Abstract
In this paper we introduce a class of routing problems where pickups and deliveries need to be performed in two distinct regions, and must be synchronized by considering the presence of a first-in-first-out channel linking them. Our research is motivated by applications in the context of automated warehouses management. We formalize our problem, defining eight variants which depend on the characteristics of both the pickup and delivery vehicles, and the first-in-first-out linking channel. We show that all variants are in general NP-hard. We focus on two of these variants, proving that relevant sub-problems can be solved in polynomial-time. Our proofs are constructive, consisting of resolution algorithms. We show the applicability of our results by computational experiments on instances from the literature.
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
References
AD-COM: ADvanced Cosmetic Manufacturing (2020). https://ad-com.net/
Applegate, D.L., Bixby, R.E., Chvatal, V., Cook, W.J.: Concorde (2003). http://www.math.uwaterloo.ca/tsp/concorde.html
Applegate, D.L., Bixby, R.E., Chvatal, V., Cook, W.J.: The Traveling Salesman Problem: A Computational Study. Princeton University Press, Princeton (2006)
Edmonds, J.: Maximum matching and a polyhedron with 0, 1-vertices. J. Res. Natl. Bur. Stan. B 69(125–130), 55–56 (1965)
Leiserson, C.E., Rivest, R.L., Cormen, T.H., Stein, C.: Introduction to Algorithms, vol. 6. MIT Press, Cambridge (2001)
Papadimitriou, C.H.: The Euclidean travelling salesman problem is NP-complete. Theor. Comput. Sci. 4(3), 237–244 (1977)
Petersen, H.L., Madsen, O.B.: The double travelling salesman problem with multiple stacks–formulation and heuristic solution approaches. Eur. J. Oper. Res. 198(1), 139–147 (2009)
Toth, P., Vigo, D.: The Vehicle Routing Problem, 2nd edn. SIAM, Philadelphia (2014)
Acknowledgements
This research was partially funded by Regione Lombardia, grant agreement n. E97F17000000009, project AD-COM, and Università degli Studi di Milano, Dipartimento di Informatica, Piano Sostegno alla Ricerca 2016–2020.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2021 The Author(s), under exclusive license to Springer Nature Switzerland AG
About this chapter
Cite this chapter
Barbato, M., Ceselli, A., Facchinetti, N. (2021). Synchronized Pickup and Delivery Problems with Connecting FIFO Stack. In: Gentile, C., Stecca, G., Ventura, P. (eds) Graphs and Combinatorial Optimization: from Theory to Applications. AIRO Springer Series, vol 5. Springer, Cham. https://doi.org/10.1007/978-3-030-63072-0_19
Download citation
DOI: https://doi.org/10.1007/978-3-030-63072-0_19
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-63071-3
Online ISBN: 978-3-030-63072-0
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)