Rapid Branching

Please always quote using this URN: urn:nbn:de:0297-zib-14728
  • 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.

Download full text files

Export metadata

  • Export Bibtex
Author:Ralf Borndörfer, Andreas Löbel, Markus Reuther, Thomas Schlechte, Steffen Weider
Document Type:ZIB-Report
Tag:column generation; large scale optimization; rapid branching
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
Date of first Publication:2012/02/22
Series (Serial Number):ZIB-Report (12-10)
Published in:A rev. vers. appeared in: . C. Muñoz and S. Voß (eds.), Proceedings of the 12th International Conference on Advanced Systems for Public Transport (CASPT12), Santiago, Chile, 2012
Licence (German):License LogoCreative Commons - Namensnennung-Keine kommerzielle Nutzung-Weitergabe unter gleichen Bedingungen

$Rev: 13581 $