An Ant Colony Algorithm for the Capacitated Vehicle Routing

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 Colon...

Descripción completa

Detalles Bibliográficos
Autores principales: Mazzeo, Silvia Noemí, Loiseau, Irene
Publicado: 2004
Materias:
Acceso en línea:https://bibliotecadigital.exactas.uba.ar/collection/paper/document/paper_15710653_v18_n_p181_Mazzeo
http://hdl.handle.net/20.500.12110/paper_15710653_v18_n_p181_Mazzeo
Aporte de:
id paper:paper_15710653_v18_n_p181_Mazzeo
record_format dspace
spelling paper:paper_15710653_v18_n_p181_Mazzeo2023-06-08T16:24:22Z An Ant Colony Algorithm for the Capacitated Vehicle Routing Mazzeo, Silvia Noemí Loiseau, Irene Ant Colony Capacitated Vehicle Routing Problem Metaheuristics 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. Fil:Mazzeo, S. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales; Argentina. Fil:Loiseau, I. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales; Argentina. 2004 https://bibliotecadigital.exactas.uba.ar/collection/paper/document/paper_15710653_v18_n_p181_Mazzeo http://hdl.handle.net/20.500.12110/paper_15710653_v18_n_p181_Mazzeo
institution Universidad de Buenos Aires
institution_str I-28
repository_str R-134
collection Biblioteca Digital - Facultad de Ciencias Exactas y Naturales (UBA)
topic Ant Colony
Capacitated Vehicle Routing Problem
Metaheuristics
spellingShingle Ant Colony
Capacitated Vehicle Routing Problem
Metaheuristics
Mazzeo, Silvia Noemí
Loiseau, Irene
An Ant Colony Algorithm for the Capacitated Vehicle Routing
topic_facet Ant Colony
Capacitated Vehicle Routing Problem
Metaheuristics
description 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.
author Mazzeo, Silvia Noemí
Loiseau, Irene
author_facet Mazzeo, Silvia Noemí
Loiseau, Irene
author_sort Mazzeo, Silvia Noemí
title An Ant Colony Algorithm for the Capacitated Vehicle Routing
title_short An Ant Colony Algorithm for the Capacitated Vehicle Routing
title_full An Ant Colony Algorithm for the Capacitated Vehicle Routing
title_fullStr An Ant Colony Algorithm for the Capacitated Vehicle Routing
title_full_unstemmed An Ant Colony Algorithm for the Capacitated Vehicle Routing
title_sort ant colony algorithm for the capacitated vehicle routing
publishDate 2004
url https://bibliotecadigital.exactas.uba.ar/collection/paper/document/paper_15710653_v18_n_p181_Mazzeo
http://hdl.handle.net/20.500.12110/paper_15710653_v18_n_p181_Mazzeo
work_keys_str_mv AT mazzeosilvianoemi anantcolonyalgorithmforthecapacitatedvehiclerouting
AT loiseauirene anantcolonyalgorithmforthecapacitatedvehiclerouting
AT mazzeosilvianoemi antcolonyalgorithmforthecapacitatedvehiclerouting
AT loiseauirene antcolonyalgorithmforthecapacitatedvehiclerouting
_version_ 1768543055090024448