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

DOI10.1016/j.ejor.2020.04.057zbMath1443.90119OpenAlexW3027761999MaRDI QIDQ2189952

Ivan Belošević, Predrag Jovanović, Norbert Pavlović, Sanjin Milinković

Publication date: 17 June 2020

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

Full work available at URL: https://doi.org/10.1016/j.ejor.2020.04.057

zbMATH Keywords

capacitytraveling salesmangraph coloringrailway stationtrain route

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Transportation, logistics and supply chain management (90B06) Coloring of graphs and hypergraphs (05C15)

Cites Work

• An analytical approach to calculate the capacity of a railway system
• Multi-objective models and techniques for analysing the absolute capacity of railway networks
• Optimisation models for expanding a railway's theoretical capacity
• An exact approach for the vertex coloring problem
• Exact weighted vertex coloring via branch-and-price
• The vertex coloring problem and its generalizations
• Models and heuristic algorithms for a weighted vertex coloring problem
• Routing trains through railway stations: Complexity issues
• Routing trains through a railway station based on a node packing model
• A solvable queueing network model for railway networks and its validation and applications for the Netherlands
• A Genetic Algorithm for Railway Scheduling Problems
• Solution of a Large-Scale Traveling-Salesman Problem

This page was built for publication: Graph coloring-based approach for railway station design analysis and capacity determination