Title of article :
Reoptimization Gaps versus Model Errors in Online-Dispatching of Service Units for ADAC
Author/Authors :
Hiller، نويسنده , , Benjamin and Krumke، نويسنده , , Sven O. and Rambau، نويسنده , , Jِrg، نويسنده ,
Issue Information :
روزنامه با شماره پیاپی سال 2004
Pages :
7
From page :
157
To page :
163
Abstract :
Under high load, the automated dispatching of service vehicles for the German Automobile As- sociation (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 mod- els. 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.
Keywords :
Integer Linear Programming , dynamic column generation , Vehicle dispatching , Real-time , shadow price model , dummy contractor
Journal title :
Electronic Notes in Discrete Mathematics
Serial Year :
2004
Journal title :
Electronic Notes in Discrete Mathematics
Record number :
1453779
Link To Document :
بازگشت