Title: Integrating CP, MIP and Decision Diagrams for the Time-Dependent TSP
Authors: Kinable, Joris ×
Cire, Andre
Van Hoeve, Willem-Jan #
Issue Date: 1-Jun-2014
Conference: INFORMS edition:2014 location:San Francisco date:9-12 November 2014
Abstract: The Time-Dependent Traveling Salesman Problem (TD-TSP), is a generalization of the well-known TSP where the travel times between cities are dependent on the order or time the cities are visited. This work presents an integrated solution procedure for the TD-TSP, thereby unifying Constraint Programming (CP), Mixed Integer Programming (MIP) and Decision Diagrams into a single framework. Experimental results indicate significant performance improvements over dedicated MIP or CP approaches.
Publication status: published
KU Leuven publication type: IMa
Appears in Collections:Computer Science Technology TC, Technology Campuses Ghent and Aalst
Technologiecluster Computerwetenschappen
× corresponding author
# (joint) last author

Files in This Item:

There are no files associated with this item.


All items in Lirias are protected by copyright, with all rights reserved.