Abstract
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. © 2012 Springer-Verlag.
Cite
CITATION STYLE
Pirkwieser, S., Raidl, G. R., & Gottlieb, J. (2012). Improved packing and routing of vehicles with compartments. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6927 LNCS, pp. 392–399). https://doi.org/10.1007/978-3-642-27549-4_50
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
