Konferensartikel

A Graph Application for Design and Capacity Analysis of Railway Junctions

Predrag Jovanovic
Faculty of Transport and Traffic Engineering, University of Belgrade, Belgrade, Serbia

Norbert Pavlovic
Faculty of Transport and Traffic Engineering, University of Belgrade, Belgrade, Serbia

Ivan Belosevic
Faculty of Transport and Traffic Engineering, University of Belgrade, Belgrade, Serbia

Sanjin Milinkovic
Faculty of Transport and Traffic Engineering, University of Belgrade, Belgrade, Serbia

Ladda ner artikel

Ingår i: RailNorrköping 2019. 8th International Conference on Railway Operations Modelling and Analysis (ICROMA), Norrköping, Sweden, June 17th – 20th, 2019

Linköping Electronic Conference Proceedings 69:33, s. 491-507

Visa mer +

Publicerad: 2019-09-13

ISBN: 978-91-7929-992-7

ISSN: 1650-3686 (tryckt), 1650-3740 (online)

Abstract

In this paper, we developed an analytical model for strategic decision making, for selection of the best solution of the junction layout according to the maximum theoretical infrastruc-ture capacity, completely independent of the timetable. Model achieves triple effects as it enables the selection of the most favorable route sequence, as well as the theoretical capac-ity calculation. The model uses well known combinatorial problems on graphs, Weighted Vertex Coloring Problem (WVCP) and Traveling Salesman Problem (TSP) to determine the minimum time of the infrastructure occupancy. The model is tested on three different junction layouts.

Nyckelord

Railway Junction, Capacity, Weighted Vertex Coloring Problem, Traveling Salesman Problem

Referenser

Inga referenser tillgängliga

Citeringar i Crossref