A fast heuristic for the train scheduling problem
From MaRDI portal
Publication:1321800
DOI10.1016/0305-0548(94)90099-XzbMath0799.90068MaRDI QIDQ1321800
Publication date: 17 November 1994
Published in: Computers \& Operations Research (Search for Journal in Brave)
Integer programming (90C10) Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35)
Related Items (21)
Exact train pathing ⋮ A disjunctive graph model and framework for constructing new train schedules ⋮ A variable neighbourhood search for fast train scheduling and routing during disturbed railway traffic situations ⋮ An integer linear programming model for integrated train stop planning and timetabling with time-dependent passenger demand ⋮ Nominal and robust train timetabling problems ⋮ Mathematical model applied to single-track line scheduling problem in Brazilian railways ⋮ Optimizing schedules of rail train circulations by tabu search algorithm ⋮ Optimising a coal rail network under capacity constraints ⋮ Exact methods for the robotic cell problem ⋮ Railway track allocation: Models and methods ⋮ Optimizing the simplon railway corridor ⋮ Locating optimal timetables and vehicle schedules in a transit line ⋮ A column generation approach to train timetabling on a corridor ⋮ Approaches to modeling train scheduling problems as job-shop problems with blocking constraints ⋮ Balanced train timetabling on a single-line railway with optimized velocity ⋮ ACS-TS: Train scheduling using ant colony system ⋮ A Lagrangian heuristic algorithm for a real-world train timetabling problem ⋮ A sequencing approach for creating new train timetables ⋮ Mathematical solutions for solving periodic railway transportation ⋮ An efficient train scheduling algorithm on a single-track railway system ⋮ An experimental study of bicriteria models for robust timetabling
Cites Work
This page was built for publication: A fast heuristic for the train scheduling problem
