Cutting path as a rural postman problem: solutions by memetic algorithms Reportar como inadecuado




Cutting path as a rural postman problem: solutions by memetic algorithms - Descarga este documento en PDF. Documentación en PDF para descargar gratis. Disponible también para leer online.

José Soeiro Ferreira ;International Journal of Combinatorial Optimization Problems and Informatics 2012, 3 1

Autor: Ana Maria Rodrigues

Fuente: http://www.redalyc.org/articulo.oa?id=265224466005


Introducción



International Journal of Combinatorial Optimization Problems and Informatics E-ISSN: 2007-1558 editor@ijcopi.org International Journal of Combinatorial Optimization Problems and Informatics México Rodrigues, Ana Maria; Soeiro Ferreira, José Cutting path as a Rural Postman Problem: solutions by Memetic Algorithms International Journal of Combinatorial Optimization Problems and Informatics, vol.
3, núm.
1, eneroabril, 2012, pp.
31-46 International Journal of Combinatorial Optimization Problems and Informatics Morelos, México Available in: http:--www.redalyc.org-articulo.oa?id=265224466005 How to cite Complete issue More information about this article Journals homepage in redalyc.org Scientific Information System Network of Scientific Journals from Latin America, the Caribbean, Spain and Portugal Non-profit academic project, developed under the open access initiative © International Journal of Combinatorial Optimization Problems and Informatics, Vol.
3, No.
1, Jan-April 2012, pp.
31-46.
ISSN: 2007-1558. Cutting path as a Rural Postman Problem: solutions by Memetic Algorithms Ana Maria Rodrigues Instituto de Engenharia de Sistemas e Computadores do Porto Instituto Superior de Contabilidade e Administração do Porto, Porto, Portugal amr@inescporto.pt José Soeiro Ferreira Faculdade de Engenharia, Universidade do Porto Instituto de Engenharia de Sistemas e Computadores do Porto Porto, Portugal jsoeiro@inescporto.pt Abstract.
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 M...





Documentos relacionados