A parallel insertion heuristic for vehicle routing with side constraints.

Author(s)
Savelsbergh, M.W.P.
Year
Abstract

In the early eighties, Fisher and Jaikumar developed a generalized assignment heuristic for vehicle routing problems. In this paper, we discuss some of the strong and weak points of this heuristic, and take its basic ideas to develop a new parallel insertion heuristic for the vehicle routing and scheduling problem that is better able to handle various side constraints.

Request publication

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

Publication

Library number
B 31652 fo /71 /
Source

Statistica Neerlandia, Vol. 44 (1990), No. 3, p. 139-148, 8 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.