On the flexibility of constraint programming models: From single to multiple time windows for the traveling salesman problem

DOI10.1016/S0377-2217(98)00248-3zbMath0998.90065OpenAlexW2037615545MaRDI QIDQ1847167

Gilles Pesant, Michel Gendreau, Jean-Yves Potvin, Jean-Marc Rousseau

Publication date: 17 November 2002

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0377-2217(98)00248-3

zbMATH Keywords

traveling salesmanconstraint programmingmultiple time windowsbranch andbounditerative-cost-deepening

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27)

Related Items

A hybrid variable neighborhood tabu search heuristic for the vehicle routing problem with multiple time windows, Heuristic Approaches to Minimize Tour Duration for the TSP with Multiple Time Windows, Explicit Modelling of Multiple Intervals in a Constraint Generation Procedure for Multiprocessor Scheduling, A variable neighborhood descent algorithm for a real waste collection problem with mobile depots

Uses Software

• ILOG SCHEDULE

Cites Work

• Unnamed Item
• A computational study of constraint satisfaction for multiple capacitated job shop scheduling
• Constraint-based scheduling: Applying constraint programming to scheduling problems.
• The split delivery vehicle scheduling problem with time windows and grid network distances
• Probabilistic diversification and intensification in local search for vehicle routing
• An Exact Constraint Logic Programming Algorithm for the Traveling Salesman Problem with Time Windows
• Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
• Constraint logic programming for examination timetabling
• A two-commodity flow formulation for the traveling salesman and the makespan problems with time windows
• A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows
• A Tabu Search Heuristic for the Vehicle Routing Problem with Soft Time Windows