Document Open Access Logo

GRID: Graph-Based Modelling Interface for Domain-Independent Dynamic Programming

Authors Fabio Giordana , Zeynep Kiziltan , Ryo Kuroiwa

PDF

File

Thumbnail PDF
PDF
LIPIcs.CP.2026.26.pdf
  • Filesize: 1.39 MB
  • 23 pages

Document Identifiers

Subject Classification

ACM Subject Classification
  • Theory of computation → Dynamic programming
  • Computing methodologies → Modeling methodologies
  • Mathematics of computing → Combinatorial optimization
Keywords
  • Modelling & Modelling Languages
  • Dynamic Programming

Metrics

Abstract

Domain-Independent Dynamic Programming (DIDP) is a general framework for solving combinatorial optimization problems using Dynamic Programming (DP), where search is separated from the problem specification. However, modelling directly in DIDP requires defining state variables, transitions, and dominance relations, which can be complex and error-prone. We introduce GRID, a modelling interface that enables high-level DP-oriented specifications. Users describe entities, relations, and resource attributes over a graph-based structure, from which GRID automatically compiles a DIDP model by deriving the components required by a DIDP solver. Common modelling elements are supported with built-in semantics, while additional constraints can be specified through user-defined variables and expressions. We use vehicle routing problems as a case study to present GRID and evaluate it on three variants: CVRP, PDPTW, and ECVRP. Results show that compilation overhead from GRID to DIDP is small and that generated models remain competitive with manually designed DIDP models while outperforming state-of-the-art CP and mixed-integer programming approaches.

Cite As Get BibTex

Fabio Giordana, Zeynep Kiziltan, and Ryo Kuroiwa. GRID: Graph-Based Modelling Interface for Domain-Independent Dynamic Programming. In 32nd International Conference on Principles and Practice of Constraint Programming (CP 2026). Leibniz International Proceedings in Informatics (LIPIcs), Volume 379, pp. 26:1-26:23, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2026) https://doi.org/10.4230/LIPIcs.CP.2026.26

Author Details

Fabio Giordana
  • Department of Computer Science and Engineering, University of Bologna, Bologna, Italy
Zeynep Kiziltan
  • Department of Computer Science and Engineering, University of Bologna, Bologna, Italy
Ryo Kuroiwa
  • Principles of Informatics Division, National Institute of Informatics, Tokyo, Japan
  • The Graduate University for Advanced Studies, SOKENDAI, Kanagawa, Japan

Funding

This work was supported by the NII-UniBo MoU Grant funded by NII.
  • Kuroiwa, Ryo: JSPS KAKENHI grant number JP25K24378

Supplementary Materials

