Large neighborhood search for the double traveling salesman problem with multiple stacks
Conference
·
OSTI ID:956471
- Los Alamos National Laboratory
- BROWN UNIV
This paper considers a complex real-life short-haul/long haul pickup and delivery application. The problem can be modeled as double traveling salesman problem (TSP) in which the pickups and the deliveries happen in the first and second TSPs respectively. Moreover, the application features multiple stacks in which the items must be stored and the pickups and deliveries must take place in reserve (LIFO) order for each stack. The goal is to minimize the total travel time satisfying these constraints. This paper presents a large neighborhood search (LNS) algorithm which improves the best-known results on 65% of the available instances and is always within 2% of the best-known solutions.
- Research Organization:
- Los Alamos National Laboratory (LANL), Los Alamos, NM (United States)
- Sponsoring Organization:
- USDOE
- DOE Contract Number:
- AC52-06NA25396
- OSTI ID:
- 956471
- Report Number(s):
- LA-UR-09-00056; LA-UR-09-56; TRN: US201013%%180
- Resource Relation:
- Conference: Inter. Conf. on Integration of AI and OR Techniques in CP 2009 ; May 27, 2009 ; Pittsburg, PA
- Country of Publication:
- United States
- Language:
- English
Similar Records
The cost-constrained traveling salesman problem
Asymptotic experimental analysis for the Held-Karp traveling salesman bound
Environmental inspection routes and the constrained travelling salesman problem
Technical Report
·
Mon Oct 01 00:00:00 EDT 1990
·
OSTI ID:956471
Asymptotic experimental analysis for the Held-Karp traveling salesman bound
Conference
·
Tue Dec 31 00:00:00 EST 1996
·
OSTI ID:956471
Environmental inspection routes and the constrained travelling salesman problem
Book
·
Thu Jan 01 00:00:00 EST 1976
·
OSTI ID:956471
+1 more