• Title of article

    Reoptimization gaps versus model errors in online-dispatching of service units for ADAC Original Research Article

  • Author/Authors

    Benjamin Hiller، نويسنده , , Sven O. Krumke، نويسنده , , J?rg Rambau، نويسنده ,

  • Issue Information
    روزنامه با شماره پیاپی سال 2006
  • Pages
    11
  • From page
    1897
  • To page
    1907
  • 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 10 s 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 10 s. 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 t
  • Keywords
    Real-time , Dynamic column generation , Dummy contractor , Integer linear programming , Shadow price model , Vehicle dispatching
  • Journal title
    Discrete Applied Mathematics
  • Serial Year
    2006
  • Journal title
    Discrete Applied Mathematics
  • Record number

    886337