BRKGA algorithm for the Capacitated Arc Routing Problem

Mostrar todas las versiones(3)

We propose a new algorithm for the Capacitated Arc Routing Problem (CARP). Our motivation to deal with this problem is related to its application in several real world scenarios such as street sweeping, urban waste collection and electric meter reading just to mention a few. Based on BRKGA metaheuri...

Descripción completa

Detalles Bibliográficos
Autores principales: Martinez, C., Loiseau, I., Resende, M.G.C., Rodriguez, S.
Formato: Artículo publishedVersion
Lenguaje:Inglés
Publicado: 2011
Materias:
BRKGA
CARP
metaheuristics
vehicle routing
Capacitated arc routing problem
Computational time
Local search
Meta heuristics
Metaheuristic
Meter readings
Objective function values
Random keys
Real-world scenario
Street sweeping
Urban wastes
Computer science
Vehicle routing
Algorithms
Acceso en línea:http://hdl.handle.net/20.500.12110/paper_15710661_v281_n_p69_Martinez
Aporte de:
Biblioteca Digital - Facultad de Ciencias Exactas y Naturales (UBA) de Universidad de Buenos Aires
id paperaa:paper_15710661_v281_n_p69_Martinez
record_format dspace
spelling paperaa:paper_15710661_v281_n_p69_Martinez2023-06-12T16:50:46Z BRKGA algorithm for the Capacitated Arc Routing Problem Electron. Notes Theor. Comput. Sci. 2011;281:69-83 Martinez, C. Loiseau, I. Resende, M.G.C. Rodriguez, S. BRKGA CARP metaheuristics vehicle routing BRKGA Capacitated arc routing problem CARP Computational time Local search Meta heuristics Metaheuristic Meter readings Objective function values Random keys Real-world scenario Street sweeping Urban wastes Computer science Vehicle routing Algorithms We propose a new algorithm for the Capacitated Arc Routing Problem (CARP). Our motivation to deal with this problem is related to its application in several real world scenarios such as street sweeping, urban waste collection and electric meter reading just to mention a few. Based on BRKGA metaheuristic, our algorithm introduces a new random key encoding for CARP, mutation to random keys strings, a restart phase to avoid stagnation and local search. The algorithm was tested with several well-known instances from the literature. The results obtained were competitive in terms of objective function value and required computational time. © 2011 Elsevier B.V. Fil:Loiseau, I. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales; Argentina. 2011 info:eu-repo/semantics/article info:ar-repo/semantics/artículo info:eu-repo/semantics/publishedVersion application/pdf eng info:eu-repo/semantics/openAccess http://creativecommons.org/licenses/by/2.5/ar http://hdl.handle.net/20.500.12110/paper_15710661_v281_n_p69_Martinez
institution Universidad de Buenos Aires
institution_str I-28
repository_str R-134
collection Biblioteca Digital - Facultad de Ciencias Exactas y Naturales (UBA)
language Inglés
orig_language_str_mv eng
topic BRKGA
CARP
metaheuristics
vehicle routing
BRKGA
Capacitated arc routing problem
CARP
Computational time
Local search
Meta heuristics
Metaheuristic
Meter readings
Objective function values
Random keys
Real-world scenario
Street sweeping
Urban wastes
Computer science
Vehicle routing
Algorithms
spellingShingle BRKGA
CARP
metaheuristics
vehicle routing
BRKGA
Capacitated arc routing problem
CARP
Computational time
Local search
Meta heuristics
Metaheuristic
Meter readings
Objective function values
Random keys
Real-world scenario
Street sweeping
Urban wastes
Computer science
Vehicle routing
Algorithms
Martinez, C.
Loiseau, I.
Resende, M.G.C.
Rodriguez, S.
BRKGA algorithm for the Capacitated Arc Routing Problem
topic_facet BRKGA
CARP
metaheuristics
vehicle routing
BRKGA
Capacitated arc routing problem
CARP
Computational time
Local search
Meta heuristics
Metaheuristic
Meter readings
Objective function values
Random keys
Real-world scenario
Street sweeping
Urban wastes
Computer science
Vehicle routing
Algorithms
description We propose a new algorithm for the Capacitated Arc Routing Problem (CARP). Our motivation to deal with this problem is related to its application in several real world scenarios such as street sweeping, urban waste collection and electric meter reading just to mention a few. Based on BRKGA metaheuristic, our algorithm introduces a new random key encoding for CARP, mutation to random keys strings, a restart phase to avoid stagnation and local search. The algorithm was tested with several well-known instances from the literature. The results obtained were competitive in terms of objective function value and required computational time. © 2011 Elsevier B.V.
format Artículo
Artículo
publishedVersion
author Martinez, C.
Loiseau, I.
Resende, M.G.C.
Rodriguez, S.
author_facet Martinez, C.
Loiseau, I.
Resende, M.G.C.
Rodriguez, S.
author_sort Martinez, C.
title BRKGA algorithm for the Capacitated Arc Routing Problem
title_short BRKGA algorithm for the Capacitated Arc Routing Problem
title_full BRKGA algorithm for the Capacitated Arc Routing Problem
title_fullStr BRKGA algorithm for the Capacitated Arc Routing Problem
title_full_unstemmed BRKGA algorithm for the Capacitated Arc Routing Problem
title_sort brkga algorithm for the capacitated arc routing problem
publishDate 2011
url http://hdl.handle.net/20.500.12110/paper_15710661_v281_n_p69_Martinez
work_keys_str_mv AT martinezc brkgaalgorithmforthecapacitatedarcroutingproblem
AT loiseaui brkgaalgorithmforthecapacitatedarcroutingproblem
AT resendemgc brkgaalgorithmforthecapacitatedarcroutingproblem
AT rodriguezs brkgaalgorithmforthecapacitatedarcroutingproblem
_version_ 1769810196374224896

Ejemplares similares