Xianpei Wang, L. Gong, Haocheng Zhao, Bowen Li, Meng Tian
{"title":"一种考虑货物定向和稳定性的三维离线装箱算法","authors":"Xianpei Wang, L. Gong, Haocheng Zhao, Bowen Li, Meng Tian","doi":"10.1155/2023/5299891","DOIUrl":null,"url":null,"abstract":"The box packing problem can be generalized as placing a batch of cargos with a specified number of different physical characteristics into a specified box. Suppose that a batch of cuboid cargos of different sizes are to be loaded into a batch of boxes of the same type, the cargos have constraints such as orientation and stability. Taking the mean value of the reciprocal of space utilization as the objective function, this paper designs a hybrid genetic algorithm that combines genetic algorithm and tabu search algorithm. Aiming at the information of the packing sequence and the rotating state of the box in the packing scheme, a two-stage real number encoding method and decoding method based on random keys are designed, and a crossover operation based on partial random keys and uniform crossover is designed. In order to convert the solution searched by the optimization algorithm into the actual packing scheme, a heuristic loading algorithm is designed while using the positioning rule of the lower left corner, the space selection rule of the minimum space, and the division and merging rules of the remaining space. In the early stage, the roulette method was used to strengthen the global search ability, and in the later stage, the optimal preservation strategy was used to speed up the algorithm convergence. To make up for the shortcomings of the genetic algorithm’s weak local search ability and slow convergence speed, the tabu search algorithm was used as a mutation operation in the genetic algorithm. The solution in the generation is used as the initial solution of the tabu search algorithm, and the search process is carried out. Finally, this paper tests the proposed hybrid algorithm on 6 groups of weakly heterogeneous and strongly heterogeneous data in the BR dataset. The results prove that the proposed algorithm can reduce the usage of boxes.","PeriodicalId":50327,"journal":{"name":"International Journal of Distributed Sensor Networks","volume":null,"pages":null},"PeriodicalIF":1.9000,"publicationDate":"2023-03-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A 3D Offline Packing Algorithm considering Cargo Orientation and Stability\",\"authors\":\"Xianpei Wang, L. Gong, Haocheng Zhao, Bowen Li, Meng Tian\",\"doi\":\"10.1155/2023/5299891\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The box packing problem can be generalized as placing a batch of cargos with a specified number of different physical characteristics into a specified box. Suppose that a batch of cuboid cargos of different sizes are to be loaded into a batch of boxes of the same type, the cargos have constraints such as orientation and stability. Taking the mean value of the reciprocal of space utilization as the objective function, this paper designs a hybrid genetic algorithm that combines genetic algorithm and tabu search algorithm. Aiming at the information of the packing sequence and the rotating state of the box in the packing scheme, a two-stage real number encoding method and decoding method based on random keys are designed, and a crossover operation based on partial random keys and uniform crossover is designed. In order to convert the solution searched by the optimization algorithm into the actual packing scheme, a heuristic loading algorithm is designed while using the positioning rule of the lower left corner, the space selection rule of the minimum space, and the division and merging rules of the remaining space. In the early stage, the roulette method was used to strengthen the global search ability, and in the later stage, the optimal preservation strategy was used to speed up the algorithm convergence. To make up for the shortcomings of the genetic algorithm’s weak local search ability and slow convergence speed, the tabu search algorithm was used as a mutation operation in the genetic algorithm. The solution in the generation is used as the initial solution of the tabu search algorithm, and the search process is carried out. Finally, this paper tests the proposed hybrid algorithm on 6 groups of weakly heterogeneous and strongly heterogeneous data in the BR dataset. The results prove that the proposed algorithm can reduce the usage of boxes.\",\"PeriodicalId\":50327,\"journal\":{\"name\":\"International Journal of Distributed Sensor Networks\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":1.9000,\"publicationDate\":\"2023-03-29\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Journal of Distributed Sensor Networks\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://doi.org/10.1155/2023/5299891\",\"RegionNum\":4,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"COMPUTER SCIENCE, INFORMATION SYSTEMS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Journal of Distributed Sensor Networks","FirstCategoryId":"94","ListUrlMain":"https://doi.org/10.1155/2023/5299891","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
A 3D Offline Packing Algorithm considering Cargo Orientation and Stability
The box packing problem can be generalized as placing a batch of cargos with a specified number of different physical characteristics into a specified box. Suppose that a batch of cuboid cargos of different sizes are to be loaded into a batch of boxes of the same type, the cargos have constraints such as orientation and stability. Taking the mean value of the reciprocal of space utilization as the objective function, this paper designs a hybrid genetic algorithm that combines genetic algorithm and tabu search algorithm. Aiming at the information of the packing sequence and the rotating state of the box in the packing scheme, a two-stage real number encoding method and decoding method based on random keys are designed, and a crossover operation based on partial random keys and uniform crossover is designed. In order to convert the solution searched by the optimization algorithm into the actual packing scheme, a heuristic loading algorithm is designed while using the positioning rule of the lower left corner, the space selection rule of the minimum space, and the division and merging rules of the remaining space. In the early stage, the roulette method was used to strengthen the global search ability, and in the later stage, the optimal preservation strategy was used to speed up the algorithm convergence. To make up for the shortcomings of the genetic algorithm’s weak local search ability and slow convergence speed, the tabu search algorithm was used as a mutation operation in the genetic algorithm. The solution in the generation is used as the initial solution of the tabu search algorithm, and the search process is carried out. Finally, this paper tests the proposed hybrid algorithm on 6 groups of weakly heterogeneous and strongly heterogeneous data in the BR dataset. The results prove that the proposed algorithm can reduce the usage of boxes.
期刊介绍:
International Journal of Distributed Sensor Networks (IJDSN) is a JCR ranked, peer-reviewed, open access journal that focuses on applied research and applications of sensor networks. The goal of this journal is to provide a forum for the publication of important research contributions in developing high performance computing solutions to problems arising from the complexities of these sensor network systems. Articles highlight advances in uses of sensor network systems for solving computational tasks in manufacturing, engineering and environmental systems.