Document Open Access Logo

RPID: Rust Programmable Interface for Domain-Independent Dynamic Programming

Authors Ryo Kuroiwa , J. Christopher Beck

PDF HTML 5

Files

Thumbnail PDF
PDF
LIPIcs.CP.2025.23.pdf
  • Filesize: 0.98 MB
  • 21 pages
HTML5 Logo HTML (experimental)
LIPIcs.CP.2025.23.html

Document Identifiers

Subject Classification

ACM Subject Classification
  • Theory of computation → Dynamic programming
Keywords
  • Decision Diagrams & Dynamic Programming
  • Modelling & Modelling Languages

Metrics

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

Abstract

In domain-independent dynamic programming (DIDP), a problem is formulated as a dynamic programming (DP) model and then solved by a general-purpose solver. In the existing software for DIDP, a model is defined using expressions composed of a predefined set of operations. In this paper, we propose the Rust Programmable Interface for DIDP (RPID), new software for DIDP, where a model is defined by Rust functions. We discuss the design of RPID and compare it with existing DP-based frameworks, including decision diagram-based (DD-based) solvers. In our experiments, RPID is up to hundreds of times faster than the existing DIDP implementation with the same models. In addition, new DIDP models, enabled by the flexibility of RPID, outperform existing models in multiple problem classes. We also show that the relative performance of RPID and existing DD-based solvers depends on problem class with, so far, no clear dominant solver technology.

Cite As Get BibTex

Ryo Kuroiwa and J. Christopher Beck. RPID: Rust Programmable Interface for Domain-Independent Dynamic Programming. In 31st International Conference on Principles and Practice of Constraint Programming (CP 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 340, pp. 23:1-23:21, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025) https://doi.org/10.4230/LIPIcs.CP.2025.23

Author Details

Ryo Kuroiwa
  • National Institute of Informatics, Tokyo, Japan
  • The Graduate University of Advanced Studies, SOKENDAI, Tokyo, Japan
J. Christopher Beck
  • Department of Mechanical and Industrial Engineering, University of Toronto, Canada

Funding

SciNet is funded by ISED Canada; the Digital Research Alliance of Canada; Ontario Research Fund:RE; and the University of Toronto.
  • Beck, J. Christopher: This work is supported by the Natural Sciences and Engineering Research Council of Canada.

Acknowledgements

Computations were performed on the Niagara supercomputer at the SciNet HPC Consortium. SciNet is funded by ISED Canada; the Digital Research Alliance of Canada; Ontario Research Fund:RE; and the University of Toronto.

Supplementary Materials

References

  1. Richard Bellman. Dynamic Programming. Princeton University Press, 1957. Google Scholar
  2. 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, 2016. URL: https://doi.org/10.1287/ijoc.2015.0648.
  3. Vianney Coppé, Xavier Gillard, and Pierre Schaus. Modeling and exploiting dominance rules for discrete optimization with decision diagrams. In Integration of Constraint Programming, Artificial Intelligence, and Operations Research - 21st International Conference, CPAIOR 2024. Springer Nature Switzerland, 2024. URL: https://doi.org/10.1007/978-3-031-60597-0_15.
  4. George B. Dantzig. Discrete-variable extremum problems. Operations Research, 5(2):266-277, 1957. URL: https://doi.org/10.1287/opre.5.2.266.
  5. 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.
  6. 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. AAAI Press, 2005. URL: http://www.aaai.org/Library/AAAI/2005/aaai05-216.php.
  7. Xavier Gillard, Vianney Coppé, Pierre Schaus, and André Augusto Cire. Improving the filtering of branch-and-bound MDD solver. In Integration of Constraint Programming, Artificial Intelligence, and Operations Research - 18th International Conference, CPAIOR 2021, pages 231-247. Springer International Publishing, 2021. URL: https://doi.org/10.1007/978-3-030-78230-6_15.
  8. 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. International Joint Conferences on Artificial Intelligence Organization, 2020. Demos. URL: https://doi.org/10.24963/ijcai.2020/757.
  9. 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.
  10. Michael Held and Richard M. Karp. The traveling-salesman problem and minimum spanning trees. Operations Research, 18(6):1138-1162, 1970. URL: https://doi.org/10.1287/opre.18.6.1138.
  11. John N. Hooker. Decision diagrams and dynamic programming. In Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems - 10th International Conference, CPAIOR 2013, pages 94-110. Springer Berlin Heidelberg, 2013. URL: https://doi.org/10.1007/978-3-642-38171-3_7.
  12. Ryo Kuroiwa. DIDP Rust Models. Software, (visited on 2025-07-28). URL: https://github.com/Kurorororo/didp-rust-models
    Software Heritage Logo archived version
    full metadata available at: https://doi.org/10.4230/artifacts.24206
  13. Ryo Kuroiwa and J. Christopher Beck. RPID. Software, version 0.1.0., (visited on 2025-07-28). URL: https://github.com/domain-independent-dp/rpid
    Software Heritage Logo archived version
    full metadata available at: https://doi.org/10.4230/artifacts.24205
  14. 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), pages 236-244. AAAI Press, 2023. URL: https://doi.org/10.1609/icaps.v33i1.27200.
  15. 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), volume 280 of Leibniz International Proceedings in Informatics (LIPIcs), pages 23:1-23:22. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023. URL: https://doi.org/10.4230/LIPIcs.CP.2023.23.
  16. 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), pages 245-253. AAAI Press, 2023. URL: https://doi.org/10.1609/icaps.v33i1.27201.
  17. Ryo Kuroiwa and J. Christopher Beck. Domain-independent dynamic programming, 2025. arXiv:2401.13883. URL: https://doi.org/10.48550/arXiv.2401.13883.
  18. Laurent Michel and Willem-Jan van Hoeve. CODD: A decision diagram-based solver for combinatorial optimization. In ECAI 2024 - 27th European Conference on Artificial Intelligence, volume 392 of Frontiers in Artificial Intelligence and Applications, pages 4240-4247. IOS Press, 2024. URL: https://doi.org/10.3233/FAIA240997.
  19. Ole Tange. GNU parallel - The command-line power tool. ;login: The USENIX Magazine, 36:42-47, 2011. URL: https://www.usenix.org/publications/login/february-2011-volume-36-number-1/gnu-parallel-command-line-power-tool.
  20. Mark Wallace. Languages versus packages for constraint problem solving. In Principles and Practice of Constraint Programming – CP 2003, pages 37-52. Springer Berlin Heidelberg, 2003. URL: https://doi.org/10.1007/978-3-540-45193-8_3.
  21. Weixiong Zhang. Complete anytime beam search. In Proceedings of the 15th National Conference on Artificial Intelligence (AAAI), pages 425-430. AAAI Press, 1998. URL: http://www.aaai.org/Library/AAAI/1998/aaai98-060.php.
Any Issues?
X

Feedback on the Current Page

CAPTCHA

Thanks for your feedback!

Feedback submitted to Dagstuhl Publishing

Could not send message

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