Improving on the initial solution heuristic for the Vehicle Routing Problem with multiple constraints.

Author(s)
Joubert, J.W.
Year
Abstract

The integration of multiple constraints of the Vehicle Routing Problem (VRP) variants is computationally expensive. Although vehicle routing problems have been well researched, variants are typically treated in isolation, whereas industry requires integrated solutions. The concept of time window compatibility is introduced to improve the initial solution algorithm when combining variants such as a heterogeneous fleet, double scheduling, and multiple time windows. The paper reports on the algorithm's results when benchmark test data is used. The results relate to both the computational burden of the algorithm, as well as the quality of the initial solution. For the covering abstract see ITRD E128680.

Request publication

5 + 9 =
Solve this simple math problem and enter the result. E.g. for 1+3, enter 4.

Publication

Library number
C 36190 (In: C 36168 [electronic version only]) /72 / ITRD E128702
Source

In: Urban Transport X : urban transport and the environment in the 21st century : proceedings of the Tenth International Conference on Urban Transport and The Environment in the 21st Century, Dresden, Germany, 2004, p. 217-226, 14 ref.

Our collection

This publication is one of our other publications, and part of our extensive collection of road safety literature, that also includes the SWOV publications.