Variable and adaptive neighbourhood search algorithms for rail rapid transit timetabling problem
From MaRDI portal
Publication:1652109
DOI10.1016/j.cor.2015.12.011zbMath1391.90271OpenAlexW2218174087MaRDI QIDQ1652109
Erfan Hassannayebi, Seyed Hessameddin Zegordi
Publication date: 11 July 2018
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2015.12.011
Transportation, logistics and supply chain management (90B06) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (7)
An efficient heuristic method for joint optimization of train scheduling and stop planning on double-track railway systems ⋮ Integrated optimization of train timetable, rolling stock assignment and short-turning strategy for a metro line ⋮ Scheduling local and express trains in suburban rail transit lines: mixed-integer nonlinear programming and adaptive genetic algorithm ⋮ Collaborative optimization of last-train timetables for metro network to increase service time for passengers ⋮ Timetable coordination in a rail transit network with time-dependent passenger demand ⋮ Integrated rolling stock deadhead routing and timetabling in urban rail transit lines ⋮ Vehicle dispatching plan for minimizing passenger waiting time in a corridor with buses of different sizes: model formulation and solution approaches
Cites Work
- Variable neighborhood search for the bi-objective post-sales network design problem: a fitness landscape analysis approach
- Variable neighbourhood search: methods and applications
- A global optimization algorithm using adaptive random search
- A procedure to adjust transit trip departure times through minimizing the maximum headway
- Stochastic adaptive search for global optimization.
- An optimization to schedule train operations with phase-regular framework for intercity rail lines
- Exact formulations and algorithm for the train timetabling problem with dynamic demand
- Modelling and optimization of average travel time for a metro line by simulation and response surface methodology
- Nonlinear inertia weight variation for dynamic adaptation in particle swarm optimization
- The demand-dependent optimization of regular train timetables
- Estimating bus passenger waiting times from incomplete bus arrivals data
- A methodology for generation of optimal schedules for an underground railway system
This page was built for publication: Variable and adaptive neighbourhood search algorithms for rail rapid transit timetabling problem
