An improved local branching approach for train formation planning

DOI10.1016/J.APM.2012.05.016zbMATH Open1349.90144OpenAlexW1991359971MaRDI QIDQ346141FDOQ346141

Authors Masoud Yaghini, Mohsen Momeni, Mohammadreza Sarmadi

Publication date 5 December 2016

Published in Applied Mathematical Modelling (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.apm.2012.05.016

zbMATH Keywords

metaheuristiclocal branching algorithmcapacitated service network design problemIranian railwayrail transportation planningtrain formation plan

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Deterministic network models in operations research (90B10) Case-oriented studies in operations research (90B90) Mixed integer programming (90C11) Transportation, logistics and supply chain management (90B06)

Recommendations

• Railway track allocation by rapid branching
• 04. Solution of the train platforming problem
• New approaches for solving the block‐to‐train assignment problem
• Solving railway track allocation problems
• Tactical design of rail freight networks. I: Exact and heuristic methods

Cited in

(4)

• Capacity consumption analysis using heuristic solution method for under construction railway routes
• Integrated optimization of train formation plan and rolling stock scheduling under time-dependent demand
• Two new mixed‐integer programming models for the integrated train formation and shipment path optimization problem
• Train timetabling for an urban rail transit line using a Lagrangian relaxation approach

This page was built for publication: An improved local branching approach for train formation planning

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q346141)