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...
Wedi'i Gadw mewn:
| Cyhoeddwyd yn: | International Journal of Combinatorial Optimization Problems and Informatics |
|---|---|
| Prif Awduron: | , |
| Fformat: | Artigo |
| Iaith: | Inglês |
| Cyhoeddwyd: |
International Journal of Combinatorial Optimization Problems and Informatics
2012
|
| Pynciau: | |
| Mynediad Ar-lein: | https://www.redalyc.org/articulo.oa?id=265224466005 |
| Tagiau: |
Dim Tagiau, Byddwch y cyntaf i dagio'r cofnod hwn!
|