Performance of clustering techniques for solving multi depot vehicle routing problem

Performance of clustering techniques for solving multi depot vehicle routing problem

The vehicle routing problem considering multiple depots is classified as NP-hard. MDVRP determines simultaneously the routes of a set of vehicles and aims to meet a set of clients with a known demand. The objective function of the problem is to minimize the total distance traveled by the routes give...

Full description

Bibliographic Details
Main Authors: Eliana M. Toro-Ocampo, Andrés H. Domínguez-Castaño, Antonio H. Escobar-Zuluaga
Format: Article
Language:English
Published: Instituto Tecnológico Metropolitano 2016-01-01
Series:TecnoLógicas
Subjects:
Combinatorial optimization
clustering techniques
distribution network
iterated local search
Multi-Depot Vehicle Routing.
Online Access:http://itmojs.itm.edu.co/index.php/tecnologicas/article/view/865/800

Internet

http://itmojs.itm.edu.co/index.php/tecnologicas/article/view/865/800

Similar Items