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

DOI10.1016/S0377-2217(00)00087-4MaRDI QIDQ1592731zbMATH OpenOpenAlexFDO

Authors Peter J. Zwaneveld, Leo Kroon, Stan 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

branch-and-cuttimetablingrailway transportationrouting trainsnode packing problem

Mathematics Subject Classification ID

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

Recommendations

• Routing Trains Through Railway Stations: Model Formulation and Algorithms
• Routing trains through railway stations: Complexity issues
• Railway track allocation by rapid branching
• A set packing inspired method for real-time junction train routing
• Formation of train routes in a station

Cites work

• scientific article; zbMATH DE number 956849 (Why is no real title available?)
• A Mathematical Model for Periodic Scheduling Problems
• A Strong Cutting Plane/Branch-and-Bound Algorithm for Node Packing
• On the facial structure of set packing polyhedra
• Routing Trains Through Railway Stations: Model Formulation and Algorithms
• Routing trains through railway stations: Complexity issues
• Solving Airline Crew Scheduling Problems by Branch-and-Cut

Cited in

(20)

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

Describes a project that uses

Uses Software

• PESPLib
• CPLEX

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1592731)