Routing trains through railway stations: Complexity issues
From MaRDI portal
Recommendations
Cites work
- Algorithms for preemptive scheduling of different classes of processors to do jobs with fixed times
- An analysis of shift class design problems
- An Optimal Solution for the Channel-Assignment Problem
- Approximation Algorithms for Fixed Job Schedule Problems
- Depth-First Search and Linear Graph Algorithms
- Games of Boldness, Where the Player Performing the Hardest Task Wins
- scientific article; zbMATH DE number 3793772 (Why is no real title available?)
- License class design: Complexity and algorithms
- Minimal Resources for Fixed and Variable Job Schedules
- On the computational complexity of (maximum) class scheduling
- On the computational complexity of (maximum) shift class scheduling
- On the facial structure of set packing polyhedra
- Routing Trains Through Railway Stations: Model Formulation and Algorithms
- Scheduling jobs with fixed start and end times
- The Fixed Job Schedule Problem with Spread-Time Constraints
- The Fixed Job Schedule Problem with Working-Time Constraints
- Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
Cited in
(27)- The hardness of train rearrangements
- The Merlin-Randell problem of train journeys
- Scheduling trams in the morning
- Discrete optimization in public rail transport
- Routing trains through a railway station based on a node packing model
- A multiobjective optimization for train routing at the high-speed railway station based on tabu search algorithm
- Sensitivity analysis of a railway station track layout with respect to a given timetable
- Effective train routing selection for real-time traffic management: improved model and ACO parallel computing
- Performance evaluation of a parallel ant colony optimization for the real-time train routing selection problem in large instances
- Graph coloring-based approach for railway station design analysis and capacity determination
- The single train shortest route problem in a railyard
- A sequencing approach for creating new train timetables
- Strategic timetable scheduling for last trains in urban railway transit networks
- Stability evaluation of a railway timetable at station level
- A disjunctive graph model and framework for constructing new train schedules
- Real time management of a metro rail terminus
- FREIGHT TRAIN ROUTING AND SCHEDULING IN A PASSENGER RAIL NETWORK: COMPUTATIONAL COMPLEXITY AND THE STEPWISE DISPATCHING HEURISTIC
- scientific article; zbMATH DE number 3956436 (Why is no real title available?)
- Routing Trains Through Railway Stations: Model Formulation and Algorithms
- On the complexity of train assignment problems
- An adaptive memory programming method for risk logistics operations
- Train scheduling on a unidirectional path
- Two railway circuits: A universal circuit and an NP-difficult one
- Railway track allocation: Models and methods
- On the approximability of train routing and the min-max disjoint paths problem
- Waiting for trains: complexity results
- Formation of train routes in a station
This page was built for publication: Routing trains through railway stations: Complexity issues
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1278725)
