A combined column generation and heuristics for railway short-term rolling stock planning with regular inspection constraints
DOI10.1016/j.cor.2016.11.025zbMath1391.90299OpenAlexW2557752638WikidataQ56523940 ScholiaQ56523940MaRDI QIDQ1652213
Masahiro Inuiguchi, Kenji Ueda, Akiyoshi Ohno, Tatsushi Nishi, Satoru Takahashi
Publication date: 11 July 2018
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2016.11.025
heuristicsLagrangian relaxationschedulingcolumn generationcombinatorial optimizationrolling stock planningset partitioning problem
Programming involving graphs or networks (90C35) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Deterministic network models in operations research (90B10)
Cites Work
- Robust rolling stock in rapid transit networks
- The aircraft rotation problem
- Circulation of railway rolling stock: a branch-and-price approach
- A Lagrangian heuristic for a train-unit assignment problem
- Accelerated label setting algorithms for the elementary resource constrained shortest path problem
- Scheduling preventive railway maintenance activities
- An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems
This page was built for publication: A combined column generation and heuristics for railway short-term rolling stock planning with regular inspection constraints
