A GRASP for the Mixed Postman Problem
[EN] Arc routing problems (ARPs) consist of finding a traversal on a graph satisfying some conditions related to the links of the graph. In the Chinese postman problem (CPP) the aim is to find a minimum cost tour (closed walk) traversing all the links of the graph at least once. Both the Undirected...
| Autores: | , , |
|---|---|
| Tipo de recurso: | artículo |
| Fecha de publicación: | 2002 |
| País: | España |
| Institución: | Universitat Politècnica de València (UPV) |
| Repositorio: | RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia |
| Idioma: | inglés |
| OAI Identifier: | oai:riunet.upv.es:10251/100592 |
| Acceso en línea: | https://riunet.upv.es/handle/10251/100592 |
| Access Level: | acceso abierto |
| Palabra clave: | Metaheuristics Routing Chinese postman GRASP MATEMATICA APLICADA |
| id |
ES_ff6f3b1204183f3a65ed411cdb2a3a63 |
|---|---|
| oai_identifier_str |
oai:riunet.upv.es:10251/100592 |
| network_acronym_str |
ES |
| network_name_str |
España |
| repository_id_str |
|
| spelling |
A GRASP for the Mixed Postman ProblemCorberán, A.Marti, R.Sanchís Llopis, José María|||0000-0002-0039-8122MetaheuristicsRoutingChinese postmanGRASPMATEMATICA APLICADA[EN] Arc routing problems (ARPs) consist of finding a traversal on a graph satisfying some conditions related to the links of the graph. In the Chinese postman problem (CPP) the aim is to find a minimum cost tour (closed walk) traversing all the links of the graph at least once. Both the Undirected CPP, where all the links are edges that can be traversed in both ways, and the Directed CPP, where all the links are arcs that must be traversed in a specified way, are known to be polynomially solvable. However, if we deal with a mixed graph (having edges and arcs), the problem turns out to be,N P-hard. In this paper, we present a heuristic algorithm for this problem, the so-called Mixed CPP (MCPP), based on greedy randomized adaptive search procedure (GRASP) techniques. The algorithm has been tested and compared with other known and recent methods from the literature on a wide collection of randomly generated instances, with up to 200 nodes and 600 links, producing encouraging computational results. As far as we know, this is the best heuristic algorithm for the MCPP, with respect to solution quality, published up to now.ElsevierDepartamento de Matemática AplicadaInstituto Universitario de Matemática Pura y AplicadaEscuela Técnica Superior de Ingeniería IndustrialRepositorio Institucional de la Universitat Politècnica de València Riunet20022002-01-01journal articlehttp://purl.org/coar/resource_type/c_6501VoRhttp://purl.org/coar/version/c_970fb48d4fbd8a85info:eu-repo/semantics/articleapplication/pdfapplication/pdfhttps://riunet.upv.es/handle/10251/100592reponame:RiuNet. Repositorio Institucional de la Universitat Politécnica de Valénciainstname:Universitat Politècnica de València (UPV)Inglésengopen accesshttp://purl.org/coar/access_right/c_abf2Reserva de todos los derechoshttp://rightsstatements.org/vocab/InC/1.0/info:eu-repo/semantics/openAccessoai:riunet.upv.es:10251/1005922026-06-13T07:49:27Z |
| dc.title.none.fl_str_mv |
A GRASP for the Mixed Postman Problem |
| title |
A GRASP for the Mixed Postman Problem |
| spellingShingle |
A GRASP for the Mixed Postman Problem Corberán, A. Metaheuristics Routing Chinese postman GRASP MATEMATICA APLICADA |
| title_short |
A GRASP for the Mixed Postman Problem |
| title_full |
A GRASP for the Mixed Postman Problem |
| title_fullStr |
A GRASP for the Mixed Postman Problem |
| title_full_unstemmed |
A GRASP for the Mixed Postman Problem |
| title_sort |
A GRASP for the Mixed Postman Problem |
| dc.creator.none.fl_str_mv |
Corberán, A. Marti, R. Sanchís Llopis, José María|||0000-0002-0039-8122 |
| author |
Corberán, A. |
| author_facet |
Corberán, A. Marti, R. Sanchís Llopis, José María|||0000-0002-0039-8122 |
| author_role |
author |
| author2 |
Marti, R. Sanchís Llopis, José María|||0000-0002-0039-8122 |
| author2_role |
author author |
| dc.contributor.none.fl_str_mv |
Departamento de Matemática Aplicada Instituto Universitario de Matemática Pura y Aplicada Escuela Técnica Superior de Ingeniería Industrial Repositorio Institucional de la Universitat Politècnica de València Riunet |
| dc.subject.none.fl_str_mv |
Metaheuristics Routing Chinese postman GRASP MATEMATICA APLICADA |
| topic |
Metaheuristics Routing Chinese postman GRASP MATEMATICA APLICADA |
| description |
[EN] Arc routing problems (ARPs) consist of finding a traversal on a graph satisfying some conditions related to the links of the graph. In the Chinese postman problem (CPP) the aim is to find a minimum cost tour (closed walk) traversing all the links of the graph at least once. Both the Undirected CPP, where all the links are edges that can be traversed in both ways, and the Directed CPP, where all the links are arcs that must be traversed in a specified way, are known to be polynomially solvable. However, if we deal with a mixed graph (having edges and arcs), the problem turns out to be,N P-hard. In this paper, we present a heuristic algorithm for this problem, the so-called Mixed CPP (MCPP), based on greedy randomized adaptive search procedure (GRASP) techniques. The algorithm has been tested and compared with other known and recent methods from the literature on a wide collection of randomly generated instances, with up to 200 nodes and 600 links, producing encouraging computational results. As far as we know, this is the best heuristic algorithm for the MCPP, with respect to solution quality, published up to now. |
| publishDate |
2002 |
| dc.date.none.fl_str_mv |
2002 2002-01-01 |
| dc.type.none.fl_str_mv |
journal article http://purl.org/coar/resource_type/c_6501 VoR http://purl.org/coar/version/c_970fb48d4fbd8a85 |
| dc.type.openaire.fl_str_mv |
info:eu-repo/semantics/article |
| format |
article |
| dc.identifier.none.fl_str_mv |
https://riunet.upv.es/handle/10251/100592 |
| url |
https://riunet.upv.es/handle/10251/100592 |
| dc.language.none.fl_str_mv |
Inglés eng |
| language_invalid_str_mv |
Inglés |
| language |
eng |
| dc.rights.none.fl_str_mv |
open access http://purl.org/coar/access_right/c_abf2 Reserva de todos los derechos http://rightsstatements.org/vocab/InC/1.0/ |
| dc.rights.openaire.fl_str_mv |
info:eu-repo/semantics/openAccess |
| rights_invalid_str_mv |
open access http://purl.org/coar/access_right/c_abf2 Reserva de todos los derechos http://rightsstatements.org/vocab/InC/1.0/ |
| eu_rights_str_mv |
openAccess |
| dc.format.none.fl_str_mv |
application/pdf application/pdf |
| dc.publisher.none.fl_str_mv |
Elsevier |
| publisher.none.fl_str_mv |
Elsevier |
| dc.source.none.fl_str_mv |
reponame:RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia instname:Universitat Politècnica de València (UPV) |
| instname_str |
Universitat Politècnica de València (UPV) |
| reponame_str |
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia |
| collection |
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia |
| repository.name.fl_str_mv |
|
| repository.mail.fl_str_mv |
|
| _version_ |
1869425774287650816 |
| score |
15,300724 |