Abstract
We describe an exact combinatorial learning approach to solve dynamic job-shop scheduling problems arising in traffic management. When a set of vehicles has to be controlled in real-time, a new schedule must be computed whenever a deviation from the current plan is detected, or periodically after a short amount of time. This suggests that each two (or more) consecutive instances will be very similar. We exploit a recently introduced MILP formulation for job-shop scheduling (called path&cycle) to develop an effective solution algorithm based on delayed row generation. In our re-optimization framework, the algorithm maintains a pool of combinatorial cuts separated during the solution of previous instances, and adapts them to warm start each new instance. In our experiments, this adaptive approach led to a 4-time average speedup over the static approach (where each instance is solved independently) for a critical application in air traffic management.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Balas, E.: Machine sequencing via disjunctive graphs: an implicit enumeration algorithm. Oper. Res. 17(6), 941–957 (1969)
Fischetti, M., Ljubić, I., Sinnl, M.: Redesigning benders decomposition for large-scale facility location. Manage. Sci. 63(7), 2146–2162 (2016)
Keha, A.B., Khowala, K., Fowler, J.W.: Mixed integer programming formulations for single machine scheduling problems. Comput. Ind. Eng. 56(1), 357–367 (2009)
Lamorgese, L., Mannino, C.: A non-compact formulation for job-shop scheduling problems in transportation. Oper. Res. (to appear)
Mannino, C., Mascis, A.: Optimal real-time traffic control in metro stations. Oper. Res. 57(4), 1026–1039 (2009)
Mascis, A., Pacciarelli, D.: Job-shop scheduling with blocking and no-wait constraints. Eur. J. Oper. Res. 143(3), 498–517 (2002)
Ozbaygin, G., Savelsbergh, M.: An iterative re-optimization framework for the dynamic vehicle routing problem with roaming delivery locations. http://www.optimization-online.org/DB_FILE/2018/08/6784.pdf (2018)
Psaraftis, H.N., Wen, M., Kontovas, C.A.: Dynamic vehicle routing problems: three decades and counting. Networks 67(1), 3–31 (2016)
Queyranne, M., Schulz, A.S.: Polyhedral approaches to machine scheduling. TU, Fachbereich 3, Berlin (1994)
Sartor, G., Mannino, C.: The path&cycle formulation for the hotspot problem in air traffic management. In: 18th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems, ATMOS 2018, Helsinki, Finland, 23–24 August 2018 (2018)
Schieber, B., Shachnai, H., Tamir, G., Tamir, T.: A theory and algorithms for combinatorial reoptimization. Algorithmica 80(2), 576–607 (2018)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Switzerland AG
About this paper
Cite this paper
Sartor, G., Mannino, C., Bach, L. (2019). Combinatorial Learning in Traffic Management. In: Nicosia, G., Pardalos, P., Umeton, R., Giuffrida, G., Sciacca, V. (eds) Machine Learning, Optimization, and Data Science. LOD 2019. Lecture Notes in Computer Science(), vol 11943. Springer, Cham. https://doi.org/10.1007/978-3-030-37599-7_32
Download citation
DOI: https://doi.org/10.1007/978-3-030-37599-7_32
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-37598-0
Online ISBN: 978-3-030-37599-7
eBook Packages: Computer ScienceComputer Science (R0)