Browse > Article

KTX Trainset Maintenance Routing and Allocation System for Korea High-Speed Rail  

Hong Soon-Hum (한국철도기술연구원 운영시스템연구그룹)
Kim Seongho (인하대학교 경영대학 경영학부)
Publication Information
Journal of the Korean Society for Railway / v.8, no.5, 2005 , pp. 391-397 More about this Journal
Abstract
In this paper we present a model for the maintenance routing construction and the trainset allocation (maintenance routing problem). The model solves the maintenance routing problem using column generation algorithm which was used to combine constraint programming and linear programming. Ilog-cplex was used to solve the linear programming model and Ilog-solver was used to solve the constraint programming model. The computational experience is also provided.
Keywords
Maintenance Routing; Trainset Allocation; Set Partitioning Problem; Column Generation Technique;
Citations & Related Records
연도 인용수 순위
  • Reference
1 Barnhart, C., E. L. Johnson, G. L. Nemhauser, M. W. P. Savelsbergh, and P. H. Vance (1998), 'Branch and Price: Column Generation for Huge Integer Programs,' Operations Research Vol.46, pp.316-329   DOI   ScienceOn
2 Booler, J. M. (1980), 'The Solution of Railway Locomotive Scheduling Problem,' Journal of the Operational Research Society, Vol.31, pp.943-948   DOI   ScienceOn
3 Ilog, ILOG Cplex 8.0 User's Mannual, (April 2001)
4 Wright, M. B. (1989), 'Applying Stochastic Algorithms to a Locomotive Scheduling Problem,' Journal of the Operational Research Society, Vol.40, pp.187-192   DOI   ScienceOn
5 Clampett, S. M., C. J. Timken, J. P. Chen, and C. P. Sebastian, 'Maintenance Station Planning,' AGIFORS proceedings, (Oct 20, 1986)
6 Ryan, D. M. and B. A. Foster, 'An Integer Programming Approach to Scheduling,' in A. Wren (ed.), Computer Scheduling of Public Transport Urban Passenger Vehicle and Crew Scheduling, North-Holland, Amsterdam (1981) 269-280
7 Ilog, ILOG Solver 5.1 User's Mannual, (April 2001)