Pages that link to "Item:Q1652047"
From MaRDI portal
The following pages link to An adaptive neighborhood search metaheuristic for the integrated railway rapid transit network design and line planning problem (Q1652047):
Displaying 15 items.
- A general rapid network design, line planning and fleet investment integrated model (Q512985) (← links)
- On strategic multistage operational two-stage stochastic 0--1 optimization for the rapid transit network design problem (Q724143) (← links)
- The line planning routing game (Q1634301) (← links)
- Integrated approach to network design and frequency setting problem in railway rapid transit systems (Q1652202) (← links)
- An adaptive large neighbourhood search for asset protection during escaped wildfires (Q1652717) (← links)
- A quantitative approach for the long-term assessment of railway rapid transit network construction or expansion projects (Q2239999) (← links)
- Optimising the travel time of a line plan (Q2336061) (← links)
- GRASP algorithms for the robust railway network design problem (Q2359149) (← links)
- Variable neighborhood search for integrated timetable based design of railway infrastructure (Q2631246) (← links)
- Benders decomposition for network design covering problems (Q2669611) (← links)
- Solving real-size stochastic railway rapid transit network construction scheduling problems (Q2669704) (← links)
- Multi-constructor CMSA for the maximum disjoint dominating sets problem (Q6065657) (← links)
- Integrating train service route design with passenger flow allocation for an urban rail transit line (Q6087534) (← links)
- Designing metro network expansion: deterministic and robust optimization models (Q6146871) (← links)
- Timetable synchronization of the last several trains at night in an urban rail transit network (Q6555136) (← links)
