Making the Yellow Angels Fly: Online Dispatching Of Service Vehicles in Real Time
Please always quote using this URN: urn:nbn:de:0297-zib-6858
- Combinatorial online optimization is an area with lots of applications and potential for significant progress, both in theory and practice. In this short note we sketch the ADACproblem, a typical large-scale online optimization problem, discuss some theoretical and pratical issues coming up, and explain, very briefly, how we approach this problem mathematically. Online problems are a battlefield of heuristics with many strong claims about their solution quality. We indicate that a stronger problem orientation and the use of a little more mathematics may yield.
Author: | Martin Grötschel, Sven Krumke, Jörg Rambau, Luis Miguel Torres |
---|---|
Document Type: | ZIB-Report |
Tag: | ADAC; branch and bound; column generation; pricing; real world data; real-time; soft time windows; vehicle dispatching |
MSC-Classification: | 90-XX OPERATIONS RESEARCH, MATHEMATICAL PROGRAMMING / 90Bxx Operations research and management science / 90B06 Transportation, logistics |
Date of first Publication: | 2002/04/08 |
Series (Serial Number): | ZIB-Report (02-18) |
ZIB-Reportnumber: | 02-18 |
Published in: | Appeared in: SIAM News, Vol. 35, No. 4, (2002) pp. 10-11 |