Document Open Access Logo

Large Neighborhood Beam Search for Domain-Independent Dynamic Programming

Authors Ryo Kuroiwa , J. Christopher Beck

PDF

File

Thumbnail PDF
PDF
LIPIcs.CP.2023.23.pdf
  • Filesize: 1.5 MB
  • 22 pages

Document Identifiers

Subject Classification

ACM Subject Classification
  • Computing methodologies → Discrete space search
Keywords
  • Large Neighborhood Search
  • Dynamic Programming
  • State Space Search
  • Combinatorial Optimization

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
    0
    Metadata Views

Abstract

Large neighborhood search (LNS) is an algorithmic framework that removes a part of a solution and performs search in the induced search space to find a better solution. While LNS shows strong performance in constraint programming, little work has combined LNS with state space search. We propose large neighborhood beam search (LNBS), a combination of LNS and state space search. Given a solution path, LNBS removes a partial path between two states and then performs beam search to find a better partial path. We apply LNBS to domain-independent dynamic programming (DIDP), a recently proposed generic framework for combinatorial optimization based on dynamic programming. We empirically show that LNBS finds better quality solutions than a state-of-the-art DIDP solver in five out of nine benchmark problem types with a total of 8570 problem instances. In particular, LNBS shows a significant improvement over the existing state-of-the-art DIDP solver in routing and scheduling problems.

Cite As Get BibTex

Ryo Kuroiwa and J. Christopher Beck. Large Neighborhood Beam Search for Domain-Independent Dynamic Programming. In 29th International Conference on Principles and Practice of Constraint Programming (CP 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 280, pp. 23:1-23:22, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023) https://doi.org/10.4230/LIPIcs.CP.2023.23

Author Details

Ryo Kuroiwa
  • Department of Mechanical and Industrial Engineering, University of Toronto, Canada
J. Christopher Beck
  • Department of Mechanical and Industrial Engineering, University of Toronto, Canada

Funding

This research is supported by the Natural Sciences and Engineering Research Council of Canada.

Supplementary Materials

