Vehicle Packing Layout Optimization Based on Genetic Taboo Hybrid Search Algorithm
Authors:
Open Access
- 1 May 2021
- conference paper
- Published by IOP Publishing in Journal of Physics: Conference Series
- Vol. 1910 (1) , 012004
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.Keywords
This publication has 4 references indexed in Scilit:
- A hybrid algorithm for the vehicle routing problem with pickup and delivery and three-dimensional loading constraintsEuropean Journal of Operational Research, 2016
- An Adaptive Variable Neighborhood Search for a Heterogeneous Fleet Vehicle Routing Problem with Three-Dimensional Loading ConstraintsIEEE Computational Intelligence Magazine, 2014
- Metaheuristics for vehicle routing problems with three-dimensional loading constraintsEuropean Journal of Operational Research, 2010
- Ant colony optimization for the two-dimensional loading vehicle routing problemComputers & Operations Research, 2009