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...
Uloženo v:
| Vydáno v: | International Journal of Combinatorial Optimization Problems and Informatics |
|---|---|
| Hlavní autoři: | , |
| Médium: | Artigo |
| Jazyk: | Inglês |
| Vydáno: |
International Journal of Combinatorial Optimization Problems and Informatics
2012
|
| Témata: | |
| On-line přístup: | https://www.redalyc.org/articulo.oa?id=265224466005 |
| Tagy: |
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|