Improved packing and routing of vehicles with compartments

Authors:
Sandro Pirkwieser;Günther R. Raidl;Jens Gottlieb
Affiliations:
Institute of Computer Graphics and Algorithms, Vienna University of Technology, Vienna, Austria;Institute of Computer Graphics and Algorithms, Vienna University of Technology, Vienna, Austria;SAP AG, Walldorf, Germany
Venue:
EUROCAST'11 Proceedings of the 13th international conference on Computer Aided Systems Theory - Volume Part I
Year:
2011

Citing 5
Cited 0

A general heuristic for vehicle routing problems

Computers and Operations Research
A memetic algorithm and a tabu search for the multi-compartment vehicle routing problem

Computers and Operations Research
A memetic algorithm for the multi-compartment vehicle routing problem with stochastic demands

Computers and Operations Research
Constructive Heuristics for the Multicompartment Vehicle Routing Problem with Stochastic Demands

Transportation Science
Vehicle routing with compartments: applications, modelling and heuristics

OR Spectrum

Quantified Score

Hi-index	0.00

Visualization

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.