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

Guardado en:

Detalles Bibliográficos
Autores principales:	Mazzeo, S., Loiseau, I.
Formato:	JOUR
Materias:	Ant Colony Capacitated Vehicle Routing Problem Metaheuristics
Acceso en línea:	http://hdl.handle.net/20.500.12110/paper_15710653_v18_n_p181_Mazzeo
Aporte de:	Biblioteca Digital - Facultad de Ciencias Exactas y Naturales (UBA) de Universidad de Buenos Aires

id	todo:paper_15710653_v18_n_p181_Mazzeo
record_format	dspace
spelling	todo:paper_15710653_v18_n_p181_Mazzeo2023-10-03T16:27:00Z An Ant Colony Algorithm for the Capacitated Vehicle Routing Mazzeo, S. Loiseau, I. 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. JOUR info:eu-repo/semantics/openAccess http://creativecommons.org/licenses/by/2.5/ar 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, S. Loiseau, I. 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.
format	JOUR
author	Mazzeo, S. Loiseau, I.
author_facet	Mazzeo, S. Loiseau, I.
author_sort	Mazzeo, S.
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
url	http://hdl.handle.net/20.500.12110/paper_15710653_v18_n_p181_Mazzeo
work_keys_str_mv	AT mazzeos anantcolonyalgorithmforthecapacitatedvehiclerouting AT loiseaui anantcolonyalgorithmforthecapacitatedvehiclerouting AT mazzeos antcolonyalgorithmforthecapacitatedvehiclerouting AT loiseaui antcolonyalgorithmforthecapacitatedvehiclerouting
_version_	1782027052759646208

An Ant Colony Algorithm for the Capacitated Vehicle Routing

Ejemplares similares