The following pages link to Optimal lines for railway systems (Q1278454):
Displaying 41 items.
- Hybrid large neighborhood search for the bus rapid transit route design problem (Q296775) (← links)
- Line planning in public transportation: models and methods (Q443830) (← links)
- Optimizing the simplon railway corridor (Q475174) (← links)
- Timetabling optimization of a mixed double- and single-tracked railway network (Q622927) (← links)
- The vehicle routing problem with coupled time windows (Q926344) (← links)
- Analyzing and evaluating the three-line rail traffic (Q946168) (← links)
- Minimizing waiting times in integrated fixed interval timetables by upgrading railway tracks (Q1280194) (← links)
- Cost optimal allocation of rail passenger lines (Q1303534) (← links)
- Discrete optimization in public rail transport (Q1365068) (← links)
- The line planning routing game (Q1634301) (← links)
- An adaptive neighborhood search metaheuristic for the integrated railway rapid transit network design and line planning problem (Q1652047) (← links)
- Integrated approach to network design and frequency setting problem in railway rapid transit systems (Q1652202) (← links)
- Delay resistant line planning with a view towards passenger transfers (Q1688439) (← links)
- A tree-based model for setting optimal train fare zones (Q1718240) (← links)
- Metric inequalities for routings on direct connections with application to line planning (Q1751129) (← links)
- Line planning with user-optimal route choice (Q1751827) (← links)
- Mind the gap: a study of tube tour (Q1761218) (← links)
- A fast algorithm for near cost optimal line plans (Q1762670) (← links)
- Schedule-based passenger assignment for high-speed rail networks considering the ticket-booking process (Q1792716) (← links)
- High-speed train stop-schedule optimization based on passenger travel convenience (Q1793712) (← links)
- Railway computation for infinite linear systems (Q1871073) (← links)
- Optimising the travel time of a line plan (Q2336061) (← links)
- Branch-and-bound-based local search heuristics for train timetabling on single-track railway network (Q2358095) (← links)
- Cost optimal periodic train scheduling (Q2433233) (← links)
- The Steiner connectivity problem (Q2434988) (← links)
- Hybrid port--Hamiltonian systems: from parameterized incidence matrices to hybrid automata (Q2496810) (← links)
- Bicriteria train scheduling for high-speed passenger railroad planning applications (Q2566708) (← links)
- On solving multi-type railway line planning problems (Q2569037) (← links)
- Column generation approach to line planning with various halting patterns - application to the Korean high-speed railway (Q2853407) (← links)
- (Q2987089) (← links)
- Line planning, path constrained network flow and inapproximability (Q3076020) (← links)
- Line planning on tree networks with applications to the Quito Trolebús system (Q4910665) (← links)
- Data-Driven Transit Network Design at Scale (Q5031609) (← links)
- Simultaneous frequency and capacity setting for rapid transit systems with a competing mode and capacity constraints (Q5240130) (← links)
- On designing connected rapid transit networks reducing the number of transfers (Q5388152) (← links)
- Algorithms and Data Structures (Q5900754) (← links)
- Train stop scheduling problem: an exact approach using valid inequalities and polar duality (Q6087540) (← links)
- Public transport for smart cities: recent innovations and future challenges (Q6106754) (← links)
- Hyperloop system optimization (Q6173780) (← links)
- Minimizing recovery cost of network optimization problems (Q6179707) (← links)
- Line planning for different demand periods (Q6200776) (← links)
