Graph coloring-based approach for railway station design analysis and capacity determination

• Published in: European journal of operational research Vol. 287; no. 1; pp. 348 - 360
• Main Authors: Jovanović, Predrag, Pavlović, Norbert, Belošević, Ivan, Milinković, Sanjin
• Format: Journal Article
• Language: English
• Published: Elsevier B.V 16.11.2020
• Subjects: Capacity; Graph coloring; Railway station; Train route; Traveling salesman; Train route; Graph coloring; Traveling salesman; Railway station; Capacity
• ISSN: 0377-2217; 1872-6860
• DOI: 10.1016/j.ejor.2020.04.057

•We propose a model for station capacity determination, independent of a timetable.•The model uses two-stage optimization approach that minimizes total occupation time of a station.•The number of sets of compatible routes is optimized by a weighted graph vertex coloring approach.•The total follow-up time between the sets is minimized by a traveling salesman problem.•We verify the model and test it on six station layouts. This study develops an optimization model for strategic decision-making in railway station design, enabling the comparison and selection of a station layout that maximizes the theoretical infrastructure capacity, completely independent of timetables. The model, using well-known combinatorial problems, such as the weighted vertex coloring problem and traveling salesman problem, identifies a route sequence that occupies a minimum amount of infrastructure and calculates the theoretical capacity. The model is tested on six different layouts for a station in the design phase, as well as on one fully operating station. The test results demonstrate the simplicity of implementing the model.