A Time-Dependent No-Overlap Constraint: Application to Delivery Problems - Archive ouverte HAL Access content directly
Conference Papers Year : 2014

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

Abstract

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 present a global constraint, extended from the no-overlap constraint, that integrates time-dependent transition costs and we compare the performance of CP models for the TDTSP with and without the new constraint.
No file

Dates and versions

hal-01313178 , version 1 (09-05-2016)

Identifiers

  • HAL Id : hal-01313178 , version 1

Cite

Penelope Aguiar-Melgarejo, Philippe Laborie, Christine Solnon. A Time-Dependent No-Overlap Constraint: Application to Delivery Problems. Doctoral Program of the 20th International Conference on Principles and Practice of Constraint Programming (CP) , Sep 2014, Lyon, France. pp.1-7. ⟨hal-01313178⟩
100 View
0 Download

Share

Gmail Mastodon Facebook X LinkedIn More