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...
| Autor principal: | |
|---|---|
| Outros Autores: | , |
| Formato: | article |
| Idioma: | por |
| Publicado em: |
2009
|
| Assuntos: | |
| Texto completo: | https://doi.org/10.7177/sg.2006.SGV1N2A1 |
| País: | Brasil |
| Oai: | oai:ojs.www.revistasg.uff.br:article/7 |