Routing trains through a railway station based on a node packing model

DOI10.1016/S0377-2217(00)00087-4zbMath0982.90004OpenAlexW2029372500MaRDI QIDQ1592731

Leo G. Kroon, Peter J. Zwaneveld, Stan P. M. van Hoesel

Publication date: 11 April 2002

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0377-2217(00)00087-4

zbMATH Keywords

timetablingbranch-and-cutrailway transportationrouting trainsnode packing problem

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Transportation, logistics and supply chain management (90B06) Combinatorial optimization (90C27) Traffic problems in operations research (90B20)

Related Items (16)

Solving the set packing problem via a maximum weighted independent set heuristic ⋮ Stability evaluation of a railway timetable at station level ⋮ A disjunctive graph model and framework for constructing new train schedules ⋮ Graph coloring-based approach for railway station design analysis and capacity determination ⋮ A multiobjective optimization for train routing at the high-speed railway station based on tabu search algorithm ⋮ Railway track allocation: Models and methods ⋮ Review of real-time vehicle schedule recovery methods in transportation services ⋮ Safe dike heights at minimal costs: an integer programming approach ⋮ Improving the robustness in railway station areas ⋮ Real time management of a metro rail terminus ⋮ A sequencing approach for creating new train timetables ⋮ An adaptive memory programming method for risk logistics operations ⋮ A fast approximation algorithm for solving the complete set packing problem ⋮ Design of a railway scheduling model for dense services ⋮ On solving multi-type railway line planning problems ⋮ Dynamic node packing

Uses Software

• CPLEX
• PESPLib

Cites Work

• Unnamed Item
• Routing trains through railway stations: Complexity issues
• A Mathematical Model for Periodic Scheduling Problems
• A Strong Cutting Plane/Branch-and-Bound Algorithm for Node Packing
• Solving Airline Crew Scheduling Problems by Branch-and-Cut
• Routing Trains Through Railway Stations: Model Formulation and Algorithms
• On the facial structure of set packing polyhedra

This page was built for publication: Routing trains through a railway station based on a node packing model