SOLVING TWO-DIMENSIONAL BIN PACKING PROBLEMS WITH TWO-STAGE GUILLOTINE CUTTING BY COMBINED LOCAL SEARCH HEURISTICS
Autor(a) principal: | |
---|---|
Data de Publicação: | 2013 |
Outros Autores: | , , |
Tipo de documento: | Artigo |
Idioma: | eng |
Título da fonte: | Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) |
Texto Completo: | http://repositorio.inesctec.pt/handle/123456789/5712 |
Resumo: | In this paper, a new efficient algorithm named combined local search heuristics which comprise two local search heuristics, Variable Neighborhood Descent (VND) and Random Neighbor Selection (RNS), is designed and proposed to solve two-dimensional guillotine bin packing problems. The objective of these problems is to pack smaller pieces of rectangular items into large rectangular bins without overlapping such that the total number of used bins is minimized. A constructive heuristic (CH) is conceived to construct a solution by packing items into bins with the use of a defined item packing sequence. VND and RNS, which consist of three deterministic neighborhood structures and three random neighbor selection operators, respectively, are used for improving a solution given by the CH. Benchmark instances were adopted to verify the effectiveness of the designed algorithm via computational experiments. Computational results show that, in terms of the quality of solutions, the proposed approach is better than other heuristics and metaheuristics. In terms of computational times, the proposed algorithm cannot be compared to other algorithms and the computational experiments cannot offer enough evidence of showing any good running-time behavior of the proposed algorithm because of different models of computers used. However, from a practical point of view, easy implementation and reasonable and affordable computational times confirm the usefulness of the proposed algorithm. |
id |
RCAP_aba6d2cf5908df97496a4534bd54d86e |
---|---|
oai_identifier_str |
oai:repositorio.inesctec.pt:123456789/5712 |
network_acronym_str |
RCAP |
network_name_str |
Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) |
repository_id_str |
7160 |
spelling |
SOLVING TWO-DIMENSIONAL BIN PACKING PROBLEMS WITH TWO-STAGE GUILLOTINE CUTTING BY COMBINED LOCAL SEARCH HEURISTICSIn this paper, a new efficient algorithm named combined local search heuristics which comprise two local search heuristics, Variable Neighborhood Descent (VND) and Random Neighbor Selection (RNS), is designed and proposed to solve two-dimensional guillotine bin packing problems. The objective of these problems is to pack smaller pieces of rectangular items into large rectangular bins without overlapping such that the total number of used bins is minimized. A constructive heuristic (CH) is conceived to construct a solution by packing items into bins with the use of a defined item packing sequence. VND and RNS, which consist of three deterministic neighborhood structures and three random neighbor selection operators, respectively, are used for improving a solution given by the CH. Benchmark instances were adopted to verify the effectiveness of the designed algorithm via computational experiments. Computational results show that, in terms of the quality of solutions, the proposed approach is better than other heuristics and metaheuristics. In terms of computational times, the proposed algorithm cannot be compared to other algorithms and the computational experiments cannot offer enough evidence of showing any good running-time behavior of the proposed algorithm because of different models of computers used. However, from a practical point of view, easy implementation and reasonable and affordable computational times confirm the usefulness of the proposed algorithm.2018-01-08T10:44:43Z2013-01-01T00:00:00Z2013info:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/articleapplication/pdfhttp://repositorio.inesctec.pt/handle/123456789/5712engChan,TMAlvelos,FElsa Marília SilvaValerio de Carvalho,JMVinfo:eu-repo/semantics/embargoedAccessreponame:Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)instname:Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informaçãoinstacron:RCAAP2023-05-15T10:20:37Zoai:repositorio.inesctec.pt:123456789/5712Portal AgregadorONGhttps://www.rcaap.pt/oai/openaireopendoar:71602024-03-19T17:53:23.942826Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) - Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informaçãofalse |
dc.title.none.fl_str_mv |
SOLVING TWO-DIMENSIONAL BIN PACKING PROBLEMS WITH TWO-STAGE GUILLOTINE CUTTING BY COMBINED LOCAL SEARCH HEURISTICS |
title |
SOLVING TWO-DIMENSIONAL BIN PACKING PROBLEMS WITH TWO-STAGE GUILLOTINE CUTTING BY COMBINED LOCAL SEARCH HEURISTICS |
spellingShingle |
SOLVING TWO-DIMENSIONAL BIN PACKING PROBLEMS WITH TWO-STAGE GUILLOTINE CUTTING BY COMBINED LOCAL SEARCH HEURISTICS Chan,TM |
title_short |
SOLVING TWO-DIMENSIONAL BIN PACKING PROBLEMS WITH TWO-STAGE GUILLOTINE CUTTING BY COMBINED LOCAL SEARCH HEURISTICS |
title_full |
SOLVING TWO-DIMENSIONAL BIN PACKING PROBLEMS WITH TWO-STAGE GUILLOTINE CUTTING BY COMBINED LOCAL SEARCH HEURISTICS |
title_fullStr |
SOLVING TWO-DIMENSIONAL BIN PACKING PROBLEMS WITH TWO-STAGE GUILLOTINE CUTTING BY COMBINED LOCAL SEARCH HEURISTICS |
title_full_unstemmed |
SOLVING TWO-DIMENSIONAL BIN PACKING PROBLEMS WITH TWO-STAGE GUILLOTINE CUTTING BY COMBINED LOCAL SEARCH HEURISTICS |
title_sort |
SOLVING TWO-DIMENSIONAL BIN PACKING PROBLEMS WITH TWO-STAGE GUILLOTINE CUTTING BY COMBINED LOCAL SEARCH HEURISTICS |
author |
Chan,TM |
author_facet |
Chan,TM Alvelos,F Elsa Marília Silva Valerio de Carvalho,JMV |
author_role |
author |
author2 |
Alvelos,F Elsa Marília Silva Valerio de Carvalho,JMV |
author2_role |
author author author |
dc.contributor.author.fl_str_mv |
Chan,TM Alvelos,F Elsa Marília Silva Valerio de Carvalho,JMV |
description |
In this paper, a new efficient algorithm named combined local search heuristics which comprise two local search heuristics, Variable Neighborhood Descent (VND) and Random Neighbor Selection (RNS), is designed and proposed to solve two-dimensional guillotine bin packing problems. The objective of these problems is to pack smaller pieces of rectangular items into large rectangular bins without overlapping such that the total number of used bins is minimized. A constructive heuristic (CH) is conceived to construct a solution by packing items into bins with the use of a defined item packing sequence. VND and RNS, which consist of three deterministic neighborhood structures and three random neighbor selection operators, respectively, are used for improving a solution given by the CH. Benchmark instances were adopted to verify the effectiveness of the designed algorithm via computational experiments. Computational results show that, in terms of the quality of solutions, the proposed approach is better than other heuristics and metaheuristics. In terms of computational times, the proposed algorithm cannot be compared to other algorithms and the computational experiments cannot offer enough evidence of showing any good running-time behavior of the proposed algorithm because of different models of computers used. However, from a practical point of view, easy implementation and reasonable and affordable computational times confirm the usefulness of the proposed algorithm. |
publishDate |
2013 |
dc.date.none.fl_str_mv |
2013-01-01T00:00:00Z 2013 2018-01-08T10:44:43Z |
dc.type.status.fl_str_mv |
info:eu-repo/semantics/publishedVersion |
dc.type.driver.fl_str_mv |
info:eu-repo/semantics/article |
format |
article |
status_str |
publishedVersion |
dc.identifier.uri.fl_str_mv |
http://repositorio.inesctec.pt/handle/123456789/5712 |
url |
http://repositorio.inesctec.pt/handle/123456789/5712 |
dc.language.iso.fl_str_mv |
eng |
language |
eng |
dc.rights.driver.fl_str_mv |
info:eu-repo/semantics/embargoedAccess |
eu_rights_str_mv |
embargoedAccess |
dc.format.none.fl_str_mv |
application/pdf |
dc.source.none.fl_str_mv |
reponame:Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) instname:Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informação instacron:RCAAP |
instname_str |
Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informação |
instacron_str |
RCAAP |
institution |
RCAAP |
reponame_str |
Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) |
collection |
Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) |
repository.name.fl_str_mv |
Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) - Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informação |
repository.mail.fl_str_mv |
|
_version_ |
1799131608333156352 |