SHERP

A pragmatic algorithm for the train-set routing: The case of Korea high-speed railway

Cited 0 time in webofscience Cited 28 time in scopus
Authors
Hong, Sung-Pil; Kim, Kyung Min; Lee, Kyungsik; Park, Bum Hwan
Issue Date
2008-04-11
Publisher
Elsevier
Citation
Omega 2009;37(3):637-645
Keywords
Rail transportTrain-set routingMinimum cost flowMaintenance
Abstract
This paper presents a two-phased train-set routing algorithm to cover a weekly train timetable with minimal working days of a
minimal number of train-sets. First, relax maintenance requirements and obtain minimum cost routes by solving the polynomial
relaxation. Then, maintenance-feasible routes are generated from the crossovers of the minimum cost routes. This pragmatic
approach seems particularly effective for the high-speed railway systems, where the railway topology is relatively simple with
few end stations while the trains are frequent. Applied to the current weekly timetable of the Korea high-speed railway, we
could find an optimal feasible routing, which is an 8.8% improvement over the current routing generated by a set partitioning
approach based on a path generation scheme.
ISSN
0305-0483
Language
English
URI
http://hdl.handle.net/10371/5332
DOI
https://doi.org/10.1016/j.omega.2008.03.003

https://doi.org/10.1016/j.omega.2008.03.003
Files in This Item:
There are no files associated with this item.
Appears in Collections:
College of Engineering/Engineering Practice School (공과대학/대학원)Dept. of Industrial Engineering (산업공학과)Journal Papers (저널논문_산업공학과)
  • mendeley

Items in S-Space are protected by copyright, with all rights reserved, unless otherwise indicated.

Browse