Large neighborhood search for the double traveling salesman problem with multiple stacks
Description:
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 constrain…
more
Date:
January 1, 2009
Creator:
Bent, Russell W & Van Hentenryck, Pascal
Item Type:
Refine your search to only
Article
Partner:
UNT Libraries Government Documents Department