References

  1. C. Archetti, L.C. Coelho, M.G. Speranza, and P. Vansteenwegen. Beyond fifty years of vehicle routing: Insights into the history and the future. Eur. J. Oper. Res., 330(2):355-372, 2026. URL: https://doi.org/10.1016/j.ejor.2025.06.014.
  2. J. Beck, Patrick Prosser, and E. Selensky. Vehicle routing and job shop scheduling: What’s the difference? In ICAPS, pages 267-276, 2003. Google Scholar
  3. Augustin Delecluse, Pierre Schaus, and Pascal Van Hentenryck. Sequence variables: A constraint programming computational domain for routing and sequencing. CoRR, abs/2510.09373, 2025. URL: https://doi.org/10.48550/arXiv.2510.09373.
  4. Augustin Delecluse, Pierre Schaus, and Pascal Van Hentenryck. Sequence variables for routing problems. In CP, volume 235, pages 19:1-19:17, 2022. URL: https://doi.org/10.4230/LIPIcs.CP.2022.19.
  5. Frédéric Didier, Laurent Perron, Sarah Mohajeri, Steven Agostino Gay, Thibaut Cuvelier, and Vincent Furnon. OR-Tools' Vehicle Routing Solver: a generic constraint-programming solver with heuristic search for routing problems. In ROADEF, 2023. Google Scholar
  6. Yvan Dumas, Jacques Desrosiers, and François Soumis. The pickup and delivery problem with time windows. Eur. J. Oper. Res., 54(1):7-22, 1991. URL: https://doi.org/10.1016/0377-2217(91)90319-Q.
  7. Najib Errami, Eduardo Queiroga, Ruslan Sadykov, and Eduardo Uchoa. VRPSolverEasy: A Python library for the exact solution of a rich vehicle routing problem. INFORMS J. Comput., 36(4):956-965, 2024. URL: https://doi.org/10.1287/ijoc.2023.0103.
  8. Alan M. Frisch, Warwick Harvey, Chris Jefferson, Bernadette Martínez-Hernández, and Ian Miguel. Essence: A constraint language for specifying combinatorial problems. Constraints, 13(3):268-306, 2008. URL: https://doi.org/10.1007/s10601-008-9047-y.
  9. Maria Gabriela S. Furtado, Pedro Munari, and Reinaldo Morabito. Pickup and delivery problem with time windows: A new compact two-index formulation. Oper. Res. Lett., 45(4):334-341, 2017. URL: https://doi.org/10.1016/j.orl.2017.04.013.
  10. S.L. Gadegaard and J. Lysgaard. A symmetry-free polynomial formulation of the capacitated vehicle routing problem. Discrete Appl. Math., 296:179-192, 2021. URL: https://doi.org/10.1016/j.dam.2020.02.012.
  11. Carmen Gervet. Interval propagation to reason about sets: Definition and implementation of a practical language. Constraints, 1(3):191-244, 1997. URL: https://doi.org/10.1007/BF00137870.
  12. J. Gromicho, J.J. van Hoorn, A.L. Kok, and J.M.J. Schutten. Restricted dynamic programming: A flexible framework for solving realistic VRPs. Comput. Oper. Res., 39(5):902-909, 2012. URL: https://doi.org/10.1016/j.cor.2011.07.002.
  13. Tias Guns. Increasing modeling language convenience with a universal n-dimensional array, CPpy as python-embedded example. In ModRef, 2019. Google Scholar
  14. Gurobi Optimization, LLC. Gurobi Optimizer Reference Manual, 2026. URL: https://www.gurobi.com.
  15. Philip Kilby and Paul Shaw. Vehicle routing. In Handbook of Constraint Programming, volume 2 of Foundations of Artificial Intelligence, pages 801-836. Elsevier, 2006. URL: https://doi.org/10.1016/S1574-6526(06)80027-1.
  16. Patrick S. Klein and Maximilian Schiffer. RoutingBlocks: An open-source Python package for vehicle routing problems with intermediate stops. INFORMS J. Comput., 36(4):966-973, 2024. URL: https://doi.org/10.1287/IJOC.2023.0104.
  17. Nicholas D. Kullman, Jorge E. Mendoza, and Ted K. Ralphs. Introduction to the special section on software tools for vehicle routing. INFORMS J. Comput., 36(4):941-942, 2024. URL: https://doi.org/10.1287/ijoc.2024.ed.v36.n4.2.
  18. Ryo Kuroiwa and J. Christopher Beck. Large neighborhood beam search for domain-independent dynamic programming. In CP, volume 280, pages 23:1-23:22, 2023. URL: https://doi.org/10.4230/LIPIcs.CP.2023.23.
  19. Ryo Kuroiwa and J. Christopher Beck. Domain-independent dynamic programming. Artif. Intell., 354:104506, 2026. URL: https://doi.org/10.1016/j.artint.2026.104506.
  20. 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.
  21. Leon Lan and Joost Berkhout. PyJobShop: Solving scheduling problems with constraint programming in Python. CoRR, abs/2502.13483, 2025. URL: https://doi.org/10.48550/arXiv.2502.13483.
  22. Christophe Lecoutre and Nicolas Szczepanski. PyCSP3: Modeling combinatorial constrained problems in Python. CoRR, abs/2009.00326, 2020. URL: https://arxiv.org/abs/2009.00326.
  23. H. Li and A. Lim. A metaheuristic for the pickup and delivery problem with time windows. In ICTAI, pages 160-167, 2001. URL: https://doi.org/10.1109/ICTAI.2001.974461.
  24. Shu Lin, Na Meng, and Wenxin Li. Optimizing constraint solving via dynamic programming. In IJCAI, pages 1146-1154, 2019. URL: https://doi.org/10.24963/ijcai.2019/160.
  25. Shu Lin, Na Meng, and Wenxin Li. Generating efficient solvers from constraint models. In ESEC/FSE, pages 956-967, 2021. URL: https://doi.org/10.1145/3468264.3468566.
  26. Michalis Mavrovouniotis, Charalambos Menelaou, Stelios Timotheou, Georgios Ellinas, Christoforos Panayiotou, and Marios M. Polycarpou. A benchmark test suite for the electric capacitated vehicle routing problem. In CEC, pages 1-8, 2020. URL: https://doi.org/10.1109/CEC48606.2020.9185753.
  27. Romain Montagné, David Torres Sanchez, and Halvard Olsen Storbugt. VRPy: A Python package for solving a range of vehicle routing problems with a column generation approach. J. Open Source Softw., 5(55):2408, 2020. URL: https://doi.org/10.21105/JOSS.02408.
  28. Nicholas Nethercote, Peter J. Stuckey, Ralph Becket, Sebastian Brand, Gregory J. Duck, and Guido Tack. MiniZinc: Towards a standard CP modelling language. In CP, volume 4741, pages 529-543. Springer, 2007. URL: https://doi.org/10.1007/978-3-540-74970-7_38.
  29. Laurent Perron, Frédéric Didier, and Steven Gay. The CP-SAT-LP solver. In CP, volume 280, pages 3:1-3:2, 2023. URL: https://doi.org/10.4230/LIPIcs.CP.2023.3.
  30. Artur Pessoa, Ruslan Sadykov, Eduardo Uchoa, and François Vanderbeck. A generic exact solver for vehicle routing and related problems. Math. Prog., 183(1):483-523, 2020. URL: https://doi.org/10.1007/s10107-020-01523-z.
  31. Pierre Schaus, Guillaume Derval, Augustin Delecluse, Laurent Michel, and Pascal Van Hentenryck. MaxiCP: A constraint programming solver for scheduling and vehicle routing, 2024. URL: https://github.com/aia-uclouvain/maxicp.
  32. Paul Shaw. Using constraint programming and local search methods to solve vehicle routing problems. In CP, pages 417-431, 1998. URL: https://doi.org/10.1007/3-540-49481-2_30.
  33. Eduardo Uchoa, Diego Pecin, Artur Pessoa, Marcus Poggi, Thibaut Vidal, and Anand Subramanian. New benchmark instances for the Capacitated Vehicle Routing Problem. Eur. J. Oper. Res., 257(3):845-858, 2017. URL: https://doi.org/10.1016/j.ejor.2016.08.012.
  34. Willem-Jan van Hoeve and Irit Katriel. Global constraints. In Handbook of Constraint Programming, volume 2 of Foundations of Artificial Intelligence, pages 169-208. Elsevier, 2006. URL: https://doi.org/10.1016/S1574-6526(06)80010-6.
  35. Christos Voudouris and Edward Tsang. Guided local search and its application to the traveling salesman problem. Eur. J. Oper. Res., 113(2):469-499, 1999. URL: https://doi.org/10.1016/S0377-2217(98)00099-X.
  36. Niels A. Wouda, Leon Lan, and Wouter Kool. PyVRP: A high-performance VRP solver package. INFORMS J. Comput., 36(4):943-955, 2024. URL: https://doi.org/10.1287/ijoc.2023.0055.
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-2026 Schloss Dagstuhl – LZI GmbH Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact