Cutting Path as a Rural Postman Problem: solutions by Memetic Algorithms
Autor(a) principal: | |
---|---|
Data de Publicação: | 2012 |
Outros Autores: | |
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: | http://repositorio.inesctec.pt/handle/123456789/2303 |
Resumo: | The Rural Postman Problem (RPP) is a particular Arc routing Problem (ARP)which consits of determining a minimum cost circuit on a graph so that a given subset of required edges is traversed. the EPP 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 componenet 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_95c5bd9cee210779221e978b00450f94 |
---|---|
oai_identifier_str |
oai:repositorio.inesctec.pt:123456789/2303 |
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 AlgorithmsThe Rural Postman Problem (RPP) is a particular Arc routing Problem (ARP)which consits of determining a minimum cost circuit on a graph so that a given subset of required edges is traversed. the EPP 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 componenet 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.2017-11-16T13:29:06Z2012-01-01T00:00:00Z2012info:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/articleapplication/pdfhttp://repositorio.inesctec.pt/handle/123456789/2303engAna 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-05-15T10:19:40Zoai:repositorio.inesctec.pt:123456789/2303Portal AgregadorONGhttps://www.rcaap.pt/oai/openaireopendoar:71602024-03-19T17:52:04.282947Repositó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 |
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 |
description |
The Rural Postman Problem (RPP) is a particular Arc routing Problem (ARP)which consits of determining a minimum cost circuit on a graph so that a given subset of required edges is traversed. the EPP 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 componenet 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-01-01T00:00:00Z 2012 2017-11-16T13:29:06Z |
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 |
http://repositorio.inesctec.pt/handle/123456789/2303 |
url |
http://repositorio.inesctec.pt/handle/123456789/2303 |
dc.language.iso.fl_str_mv |
eng |
language |
eng |
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_ |
1799131597834813440 |