Overview Statistic: PDF-Downloads (blue) and Frontdoor-Views (gray)

Reoptimization in branch-and-bound algorithms with an application to elevator control

Please always quote using this URN: urn:nbn:de:0297-zib-17876
  • We consider reoptimization (i.e. the solution of a problem based on information available from solving a similar problem) for branch-and-bound algorithms and propose a generic framework to construct a reoptimizing branch-and-bound algorithm. We apply this to an elevator scheduling algorithm solving similar subproblems to generate columns using branch-and-bound. Our results indicate that reoptimization techniques can substantially reduce the running times of the overall algorithm.

Download full text files

Export metadata

Additional Services

Share in Twitter Search Google Scholar Statistics - number of accesses to the document
Author:Benjamin HillerORCiD, Torsten Klug, Jakob WitzigORCiD
Document Type:ZIB-Report
Tag:branch-and-bound; column generation; elevator control; reoptimization
CCS-Classification:J. Computer Applications
Date of first Publication:2013/03/20
Series (Serial Number):ZIB-Report (13-15)
Published in:Appeared in: Proceedings of the 12th International Symposium on Experimental Algorithms, 2013, LNCS 7933, pp. 378-389
Licence (German):License LogoCreative Commons - Namensnennung-Nicht kommerziell-Keine Bearbeitung
Accept ✔
Diese Webseite verwendet technisch erforderliche Session-Cookies. Durch die weitere Nutzung der Webseite stimmen Sie diesem zu. Unsere Datenschutzerklärung finden Sie hier.