2021-04-122019-01-011865092918650937WOS;000525351100062SCOPUS;2-s2.0-85075684471http://hdl.handle.net/10784/27909This 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.enghttps://v2.sherpa.ac.uk/id/publication/issn/1865-0929info:eu-repo/semantics/conferencePaperLocationPickupsTraveling salesman problemCapacitated vehiclesCommercial solversMixed integer linear programmingMixed integer linear programming modelPickup and deliveryRouting problemsSolution qualitySplit deliveryInteger programming2021-04-12Palacio J.D.Rivera J.C.10.1007/978-3-030-31019-6_62