BRKGA algorithm for the Capacitated Arc Routing Problem

• Autores: Martinez, C.; Loiseau, I.; Resende, M.G.C.; Rodriguez, S.
• Año de publicación: 2011
• Idioma: inglés
• Tipo de recurso: artículo
• Fuente: Electron. Notes Theor. Comput. Sci. 2011;281:69-83
• Materia: 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
• Institución: Universidad Nacional de Buenos Aires. Facultad de Ciencias Exactas y Naturales

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.