A platform for research: civil engineering, architecture and urbanism
A platform for research: civil engineering, architecture and urbanism
The mixed fleet stochastic vehicle routing problem
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
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
Teodorovic, Dusan (author) / Krcmar-Nozic, Emina (author) / Pavkovic, Goran (author)
Transportation Planning and Technology ; 19 ; 31-43
1995-01-01
13 pages
Article (Journal)
Electronic Resource
Unknown
THE MIXED FLEET STOCHASTIC VEHICLE ROUTING PROBLEM
| Online Contents | 1995
Memetic Algorithm for the Heterogeneous Fleet School Bus Routing Problem
| British Library Online Contents | 2018