Reoptimization gaps versus model errors in online-dispatching of service units

In: Discrete Applied Mathematics. To Appear, 2006

Authors

• Benjamin Hiller
• Sven O. Krumke
• Jörg Rambau

Abstract

Under high load, the automated dispatching of service vehicles for the German Automobile Association (ADAC) must reoptimize a dispatch for 100-150 vehicles and 400 requests in about ten seconds to near optimality. In the presence of service contractors, this can be achieved by the column generation algorithm ZIBDIP. In metropolitan areas, however, service contractors cannot be dispatched automatically because they may decline. The problem: a model without contractors yields larger optimality gaps within ten seconds. One way-out are simplified reoptimization models. These compute a short-term dispatch containing only some of the requests: unknown future requests will influence future service anyway. The simpler the models the better the gaps, but also the larger the model error. What is more significant: reoptimization gap or reoptimization model error? We answer this question in simulations on real-world ADAC data: only the new model ZIBDIPdummy can keep up with ZIBDIP.

BibTeX

 
@Article{ HillerEtAl:Reoptimization, 
   title = { Reoptimization gaps versus model errors in online-dispatching of service units }, 
   author = { Benjamin Hiller and Sven O. Krumke and Jörg Rambau },    
   journal = { Discrete Applied Mathematics },           
   note = { To Appear },  
   year = 2006, 
} 

---

This publication belongs to the project DeNDeMA.