Cutting path as a Rural Postman Problem: solutions by Memetic Algorithms
The Rural Postman Problem (RPP) is a particular Arc Routing Problem (ARP) which consists of determining a minimum cost circuit on a graph so that a given subset of required edges is traversed. The RPP is an NP-hard problem with significant real-life applications. This paper introduces an original ap...
| Autor principal: | |
|---|---|
| Outros Autores: | |
| Formato: | article |
| Idioma: | eng |
| Publicado em: |
2012
|
| Assuntos: | |
| Texto completo: | https://hdl.handle.net/10216/57210 |
| País: | Portugal |
| Oai: | oai:repositorio-aberto.up.pt:10216/57210 |