Search Results

Advanced search parameters have been applied.
open access

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
Partner: UNT Libraries Government Documents Department
open access

The price of commitment in online stochastic vehicle routing

Description: This paper considers online stochastic multiple vehicle routing with time windows in which requests arrive dynamically and the goal is to maximize the number of serviced customers. Early work has focused on very flexible routing settings where the decision to assign a vehicle to a customer is delayed until a vehicle is actually deployed to the customer. Motivated by real applications that require stability in the decision making, this paper considers a setting where the decision to assign a cus… more
Date: January 1, 2009
Creator: Bent, Russell W & Van Hentenryck, Pascal
Partner: UNT Libraries Government Documents Department
Back to Top of Screen