Rapid Branching
Please always quote using this URN:urn:nbn:de:0296-matheon-10878
- We propose rapid branching (RB) as a general branch-and-bound heuristic for solving large scale optimization problems in traffic and transport. The key idea is to combine a special branching rule and a greedy node selection strategy in order to produce solutions of controlled quality rapidly and efficiently. We report on three successful applications of the method for integrated vehicle and crew scheduling, railway track allocation, and railway vehicle rotation planning.
Author: | Ralf Borndörfer, Andreas Löbel, Markus Reuther, Thomas Schlechte, Steffen Weider |
---|---|
URN: | urn:nbn:de:0296-matheon-10878 |
Referee: | Volker Mehrmann |
Document Type: | Preprint, Research Center Matheon |
Language: | English |
Date of first Publication: | 2012/02/25 |
Release Date: | 2012/02/25 |
Tag: | column generation; large scale optimization; rapid branching |
Institute: | Research Center Matheon |
Zuse Institute Berlin (ZIB) | |
MSC-Classification: | 90-XX OPERATIONS RESEARCH, MATHEMATICAL PROGRAMMING / 90Bxx Operations research and management science / 90B06 Transportation, logistics |
90-XX OPERATIONS RESEARCH, MATHEMATICAL PROGRAMMING / 90Cxx Mathematical programming [See also 49Mxx, 65Kxx] / 90C10 Integer programming | |
Preprint Number: | 930 |