Cutting path as a Rural Postman Problem: solutions by Memetic Algorithms

Detalhes bibliográficos
Autor(a) principal: Ana Maria Rodrigues
Data de Publicação: 2012
Outros Autores: José Soeiro Ferreira
Tipo de documento: Artigo
Idioma: eng
Título da fonte: Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)
Texto Completo: https://hdl.handle.net/10216/57210
Resumo: 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.
id RCAP_86bfa12d81ef87e8ac1bc53bcfc818c0
oai_identifier_str oai:repositorio-aberto.up.pt:10216/57210
network_acronym_str RCAP
network_name_str Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)
repository_id_str 7160
spelling Cutting path as a Rural Postman Problem: solutions by Memetic AlgorithmsInvestigação operacional, Ciências da computação e da informaçãoOperations research, Computer and information sciencesThe 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.20122012-01-01T00:00:00Zinfo:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/articleapplication/pdfhttps://hdl.handle.net/10216/57210eng1558Ana Maria RodriguesJosé Soeiro Ferreirainfo:eu-repo/semantics/openAccessreponame:Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)instname:Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informaçãoinstacron:RCAAP2023-11-29T16:02:39Zoai:repositorio-aberto.up.pt:10216/57210Portal AgregadorONGhttps://www.rcaap.pt/oai/openaireopendoar:71602024-03-20T00:37:11.785454Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) - Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informaçãofalse
dc.title.none.fl_str_mv Cutting path as a Rural Postman Problem: solutions by Memetic Algorithms
title Cutting path as a Rural Postman Problem: solutions by Memetic Algorithms
spellingShingle Cutting path as a Rural Postman Problem: solutions by Memetic Algorithms
Ana Maria Rodrigues
Investigação operacional, Ciências da computação e da informação
Operations research, Computer and information sciences
title_short Cutting path as a Rural Postman Problem: solutions by Memetic Algorithms
title_full Cutting path as a Rural Postman Problem: solutions by Memetic Algorithms
title_fullStr Cutting path as a Rural Postman Problem: solutions by Memetic Algorithms
title_full_unstemmed Cutting path as a Rural Postman Problem: solutions by Memetic Algorithms
title_sort Cutting path as a Rural Postman Problem: solutions by Memetic Algorithms
author Ana Maria Rodrigues
author_facet Ana Maria Rodrigues
José Soeiro Ferreira
author_role author
author2 José Soeiro Ferreira
author2_role author
dc.contributor.author.fl_str_mv Ana Maria Rodrigues
José Soeiro Ferreira
dc.subject.por.fl_str_mv Investigação operacional, Ciências da computação e da informação
Operations research, Computer and information sciences
topic Investigação operacional, Ciências da computação e da informação
Operations research, Computer and information sciences
description 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.
publishDate 2012
dc.date.none.fl_str_mv 2012
2012-01-01T00:00:00Z
dc.type.status.fl_str_mv info:eu-repo/semantics/publishedVersion
dc.type.driver.fl_str_mv info:eu-repo/semantics/article
format article
status_str publishedVersion
dc.identifier.uri.fl_str_mv https://hdl.handle.net/10216/57210
url https://hdl.handle.net/10216/57210
dc.language.iso.fl_str_mv eng
language eng
dc.relation.none.fl_str_mv 1558
dc.rights.driver.fl_str_mv info:eu-repo/semantics/openAccess
eu_rights_str_mv openAccess
dc.format.none.fl_str_mv application/pdf
dc.source.none.fl_str_mv reponame:Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)
instname:Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informação
instacron:RCAAP
instname_str Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informação
instacron_str RCAAP
institution RCAAP
reponame_str Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)
collection Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)
repository.name.fl_str_mv Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) - Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informação
repository.mail.fl_str_mv
_version_ 1799136279735042049

Registros relacionados