@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",
    pages = "100-107",
    doi = "10.1016/j.cor.2013.09.003",
    journal = "Computers and Operations Research"
}

{"_id":"RE6MDzhrZJdtPRtJy","bibbaseid":"anonymous-abeamsearchapproachtothecontainerloadingproblem-2014","downloads":0,"creationDate":"2017-03-31T20:15:32.997Z","title":"A beam search approach to the container loading problem","author_short":null,"year":2014,"bibtype":"article","biburl":"https://1fichier.com/?j9cpurkmnv","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","pages":"100-107","doi":"10.1016/j.cor.2013.09.003","journal":"Computers and Operations Research","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 pages = \"100-107\",\n doi = \"10.1016/j.cor.2013.09.003\",\n journal = \"Computers and Operations Research\"\n}\n\n","key":"10.1016/j.cor.2013.09.003","id":"10.1016/j.cor.2013.09.003","bibbaseid":"anonymous-abeamsearchapproachtothecontainerloadingproblem-2014","urls":{},"downloads":0,"html":""},"search_terms":["beam","search","approach","container","loading","problem"],"keywords":[],"authorIDs":[],"dataSources":["gKiCRHjjC2iGthGEx"]}