Abstract
We analyze a number of variations of a combinatorial optimization problem arising from the optimization of an automated warehouse. We classify these variations according to four relevant parameters and we analyze which combinations are polynomially solvable, owing to dynamic programming recursions or to reductions to known graph optimization problems such as the shortest path problem and the minimum cost perfect matching problem.
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
Toth, P., Vigo, D. (eds.) The Vehicle Routing Problem. SIAM Monographs on Discrete Mathematics and Applications, Philadelphia (2002)
Barbato, M., Ceselli, A., Mosconi, F.: A Computational Evaluation of Online ATSP Algorithms, Technical Report of University of Milan, submitted to ODS 2019
Acknowledgement
This research was partially funded by Regione Lombardia, grant agreement n. E97F17000000009, project AD-COM.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Switzerland AG
About this chapter
Cite this chapter
Barbato, M., Ceselli, A., Righini, G. (2019). Paths and Matchings in an Automated Warehouse. In: Paolucci, M., Sciomachen, A., Uberti, P. (eds) Advances in Optimization and Decision Science for Society, Services and Enterprises. AIRO Springer Series, vol 3. Springer, Cham. https://doi.org/10.1007/978-3-030-34960-8_14
Download citation
DOI: https://doi.org/10.1007/978-3-030-34960-8_14
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-34959-2
Online ISBN: 978-3-030-34960-8
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)