90-XX OPERATIONS RESEARCH, MATHEMATICAL PROGRAMMING
Filtern
Erscheinungsjahr
- 2013 (1) (entfernen)
Dokumenttyp
- ZIB-Report (1) (entfernen)
Sprache
- Englisch (1)
Volltext vorhanden
- ja (1)
Gehört zur Bibliographie
- nein (1)
Schlagworte
- branch-and-bound (1)
- column generation (1)
- elevator control (1)
- reoptimization (1)
Institut
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.