Branch-and-bound-based local search heuristics for train timetabling on single-track railway network
From MaRDI portal
Publication:2358095
DOI10.1007/S11067-015-9316-4zbMath1364.90157OpenAlexW2266144961MaRDI QIDQ2358095
Apisak Taptana, Ampol Karoonsoontawong
Publication date: 21 June 2017
Published in: Networks and Spatial Economics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11067-015-9316-4
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (4)
An efficient heuristic method for joint optimization of train scheduling and stop planning on double-track railway systems ⋮ A decomposition based hybrid heuristic algorithm for the joint passenger and freight train scheduling problem ⋮ Efficient insertion heuristic algorithms for multi-trip inventory routing problem with time windows, shift time limits and variable delivery time ⋮ Tabu search heuristic for joint location-inventory problem with stochastic inventory capacity and practicality constraints
Cites Work
- Combined gravity model trip distribution and paired combinatorial logit stochastic user equilibrium problem
- Combined route choice and adaptive traffic control in a day-to-day dynamical system
- Timetabling optimization of a mixed double- and single-tracked railway network
- A column generation approach to train timetabling on a corridor
- Non-cyclic train timetabling and comparability graphs
- An advanced real-time train dispatching system for minimizing the propagation of delays in a dispatching area under severe disturbances
- The influence of anticipating train driving on the dispatching process in railway conflict situations
- Optimal lines for railway systems
- A model predictive control approach for discrete-time rescheduling in complex central railway station areas
- Modeling business land use equilibrium for small firms' relocation and consumers' trip in a transportation network
- An algorithm for the one commodity pickup and delivery traveling salesman problem with restricted depot
- A train dispatching model under a stochastic environment: stable train routing constraints and reformulation
- A branch and bound algorithm for scheduling trains in a railway network
- Bicriteria train scheduling for high-speed passenger railroad planning applications
- Heuristic techniques for single line train scheduling
- Modeling Train Delays in Urban Networks
- Railway Timetabling Using Lagrangian Relaxation
- A Survey of Optimization Models for Train Routing and Scheduling
- Modeling and Solving the Train Timetabling Problem
- A Model, Algorithms and Strategy for Train Pathing
This page was built for publication: Branch-and-bound-based local search heuristics for train timetabling on single-track railway network
