Considers a common variant of the vehicle routing problem in which a vehicle fleet delivers products stored at a central depot to satisfy customer orders. Each vehicle has a fixed capacity, and each order uses a fixed portion of vehicle capacity. The routing decision involves determining which of the demands will be satisfied by each vehicle and what route each vehicle will follow in servicing its assigned demand in order to minimize total delivery cost. The authors present a heuristic for this problem in which an assignment of customers to vehicles is obtained by solving a generalized assignment problem with an objective function that approximates delivery cost.
A generalized assignment heuristic for vehicle routing
Eine verallgemeinerte Zuordnungsheuristik fuer die Ermittlung des Kraftfahrzeugleitweges
Networks ; 11 , 2 ; 109-124
1981
16 Seiten, 22 Quellen
Aufsatz (Zeitschrift)
Englisch
Transportation Research Record | 2012
|The Time Window Assignment Vehicle Routing Problem
Online Contents | 2014
|