A Comparison of Anticipatory Algorithms for the Dynamic and Stochastic Traveling Salesman Problem

Authors:
Gianpaolo Ghiani;Emanuele Manni;Barrett W. Thomas
Affiliations:
Dipartimento di Ingegneria dell'Innovazione, Università del Salento, 73100 Lecce, Italy;Dipartimento di Ingegneria dell'Innovazione, Università del Salento, 73100 Lecce, Italy;Department of Management Sciences, University of Iowa, Iowa City, Iowa 52242
Venue:
Transportation Science
Year:
2012

Citing 16
Cited 0

Algorithms for the vehicle routing and scheduling problems with time window constraints

Operations Research
The vehicle scheduling problem with intermittent customer demands

Computers and Operations Research
Comparing neuro-dynamic programming algorithms for the vehicle routing problem with stochastic demands

Computers and Operations Research - Neural networks in business
Simulation Modeling and Analysis

Simulation Modeling and Analysis
Parallel Tabu Search for Real-Time Vehicle Routing and Dispatching

Transportation Science
Diversion Issues in Real-Time Vehicle Dispatching

Transportation Science
A Rollout Policy for the Vehicle Routing Problem with Stochastic Demands

Operations Research
Scenario-Based Planning for Partially Dynamic Vehicle Routing with Stochastic Customers

Operations Research
A Compressed-Annealing Heuristic for the Traveling Salesman Problem with Time Windows

INFORMS Journal on Computing
Solving a Dynamic and Stochastic Vehicle Routing Problem with a Sample Scenario Hedging Heuristic

Transportation Science
The A Priori Dynamic Traveling Salesman Problem with Time Windows

Transportation Science
Waiting Strategies for Dynamic Vehicle Routing

Transportation Science
Exploiting Knowledge About Future Demands for Real-Time Vehicle Dispatching

Transportation Science
Waiting Strategies for Anticipating Service Requests from Known Customer Locations

Transportation Science
Reoptimization Approaches for the Vehicle-Routing Problem with Stochastic Demands

Operations Research
ASAP: The After-Salesman Problem

Manufacturing & Service Operations Management

Quantified Score

Hi-index	0.00

Visualization

Abstract

Advances in information technology and telecommunications, together with ever-growing amounts of data, offer opportunities for transportation companies to improve the quality of the service that they provide to their customers. This paper compares two methods motivated by the opportunity that the availability of data and technology gives to improve on current practice. In particular, the two solution approaches are explored in the context of a dynamic and stochastic routing problem in which a single, uncapacitated vehicle serves a set of known customers locations. One approach, sample-scenario planning, offers the potential for higher-quality solutions, but at the expense of greater computational effort. On the other hand, anticipatory insertion offers reduced computation and increased managerial ease, but with the potential for reduced solution quality due to restrictions on solution structure. Our results show that anticipatory insertion can often match the quality of sample-scenario planning, particularly when the degree of dynamism is low.