An evolutionary algorithm for the capacitated arc routing problem
The Capacitated Arc Routing Problem (CARP) consists of visiting a subset of edges of the graph that describes the problem. CARP applications include urban waste collection and inspection of power lines. The CARP is NP-hard, even in the single-vehicle case (called Rural Postman Problem). In this case...
| Autores: | , |
|---|---|
| Tipo de recurso: | artículo |
| Estado: | Versión publicada |
| Fecha de publicación: | 2009 |
| País: | Brasil |
| Institución: | Universidade Federal Fluminense (UFF) |
| Repositorio: | Sistemas & Gestão |
| Idioma: | portugués |
| OAI Identifier: | oai:ojs.www.revistasg.uff.br:article/8 |
| Acceso en línea: | https://www.revistasg.uff.br/sg/article/view/SGV1N2A2 |
| Access Level: | acceso abierto |
| Palabra clave: | Capacitated arc Routing problem Vehicle routing Genetic algorithms Roteamento de veículos Arcos capacitados Algoritmos genéticos |
| Sumario: | The Capacitated Arc Routing Problem (CARP) consists of visiting a subset of edges of the graph that describes the problem. CARP applications include urban waste collection and inspection of power lines. The CARP is NP-hard, even in the single-vehicle case (called Rural Postman Problem). In this case, the use of metaheuristics is an efficient solution strategy. This paper proposes a hybrid genetic algorithm for the CARP, which is tested on available instances of the literature. The results obtained until now show the effectiveness of the proposed algorithm when it is compared with lower bounds described in the literature. |
|---|