{"title":"双层启发式的三维料仓设计与包装问题","authors":"Ying Yang, Zili Wu, Xiaodeng Hao, Huiqiang Liu, Mingyao Qi","doi":"10.1080/0305215x.2023.2269868","DOIUrl":null,"url":null,"abstract":"AbstractThe bin packing problem is a classical problem widely existing in practical applications, such as shipping, warehousing and manufacturing industries. Whereas current research mainly focuses on reducing packing costs by optimizing the packing scheme, this study explores a novel approach by redesigning the bin sizes to fit the items ready to be packed. Specifically, this study considers a general three-dimensional open dimension problem (3D-ODP) where all dimensions, i.e. length, width and height, of a number of heterogeneous bin types are unknown and need to be decided. Based on the designed bin types, the corresponding packing scheme with minimal total costs is optimized, which is referred to as a three-dimensional multiple-bin-size bin packing problem (3D-MBSBPP). The combination of 3D-ODP and 3D-MBSBPP is redefined as a three-dimensional bin design and packing problem (3D-BDPP), for which a two-layer heuristic is developed. It consists of an outer heuristic framework (i.e. genetic algorithm or differential evolution algorithm) to design bin types, and an inner deterministic constructive heuristic (i.e. placement algorithm) to generate an effective solution for the 3D-MBSBPP. Extensive simulation tests on the classical benchmark and a case study derived from an e-commerce company are conducted to verify the algorithms and deduce managerial insights.Keywords: Open dimension problemthree-dimensionalbin-packing problembin designtwo-layer heuristic Disclosure statementNo potential conflict of interest was reported by the author(s).Data availability statementThe experimental data in Section 5.1 and the data of items in Section 5.2 are available from Alvarez-Valdes, Parreño, and Tamarit (Citation2013) with the permission of the authors. The data of bin sizes in Section 5.2 are available from the corresponding author upon request. The case study data in Section 5.3 are not available owing to commercial restrictions.Additional informationFundingThis work is supported by the National Natural Science Foundation of China [grant No. 71772100].","PeriodicalId":50521,"journal":{"name":"Engineering Optimization","volume":"137 10","pages":"0"},"PeriodicalIF":2.2000,"publicationDate":"2023-11-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Two-layer heuristic for the three-dimensional bin design and packing problem\",\"authors\":\"Ying Yang, Zili Wu, Xiaodeng Hao, Huiqiang Liu, Mingyao Qi\",\"doi\":\"10.1080/0305215x.2023.2269868\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"AbstractThe bin packing problem is a classical problem widely existing in practical applications, such as shipping, warehousing and manufacturing industries. Whereas current research mainly focuses on reducing packing costs by optimizing the packing scheme, this study explores a novel approach by redesigning the bin sizes to fit the items ready to be packed. Specifically, this study considers a general three-dimensional open dimension problem (3D-ODP) where all dimensions, i.e. length, width and height, of a number of heterogeneous bin types are unknown and need to be decided. Based on the designed bin types, the corresponding packing scheme with minimal total costs is optimized, which is referred to as a three-dimensional multiple-bin-size bin packing problem (3D-MBSBPP). The combination of 3D-ODP and 3D-MBSBPP is redefined as a three-dimensional bin design and packing problem (3D-BDPP), for which a two-layer heuristic is developed. It consists of an outer heuristic framework (i.e. genetic algorithm or differential evolution algorithm) to design bin types, and an inner deterministic constructive heuristic (i.e. placement algorithm) to generate an effective solution for the 3D-MBSBPP. Extensive simulation tests on the classical benchmark and a case study derived from an e-commerce company are conducted to verify the algorithms and deduce managerial insights.Keywords: Open dimension problemthree-dimensionalbin-packing problembin designtwo-layer heuristic Disclosure statementNo potential conflict of interest was reported by the author(s).Data availability statementThe experimental data in Section 5.1 and the data of items in Section 5.2 are available from Alvarez-Valdes, Parreño, and Tamarit (Citation2013) with the permission of the authors. The data of bin sizes in Section 5.2 are available from the corresponding author upon request. The case study data in Section 5.3 are not available owing to commercial restrictions.Additional informationFundingThis work is supported by the National Natural Science Foundation of China [grant No. 71772100].\",\"PeriodicalId\":50521,\"journal\":{\"name\":\"Engineering Optimization\",\"volume\":\"137 10\",\"pages\":\"0\"},\"PeriodicalIF\":2.2000,\"publicationDate\":\"2023-11-13\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Engineering Optimization\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1080/0305215x.2023.2269868\",\"RegionNum\":3,\"RegionCategory\":\"工程技术\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"ENGINEERING, MULTIDISCIPLINARY\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Engineering Optimization","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1080/0305215x.2023.2269868","RegionNum":3,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"ENGINEERING, MULTIDISCIPLINARY","Score":null,"Total":0}
Two-layer heuristic for the three-dimensional bin design and packing problem
AbstractThe bin packing problem is a classical problem widely existing in practical applications, such as shipping, warehousing and manufacturing industries. Whereas current research mainly focuses on reducing packing costs by optimizing the packing scheme, this study explores a novel approach by redesigning the bin sizes to fit the items ready to be packed. Specifically, this study considers a general three-dimensional open dimension problem (3D-ODP) where all dimensions, i.e. length, width and height, of a number of heterogeneous bin types are unknown and need to be decided. Based on the designed bin types, the corresponding packing scheme with minimal total costs is optimized, which is referred to as a three-dimensional multiple-bin-size bin packing problem (3D-MBSBPP). The combination of 3D-ODP and 3D-MBSBPP is redefined as a three-dimensional bin design and packing problem (3D-BDPP), for which a two-layer heuristic is developed. It consists of an outer heuristic framework (i.e. genetic algorithm or differential evolution algorithm) to design bin types, and an inner deterministic constructive heuristic (i.e. placement algorithm) to generate an effective solution for the 3D-MBSBPP. Extensive simulation tests on the classical benchmark and a case study derived from an e-commerce company are conducted to verify the algorithms and deduce managerial insights.Keywords: Open dimension problemthree-dimensionalbin-packing problembin designtwo-layer heuristic Disclosure statementNo potential conflict of interest was reported by the author(s).Data availability statementThe experimental data in Section 5.1 and the data of items in Section 5.2 are available from Alvarez-Valdes, Parreño, and Tamarit (Citation2013) with the permission of the authors. The data of bin sizes in Section 5.2 are available from the corresponding author upon request. The case study data in Section 5.3 are not available owing to commercial restrictions.Additional informationFundingThis work is supported by the National Natural Science Foundation of China [grant No. 71772100].
期刊介绍:
Engineering Optimization is an interdisciplinary engineering journal which serves the large technical community concerned with quantitative computational methods of optimization, and their application to engineering planning, design, manufacture and operational processes. The policy of the journal treats optimization as any formalized numerical process for improvement. Algorithms for numerical optimization are therefore mainstream for the journal, but equally welcome are papers which use the methods of operations research, decision support, statistical decision theory, systems theory, logical inference, knowledge-based systems, artificial intelligence, information theory and processing, and all methods which can be used in the quantitative modelling of the decision-making process.
Innovation in optimization is an essential attribute of all papers but engineering applicability is equally vital. Engineering Optimization aims to cover all disciplines within the engineering community though its main focus is in the areas of environmental, civil, mechanical, aerospace and manufacturing engineering. Papers on both research aspects and practical industrial implementations are welcomed.