Premium
A parallel insertion heuristic for vehicle routing with side constraints
Author(s) -
Savelsbergh M.W.P.
Publication year - 1990
Publication title -
statistica neerlandica
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.52
H-Index - 39
eISSN - 1467-9574
pISSN - 0039-0402
DOI - 10.1111/j.1467-9574.1990.tb01278.x
Subject(s) - vehicle routing problem , heuristic , mathematical optimization , scheduling (production processes) , null move heuristic , routing (electronic design automation) , computer science , consistent heuristic , mathematics , incremental heuristic search , search algorithm , computer network , beam search
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.