Document Open Access Logo

Sequence Variables for Routing Problems

Authors Augustin Delecluse , Pierre Schaus , Pascal Van Hentenryck

PDF
Thumbnail PDF

File

LIPIcs.CP.2022.19.pdf
  • Filesize: 0.82 MB
  • 17 pages

Document Identifiers

Author Details

Augustin Delecluse
  • TRAIL, ICTEAM, UCLouvain, Louvain-la-Neuve, Belgium
Pierre Schaus
  • ICTEAM, UCLouvain, Louvain-la-Neuve, Belgium
Pascal Van Hentenryck
  • Georgia Institute of Technology, Atlanta, GA, USA

Funding

  • Delecluse, Augustin: This work was supported by Service Public de Wallonie Recherche under grant n°2010235 – ARIAC by DIGITALWALLONIA4.A.

Cite As Get BibTex

Augustin Delecluse, Pierre Schaus, and Pascal Van Hentenryck. Sequence Variables for Routing Problems. In 28th International Conference on Principles and Practice of Constraint Programming (CP 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 235, pp. 19:1-19:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022) https://doi.org/10.4230/LIPIcs.CP.2022.19

Abstract

Constraint Programming (CP) is one of the most flexible approaches for modeling and solving vehicle routing problems (VRP). This paper proposes the sequence variable domain, that is inspired by the insertion graph introduced in [Bent and Van Hentenryck, 2004] and the subset bound domain for set variables. This domain representation, which targets VRP applications, allows for an efficient insertion-based search on a partial tour and the implementation of simple, yet efficient filtering algorithms for constraints that enforce time-windows on the visits and capacities on the vehicles. Experiment results demonstrate the efficiency and flexibility of this CP domain for solving some hard VRP problems, including the Dial-A-Ride, the Patient Transportation, and the asymmetric TSP with time windows.

Subject Classification

ACM Subject Classification
  • Theory of computation → Constraint and logic programming
Keywords
  • Constraint Programming
  • Dial-A-Ride
  • Patient Transportation
  • TSPTW
  • Vehicle Routing
  • Sequence Variables
  • Insertion Variables

Metrics

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

Supplementary Materials

References

  1. MiniCP Sequences - Anonymous GitHub, September 2021. [Online; accessed 26. Feb. 2022]. URL: https://anonymous.4open.science/r/minicp-sequences-5EE3/README.md.
  2. Norbert Ascheuer. Hamiltonian path problems in the on-line optimization of flexible manufacturing systems. Technical report, Konrad-Zuse-Zentrum für Informationstechnik Berlin, 1996. Google Scholar
  3. Bruno De Backer, Vincent Furnon, Paul Shaw, Philip Kilby, and Patrick Prosser. Solving vehicle routing problems using constraint programming and metaheuristics. Journal of heuristics, 6(4):501-523, 2000. Google Scholar
  4. Russell Bent and Pascal Van Hentenryck. A two-stage hybrid local search for the vehicle routing problem with time windows. Transportation Science, 38(4):515-530, 2004. Google Scholar
  5. Quentin Cappart, Charles Thomas, Pierre Schaus, and Louis-Martin Rousseau. A constraint programming approach for solving patient transportation problems. In John Hooker, editor, Principles and Practice of Constraint Programming, pages 490-506, Cham, 2018. Springer International Publishing. Google Scholar
  6. IBM Knowledge Center. Interval variable sequencing in CP Optimizer, March 2021. [Online; accessed 13. Jan. 2022]. URL: https://www.ibm.com/docs/en/icos/12.9.0?topic=concepts-interval-variable-sequencing-in-cp-optimizer.
  7. IBM Knowledge Center. Search API for scheduling in CP Optimizer, March 2021. [Online; accessed 13. Jan. 2022]. URL: https://www.ibm.com/docs/en/icos/12.9.0?topic=c-search-api-scheduling-in-cp-optimizer#85.
  8. Jean-François Cordeau and Gilbert Laporte. The dial-a-ride problem: models and algorithms. Annals of operations research, 153(1):29-46, 2007. Google Scholar
  9. Jean-François Cordeau and Gilbert Laporte. A tabu search heuristic for the static multi-vehicle dial-a-ride problem. Transportation Research Part B: Methodological, 37:579-594, July 2003. URL: https://doi.org/10.1016/S0191-2615(02)00045-0.
  10. Vianney le Clément de Saint-Marcq, Pierre Schaus, Christine Solnon, and Christophe Lecoutre. Sparse-sets for domain implementation. In CP workshop on Techniques foR Implementing Constraint programming Systems (TRICS), pages 1-10, 2013. Google Scholar
  11. 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. Google Scholar
  12. Interreg Europe. Demand-responsive transport. https://www.interregeurope.eu/sites/default/files/2021-12/Policy%20brief%20on%20demand%20responsive%20transport.pdf, June 2018.
  13. 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-335, 1998. Google Scholar
  14. Carmen Gervet. Interval propagation to reason about sets: Definition and implementation of a practical language. Constraints, 1:191-244, March 1997. Google Scholar
  15. Siddhartha Jain and Pascal Van Hentenryck. Large neighborhood search for dial-a-ride problems. In International Conference on Principles and Practice of Constraint Programming, pages 400-413. Springer, 2011. Google Scholar
  16. Philippe Laborie and Jerome Rogerie. Reasoning with conditional time-intervals. In FLAIRS conference, pages 555-560, 2008. Google Scholar
  17. Philippe Laborie, Jerome Rogerie, Paul Shaw, and Petr Vilím. Reasoning with conditional time-intervals. part ii: An algebraical model for resources. In FLAIRS Conference, 2009. Google Scholar
  18. Philippe Laborie, Jérôme Rogerie, Paul Shaw, and Petr Vilím. Ibm ilog cp optimizer for scheduling. Constraints, 23(2):210-250, April 2018. URL: https://doi.org/10.1007/s10601-018-9281-x.
  19. Chang Liu, Dionne M. Aleman, and J. Christopher Beck. Modelling and solving the senior transportation problem. In Willem-Jan van Hoeve, editor, Integration of Constraint Programming, Artificial Intelligence, and Operations Research, pages 412-428, Cham, 2018. Springer International Publishing. Google Scholar
  20. Manuel López-Ibáñez. Instances for the TSPTW, September 2020. [Online; accessed 15. Feb. 2022]. URL: https://lopez-ibanez.eu/tsptw-instances.
  21. L. Michel, P. Schaus, and P. Van Hentenryck. Minicp: a lightweight solver for constraint programming. Mathematical Programming Computation, 13(1):133-184, 2021. URL: https://doi.org/10.1007/s12532-020-00190-7.
  22. 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. Google Scholar
  23. Laurent Perron and Vincent Furnon. Or-tools. URL: https://developers.google.com/optimization/.
  24. Laurent Perron and Vincent Furnon. Or-tools sequence var. URL: https://developers.google.com/optimization/reference/constraint_solver/constraint_solver/SequenceVar.
  25. Martin WP Savelsbergh. Local search in routing problems with time windows. Annals of Operations research, 4(1):285-305, 1985. Google Scholar
  26. Charles Thomas, Roger Kameugne, and Pierre Schaus. Insertion sequence variables for hybrid routing and scheduling problems. In International Conference on Integration of Constraint Programming, Artificial Intelligence, and Operations Research, pages 457-474. Springer, 2020. Google Scholar
  27. Paolo Toth and Daniele Vigo. The Vehicle Routing Problem. SIAM, 2002. 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-2024 Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact