This paper considers the problem of scheduling a fleet of identical vehicles to execute a set of freight orders in truckload quantities. Each freight order is given in terms of an origin and a destination and the number of truckloads to be transported between them. The goal is to minimize the total cost of travel while completing all freight orders. Our work is the first to allow vehicles to be dispatched from a depot and discharged into another after service. We propose an algorithm that starts from an optimal solution to a network flow model which considers all data in the problem in parallel including unloaded travel costs, freight orders, depots, availability of vehicles and the vehicle receiving capacity at each depot. The network solution is then iteratively modified through heuristic operations and the routing of vehicles is determined, one at a time, based on the modified solution. A novel feature of the algorithm is the option of resolving the network model for scheduling the remaining vehicles.
Full Load Vehicle Routing with Multiple Depots: A New, Network Flow Based Algorithm
International Conference on Traffic and Transportation Studies (ICTTS) 2002 ; 2002 ; Guilin, China
2002-07-10
Conference paper
Electronic Resource
English
Full Load Vehicle Routing with Multiple Depots: A New, Network Flow Based Algorithm
British Library Conference Proceedings | 2002
|Multiple depots vehicle routing based on the ant colony with the genetic algorithm
BASE | 2013
|The vehicle routing problem with multiple depots (MDVRP) in supply chain
ORKG Comparisons | 2022
|Papers on fleet composition and routing problems with multiple depots.
ORKG Comparisons | 2020
Multiple Depots Vehicle Routing Problem in the Context of Total Urban Traffic Equilibrium
DOAJ | 2017
|