Mixed-Integer Linear Programming Models for One-Commodity Pickup and Delivery Traveling Salesman Problems

Vista sencilla de ítem
dc.contributor.authorPalacio J.D.
dc.contributor.authorRivera J.C.
dc.contributor.departmentUniversidad EAFIT. Departamento de Cienciasspa
dc.contributor.researchgroupMatemáticas y Aplicacionesspa
dc.creatorPalacio J.D.
dc.creatorRivera J.C.
dc.date.accessioned2021-04-12T13:55:41Z
dc.date.available2021-04-12T13:55:41Z
dc.date.issued2019-01-01
dc.description.abstractThis article addresses two different pickup and delivery routing problems. In the first one, called the one-commodity pickup and delivery traveling salesman problem, a known amount of a single product is supplied or demanded by a set of two different types of locations (pickup or delivery nodes). Therefore, a capacitated vehicle must visit each location once at a minimum cost. We also deal with the relaxed case where locations can be visited several times. In the last problem, the pickup or delivery operation can be split into several smaller pickups or deliveries, and also locations can be used as temporal storage points with the aim of reducing the cost of the route. To solve these problems, we present two mixed-integer linear programming models and we solve them via commercial solver. We analyze how several visits to a single location may improve solution quality and we also show that our simple strategy has a good performance for instances with up to 60 locations. © 2019, Springer Nature Switzerland AG.eng
dc.identifierhttps://eafit.fundanetsuite.com/Publicaciones/ProdCientif/PublicacionFrw.aspx?id=9891
dc.identifier.doi10.1007/978-3-030-31019-6_62
dc.identifier.issn18650929
dc.identifier.issn18650937
dc.identifier.otherWOS;000525351100062
dc.identifier.otherSCOPUS;2-s2.0-85075684471
dc.identifier.urihttp://hdl.handle.net/10784/27670
dc.language.isoengeng
dc.publisherSpringer Verlag
dc.relation.urihttps://www.scopus.com/inward/record.uri?eid=2-s2.0-85075684471&doi=10.1007%2f978-3-030-31019-6_62&partnerID=40&md5=2f85aa59b85c2983b87dc3d461625fb2
dc.rightshttps://v2.sherpa.ac.uk/id/publication/issn/1865-0929
dc.sourceCommunications in Computer and Information Science
dc.subject.keywordLocationeng
dc.subject.keywordPickupseng
dc.subject.keywordTraveling salesman problemeng
dc.subject.keywordCapacitated vehicleseng
dc.subject.keywordCommercial solverseng
dc.subject.keywordMixed integer linear programmingeng
dc.subject.keywordMixed integer linear programming modeleng
dc.subject.keywordPickup and deliveryeng
dc.subject.keywordRouting problemseng
dc.subject.keywordSolution qualityeng
dc.subject.keywordSplit deliveryeng
dc.subject.keywordInteger programmingeng
dc.titleMixed-Integer Linear Programming Models for One-Commodity Pickup and Delivery Traveling Salesman Problemseng
dc.typeinfo:eu-repo/semantics/conferencePapereng
dc.typeconferencePapereng
dc.typeinfo:eu-repo/semantics/publishedVersioneng
dc.typepublishedVersioneng
dc.type.localDocumento de conferenciaspa

Archivos

Colecciones

Documentos de conferencia