Pages that link to "Item:Q1278725"
From MaRDI portal
The following pages link to Routing trains through railway stations: Complexity issues (Q1278725):
Displayed 15 items.
- Railway track allocation: Models and methods (Q657061) (← links)
- Discrete optimization in public rail transport (Q1365068) (← links)
- Routing trains through a railway station based on a node packing model (Q1592731) (← links)
- A multiobjective optimization for train routing at the high-speed railway station based on tabu search algorithm (Q1721527) (← links)
- Sensitivity analysis of a railway station track layout with respect to a given timetable (Q1806663) (← links)
- Effective train routing selection for real-time traffic management: improved model and ACO parallel computing (Q2147150) (← links)
- Performance evaluation of a parallel ant colony optimization for the real-time train routing selection problem in large instances (Q2163779) (← links)
- Graph coloring-based approach for railway station design analysis and capacity determination (Q2189952) (← links)
- A sequencing approach for creating new train timetables (Q2267382) (← links)
- Strategic timetable scheduling for last trains in urban railway transit networks (Q2290115) (← links)
- Stability evaluation of a railway timetable at station level (Q2378419) (← links)
- A disjunctive graph model and framework for constructing new train schedules (Q2379528) (← links)
- Real time management of a metro rail terminus (Q2482751) (← links)
- FREIGHT TRAIN ROUTING AND SCHEDULING IN A PASSENGER RAIL NETWORK: COMPUTATIONAL COMPLEXITY AND THE STEPWISE DISPATCHING HEURISTIC (Q3503068) (← links)
- An adaptive memory programming method for risk logistics operations (Q4678215) (← links)