ASAP: The After-Salesman Problem

Authors:
Joris van de Klundert;Laurens Wormer
Affiliations:
Erasmus University Rotterdam, 3000 Rotterdam, The Netherlands;Mateum, 6225XS Maastricht, The Netherlands
Venue:
Manufacturing & Service Operations Management
Year:
2010

Citing 9
Cited 3

Stochastic and dynamic vehicle routing in the Euclidean plane with multiple capacitated vehicles

Operations Research
Non-abusiveness Helps: An O(1)-Competitive Algorithm for Minimizing the Maximum Flow Time in the Online Traveling Salesman Problem

APPROX '02 Proceedings of the 5th International Workshop on Approximation Algorithms for Combinatorial Optimization
Real-Time Dispatching of Guided and Unguided Automobile Service Units with Soft Time Windows

ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
Diversion Issues in Real-Time Vehicle Dispatching

Transportation Science
Reoptimization gaps versus model errors in online-dispatching of service units for ADAC

Discrete Applied Mathematics - Special issue: Traces of the Latin American conference on combinatorics, graphs and applications: a selection of papers from LACGA 2004, Santiago, Chile
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
Exploiting Knowledge About Future Demands for Real-Time Vehicle Dispatching

Transportation Science
A branch-and-regret heuristic for stochastic and dynamic vehicle routing problems

Networks

ANWB Automates and Improves Service Personnel Dispatching

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

Transportation Science
Rollout Policies for Dynamic Solutions to the Multivehicle Routing Problem with Stochastic Demand and Duration Limits

Operations Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider the operational scheduling or dispatching problem of assigning servicemen to service requests that arrive in real time. The objective is to optimize responsiveness, i.e., to minimize waiting in excess of a promised response time. We study how responsiveness is influenced by modeling decisions and solution methods that arise when solving the dynamic problem by repeatedly solving real-time problems. Most results are derived using a set-partitioning based solution approach, which is shown to perform best among considered alternatives. Our research is based on a large-scale real-life application regarding roadside service assistance.