Improved Packing and Routing of Vehicles with Compartments
We present a variable neighborhood search for the vehicle routing problem with compartments where we incorporate some features specifically aiming at the packing aspect. Among them we use a measure to distinguish packings and favor solutions with a denser packing, propose new neighborhood structures for shaking, and employ best-fit and best-fit-decreasing methods for inserting orders. Our approach yields encouraging results on a large set of test instances, obtaining new best known solutions for almost two third of them.
KeywordsNeighborhood Structure Packing Problem Memetic Algorithm Variable Neighborhood Search Vehicle Rout Problem
Unable to display preview. Download preview PDF.
- 1.Derigs, U., Gottlieb, J., Kalkoff, J., Piesche, M., Rothlauf, F., Vogel, U.: Vehicle routing with compartments: applications, modelling and heuristics. OR Spectrum (2010) doi: 10.1007/s00291-010-0194-3Google Scholar
- 7.Falkenauer, E., Delchambre, A.: A genetic algorithm for bin packing and line balancing. In: Proceedings of the 1992 IEEE International Conference on Robotics and Automation, vol. 2, pp. 1186–1192 (May 1992)Google Scholar