Journal
INTERNATIONAL TRANSACTIONS IN OPERATIONAL RESEARCH
Volume 21, Issue 3, Pages 375-398Publisher
WILEY
DOI: 10.1111/itor.12070
Keywords
multistart algorithms; biased randomization; vehicle routing problem; heuristics; vehicle packing
Funding
- Spanish Ministry of Science and Innovation [TRA2010-21644-C03]
- Ibero-American Programme for Science, Technology and Development of the IN3-HAROSA Network [CYTED2010-511RT0419]
- Sustainable TransMET Network
- Government of Navarre (Spain)
Ask authors/readers for more resources
This paper proposes an efficient algorithm, with a reduced number of parameters, for solving the two-dimensional loading-capacitated vehicle routing problem (2L-CVRP). This problem combines two of the most important issues in logistics, that is, vehicle routing and packing problems. Our approach contemplates unrestricted loading including the possibility of applying 90 degrees rotations to each rectangular-shaped item while loading it into the vehicle, which is a realistic assumption seldom considered in the existing literature. The algorithm uses a multistart approach that is designed to avoid local minima and also to make the algorithm an easily parallelizable one. At each restart, a biased randomization of a savings-based routing algorithm is combined with an enhanced version of a classical packing heuristic to produce feasible good solutions for the 2L-CVRP. The proposed algorithm has been compared with the classical benchmarks for two different 2L-CVRP variants, that is, with and without item rotations. Experimental results show that our approach outperforms several best-known solutions from previous work, both in terms of quality and the computational time needed to obtain them.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available