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

Full description

Saved in:
Bibliographic Details
Published in:Public transport 2013-09, Vol.5 (1-2), p.3-23
Main Authors: Borndörfer, Ralf, Löbel, Andreas, Reuther, Markus, Schlechte, Thomas, Weider, Steffen
Format: Article
Language:English
Subjects:
Allocations
Automotive Engineering
Business and Management
CAE) and Design
Computer-Aided Engineering (CAD
Heuristic
Integer programming
Linear programming
Operations Research/Decision Theory
Optimization
Original Paper
Public transportation
Railroads
Railway engineering
Scheduling
Strategy
Studies
Transport
Transportation
Variables
Vehicles
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:1866-749X
1613-7159
DOI:10.1007/s12469-013-0066-8