Problems associated with seeking the lowest cost vehicle routes to deliver demand from a set of depots to a set of customers are called Multi-depot Vehicle Routing Problems (MDVRP). The MDVRP is a generalization of the standard vehicle routing problem which involves more than one depot. In MDVRP each vehicle leaves a depot and should return to the same depot they started with. In this paper, the MDVRP is tackled using a iterated local search metaheuristic. Experiments are run on a number of benchmark instances of varying depots and customer sizes. The numerical results show that the proposed algorithm is competitive against state-of-the-art methods.
On Solving the Multi-depot Vehicle Routing Problem
Smart Innovation, Systems and Technologies
Proceedings of 3rd International Conference on Advanced Computing, Networking and Informatics ; Chapter : 10 ; 103-108
2015-09-03
6 pages
Article/Chapter (Book)
Electronic Resource
English
Selective multi-depot vehicle routing problem with pricing
Online Contents | 2011
|BASE | 2012
|Multi-Depot Vehicle Routing Problem with Hybrid Genetic Algorithm
Trans Tech Publications | 2012
|