Refine
Year of publication
- 2013 (3) (remove)
Document Type
- Article (3) (remove)
Language
- English (3)
Has Fulltext
- no (3)
Is part of the Bibliography
- no (3)
Institute
Two fundamental mathematical formulations for railway timetabling
are compared on a common set of sample problems, representing both
multiple track high density services in Europe and single track bidirectional
operations in North America. One formulation, ACP, enforces
against conflicts by constraining time intervals between trains,
while the other formulation, RCHF, monitors physical occupation of
controlled track segments. The results demonstrate that both ACP
and RCHF return comparable solutions in the aggregate, with some
significant differences in select instances, and a pattern of significant
differences in performance and constraint enforcement overall.
Rapid Branching
(2013)
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.