A decomposition based hybrid heuristic algorithm for the joint passenger and freight train scheduling problem
From MaRDI portal
Publication:1652413
DOI10.1016/j.cor.2017.06.009zbMath1391.90286OpenAlexW2624758867MaRDI QIDQ1652413
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.2017.06.009
Mixed integer programming (90C11) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (3)
A logic-based Benders decomposition for microscopic railway timetable planning ⋮ Set covering heuristics in a benders decomposition for railway timetabling ⋮ An efficient train scheduling algorithm on a single-track railway system
Cites Work
- A note on two problems in connexion with graphs
- Railway track allocation: Models and methods
- A column generation approach to train timetabling on a corridor
- Scheduling trains as a blocking parallel-machine job shop scheduling problem
- Job-shop scheduling with blocking and no-wait constraints
- Adjusting a railway timetable in case of partial or complete blockades
- Branch-and-bound-based local search heuristics for train timetabling on single-track railway network
- A branch and bound algorithm for scheduling trains in a railway network
- A Lagrangian heuristic algorithm for a real-world train timetabling problem
- Railway Timetabling Using Lagrangian Relaxation
- A Survey of Optimization Models for Train Routing and Scheduling
- 04. Solution of the Train Platforming Problem
- Modeling and Solving the Train Timetabling Problem
- Finding the k Shortest Paths
This page was built for publication: A decomposition based hybrid heuristic algorithm for the joint passenger and freight train scheduling problem
