Cutting path as a Rural Postman Problem: solutions by Memetic Algorithms
Fuente:
Redalyc
Salvato in:
| Autore principale: | |
|---|---|
| Natura: | Artículo científico |
| Lingua: | en |
| Pubblicazione: |
International Journal of Combinatorial Optimization Problems and Informatics
2012
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1876437024828817408 |
|---|---|
| author | Ana Maria Rodrigues |
| author_facet | Ana Maria Rodrigues |
| contents | Cutting path as a Rural Postman Problem: solutions by Memetic Algorithms Ana Maria Rodrigues José Soeiro Ferreira Computación Memetic Algorithms Rural Postman Problem Cutting Path Application 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 approach based on Memetic Algorithms - the MARP algorithm - to solve the RPP and, also deals with an interesting Industrial Application, which focuses on the path optimization for component cutting operations. Memetic Algorithms are a class of Metaheuristics which may be seen as a population strategy that involves cooperation and competition processes between population elements and integrates "social knowledge", using a local search procedure. The MARP algorithm is tested with different groups of instances and the results are compared with those gathered from other publications. MARP is also used in the context of various real-life applications. 2012 artículo científico 2007-1558 https://www.redalyc.org/articulo.oa?id=265224466005 en http://www.redalyc.org/revista.oa?id=2652 International Journal of Combinatorial Optimization Problems and Informatics application/pdf International Journal of Combinatorial Optimization Problems and Informatics International Journal of Combinatorial Optimization Problems and Informatics (México) Num.1 Vol.3 |
| format | Artículo científico |
| id | redalyc_265224466005 |
| institution | Redalyc |
| language | en |
| publishDate | 2012 |
| publisher | International Journal of Combinatorial Optimization Problems and Informatics |
| spellingShingle | Cutting path as a Rural Postman Problem: solutions by Memetic Algorithms Ana Maria Rodrigues Computación Memetic Algorithms Rural Postman Problem Cutting Path Application Cutting path as a Rural Postman Problem: solutions by Memetic Algorithms Ana Maria Rodrigues José Soeiro Ferreira Computación Memetic Algorithms Rural Postman Problem Cutting Path Application 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 approach based on Memetic Algorithms - the MARP algorithm - to solve the RPP and, also deals with an interesting Industrial Application, which focuses on the path optimization for component cutting operations. Memetic Algorithms are a class of Metaheuristics which may be seen as a population strategy that involves cooperation and competition processes between population elements and integrates "social knowledge", using a local search procedure. The MARP algorithm is tested with different groups of instances and the results are compared with those gathered from other publications. MARP is also used in the context of various real-life applications. 2012 artículo científico 2007-1558 https://www.redalyc.org/articulo.oa?id=265224466005 en http://www.redalyc.org/revista.oa?id=2652 International Journal of Combinatorial Optimization Problems and Informatics application/pdf International Journal of Combinatorial Optimization Problems and Informatics International Journal of Combinatorial Optimization Problems and Informatics (México) Num.1 Vol.3 |
| title | Cutting path as a Rural Postman Problem: solutions by Memetic Algorithms |
| topic | Computación Memetic Algorithms Rural Postman Problem Cutting Path Application |
| url | https://www.redalyc.org/articulo.oa?id=265224466005 |