An improved local branching approach for train formation planning

DOI10.1016/J.APM.2012.05.016zbMath1349.90144OpenAlexW1991359971MaRDI QIDQ346141

Mohsen Momeni, Masoud Yaghini, 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) Mixed integer programming (90C11) Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59) Deterministic network models in operations research (90B10) Case-oriented studies in operations research (90B90)

Related Items (4)

Capacity consumption analysis using heuristic solution method for under construction railway routes ⋮ 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 ⋮ Integrated optimization of train formation plan and rolling stock scheduling under time-dependent demand

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