The authors address the problem of routing a fleet of vehicles from a central depot to customers with known demand. Routes originate and terminate at the central depot and obey vehicle capacity restrictions. Typically, researchers assume that all vehicles are identical. They relax the homogeneous fleet assumption. The objective is to determine optimal fleet size and mix by minimizing a total cost function which includes fixed cost and variable cost components. They describe several efficient heuristic solution procedures as well as techniques for generating a lower bound and an underestimate of the optimal solution. Finally, they present some encouraging computational results and suggestions for further study.
The fleet size and mix vehicle routing problem
Die Fuhrparkgroesse und das Leitwegproblem
Computers and Operations Research ; 11 , 1 ; 49-66
1984
18 Seiten, 16 Quellen
Article (Journal)
English
The fleet size and mix vehicle routing problem with synchronized visits
Taylor & Francis Verlag | 2022
|THE MIXED FLEET STOCHASTIC VEHICLE ROUTING PROBLEM
Online Contents | 1995
|The mixed fleet stochastic vehicle routing problem
Taylor & Francis Verlag | 1995
|The fleet size and mix pollution-routing problem
Elsevier | 2014
|