Capacity consumption analysis using heuristic solution method for under construction railway routes
DOI10.1007/S11067-014-9223-0zbMATH Open1338.90187OpenAlexW2019558196WikidataQ125888380 ScholiaQ125888380MaRDI QIDQ291652FDOQ291652
Authors: Masoud Yaghini, Mohammadreza Sarmadi, Nariman Nikoo, Mohsen Momeni 
Publication date: 10 June 2016
Published in: Networks and Spatial Economics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11067-014-9223-0
Recommendations
- Timetable compression using max-plus automata applied to large railway networks
- A probabilistic \((\max,+)\) approach for determining railway infrastructure capacity.
- Railway timetabling using Lagrangian relaxation
- Graph coloring-based approach for railway station design analysis and capacity determination
- Routing Trains Through Railway Stations: Model Formulation and Algorithms
capacity consumptiondiscrete-time multicommodity network design modellocal branching algorithmrailway routestrain timetablingUIC capacity calculation method
Approximation methods and heuristics in mathematical programming (90C59) Deterministic network models in operations research (90B10) Deterministic scheduling theory in operations research (90B35) Traffic problems in operations research (90B20)
Cites Work
- A probabilistic \((\max,+)\) approach for determining railway infrastructure capacity.
- An analytical approach to calculate the capacity of a railway system
- Local branching
- Robust optimization model for a dynamic network design problem under demand uncertainty
- Fine-Tuning of Algorithms Using Fractional Experimental Designs and Local Search
- Using experimental design to find effective parameter settings for heuristics
- An advanced real-time train dispatching system for minimizing the propagation of delays in a dispatching area under severe disturbances
- Evaluation of railway networks with single track operation using the UIC 406 capacity method
- Design of a railway scheduling model for dense services
- A branch and bound algorithm for scheduling trains in a railway network
- Railway timetabling using Lagrangian relaxation
- Robust facility location problem for hazardous waste transportation
- Tuning an Algorithm Using Design of Experiments
- An improved local branching approach for train formation planning
- A Model, Algorithms and Strategy for Train Pathing
- A Genetic Algorithm for Railway Scheduling Problems
Cited In (6)
- A train dispatching model under a stochastic environment: stable train routing constraints and reformulation
- A model of stratified production process and spatial risk
- A probabilistic \((\max,+)\) approach for determining railway infrastructure capacity.
- A genetic algorithm based on relaxation induced neighborhood search in a local branching framework for capacitated multicommodity network design
- Evaluation of railway networks with single track operation using the UIC 406 capacity method
- Timetable compression using max-plus automata applied to large railway networks
Uses Software
This page was built for publication: Capacity consumption analysis using heuristic solution method for under construction railway routes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q291652)