References

  1. H. R. Andersen, T. Hadzic, J. N. Hooker, and P. Tiedemann. A constraint store based on multivalued decision diagrams. In Principles and Practice of Constraint Programming - CP 2007, pages 118-132, 2007. URL: https://doi.org/10.1007/978-3-540-74970-7_11.
  2. Norbert Ascheuer. Hamiltonian path problems in the on-line optimization of flexible manufacturing systems. PhD thesis, Technische Universität Berlin, 1995. Google Scholar
  3. Norbert Ascheuer, Michael Jünger, and Gerhard Reinelt. A branch & cut algorithm for the asymmetric traveling salesman problem with precedence constraint. Computational Optimization and Applications, 17:25-42, 2000. URL: https://doi.org/10.1023/A:1008779125567.
  4. David Bergman, Andre A. Cire, Willem-Jan van Hoeve, and J. N. Hooker. Optimization bounds from binary decision diagrams. INFORMS Journal on Computing, 26(2):253-268, 2014. URL: https://doi.org/10.1287/ijoc.2013.0561.
  5. David Bergman, Andre A. Cire, Willem Jan Van Hoeve, and J. N. Hooker. Discrete optimization with decision diagrams. INFORMS Journal on Computing, 28(1):47-66, December 2016. URL: https://doi.org/10.1287/ijoc.2015.0648.
  6. David Bergman, Andre A. Cire, Willem-Jan van Hoeve, and Tallys Yunes. Bdd-based heuristics for binary optimization. Journal of Heuristics, 20(2):211-234, 2014. URL: https://doi.org/10.1007/s10732-014-9238-1.
  7. Timo Berthold. Measuring the impact of primal heuristics. Operations Research Letters, 41:611-614, 2013. URL: https://doi.org/10.1016/j.orl.2013.08.007.
  8. Marco Antonio Moreira De Carvalho and Nei Yoshihiro Soma. A breadth-first search applied to the minimization of the open stacks. Journal of the Operational Research Society, 66:936-946, June 2015. URL: https://doi.org/10.1057/jors.2014.60.
  9. Margarita P. Castro, Andre A. Cire, and J. Christopher Beck. Decision diagrams for discrete optimization: A survey of recent advances. INFORMS Journal on Computing, 34(4):2271-2295, 2022. URL: https://doi.org/10.1287/ijoc.2022.1170.
  10. Yvan Dumas, Jacques Desrosiers, Eric Gelinas, and Marius M Solomon. An optimal algorithm for the traveling salesman problem with time windows. Operations Research, 43(2):367-371, 1995. URL: https://doi.org/10.1287/opre.43.2.367.
  11. Stefan Edelkamp, Shahid Jabbar, and Alberto Lluch Lafuente. Cost-algebraic heuristic search. In Proceedings of the 20th National Conference on Artificial Intelligence (AAAI), pages 1362-1367, 2005. Google Scholar
  12. Rafael de Magalhães Dias Frinhani, Marco Antonio Moreira de Carvalho, and Nei Yoshihiro Soma. A pagerank-based heuristic for the minimization of open stacks problem. PLoS ONE, 13(8):1-24, 2018. URL: https://doi.org/10.1371/journal.pone.0203076.
  13. David A Furcy. ITSA*: Iterative tunneling search with A*. In Proceedings of AAAI Workshop on Heuristic Search, Memory-Based Heuristics and Their Applications, pages 21-26, 2006. Google Scholar
  14. Maria Garcia de la Banda and Peter J. Stuckey. Dynamic programming to minimize the maximum number of open stacks. INFORMS Journal on Computing, 19(4):607-617, 2007. URL: https://doi.org/10.1287/ijoc.1060.0205.
  15. Maria Garcia de la Banda, Peter J. Stuckey, and Geoffrey Chu. Solving talent scheduling with dynamic programming. INFORMS Journal on Computing, 23(1):120-137, 2011. URL: https://doi.org/10.1287/ijoc.1090.0378.
  16. Michel Gendreau, Alain Hertz, Gilbert Laporte, and Mihnea Stan. A generalized insertion heuristic for the traveling salesman problem with time windows. Operations Research, 46(3):330-346, 1998. URL: https://doi.org/10.1287/opre.46.3.330.
  17. Rebecca Gentzel, Laurent Michel, and W.-J. van Hoeve. HADDOCK: A language and architecture for decision diagram compilation. In Helmut Simonis, editor, Principles and Practice of Constraint Programming - CP 2020, pages 531-547, 2020. URL: https://doi.org/10.1007/978-3-030-58475-7_31.
  18. Xavier Gillard and Pierre Schaus. Large neighborhood search with decision diagrams. In Proceedings of the 21st International Joint Conference on Artificial Intelligence, IJCAI-22, pages 4754-4760, 2022. URL: https://doi.org/10.24963/ijcai.2022/659.
  19. Xavier Gillard, Pierre Schaus, and Vianney Coppé. Ddo, a generic and efficient framework for mdd-based optimization. In Proceedings of the 29th International Joint Conference on Artificial Intelligence, IJCAI-20, pages 5243-5245, 2020. URL: https://doi.org/10.24963/ijcai.2020/757.
  20. Peter E. Hart, Nils J. Nilsson, and Bertram Raphael. A formal basis for the heuristic determination of minimum cost paths. IEEE Transactions on Systems Science and Cybernetics, 4(2):100-107, 1968. URL: https://doi.org/10.1109/TSSC.1968.300136.
  21. Hipólito Hernández-Pérez and Juan José Salazar-González. The multi-commodity one-to-one pickup-and-delivery traveling salesman problem. European Journal of Operational Research, 196:987-995, August 2009. URL: https://doi.org/10.1016/j.ejor.2008.05.009.
  22. Samid Hoda, Willem-Jan van Hoeve, and J. N. Hooker. A systematic approach to MDD-based constraint programming. In Principles and Practice of Constraint Programming - CP 2010, pages 266-280, 2010. Google Scholar
  23. John N. Hooker. Decision diagrams and dynamic programming. In Carla Gomes and Meinolf Sellmann, editors, Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, pages 94-110, 2013. Google Scholar
  24. Siddhartha Jain and Pascal Van Hentenryck. Large neighborhood search for dial-a-ride problems. In Principles and Practice of Constraint Programming - CP 2011, pages 400-413, 2011. Google Scholar
  25. Ryo Kuroiwa and J. Christopher Beck. Domain-independent dynamic programming: Generic state space search for combinatorial optimization. In Proceedings of the 33rd International Conference on Automated Planning and Scheduling (ICAPS), 2023. URL: https://doi.org/10.1609/icaps.v33i1.27200.
  26. Ryo Kuroiwa and J. Christopher Beck. Solving domain-independent dynamic programming problems with anytime heuristic search. In Proceedings of the 33rd International Conference on Automated Planning and Scheduling (ICAPS), 2023. URL: https://doi.org/10.1609/icaps.v33i1.27201.
  27. Philippe Laborie, Jérôme Rogerie, Paul Shaw, and Petr Vilím. IBM ILOG CP optimizer for scheduling. Constraints, 23(2):210-250, 2018. URL: https://doi.org/10.1007/s10601-018-9281-x.
  28. Shu Lin, Na Meng, and Wenxin Li. Optimizing constraint solving via dynamic programming. In Proceedings of the 28th International Joint Conference on Artificial Intelligence, IJCAI-19, pages 1146-1154, July 2019. URL: https://doi.org/10.24963/ijcai.2019/160.
  29. Michael Morin, Margarita P. Castro, Kyle E.C. Booth, Tony T. Tran, Chang Liu, and J. Christopher Beck. Intruder alert! Optimization models for solving the mobile robot graph-clear problem. Constraints, 23(3):335-354, 2018. URL: https://doi.org/10.1007/s10601-018-9288-3.
  30. Hootan Nakhost and Martin Müller. Action elimination and plan neighborhood graph search: Two algorithms for plan improvement. In Proceedings of the 20th International Conference on Automated Planning and Scheduling (ICAPS), pages 121-128, 2010. URL: https://doi.org/10.1609/icaps.v20i1.13402.
  31. Jeffrey W. Ohlmann and Barrett W. Thomas. A compressed-annealing heuristic for the traveling salesman problem with time windows. INFORMS Journal on Computing, 19(1):80-90, 2007. URL: https://doi.org/10.1287/ijoc.1050.0145.
  32. Daniel Ratner and Ira Pohl. Joint and LPA*: Combination of approximation and search. In Proceedings of the fifith National Conference on Artificial Intelligence (AAAI)., pages 173-177, 1986. URL: https://doi.org/10.5555/2887770.2887798.
  33. Isaac Rudich, Quentin Cappart, and Louis-Martin Rousseau. Peel-And-Bound: Generating Stronger Relaxed Bounds with Multivalued Decision Diagrams. In Principles and Practice of Constraint Programming - CP 2022, pages 35:1-35:20, 2022. URL: https://doi.org/10.4230/LIPIcs.CP.2022.35.
  34. Paul Shaw. Using constraint programming and local search methods to solve vehicle routing problems. In Principles and Practice of Constraint Programming - CP98, volume 1520, pages 417-431, 1998. URL: https://doi.org/10.1007/3-540-49481-2_30.
  35. Yingce Xia, Xu-Dong Zhang, Nenghai Yu, Geoffrey Holmes, and Yan Liu. Budgeted bandit problems with continuous random costs. In Proceedings of the Seventh Asian Conference on Machine Learning, pages 317-332, 2015. Google Scholar
  36. Weixiong Zhang. Complete anytime beam search. In Proceedings of the Fifteenth National/Tenth Conference on Artificial Intelligence/Innovative Applications of Artificial Intelligence (AAAI-98/IAAI-98), pages 425-430, 1998. Google Scholar
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2025 Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact