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. Copyright

, ,
Statistica Neerlandica

Savelsbergh, M.W.P. (1990). A parallel insertion heuristic for vehicle routing with side constraints. Statistica Neerlandica, 44(3), 139–148. doi:10.1111/j.1467-9574.1990.tb01278.x