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

A Time-Dependent No-Overlap Constraint: Application to Urban 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 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 outper-forms the classical CP approach.
Fichier principal
Vignette du fichier
versionFinale.pdf (1.1 Mo) Télécharger le fichier
Origin Files produced by the author(s)
Loading...

Dates and versions

hal-01163394 , version 1 (12-06-2015)

Identifiers

Cite

Penélope Aguiar Melgarejo, Philippe Laborie, Christine Solnon. A Time-Dependent No-Overlap Constraint: Application to Urban Delivery Problems. 12th International Conference on Integration of AI and OR Techniques in Constraint Programming (CPAIOR 2015), May 2015, Barcelone, Spain. pp.1-17, ⟨10.1007/978-3-319-18008-3_1⟩. ⟨hal-01163394⟩
164 View
225 Download

Altmetric

Share

Gmail Mastodon Facebook X LinkedIn More