Browse

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

DC Field Value Language
dc.contributor.authorHong, Sung-Pil-
dc.contributor.authorKim, Kyung Min-
dc.contributor.authorLee, Kyungsik-
dc.contributor.authorPark, Bum Hwan-
dc.date.accessioned2009-07-08T06:05:13Z-
dc.date.available2009-07-08T06:05:13Z-
dc.date.issued2008-04-11-
dc.identifier.citationOmega 2009;37(3):637-645en
dc.identifier.issn0305-0483-
dc.identifier.urihttp://hdl.handle.net/10371/5332-
dc.description.abstractThis 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.
en
dc.description.sponsorshipThis work was supported by Hankuk University of Foreign Studies Research Fund.en
dc.language.isoen-
dc.publisherElsevieren
dc.subjectRail transporten
dc.subjectTrain-set routingen
dc.subjectMinimum cost flowen
dc.subjectMaintenanceen
dc.titleA pragmatic algorithm for the train-set routing: The case of Korea high-speed railwayen
dc.typeArticleen
dc.contributor.AlternativeAuthor홍성필-
dc.contributor.AlternativeAuthor김경민-
dc.contributor.AlternativeAuthor이경식-
dc.contributor.AlternativeAuthor박범환-
dc.identifier.doi10.1016/j.omega.2008.03.003-
dc.identifier.doi10.1016/j.omega.2008.03.003-
dc.citation.journaltitleOmega-
Appears in Collections:
College of Engineering/Engineering Practice School (공과대학/대학원)Dept. of Industrial Engineering (산업공학과)Journal Papers (저널논문_산업공학과)
Files in This Item:
There are no files associated with this item.
  • mendeley

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

Browse