A Time-Dependent No-Overlap Constraint: Application to Urban Delivery Problems

The Time-Dependent Traveling Salesman Problem (TDTSP) is the extended version of the TSP where arc costs depend on the time when the arc is traveled. When we consider urban deliveries, travel times vary considerably during the day and optimizing a delivery tour comes down to solving an instance of the TDTSP. In this paper we propose a set of benchmarks for the TDTSP based on real traffic data and show the interest of handling time dependency in the problem. We then present a new global constraint (an extension of no-overlap) that integrates time-dependent transition times and show that this new constraint outperforms the classical CP approach.

[1]  Michel Gendreau,et al.  Vehicle dispatching with time-dependent travel times , 2003, Eur. J. Oper. Res..

[2]  Jean-Guillaume Fages,et al.  Improving the Asymmetric TSP by Considering Graph Structure , 2012, ArXiv.

[3]  Philip Kilby,et al.  CP Methods for Scheduling and Routing with Time-Dependent Task Costs , 2013, CPAIOR.

[4]  Artur Alves Pessoa,et al.  The time dependent traveling salesman problem: polyhedra and algorithm , 2013, Math. Program. Comput..

[5]  Bruce L. Golden,et al.  Solving the Time Dependent Traveling Salesman Problem , 2005 .

[6]  Toby Walsh,et al.  Handbook of Constraint Programming , 2006, Handbook of Constraint Programming.

[7]  Giacomo Nannicini,et al.  Point-to-point shortest paths on dynamic time-dependent road networks , 2010, 4OR.

[8]  Roberto Montemanni,et al.  Time dependent vehicle routing problem with a multi ant colony system , 2008, Eur. J. Oper. Res..

[9]  Hideki Hashimoto,et al.  An iterated local search algorithm for the time-dependent vehicle routing problem with time windows , 2008, Discret. Optim..

[10]  Wim Nuijten,et al.  Solving Scheduling Problems with Setup Times and Alternative Resources , 2000, AIPS.

[11]  Mark S. Daskin,et al.  Time Dependent Vehicle Routing Problems: Formulations, Properties and Heuristic Algorithms , 1992, Transp. Sci..

[13]  Petr Vilím,et al.  Reasoning with Conditional Time-Intervals. Part II: An Algebraical Model for Resources , 2009, FLAIRS.

[14]  Xin-She Yang,et al.  Introduction to Algorithms , 2021, Nature-Inspired Optimization Algorithms.

[15]  Jean-François Cordeau,et al.  Analysis and Branch-and-Cut Algorithm for the Time-Dependent Travelling Salesman Problem , 2014, Transp. Sci..

[16]  Philippe Baptiste,et al.  Constraint-Based Scheduling and Planning , 2006, Handbook of Constraint Programming.

[17]  Richard W. Eglese,et al.  Vehicle routing and scheduling with time-varying data: A case study , 2010, J. Oper. Res. Soc..

[18]  Louis-Martin Rousseau,et al.  Improved filtering for weighted circuit constraints , 2012, Constraints.

[19]  Miguel A. Figliozzi,et al.  The time dependent vehicle routing problem with time windows: Benchmark problems, an efficient solution algorithm, and solution characteristics , 2012 .

[20]  J Bentner,et al.  Optimization of the time-dependent traveling salesman problem with Monte Carlo methods. , 2001, Physical review. E, Statistical, nonlinear, and soft matter physics.

[21]  A. ILOGS..  DISJUNCTIVE CONSTRAINTS FOR MANUFACTURING SCHEDULING : PRINCIPLES AND EXTENSIONS , 1995 .

[22]  Jean-François Cordeau,et al.  A branch-and-cut algorithm for a production scheduling problem with sequence-dependent and time-dependent setup times , 2008, Comput. Oper. Res..

[23]  S. Voß,et al.  A classification of formulations for the (time-dependent) traveling salesman problem , 1995 .

[24]  Stephen C. Graves,et al.  Technical Note - An n-Constraint Formulation of the (Time-Dependent) Traveling Salesman Problem , 1980, Oper. Res..

[25]  Maurice Queyranne,et al.  The Time-Dependent Traveling Salesman Problem and Its Application to the Tardiness Problem in One-Machine Scheduling , 1978, Oper. Res..

[26]  Philippe Laborie,et al.  Reasoning with Conditional Time-Intervals , 2008, FLAIRS.

[27]  Bernhard Fleischmann,et al.  Time-Varying Travel Times in Vehicle Routing , 2004, Transp. Sci..

[28]  Nikolaos V. Sahinidis,et al.  Time-Dependent Traveling Salesman Problem , 2009, Encyclopedia of Optimization.

[29]  D. Godard,et al.  Self-Adapting Large Neighborhood Search: Application to Single-Mode Scheduling Problems , 2007 .

[30]  Stephen C. Graves,et al.  An n-Constraint Formulation of the (Time-Dependent) Traveling Salesman Problem , 2016 .