Online Presentation on Sequence Variables for Vehicle Routing Problems
16 views
Skip to first unread message
Pierre Schaus
Mar 4, 2026, 6:05:48 AMMar 4
to const...@googlegroups.com, to...@afpc-asso.org
Hello,
If you are interested in knowing more about (insertion-based) Sequence Variables, I’ll be giving an introduction presentation on this topic today that you can follow online https://www.ai4opt.org/news-events/ai4opt-seminar-series-pierre-schaus
Abstract: Constraint Programming (CP) provides a powerful and intuitive framework for modeling combinatorial optimization problems such as Vehicle Routing Problems (VRPs).
However, classical CP models based on successor variables are not well suited to handling optional visits or insertion-based search strategies, which are central to many state-of-the-art routing heuristics.
In this talk, I will introduce sequence variables, a modeling abstraction designed to better capture ordered structures such as routes.
Sequence variables naturally support optional visits and insertion-based heuristics, including insertion-driven Large Neighborhood Search.
The presentation will cover their formal definition, associated domain and update operations, how they can be efficiently integrated into existing trail-based CP solvers, and dedicated global constraints for routing problems.
Best,
Pierre
If you are interested in knowing more about (insertion-based) Sequence Variables, I’ll be giving an introduction presentation on this topic today that you can follow online https://www.ai4opt.org/news-events/ai4opt-seminar-series-pierre-schaus
Abstract: Constraint Programming (CP) provides a powerful and intuitive framework for modeling combinatorial optimization problems such as Vehicle Routing Problems (VRPs).
However, classical CP models based on successor variables are not well suited to handling optional visits or insertion-based search strategies, which are central to many state-of-the-art routing heuristics.
In this talk, I will introduce sequence variables, a modeling abstraction designed to better capture ordered structures such as routes.
Sequence variables naturally support optional visits and insertion-based heuristics, including insertion-driven Large Neighborhood Search.
The presentation will cover their formal definition, associated domain and update operations, how they can be efficiently integrated into existing trail-based CP solvers, and dedicated global constraints for routing problems.
Best,
Pierre
Reply all
Reply to author
Forward
0 new messages