Generalization of the MOACS algorithm for Many Objectives. An application to motorcycle distribution

Authors

  • Benjamín Barán National University of Asuncion, Paraguay
  • Melissa Laufer Universidad Católica “Nuestra Señora de la Asunción”, Paraguay
  • María Gabriela Insaurralde Universidad Católica “Nuestra Señora de la Asunción”, Paraguay

DOI:

https://doi.org/10.19153/cleiej.18.2.8

Keywords:

Multiobjective Optimization, Many-Objective Optimization, Vehicle Routing Problem, Ant Colony Optimization, Distribution

Abstract

To solve many-objective routing problems, this paper generalizes the Multi-Objective Ant Colony System (MOACS) algorithm, a well-known Multi-Objective Ant Colony Optimization (MOACO) metaheuristic proposed in 2003. This Generalized MOACS algorithm is used to solve a Split-Delivery/Mixed-Fleet Vehicle Routing Problem (SD/MF-VRP) under different constraints, resulting from the mathematical modeling of a logistic problem: the distribution of motorcycles by a Paraguayan factory, considering several objective functions as: (1) total distribution cost, (2) total traveled distance, (3) total traveled time, and (4) nsatisfied demand. Experimental results using the proposed algorithm in weekly operations of the motorcycle factory prove the advantages of using the proposed algorithm, facilitating the work of the logistic planner, reducing the distribution cost and minimizing the time needed to satisfy customers.

Downloads

Published

2015-08-01

Issue

Vol. 18 No. 2 (2015): Best Papers from CLEI 2014 Special Issue

Section

Articles

License

CLEIej is supported by its home institution, CLEI, and by the contribution of the Latin American and international researchers community, and it does not apply any author charges whatsoever for submitting and publishing. Since its creation in 1998, all contents are made publicly accesibly. The current license being applied is a (CC)-BY license (effective October 2015; between 2011 and 2015 a (CC)-BY-NC license was used).