Pages that link to "Item:Q2285990"
From MaRDI portal
The following pages link to A simulated annealing algorithm for first train transfer problem in urban railway networks (Q2285990):
Displaying 9 items.
- A simulated annealing approach for the multi-periodic rail-car fleet sizing problem (Q1000958) (← links)
- Mathematical analysis and an exact solution combined with preprocessing method for resynchronizing of bus timetable problem (Q1721431) (← links)
- Synchronizing last trains of urban rail transit system to better serve passengers from late night trains of high-speed railway lines (Q2005942) (← links)
- An innovative flower pollination algorithm for continuous optimization problem (Q2182960) (← links)
- Strategic timetable scheduling for last trains in urban railway transit networks (Q2290115) (← links)
- Timetable coordination of first trains in urban railway network: a case study of Beijing (Q2293454) (← links)
- Modeling formulation and a new heuristic for the railroad blocking problem (Q2295212) (← links)
- Transfer-oriented dispatching optimization of rail transit network (Q3132116) (← links)
- Application of improved meta-heuristic algorithms for green preservation technology management to optimize dynamical investments and replenishment strategies (Q6104708) (← links)
