Title of article
A multi-objective Pareto ant colony algorithm for the Multi-Depot Vehicle Routing problem with Backhauls
Author/Authors
Ch?vez، Jhon Jairo Santa نويسنده Programa de Ingenier?a Eléctrica, Universidad Libre Seccional Pereira and Universidad Tecnol?gica de Pereira, Colombia , , Escobar، John Willmer نويسنده Department of Civil and Industrial Engineering, Pontificia Universidad Javeriana Cali, Colombia , , Echeverri، Mauricio Granada نويسنده Programa de Ingenier?a Eléctrica, Universidad Tecnol?gica de Pereira, Colombia ,
Issue Information
دوفصلنامه با شماره پیاپی 24 سال 2016
Pages
14
From page
35
To page
48
Abstract
This paper presents a multiobjective ant colony algorithm for the Multi-Depot Vehicle Routing Problem with Backhauls (MDVRPB) where three objectives of traveled distance, traveling times and total consumption of energy are minimized. An ant colony algorithm is proposed to solve the MDVRPB. The solution scheme allows one to find a set of ordered solutions in Pareto fronts by considering the concept of dominance. The effectiveness of the proposed approach is examined by considering a set of instances adapted from the literature. The computational results show high quality results within short computing times.
Journal title
International Journal of Industrial Engineering Computations
Serial Year
2016
Journal title
International Journal of Industrial Engineering Computations
Record number
2332079
Link To Document