Advertisement
Published in:
2016 | OriginalPaper | Chapter
On Solving the Multi-depot Vehicle Routing Problem
Authors : Takwa Tlili, Saoussen Krichen, Ghofrane Drira, Sami Faiz
Published in: Proceedings of 3rd International Conference on Advanced Computing, Networking and Informatics
Publisher: Springer India
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
Abstract
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.