The mixed fleet stochastic vehicle routing problem is considered in the paper. It is assumed that operations are performed by vehicles of different types. The model developed is based on the “route first — cluster second” approach. A heuristic algorithm based on space-filling curves is used to produce a giant Travelling Salesman tour. The giant tour is divided into smaller parts using the generalized Floyd algorithm. The final set of routes may be chosen after making a suitable multi-attribute decision making analysis.
The mixed fleet stochastic vehicle routing problem
Transportation Planning and Technology ; 19 , 1 ; 31-43
01.01.1995
Aufsatz (Zeitschrift)
Elektronische Ressource
Unbekannt
THE MIXED FLEET STOCHASTIC VEHICLE ROUTING PROBLEM
Online Contents | 1995
|The Multi-period Fleet Size and Mix Vehicle Routing Problem with Stochastic Demands
British Library Conference Proceedings | 2018
|The Multi-period Fleet Size and Mix Vehicle Routing Problem with Stochastic Demands
Springer Verlag | 2017
|The fleet size and mix vehicle routing problem
Tema Archiv | 1984
|