Capacity consumption analysis using heuristic solution method for under construction railway routes

DOI10.1007/s11067-014-9223-0zbMath1338.90187OpenAlexW2019558196WikidataQ125888380 ScholiaQ125888380MaRDI QIDQ291652

Mohammadreza Sarmadi, Nariman Nikoo, Mohsen Momeni, Masoud Yaghini

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

zbMATH Keywords

capacity consumptiondiscrete-time multicommodity network design modellocal branching algorithmrailway routestrain timetablingUIC capacity calculation method

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Deterministic network models in operations research (90B10) Traffic problems in operations research (90B20)

Related Items (3)

A genetic algorithm based on relaxation induced neighborhood search in a local branching framework for capacitated multicommodity network design ⋮ A train dispatching model under a stochastic environment: stable train routing constraints and reformulation ⋮ A model of stratified production process and spatial risk

Uses Software

• SPOT

Cites Work

• An analytical approach to calculate the capacity of a railway system
• Robust facility location problem for hazardous waste transportation
• An improved local branching approach for train formation planning
• Robust optimization model for a dynamic network design problem under demand uncertainty
• 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
• Local branching
• A probabilistic \((\max,+)\) approach for determining railway infrastructure capacity.
• A branch and bound algorithm for scheduling trains in a railway network
• Railway Timetabling Using Lagrangian Relaxation
• Tuning an Algorithm Using Design of Experiments
• Fine-Tuning of Algorithms Using Fractional Experimental Designs and Local Search
• A Model, Algorithms and Strategy for Train Pathing
• A Genetic Algorithm for Railway Scheduling Problems
• Using experimental design to find effective parameter settings for heuristics

This page was built for publication: Capacity consumption analysis using heuristic solution method for under construction railway routes