Abstract
Logic-based Benders decomposition is a technique to solve optimization problems to optimality. It works by splitting the problem into a master problem, which neglects some aspects of the problem, and a subproblem, which is used to iteratively produce cuts for the master problem to account for those aspects. It is critical for the computational performance that these cuts are strengthened, but the strengthening of cuts comes at the cost of solving additional subproblems. In this work we apply a graph neural network in an autoregressive fashion to approximate the compilation of an irreducible cut, which then only requires few postprocessing steps to ensure its validity. We test the approach on a job scheduling problem with a single machine and multiple time windows per job and compare to approaches from the literature. Results show that our approach is capable of considerably reducing the number of subproblems that need to be solved and hence the total computational effort.
J. Varga acknowledges the financial support from Honda Research Institute Europe.
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
Alvarez, A.M., Louveaux, Q., Wehenkel, L.: A machine learning-based approximation of strong branching. INFORMS J. Comput. 29(1), 185–195 (2017)
Bengio, Y., Lodi, A., Prouvost, A.: Machine learning for combinatorial optimization: a methodological tour d’Horizon. Eur. J. Oper. Res. 290(2), 405–421 (2021)
Chinneck, J.W., Dravnieks, E.W.: Locating minimal infeasible constraint sets in linear programs. ORSA J. Comput. 3(2), 157–168 (1991)
Coban, E., Hooker, J.N.: Single-facility scheduling by logic-based Benders decomposition. Ann. Oper. Res. 210, 245–272 (2013)
Friess, S., Tiňo, P., Xu, Z., Menzel, S., Sendhoff, B., Yao, X.: Artificial neural networks as feature extractors in continuous evolutionary optimization. In: 2021 International Joint Conference on Neural Networks, pp. 1–9 (2021)
Gräning, L., Jin, Y., Sendhoff, B.: Efficient evolutionary optimization using individual-based evolution control and neural networks: a comparative study. In: ESANN, pp. 273–278 (2005)
Hooker, J.N., Ottosson, G.: Logic-based Benders decomposition. Math. Program. 96, 33–60 (2003)
Horn, M., Raidl, G.R., Rönnberg, E.: A* search for prize-collecting job sequencing with one common and multiple secondary resources. Ann. Oper. Res. 307, 477–505 (2021)
Karlsson, E., Rönnberg, E.: Strengthening of feasibility cuts in logic-based Benders decomposition. In: Stuckey, P.J. (ed.) Integration of Constraint Programming, Artificial Intelligence, and Operations Research, pp. 45–61. Springer, Cham (2021). https://doi.org/10.1007/978-3-030-78230-6_3
Karlsson, E., Rönnberg, E.: Logic-based Benders decomposition with a partial assignment acceleration technique for avionics scheduling. Comput. Oper. Res. 146, 105916 (2022)
Kool, W., van Hoof, H., Welling, M.: Attention, learn to solve routing problems! In: International Conference on Learning Representations (2019)
Lam, E., Gange, G., Stuckey, P.J., Van Hentenryck, P., Dekker, J.J.: Nutmeg: a MIP and CP hybrid solver using branch-and-check. SN Oper. Res. Forum 1(3), 22 (2020)
Liffiton, M.H., Malik, A.: Enumerating infeasibility: finding multiple MUSes quickly. In: Gomes, C., Sellmann, M. (eds.) Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems. LNCS, vol. 7874, pp. 160–175. Springer, Heidelberg (2013). https://doi.org/10.1007/978-3-642-38171-3_11
Paulus, M.B., Zarpellon, G., Krause, A., Charlin, L., Maddison, C.: Learning to cut by looking ahead: cutting plane selection via imitation learning. In: Proceedings of the 39th International Conference on Machine Learning, pp. 17584–17600. PMLR (2022)
Riedler, M., Raidl, G.R.: Solving a selective dial-a-ride problem with logic-based benders decomposition. Comput. Oper. Res. 96, 30–54 (2018)
Saken, A., Karlsson, E., Maher, S.J., Rönnberg, E.: Computational evaluation of cut-strengthening techniques in logic-based benders’ decomposition. Oper. Res. Forum 4, 62 (2023)
Varga, J., Raidl, G.R., Limmer, S.: Computational methods for scheduling the charging and assignment of an on-site shared electric vehicle fleet. IEEE Access 10, 105786–105806 (2022)
Vaswani, A., et al.: Attention is all you need. In: Advances in Neural Information Processing Systems, vol. 30. Curran Associates, Inc. (2017)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2024 The Author(s), under exclusive license to Springer Nature Switzerland AG
About this paper
Cite this paper
Varga, J., Karlsson, E., Raidl, G.R., Rönnberg, E., Lindsten, F., Rodemann, T. (2024). Speeding Up Logic-Based Benders Decomposition by Strengthening Cuts with Graph Neural Networks. In: Nicosia, G., Ojha, V., La Malfa, E., La Malfa, G., Pardalos, P.M., Umeton, R. (eds) Machine Learning, Optimization, and Data Science. LOD 2023. Lecture Notes in Computer Science, vol 14505. Springer, Cham. https://doi.org/10.1007/978-3-031-53969-5_3
Download citation
DOI: https://doi.org/10.1007/978-3-031-53969-5_3
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-031-53968-8
Online ISBN: 978-3-031-53969-5
eBook Packages: Computer ScienceComputer Science (R0)