Allocation of Trains to Platforms at Railway Station

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989100%3A27230%2F13%3A86087686" target="_blank" >RIV/61989100:27230/13:86087686 - isvavai.cz</a>

Výsledek na webu

<a href="https://mme2013.vspj.cz/about-conference/conference-proceedings" target="_blank" >https://mme2013.vspj.cz/about-conference/conference-proceedings</a>

DOI - Digital Object Identifier

—

Jazyk výsledku

angličtina

Název v původním jazyce

Allocation of Trains to Platforms at Railway Station

Popis výsledku v původním jazyce

This paper deals with the organization of train traffic in a passenger railway stations. One of the important problems which a dispatcher has to solve very day is track allocation for every approaching train. There is a tool helping him in his job calledthe Track Occupancy Plan, which is attached to the train traffic diagram. The plans specify the scheduled times (of arrivals and departures), as well as the assignment of platform tracks to arriving or departing trains. In this paper the problem of allocation of trains to platforms is formulated as a bicriterion mixed integer programming problem. The first objective is to minimise the deviations of the arrival and departure times proposed by the model from the times specified by the timetable. The second criterion maximises the desirability of the platform tracks to be assigned to the trains. For finding a solution there is used a lexicographic approach and the local branching algorithm.

Název v anglickém jazyce

Allocation of Trains to Platforms at Railway Station

Popis výsledku anglicky

This paper deals with the organization of train traffic in a passenger railway stations. One of the important problems which a dispatcher has to solve very day is track allocation for every approaching train. There is a tool helping him in his job calledthe Track Occupancy Plan, which is attached to the train traffic diagram. The plans specify the scheduled times (of arrivals and departures), as well as the assignment of platform tracks to arriving or departing trains. In this paper the problem of allocation of trains to platforms is formulated as a bicriterion mixed integer programming problem. The first objective is to minimise the deviations of the arrival and departure times proposed by the model from the times specified by the timetable. The second criterion maximises the desirability of the platform tracks to be assigned to the trains. For finding a solution there is used a lexicographic approach and the local branching algorithm.

Druh

D - Stať ve sborníku

CEP obor

JO - Pozemní dopravní systémy a zařízení

OECD FORD obor

—

Projekt

—

Návaznosti

S - Specificky vyzkum na vysokych skolach

Rok uplatnění

2013

Kód důvěrnosti údajů

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Název statě ve sborníku

Mathematical Methods in Economics 2013 : 31st international conference : 11-13 September 2013, Jihlava, Czech Republic

ISBN

978-80-87035-76-4

ISSN

—

e-ISSN

—

Počet stran výsledku

6

Strana od-do

338 - 343

Název nakladatele

College of Polytechnics Jihlava

Místo vydání

Jihlava

Místo konání akce

Jihlava

Datum konání akce

11. 9. 2013

Typ akce podle státní příslušnosti

WRD - Celosvětová akce

Kód UT WoS článku

—