A multi-start evolutionary local search for the one-commodity pickup and delivery traveling salesman problem

Vista sencilla de ítem
dc.citation.journalTitleANNALS OF OPERATIONS RESEARCHeng
dc.contributor.authorPalacio J.D.
dc.contributor.authorRivera J.C.
dc.contributor.departmentUniversidad EAFIT. Escuela de Cienciasspa
dc.contributor.researchgroupModelado Matemáticospa
dc.date2020-01-01
dc.date.accessioned2021-04-12T14:07:20Z
dc.date.available2021-04-12T14:07:20Z
dc.description.abstractThis article addresses the one-commodity pickup and delivery traveling salesman problem (1-PDTSP), which is a generalization of the well-known traveling salesman problem. The 1-PDTSP aims to find a Hamiltonian tour in which a set of supply points (pickup locations), demand points (delivery locations) are visited and, the total traveled distance is minimized. We propose a hybrid metaheuristic based on multi-start evolutionary local search and variable neighborhood descent to solve the 1-PDTSP. To test the performance of our algorithm, we solve instances with up to 500 nodes available in the literature and we demonstrate that our approach is able to provide competitive results when comparing to other existing strategies. Since a direct application of the 1-PDTSP arises as the bicycle repositioning problem, we also use our metaheuristic algorithm to solve a set of real-case instances based on EnCicla, the bicycle sharing system in the Aburrá Valley (Antioquia, Colombia). © 2020, Springer Science+Business Media, LLC, part of Springer Nature.eng
dc.identifierhttps://eafit.fundanetsuite.com/Publicaciones/ProdCientif/PublicacionFrw.aspx?id=12210
dc.identifier.doi10.1007/s10479-020-03789-0
dc.identifier.issn02545330
dc.identifier.issn15729338
dc.identifier.otherWOS;000571368800003
dc.identifier.otherSCOPUS;2-s2.0-85091132665
dc.identifier.urihttp://hdl.handle.net/10784/27830
dc.language.isoengeng
dc.publisherSpringer Netherlands
dc.relation.urihttps://www.scopus.com/inward/record.uri?eid=2-s2.0-85091132665&doi=10.1007%2fs10479-020-03789-0&partnerID=40&md5=778af8ec4d15baa09ed16d0225b2d0ce
dc.rightsSpringer Netherlands
dc.sourceANNALS OF OPERATIONS RESEARCH
dc.subject.keywordBicycle repositioning problemeng
dc.subject.keywordEvolutionary local searcheng
dc.subject.keywordPickup and delivery traveling salesman problemeng
dc.subject.keywordVariable neighborhood descenteng
dc.titleA multi-start evolutionary local search for the one-commodity pickup and delivery traveling salesman problemeng
dc.typearticleeng
dc.typeinfo:eu-repo/semantics/articleeng
dc.typeinfo:eu-repo/semantics/publishedVersioneng
dc.typepublishedVersioneng
dc.type.localArtículospa

Archivos

Bloque original
Mostrando 1 - 1 de 1
No hay miniatura disponible
Nombre:
s10479-020-03789-0.pdf
Tamaño:
725.3 KB
Formato:
Adobe Portable Document Format
Descripción:
Descargar

Colecciones

Artículos