Large neighborhood search for the double traveling salesman problem with multiple stacks
Abstract
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.
- Authors:
-
- Los Alamos National Laboratory
- BROWN UNIV
- Publication Date:
- Research Org.:
- Los Alamos National Laboratory (LANL), Los Alamos, NM (United States)
- Sponsoring Org.:
- USDOE
- OSTI Identifier:
- 956471
- Report Number(s):
- LA-UR-09-00056; LA-UR-09-56
TRN: US201013%%180
- DOE Contract Number:
- AC52-06NA25396
- Resource Type:
- Conference
- 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
- Subject:
- 97 MATHEMATICS AND COMPUTING; ALGORITHMS; ARTIFICIAL INTELLIGENCE; COMPUTERS
Citation Formats
Bent, Russell W, and Van Hentenryck, Pascal. Large neighborhood search for the double traveling salesman problem with multiple stacks. United States: N. p., 2009.
Web.
Bent, Russell W, & Van Hentenryck, Pascal. Large neighborhood search for the double traveling salesman problem with multiple stacks. United States.
Bent, Russell W, and Van Hentenryck, Pascal. 2009.
"Large neighborhood search for the double traveling salesman problem with multiple stacks". United States. https://www.osti.gov/servlets/purl/956471.
@article{osti_956471,
title = {Large neighborhood search for the double traveling salesman problem with multiple stacks},
author = {Bent, Russell W and Van Hentenryck, Pascal},
abstractNote = {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.},
doi = {},
url = {https://www.osti.gov/biblio/956471},
journal = {},
number = ,
volume = ,
place = {United States},
year = {Thu Jan 01 00:00:00 EST 2009},
month = {Thu Jan 01 00:00:00 EST 2009}
}
Other availability
Please see Document Availability for additional information on obtaining the full-text document. Library patrons may search WorldCat to identify libraries that hold this conference proceeding.
Save to My Library
You must Sign In or Create an Account in order to save documents to your library.