Real-Time Dispatching of Guided and Unguided Automobile Service Units with Soft Time Windows

Authors:
Sven Oliver Krumke;Jörg Rambau;Luis Torres
Affiliations:
-;-;-
Venue:
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
Year:
2002

Citing 2
Cited 9

Diversion Issues in Real-Time Vehicle Dispatching

Transportation Science
A reactive method for real time dynamic vehicle routing problem

ICTAI '00 Proceedings of the 12th IEEE International Conference on Tools with Artificial Intelligence

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
Online-optimization of multi-elevator transport systems with reoptimization algorithms based on set-partitioning models

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
Selected Topics in Column Generation

Operations Research
Vehicle Routing and Staffing for Sedan Service

Transportation Science
Dynamic vehicle routing using genetic algorithms

Applied Intelligence
Online decision making and automatic decision model adaptation

Computers and Operations Research
ASAP: The After-Salesman Problem

Manufacturing & Service Operations Management
DVRP: a hard dynamic combinatorial optimisation problem tackled by an evolutionary hyper-heuristic

Journal of Heuristics
A Flexible and Adaptive Hyper-heuristic Approach for (Dynamic) Capacitated Vehicle Routing Problems

Fundamenta Informaticae - Emergent Computing

Quantified Score

Hi-index	0.02

Visualization

Abstract

We investigate a real-world large scale vehicle dispatching problem with strict real-time requirements, posed by our cooperation partner, the German Automobile Association. We present computational experience on real-world data with a dynamic column generation method employing a portfolio of acceleration techniques. Our computer program ZIBDIP yields solutions on heavy-load real-world instances (215 service requests, 95 service units) in less than a minute that are no worse than 1% from optimum on state-of-the-art personal computers.