Rapid Branching

  • 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.

Export metadata

  • Export Bibtex

Additional Services

Share in Twitter Search Google Scholar
Metadaten
Author:Ralf Borndörfer, Andreas Löbel, Markus Reuther, Thomas Schlechte, Steffen Weider
Editor:J.C. Muñoz, S. Voß
Document Type:Article
Parent Title (English):Public Transport
Volume:5
Issue:1
First Page:3
Last Page:23
Publisher:Springer Berlin Heidelberg
Year of first publication:2013
Pagenumber:21
Preprint:urn:nbn:de:0297-zib-14728
Licence (German):License LogoCreative Commons - Namensnennung-Keine kommerzielle Nutzung-Weitergabe unter gleichen Bedingungen

$Rev: 13581 $