IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v312y2024i3p840-854.html
   My bibliography  Save this article

Combining optimisation and simulation using logic-based Benders decomposition

Author

Listed:
  • Forbes, M.A.
  • Harris, M.G.
  • Jansen, H.M.
  • van der Schoot, F.A.
  • Taimre, T.

Abstract

Operations Research practitioners often want to model complicated functions that are difficult to encode in their underlying optimisation framework. A common approach is to solve an approximate model, and then use a simulation to evaluate the true objective value of one or more solutions. We propose a new approach to integrating simulation into the optimisation model itself. The idea is to run the simulation at each incumbent solution to a master problem. The simulation results are then used to guide the trajectory of the optimisation model itself using logic-based Benders cuts. We test the approach on a class of stochastic resource allocation problems with monotonic performance measures. We derive strong novel Benders cuts that are provably valid for all problems of the given form. We consider two concrete examples: a nursing home shift scheduling problem, and an airport check in counter allocation problem. While previous papers on these applications could only approximately solve realistic instances, we are able to solve them exactly within a reasonable amount of time. Moreover, while those papers account for the inherent variance of the problem by including estimates of the underlying random variables as model parameters, we are able to compute sample-average approximations to optimality with up to 100 scenarios.

Suggested Citation

  • Forbes, M.A. & Harris, M.G. & Jansen, H.M. & van der Schoot, F.A. & Taimre, T., 2024. "Combining optimisation and simulation using logic-based Benders decomposition," European Journal of Operational Research, Elsevier, vol. 312(3), pages 840-854.
  • Handle: RePEc:eee:ejores:v:312:y:2024:i:3:p:840-854
    DOI: 10.1016/j.ejor.2023.07.032
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S037722172300591X
    Download Restriction: Full text for ScienceDirect subscribers only

    File URL: https://libkey.io/10.1016/j.ejor.2023.07.032?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Özgün Elçi & John Hooker, 2022. "Stochastic Planning and Scheduling with Logic-Based Benders Decomposition," INFORMS Journal on Computing, INFORMS, vol. 34(5), pages 2428-2442, September.
    2. Lalita, T.R. & Manna, D.K. & Murthy, G.S.R., 2020. "Mathematical formulations for large scale check-in counter allocation problem," Journal of Air Transport Management, Elsevier, vol. 85(C).
    3. John N. Hooker, 2019. "Logic-Based Benders Decomposition for Large-Scale Optimization," Springer Optimization and Its Applications, in: Jesús M. Velásquez-Bermúdez & Marzieh Khakifirooz & Mahdi Fathi (ed.), Large Scale Optimization in Supply Chains and Smart Manufacturing, pages 1-26, Springer.
    4. René Bekker & Dennis Moeke & Bas Schmidt, 2019. "Keeping pace with the ebbs and flows in daily nursing home operations," Health Care Management Science, Springer, vol. 22(2), pages 350-363, June.
    5. Dennis Moeke & Ger Koole & Lineke Verkooijen, 2014. "Scale and skill-mix efficiencies in nursing home staffing: inside the black box," Health Systems, Taylor & Francis Journals, vol. 3(1), pages 18-28, February.
    6. van Dijk, Nico M. & van der Sluis, Erik, 2006. "Check-in computation and optimization by simulation and IP in combination," European Journal of Operational Research, Elsevier, vol. 171(3), pages 1152-1168, June.
    7. Cheng Guo & Merve Bodur & Dionne M. Aleman & David R. Urbach, 2021. "Logic-Based Benders Decomposition and Binary Decision Diagram Based Approaches for Stochastic Distributed Operating Room Scheduling," INFORMS Journal on Computing, INFORMS, vol. 33(4), pages 1551-1569, October.
    8. Matteo Fischetti & Ivana Ljubić & Michele Monaci & Markus Sinnl, 2019. "Interdiction Games and Monotonicity, with Application to Knapsack Problems," INFORMS Journal on Computing, INFORMS, vol. 31(2), pages 390-410, April.
    9. Pearce, Robin H. & Forbes, Michael, 2018. "Disaggregated Benders decomposition and branch-and-cut for solving the budget-constrained dynamic uncapacitated facility location and network design problem," European Journal of Operational Research, Elsevier, vol. 270(1), pages 78-88.
    10. Rahmaniani, Ragheb & Crainic, Teodor Gabriel & Gendreau, Michel & Rei, Walter, 2017. "The Benders decomposition algorithm: A literature review," European Journal of Operational Research, Elsevier, vol. 259(3), pages 801-817.
    11. repec:inm:orijoo:v:4:y:2022:i:1:p:1-28 is not listed on IDEAS
    12. Mohammad Fazel-Zarandi & Oded Berman & J. Beck, 2013. "Solving a stochastic facility location/fleet management problem with logic-based Benders' decomposition," IISE Transactions, Taylor & Francis Journals, vol. 45(8), pages 896-911.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Guo, Penghui & Zhu, Jianjun, 2023. "Capacity reservation for humanitarian relief: A logic-based Benders decomposition method with subgradient cut," European Journal of Operational Research, Elsevier, vol. 311(3), pages 942-970.
    2. Lin, Yun Hui & Wang, Yuan & Lee, Loo Hay & Chew, Ek Peng, 2022. "Omnichannel facility location and fulfillment optimization," Transportation Research Part B: Methodological, Elsevier, vol. 163(C), pages 187-209.
    3. Ying Liu & Xiuqing Yang & Yong Xiang & Yi Chen & Gang Mao & Xinzhi Zhou, 2022. "Allocation and optimization of shared self-service check-in system based on integer programming model," Journal of Combinatorial Optimization, Springer, vol. 44(1), pages 532-556, August.
    4. Özgün Elçi & John Hooker, 2022. "Stochastic Planning and Scheduling with Logic-Based Benders Decomposition," INFORMS Journal on Computing, INFORMS, vol. 34(5), pages 2428-2442, September.
    5. Aigerim Saken & Emil Karlsson & Stephen J. Maher & Elina Rönnberg, 2023. "Computational Evaluation of Cut-Strengthening Techniques in Logic-Based Benders’ Decomposition," SN Operations Research Forum, Springer, vol. 4(3), pages 1-53, September.
    6. Zheng, Xiaojin & Yin, Meixia & Zhang, Yanxia, 2019. "Integrated optimization of location, inventory and routing in supply chain network design," Transportation Research Part B: Methodological, Elsevier, vol. 121(C), pages 1-20.
    7. Cerulli, Martina & Serra, Domenico & Sorgente, Carmine & Archetti, Claudia & Ljubić, Ivana, 2023. "Mathematical programming formulations for the Collapsed k-Core Problem," European Journal of Operational Research, Elsevier, vol. 311(1), pages 56-72.
    8. Beck, Yasmine & Ljubić, Ivana & Schmidt, Martin, 2023. "A survey on bilevel optimization under uncertainty," European Journal of Operational Research, Elsevier, vol. 311(2), pages 401-426.
    9. Aliakbari Sani, Sajad & Bahn, Olivier & Delage, Erick, 2022. "Affine decision rule approximation to address demand response uncertainty in smart Grids’ capacity planning," European Journal of Operational Research, Elsevier, vol. 303(1), pages 438-455.
    10. Maher, Stephen J., 2021. "Implementing the branch-and-cut approach for a general purpose Benders’ decomposition framework," European Journal of Operational Research, Elsevier, vol. 290(2), pages 479-498.
    11. William B. Haskell & Wenjie Huang & Huifu Xu, 2018. "Preference Elicitation and Robust Optimization with Multi-Attribute Quasi-Concave Choice Functions," Papers 1805.06632, arXiv.org.
    12. Clavijo López, Christian & Crama, Yves & Pironet, Thierry & Semet, Frédéric, 2024. "Multi-period distribution networks with purchase commitment contracts," European Journal of Operational Research, Elsevier, vol. 312(2), pages 556-572.
    13. Camilo Ortiz-Astorquiza & Ivan Contreras & Gilbert Laporte, 2019. "An Exact Algorithm for Multilevel Uncapacitated Facility Location," Transportation Science, INFORMS, vol. 53(4), pages 1085-1106, July.
    14. Zhu, Xuedong & Son, Junbo & Zhang, Xi & Wu, Jianguo, 2023. "Constraint programming and logic-based Benders decomposition for the integrated process planning and scheduling problem," Omega, Elsevier, vol. 117(C).
    15. Thomas Kleinert & Martin Schmidt, 2023. "Why there is no need to use a big-M in linear bilevel optimization: a computational study of two ready-to-use approaches," Computational Management Science, Springer, vol. 20(1), pages 1-12, December.
    16. Yang, Yongjian & Yin, Yunqiang & Wang, Dujuan & Ignatius, Joshua & Cheng, T.C.E. & Dhamotharan, Lalitha, 2023. "Distributionally robust multi-period location-allocation with multiple resources and capacity levels in humanitarian logistics," European Journal of Operational Research, Elsevier, vol. 305(3), pages 1042-1062.
    17. Moreno, Alfredo & Munari, Pedro & Alem, Douglas, 2019. "A branch-and-Benders-cut algorithm for the Crew Scheduling and Routing Problem in road restoration," European Journal of Operational Research, Elsevier, vol. 275(1), pages 16-34.
    18. Liu, Shaonan & Kong, Nan & Parikh, Pratik & Wang, Mingzheng, 2023. "Optimal trauma care network redesign with government subsidy: A bilevel integer programming approach," Omega, Elsevier, vol. 119(C).
    19. Belieres, Simon & Hewitt, Mike & Jozefowiez, Nicolas & Semet, Frédéric & Van Woensel, Tom, 2020. "A Benders decomposition-based approach for logistics service network design," European Journal of Operational Research, Elsevier, vol. 286(2), pages 523-537.
    20. Hassan Zohali & Bahman Naderi & Vahid Roshanaei, 2022. "Solving the Type-2 Assembly Line Balancing with Setups Using Logic-Based Benders Decomposition," INFORMS Journal on Computing, INFORMS, vol. 34(1), pages 315-332, January.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:ejores:v:312:y:2024:i:3:p:840-854. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.