Navegar

Colección

Datos Estadísticas

Artículo

La versión final de este artículo es de uso interno. El editor solo permite incluir en el repositorio el artículo en su versión post-print. Por favor, si usted la posee enviela a
Consulte el artículo en la página del editor
Consulte la política de Acceso Abierto del editor

Abstract:

The Vehicle Routing Problem (VRP) requires the determination of an optimal set of routes for a set of vehicles to serve a set of customers. We deal here with the Capacitated Vehicle Routing Problem (CVRP) where there is a maximum weight or volume that each vehicle can load. We developed an Ant Colony algorithm (ACO) for the CVRP based on the metaheuristic technique introduced by Colorni, Dorigo and Maniezzo. We present preliminary results that show that ant algorithms are competitive with other metaheuristics for solving CVRP. © 2005 Elsevier B.V. All rights reserved.

Registro:

Documento: Artículo
Título:An Ant Colony Algorithm for the Capacitated Vehicle Routing
Autor:Mazzeo, S.; Loiseau, I.
Filiación:Departamento de Computación, Facultad de Ciencias Exactas y Naturales, Universidad de Buenos Aires, Argentina
Palabras clave:Ant Colony; Capacitated Vehicle Routing Problem; Metaheuristics
Año:2004
Volumen:18
Página de inicio:181
Página de fin:186
DOI: http://dx.doi.org/10.1016/j.endm.2004.06.029
Título revista:Electronic Notes in Discrete Mathematics
Título revista abreviado:Electron. Notes Discrete Math.
ISSN:15710653
Registro:https://bibliotecadigital.exactas.uba.ar/collection/paper/document/paper_15710653_v18_n_p181_Mazzeo

Referencias:

  • Bullnheimer, B., Hartl, R.F., Strauss, C., An improved ant system algorithm for the vehicle routing problem (1999) Annals of Operations Res., 89, pp. 319-328
  • Clarke, G., Wright, J.V., Scheduling of vehicles from a central depot to a number of delivery points (1964) Operations Research, 12, pp. 568-581
  • Colorni, A., Dorigo, M., Maniezzo, V., Distributed Optimization by Ant Colonies (1991) First European Conference on Artificial Life, pp. 134-142
  • Lin, S., Kernighan, B.W., An effective heuristic algorithm for the traveling salesman problem (1973) Operations Research, 21, pp. 498-516
  • Osman, I.H., Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem (1993) Annals of Operations Res., 41, pp. 421-451
  • (2002) SIAM monographs on discrete mathematics and applications, , Toth P., and Vigo D. (Eds)

Citas:

---------- APA ----------
Mazzeo, S. & Loiseau, I. (2004) . An Ant Colony Algorithm for the Capacitated Vehicle Routing. Electronic Notes in Discrete Mathematics, 18, 181-186.
http://dx.doi.org/10.1016/j.endm.2004.06.029
---------- CHICAGO ----------
Mazzeo, S., Loiseau, I. "An Ant Colony Algorithm for the Capacitated Vehicle Routing" . Electronic Notes in Discrete Mathematics 18 (2004) : 181-186.
http://dx.doi.org/10.1016/j.endm.2004.06.029
---------- MLA ----------
Mazzeo, S., Loiseau, I. "An Ant Colony Algorithm for the Capacitated Vehicle Routing" . Electronic Notes in Discrete Mathematics, vol. 18, 2004, pp. 181-186.
http://dx.doi.org/10.1016/j.endm.2004.06.029
---------- VANCOUVER ----------
Mazzeo, S., Loiseau, I. An Ant Colony Algorithm for the Capacitated Vehicle Routing. Electron. Notes Discrete Math. 2004;18:181-186.
http://dx.doi.org/10.1016/j.endm.2004.06.029