The dispatching problem on multitrack territories: Heuristic approaches based on mixed integer linear programming

DOI10.1002/net.21528zbMath1338.90138OpenAlexW2036339602MaRDI QIDQ2811317

Carlo Mannino, Maurizio Boccia, Igor' Leonidovich Vasilyev

Publication date: 10 June 2016

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.21528

zbMATH Keywords

mixed integer linear programmingdispatching problem

Mathematics Subject Classification ID

Mixed integer programming (90C11) Reliability, availability, maintenance, inspection in operations research (90B25)

Related Items (2)

Effective train routing selection for real-time traffic management: improved model and ACO parallel computing ⋮ An iterative approach for reducing the impact of infrastructure maintenance on the performance of railway systems

Cites Work

• A rollout metaheuristic for job shop scheduling problems
• A branch and bound algorithm for scheduling trains in a railway network
• 04. Solution of the Train Platforming Problem
• A MIP-based local search method for the railway rescheduling problem
• Optimal Real-Time Traffic Control in Metro Stations

This page was built for publication: The dispatching problem on multitrack territories: Heuristic approaches based on mixed integer linear programming