Publications
Detailed Information
A pragmatic algorithm for the train-set routing: The case of Korea high-speed railway
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Hong, Sung-Pil | - |
dc.contributor.author | Kim, Kyung Min | - |
dc.contributor.author | Lee, Kyungsik | - |
dc.contributor.author | Park, Bum Hwan | - |
dc.date.accessioned | 2012-03-05T02:30:20Z | - |
dc.date.available | 2012-03-05T02:30:20Z | - |
dc.date.issued | 2009-06-01 | - |
dc.identifier.citation | OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE; Vol.37 3; 637-645 | - |
dc.identifier.issn | 0305-0483 | - |
dc.identifier.uri | https://hdl.handle.net/10371/75334 | - |
dc.description.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. (c) 2008 Elsevier Ltd. All rights reserved. | - |
dc.language.iso | en | - |
dc.publisher | PERGAMON-ELSEVIER SCIENCE LTD | - |
dc.subject | Rail transport | - |
dc.subject | Minimum cost flow | - |
dc.subject | Maintenance | - |
dc.subject | Train-set routing | - |
dc.title | A pragmatic algorithm for the train-set routing: The case of Korea high-speed railway | - |
dc.type | Article | - |
dc.contributor.AlternativeAuthor | 홍성필 | - |
dc.contributor.AlternativeAuthor | 김경민 | - |
dc.contributor.AlternativeAuthor | 이경식 | - |
dc.contributor.AlternativeAuthor | 박범환 | - |
dc.identifier.doi | 10.1016/j.omega.2008.03.003 | - |
dc.citation.journaltitle | OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE | - |
dc.description.citedreference | Kuo CC, 2007, OMEGA-INT J MANAGE S, V35, P472, DOI 10.1016/j.omega.2005.09.003 | - |
dc.description.citedreference | Maroti G, 2007, COMPUT OPER RES, V34, P1121, DOI 10.1016/j.cor.2005.05.026 | - |
dc.description.citedreference | BUNTE S, 2006, OVERVIEW VEHICLE SCH | - |
dc.description.citedreference | Brucker P, 2003, J GLOBAL OPTIM, V27, P313 | - |
dc.description.citedreference | ANDEREGG L, 2003, P 5 WORKSH ALG ENG E | - |
dc.description.citedreference | Lingaya N, 2002, TRANSPORT RES B-METH, V36, P755 | - |
dc.description.citedreference | ZHAO P, 2002, COMPUTERS RAILWAYS, V8, P817 | - |
dc.description.citedreference | Cordeau JF, 2001, TRANSPORT RES B-METH, V35, P767 | - |
dc.description.citedreference | Erlebach T, 2001, LECT NOTES COMPUT SC, V2223, P390 | - |
dc.description.citedreference | GOPALAN R, 1998, OPERATIONS RES, V46 | - |
dc.description.citedreference | KHEDHER NB, 1998, INTERFACES, V28, P6 | - |
dc.description.citedreference | Ziarati K, 1997, EUR J OPER RES, V97, P281 | - |
dc.description.citedreference | Clarke L, 1997, ANN OPER RES, V69, P33 | - |
dc.description.citedreference | FORBES MA, 1997, J OPERATIONAL RES SO, V42 | - |
dc.description.citedreference | SCHRIJVER A, 1993, CWI Q, V6, P205 | - |
dc.description.citedreference | KABBANI NM, 1992, P 32 ANN S AGIFORS B | - |
dc.description.citedreference | BERTOSSI AA, 1987, NETWORKS, V17, P313 | - |
dc.description.citedreference | DANTZIG G, 1954, NAV RES LOG, V1, P217 | - |
dc.description.citedreference | CHUNG JW, INT J MANAG IN PRESS, DOI DOI 10.1016/J.OMEGA.2007.12.001 | - |
dc.description.tc | 2 | - |
dc.identifier.wosid | 000259851900014 | - |
- Appears in Collections:
- Files in This Item:
- There are no files associated with this item.
Item View & Download Count
Items in S-Space are protected by copyright, with all rights reserved, unless otherwise indicated.