Mathematical Optimization for the Train Timetabling Problem

Stanojević, Predrag; Marić, Miroslav; Kratica, Jozef; Bojović, Nebojša; Milenković, Miloš

Mathematica Balkanica New Series (2010)

  • Volume: 24, Issue: 3-4, page 303-312
  • ISSN: 0205-3217

Abstract

top
AMS Subj. Classification: 90C57; 90C10;Rail transportation is very rich in terms of problems that can be modelled and solved using mathematical optimization techniques. The train scheduling problem as the most important part of a rail operating policy has a very significant impact on a rail company profit considering the fact that from the quality of a train timetable depends a flow of three most important resources on rail network: cars, locomotives and crews. The train timetabling problem aims at determining a periodic timetable for a set of trains that does not violate track capacities and satisfies some operational constraints. In this paper, we developed an integer programming approach for determining an optimal train schedule for a single, one-way track linking two major stations, with a number of intermediate stations between. The application has been tested on a realistic example suggested by the PE “Serbian Railways”. Obtained results show a potential for a practical application of proposed approach.

How to cite

top

Stanojević, Predrag, et al. "Mathematical Optimization for the Train Timetabling Problem." Mathematica Balkanica New Series 24.3-4 (2010): 303-312. <http://eudml.org/doc/11351>.

@article{Stanojević2010,
abstract = {AMS Subj. Classification: 90C57; 90C10;Rail transportation is very rich in terms of problems that can be modelled and solved using mathematical optimization techniques. The train scheduling problem as the most important part of a rail operating policy has a very significant impact on a rail company profit considering the fact that from the quality of a train timetable depends a flow of three most important resources on rail network: cars, locomotives and crews. The train timetabling problem aims at determining a periodic timetable for a set of trains that does not violate track capacities and satisfies some operational constraints. In this paper, we developed an integer programming approach for determining an optimal train schedule for a single, one-way track linking two major stations, with a number of intermediate stations between. The application has been tested on a realistic example suggested by the PE “Serbian Railways”. Obtained results show a potential for a practical application of proposed approach.},
author = {Stanojević, Predrag, Marić, Miroslav, Kratica, Jozef, Bojović, Nebojša, Milenković, Miloš},
journal = {Mathematica Balkanica New Series},
keywords = {Rail Transportation; Scheduling; Timetabling; Integer Programming; rail transportation; scheduling; timetabling; integer programming},
language = {eng},
number = {3-4},
pages = {303-312},
publisher = {Bulgarian Academy of Sciences - National Committee for Mathematics},
title = {Mathematical Optimization for the Train Timetabling Problem},
url = {http://eudml.org/doc/11351},
volume = {24},
year = {2010},
}

TY - JOUR
AU - Stanojević, Predrag
AU - Marić, Miroslav
AU - Kratica, Jozef
AU - Bojović, Nebojša
AU - Milenković, Miloš
TI - Mathematical Optimization for the Train Timetabling Problem
JO - Mathematica Balkanica New Series
PY - 2010
PB - Bulgarian Academy of Sciences - National Committee for Mathematics
VL - 24
IS - 3-4
SP - 303
EP - 312
AB - AMS Subj. Classification: 90C57; 90C10;Rail transportation is very rich in terms of problems that can be modelled and solved using mathematical optimization techniques. The train scheduling problem as the most important part of a rail operating policy has a very significant impact on a rail company profit considering the fact that from the quality of a train timetable depends a flow of three most important resources on rail network: cars, locomotives and crews. The train timetabling problem aims at determining a periodic timetable for a set of trains that does not violate track capacities and satisfies some operational constraints. In this paper, we developed an integer programming approach for determining an optimal train schedule for a single, one-way track linking two major stations, with a number of intermediate stations between. The application has been tested on a realistic example suggested by the PE “Serbian Railways”. Obtained results show a potential for a practical application of proposed approach.
LA - eng
KW - Rail Transportation; Scheduling; Timetabling; Integer Programming; rail transportation; scheduling; timetabling; integer programming
UR - http://eudml.org/doc/11351
ER -

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.