The Chinese Postman Problem with Load-Dependent Costs

[EN] We introduce an interesting variant of the well-known Chinese postman problem (CPP). While in the CPP the cost of traversing an edge is a constant (equal to its length), in the variant we present here the cost of traversing an edge depends on its length and on the weight of the vehicle at the m...

Descripción completa

Detalles Bibliográficos
Autores: Corberán, Ángel, Erdogan, Gunes, Laporte, Gilbert, Plana, Isaac, Sanchís Llopis, José María
Tipo de recurso: artículo
Fecha de publicación:2018
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/105283
Acceso en línea:https://riunet.upv.es/handle/10251/105283
Access Level:acceso abierto
Palabra clave:Chinese postman problem
Arc-routing problems
Pollution routing
MATEMATICA APLICADA
id ES_3cf8d9916f03ed9bb9e2be8bb7c0b4a2
oai_identifier_str oai:riunet.upv.es:10251/105283
network_acronym_str ES
network_name_str España
repository_id_str
spelling The Chinese Postman Problem with Load-Dependent CostsCorberán, ÁngelErdogan, GunesLaporte, GilbertPlana, IsaacSanchís Llopis, José MaríaChinese postman problemArc-routing problemsPollution routingMATEMATICA APLICADA[EN] We introduce an interesting variant of the well-known Chinese postman problem (CPP). While in the CPP the cost of traversing an edge is a constant (equal to its length), in the variant we present here the cost of traversing an edge depends on its length and on the weight of the vehicle at the moment it is traversed. This problem is inspired by the perspective of minimizing pollution in transportation, since the amount of pollution emitted by a vehicle not only depends on the travel distance but also on its load, among other factors. We define the problem, study its computational complexity, provide two mathematical programming formulations, and propose two metaheuristics for its solution. Extensive computational experiments reveal the extraordinary difficulty of this problem.The work by Angel Corberan, Isaac Plana, and Jose M. Sanchis was supported by the Spanish Ministerio de Economia y Competitividad and Fondo Europeo de Desarrollo Regional (FEDER) through [project MTM2015-68097-P] (MINECO/FEDER) and by the Generalitat Valenciana [project GVPROMETEO2013-049]. Gilbert Laporte was supported by the Canadian Natural Sciences and Engineering Research Council under [Grant 2015-06189].Institute for Operations Research and the Management SciencesMinisterio de Economía y CompetitividadGeneralitat ValencianaRepositorio Institucional de la Universitat Politècnica de València Riunet20182018-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/105283reponame:RiuNet. Repositorio Institucional de la Universitat Politécnica de Valénciainstname:Universitat Politècnica de València (UPV)InglésengMinisterio de Economía y Competitividad http://dx.doi.org/10.13039/501100003329 MTM2015-68097-P MODELOS Y ALGORITMOS PARA PROBLEMAS DE RUTAS DE VEHICULOS Y DE LOCALIZACION DE SERVICIOSGeneralitat Valenciana https://doi.org/10.13039/501100003359 PROMETEO%2F2013%2F049 Modelos y algoritmos para problemas de optimización combinatoriaopen 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/1052832026-06-13T07:49:27Z
dc.title.none.fl_str_mv The Chinese Postman Problem with Load-Dependent Costs
title The Chinese Postman Problem with Load-Dependent Costs
spellingShingle The Chinese Postman Problem with Load-Dependent Costs
Corberán, Ángel
Chinese postman problem
Arc-routing problems
Pollution routing
MATEMATICA APLICADA
title_short The Chinese Postman Problem with Load-Dependent Costs
title_full The Chinese Postman Problem with Load-Dependent Costs
title_fullStr The Chinese Postman Problem with Load-Dependent Costs
title_full_unstemmed The Chinese Postman Problem with Load-Dependent Costs
title_sort The Chinese Postman Problem with Load-Dependent Costs
dc.creator.none.fl_str_mv Corberán, Ángel
Erdogan, Gunes
Laporte, Gilbert
Plana, Isaac
Sanchís Llopis, José María
author Corberán, Ángel
author_facet Corberán, Ángel
Erdogan, Gunes
Laporte, Gilbert
Plana, Isaac
Sanchís Llopis, José María
author_role author
author2 Erdogan, Gunes
Laporte, Gilbert
Plana, Isaac
Sanchís Llopis, José María
author2_role author
author
author
author
dc.contributor.none.fl_str_mv Ministerio de Economía y Competitividad
Generalitat Valenciana
Repositorio Institucional de la Universitat Politècnica de València Riunet
dc.subject.none.fl_str_mv Chinese postman problem
Arc-routing problems
Pollution routing
MATEMATICA APLICADA
topic Chinese postman problem
Arc-routing problems
Pollution routing
MATEMATICA APLICADA
description [EN] We introduce an interesting variant of the well-known Chinese postman problem (CPP). While in the CPP the cost of traversing an edge is a constant (equal to its length), in the variant we present here the cost of traversing an edge depends on its length and on the weight of the vehicle at the moment it is traversed. This problem is inspired by the perspective of minimizing pollution in transportation, since the amount of pollution emitted by a vehicle not only depends on the travel distance but also on its load, among other factors. We define the problem, study its computational complexity, provide two mathematical programming formulations, and propose two metaheuristics for its solution. Extensive computational experiments reveal the extraordinary difficulty of this problem.
publishDate 2018
dc.date.none.fl_str_mv 2018
2018-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/105283
url https://riunet.upv.es/handle/10251/105283
dc.language.none.fl_str_mv Inglés
eng
language_invalid_str_mv Inglés
language eng
dc.relation.none.fl_str_mv Ministerio de Economía y Competitividad http://dx.doi.org/10.13039/501100003329 MTM2015-68097-P MODELOS Y ALGORITMOS PARA PROBLEMAS DE RUTAS DE VEHICULOS Y DE LOCALIZACION DE SERVICIOS
Generalitat Valenciana https://doi.org/10.13039/501100003359 PROMETEO%2F2013%2F049 Modelos y algoritmos para problemas de optimización combinatoria
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 Institute for Operations Research and the Management Sciences
publisher.none.fl_str_mv Institute for Operations Research and the Management Sciences
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_ 1869406410611097600
score 15.300719

Similares en LA Referencia