Abstract

According to the characteristics of the actual transportation packing problem, the three-dimensional vehicle packing problem with path constraints is studied, and the optimal model of the three-dimensional vehicle packing problem with path constraints is established, and then taboo search is added to the genetic algorithm to solve the problem. The performance of the algorithm is verified by example analysis. The experimental result shows that the hybrid algorithm can obtain an approximate optimal solution of higher quality than the ordinary genetic algorithm, indicating that the algorithm has a better solution to the three-dimensional packing problem. The algorithm has a great help in improving vehicle utilization and work efficiency.

Details

Title
Vehicle Packing Layout Optimization Based on Genetic Taboo Hybrid Search Algorithm
Author
Wei, Shifeng 1 ; Deng, Jianxin 2 ; Wei, Wandong 1 ; Chen, Xingyu 1 

 School of Mechanical Engineering, Guangxi University, Nanning 530003, Guangxi, China 
 School of Mechanical Engineering, Guangxi University, Nanning 530003, Guangxi, China; Guangxi Key Lab of Manufacturing System & Advanced Manufacturing Technology, Guangxi University, Nanning 530003, Guangxi, China 
Publication year
2021
Publication date
May 2021
Publisher
IOP Publishing
ISSN
17426588
e-ISSN
17426596
Source type
Scholarly Journal
Language of publication
English
ProQuest document ID
2535669802
Copyright
© 2021. This work is published under http://creativecommons.org/licenses/by/3.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.