Graph coloring-based approach for railway station design analysis and capacity determination
From MaRDI portal
Publication:2189952
Recommendations
- A queuing network based optimization model for calculating capacity of subway station
- Stability evaluation of a railway timetable at station level
- An analytical approach to calculate the capacity of a railway system
- A multiobjective optimization for train routing at the high-speed railway station based on tabu search algorithm
- Optimisation models for expanding a railway's theoretical capacity
Cites work
- A Genetic Algorithm for Railway Scheduling Problems
- A solvable queueing network model for railway networks and its validation and applications for the Netherlands
- An analytical approach to calculate the capacity of a railway system
- An exact approach for the vertex coloring problem
- Exact weighted vertex coloring via branch-and-price
- Models and heuristic algorithms for a weighted vertex coloring problem
- Multi-objective models and techniques for analysing the absolute capacity of railway networks
- Optimisation models for expanding a railway's theoretical capacity
- Routing trains through a railway station based on a node packing model
- Routing trains through railway stations: Complexity issues
- Solution of a Large-Scale Traveling-Salesman Problem
- The vertex coloring problem and its generalizations
Cited in
(10)- A queuing network based optimization model for calculating capacity of subway station
- Stability evaluation of a railway timetable at station level
- An analytical approach to calculate the capacity of a railway system
- Capacity consumption analysis using heuristic solution method for under construction railway routes
- Multi-objective models and techniques for analysing the absolute capacity of railway networks
- Optimisation models for expanding a railway's theoretical capacity
- scientific article; zbMATH DE number 3841918 (Why is no real title available?)
- Bivariate fractal interpolation functions on triangular domain for numerical integration and approximation
- The connected Grundy coloring problem: formulations and a local-search enhanced biased random-key genetic algorithm
- Obtaining the Grundy chromatic number: how bad can my greedy heuristic coloring be?
This page was built for publication: Graph coloring-based approach for railway station design analysis and capacity determination
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2189952)