A beam search approach to the container loading problem. Araya, I. & Riff Rojas, M. C. Computers and Operations Research, 43(1):100-107, 2014. doi abstract bibtex The single container loading problem is a three-dimensional packing problem in which a container has to be filled with a set of boxes. The objective is to maximize the space utilization of the container. This problem has wide applications in the logistics industry. In this work, a new constructive approach to this problem is introduced. The approach uses a beam search strategy. This strategy can be viewed as a variant of the branch-and-bound search that only expands the most promising nodes at each level of the search tree. The approach is compared with state-of-the-art algorithms using 16 well-known sets of benchmark instances. Results show that the new approach outperforms all the others for each set of instances. © 2013 Published by Elsevier Ltd.
@article{10.1016/j.cor.2013.09.003,
abstract = "The single container loading problem is a three-dimensional packing problem in which a container has to be filled with a set of boxes. The objective is to maximize the space utilization of the container. This problem has wide applications in the logistics industry. In this work, a new constructive approach to this problem is introduced. The approach uses a beam search strategy. This strategy can be viewed as a variant of the branch-and-bound search that only expands the most promising nodes at each level of the search tree. The approach is compared with state-of-the-art algorithms using 16 well-known sets of benchmark instances. Results show that the new approach outperforms all the others for each set of instances. © 2013 Published by Elsevier Ltd.",
number = "1",
year = "2014",
title = "A beam search approach to the container loading problem",
volume = "43",
keywords = "Beam search , Combinatorial optimization , Constructive algorithms , Container loading problem , Load planning",
pages = "100-107",
doi = "10.1016/j.cor.2013.09.003",
journal = "Computers and Operations Research",
author = "Araya, I. and Riff Rojas, Maria Cristina"
}
Downloads: 0
{"_id":"ZodT3hWz9P7DSLvbY","bibbaseid":"araya-riffrojas-abeamsearchapproachtothecontainerloadingproblem-2014","downloads":0,"creationDate":"2017-04-03T15:16:25.796Z","title":"A beam search approach to the container loading problem","author_short":["Araya, I.","Riff Rojas, M. C."],"year":2014,"bibtype":"article","biburl":"https://1fichier.com/?yjj84y68k0","bibdata":{"bibtype":"article","type":"article","abstract":"The single container loading problem is a three-dimensional packing problem in which a container has to be filled with a set of boxes. The objective is to maximize the space utilization of the container. This problem has wide applications in the logistics industry. In this work, a new constructive approach to this problem is introduced. The approach uses a beam search strategy. This strategy can be viewed as a variant of the branch-and-bound search that only expands the most promising nodes at each level of the search tree. The approach is compared with state-of-the-art algorithms using 16 well-known sets of benchmark instances. Results show that the new approach outperforms all the others for each set of instances. © 2013 Published by Elsevier Ltd.","number":"1","year":"2014","title":"A beam search approach to the container loading problem","volume":"43","keywords":"Beam search , Combinatorial optimization , Constructive algorithms , Container loading problem , Load planning","pages":"100-107","doi":"10.1016/j.cor.2013.09.003","journal":"Computers and Operations Research","author":[{"propositions":[],"lastnames":["Araya"],"firstnames":["I."],"suffixes":[]},{"propositions":[],"lastnames":["Riff","Rojas"],"firstnames":["Maria","Cristina"],"suffixes":[]}],"bibtex":"@article{10.1016/j.cor.2013.09.003,\n abstract = \"The single container loading problem is a three-dimensional packing problem in which a container has to be filled with a set of boxes. The objective is to maximize the space utilization of the container. This problem has wide applications in the logistics industry. In this work, a new constructive approach to this problem is introduced. The approach uses a beam search strategy. This strategy can be viewed as a variant of the branch-and-bound search that only expands the most promising nodes at each level of the search tree. The approach is compared with state-of-the-art algorithms using 16 well-known sets of benchmark instances. Results show that the new approach outperforms all the others for each set of instances. © 2013 Published by Elsevier Ltd.\",\n number = \"1\",\n year = \"2014\",\n title = \"A beam search approach to the container loading problem\",\n volume = \"43\",\n keywords = \"Beam search , Combinatorial optimization , Constructive algorithms , Container loading problem , Load planning\",\n pages = \"100-107\",\n doi = \"10.1016/j.cor.2013.09.003\",\n journal = \"Computers and Operations Research\",\n author = \"Araya, I. and Riff Rojas, Maria Cristina\"\n}\n\n","author_short":["Araya, I.","Riff Rojas, M. C."],"key":"10.1016/j.cor.2013.09.003","id":"10.1016/j.cor.2013.09.003","bibbaseid":"araya-riffrojas-abeamsearchapproachtothecontainerloadingproblem-2014","role":"author","urls":{},"keyword":["Beam search","Combinatorial optimization","Constructive algorithms","Container loading problem","Load planning"],"downloads":0},"search_terms":["beam","search","approach","container","loading","problem","araya","riff rojas"],"keywords":["beam search","combinatorial optimization","constructive algorithms","container loading problem","load planning"],"authorIDs":[],"dataSources":["mqyNxb9twi6rYAXFv"]}