Abstract
This paper concerns the problem of designing a route of minimum cost for a capacitated vehicle moving a single commodity between a set of customers. The route must allow two characteristics uncommon in the literature. One characteristic is that a customer may be visited several times. The other characteristic is that a customer may be used as intermediate location to temporarily collect and deliver part of the load of the vehicle. Routes with these characteristics may lead to cost reductions when compared to routes without them. The paper describes a branch-and-cut algorithm based on a relaxation of a model of Mixed Integer Programming. Preliminary computational results on benchmark instances demonstrate the good performance of the algorithm compared with the original model.
This work has been partially supported by MTM2015-63680-R (MINECO/FEDER), ProID2017010132 (Gobierno Canarias) and 2016TUR11 (Fundación CajaCanarias).
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Chemla, D., Meunier, F., Wolfler-Calvo, R.: Bike sharing systems: solving the static rebalancing problem. Discrete Optim. 10(2), 120–146 (2013)
Cruz, F., Bruck, B.P., Subramanian, A., Iori, M.: A heuristic algorithm for a single vehicle static bike sharing rebalancing problem. Comput. Oper. Res. 79, 19–33 (2017)
Erdogan, G., Battarra, M., Wolfler Calvo, R.: An exact algorithm for the static rebalancing problem arising in bicycle sharing systems. Eur. J. Oper. Res. 245, 667–679 (2015)
Hernández-Pérez, H., Salazar-González, J.-J.: The one-commodity pickup-and-delivery travelling salesman problem. In: Jünger, M., Reinelt, G., Rinaldi, G. (eds.) Combinatorial Optimization — Eureka, You Shrink!. LNCS, vol. 2570, pp. 89–104. Springer, Heidelberg (2003). https://doi.org/10.1007/3-540-36478-1_10
Hernández-Pérez, H., Salazar-González, J.J.: A branch-and-cut algorithm for a traveling salesman problem with pickup and delivery. Disc. Appl. Math. 145, 126–139 (2004)
Hernández-Pérez, H., Salazar-González, J.J.: Heuristics for the one-commodity pickup-and-delivery traveling salesman problem. Transp. Sci. 38, 245–255 (2004)
Hernández-Pérez, H., Salazar-González, J.J.: The one-commodity pickup-and-delivery traveling salesman problem: Inequalities and algorithms. Networks 50, 258–272 (2007)
Hernández-Pérez, H., Salazar-González, J.J., Santos-Hernández, B.: Heuristic algorithm for the split-demand one-commodity pickup-and-delivery travelling salesman problem. Comput. Oper. Res. 97, 1–17 (2018)
Salazar-González, J.J., Santos-Hernández, B.: The split-demand one-commodity pickup-and-delivery travelling salesman problem. Transp. Res. Part B Methodol. 75, 58–73 (2015)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer International Publishing AG, part of Springer Nature
About this paper
Cite this paper
Hernández-Pérez, H., Salazar-González, J.J. (2018). An Exact Algorithm for the Split-Demand One-Commodity Pickup-and-delivery Travelling Salesman Problem. In: Lee, J., Rinaldi, G., Mahjoub, A. (eds) Combinatorial Optimization. ISCO 2018. Lecture Notes in Computer Science(), vol 10856. Springer, Cham. https://doi.org/10.1007/978-3-319-96151-4_21
Download citation
DOI: https://doi.org/10.1007/978-3-319-96151-4_21
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-96150-7
Online ISBN: 978-3-319-96151-4
eBook Packages: Computer ScienceComputer Science (R0)