Heuristics for a dynamic rural postman problem
Autor(a) principal: | |
---|---|
Data de Publicação: | 2007 |
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/1414 |
Resumo: | This paper presents a very special cutting path determination problem appearing in a high precision tools factory, and provides two new heuristics for its resolution. Particular features of both the cutting process, and of the material to be cut, bring in a set of unusual constraints, when compared with other cutting processes, which confer additional complexity and originality to the problem. In particular, this is a matter of practical and economic relevance, since the solution methods are intended to be implemented in a real-life industrial environment. The concept of dynamic graph is exploited to deal with the arc routing problem under study, which is modelled as a dynamic rural postman problem. The constructive heuristics developed, the “higher up vertex heuristic” (HUV) and the “minimum empty path heuristic” (MEP) are tested with real data sets. |
id |
RCAP_515099d1a3917922a9b89286cb947997 |
---|---|
oai_identifier_str |
oai:repositorio.inesctec.pt:123456789/1414 |
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 |
Heuristics for a dynamic rural postman problemThis paper presents a very special cutting path determination problem appearing in a high precision tools factory, and provides two new heuristics for its resolution. Particular features of both the cutting process, and of the material to be cut, bring in a set of unusual constraints, when compared with other cutting processes, which confer additional complexity and originality to the problem. In particular, this is a matter of practical and economic relevance, since the solution methods are intended to be implemented in a real-life industrial environment. The concept of dynamic graph is exploited to deal with the arc routing problem under study, which is modelled as a dynamic rural postman problem. The constructive heuristics developed, the “higher up vertex heuristic” (HUV) and the “minimum empty path heuristic” (MEP) are tested with real data sets.2017-11-16T12:19:42Z2007-01-01T00:00:00Z2007info:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/articleapplication/pdfhttp://repositorio.inesctec.pt/handle/123456789/1414engJosé Soeiro FerreiraAntónio Miguel GomesLuís Miguel MoreiraJosé Fernando Oliveirainfo:eu-repo/semantics/embargoedAccessreponame: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:20:59Zoai:repositorio.inesctec.pt:123456789/1414Portal AgregadorONGhttps://www.rcaap.pt/oai/openaireopendoar:71602024-03-19T17:53:54.019641Repositó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 |
Heuristics for a dynamic rural postman problem |
title |
Heuristics for a dynamic rural postman problem |
spellingShingle |
Heuristics for a dynamic rural postman problem José Soeiro Ferreira |
title_short |
Heuristics for a dynamic rural postman problem |
title_full |
Heuristics for a dynamic rural postman problem |
title_fullStr |
Heuristics for a dynamic rural postman problem |
title_full_unstemmed |
Heuristics for a dynamic rural postman problem |
title_sort |
Heuristics for a dynamic rural postman problem |
author |
José Soeiro Ferreira |
author_facet |
José Soeiro Ferreira António Miguel Gomes Luís Miguel Moreira José Fernando Oliveira |
author_role |
author |
author2 |
António Miguel Gomes Luís Miguel Moreira José Fernando Oliveira |
author2_role |
author author author |
dc.contributor.author.fl_str_mv |
José Soeiro Ferreira António Miguel Gomes Luís Miguel Moreira José Fernando Oliveira |
description |
This paper presents a very special cutting path determination problem appearing in a high precision tools factory, and provides two new heuristics for its resolution. Particular features of both the cutting process, and of the material to be cut, bring in a set of unusual constraints, when compared with other cutting processes, which confer additional complexity and originality to the problem. In particular, this is a matter of practical and economic relevance, since the solution methods are intended to be implemented in a real-life industrial environment. The concept of dynamic graph is exploited to deal with the arc routing problem under study, which is modelled as a dynamic rural postman problem. The constructive heuristics developed, the “higher up vertex heuristic” (HUV) and the “minimum empty path heuristic” (MEP) are tested with real data sets. |
publishDate |
2007 |
dc.date.none.fl_str_mv |
2007-01-01T00:00:00Z 2007 2017-11-16T12:19:42Z |
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/1414 |
url |
http://repositorio.inesctec.pt/handle/123456789/1414 |
dc.language.iso.fl_str_mv |
eng |
language |
eng |
dc.rights.driver.fl_str_mv |
info:eu-repo/semantics/embargoedAccess |
eu_rights_str_mv |
embargoedAccess |
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_ |
1799131612673212416 |