Journal of the Korean Society for Railway (한국철도학회논문집)

The Korean Society for Railway (한국철도학회)
권호 표지

An Enumeration Algorithm for Generating the Candidate Routings in a Set Partitioning Problem Approach to the Rolling Stock Requirement Plan

철도차량소요계획에 대한 집합분할문제 접근에서 후보운용생성을 위한 열거알고리즘

  • 김성호 (인하대학교 경영대학 경영학부) ;
  • 김동희 (한국철도기술연구원 운영시스템연구그룹) ;
  • 최태성 (인하대학교 경영대학 경영학부)
  • Published : 2004.12.01
Download PDF
⟨ Previous Next ⟩

Abstract

A routing is the path that an actual trainset follows as it moves from one train to another train in a timetable. The number of routings is equivalent to the number of trainsets required to cover the timetable. The primary factors of rolling stock requirement plan include evaluating the minimum number of routings. This can be formulated as a set partitioning problem and solved using enumeration method or column generation method. In this paper we presents an enumeration algorithm which is useful to implement the enumeration method for the rolling stock requirement plan.

Keywords

References

  1. Barnhart, C., E. L. Johnson, G. L. Nemhauser, M. W. P. Savelsbergh, and P. H. Vance (1996), Branch-and-Price: Column Generation for Solving Huge Integer Programs, Georgia Institute of Technology, School of Industrial and Systems Engineering
  2. Ben Khedher, N., J. Kintanar, C. Queille, and W. Stripling (1998), 'Schedule Optimization at SNCF: From Conception to Day of Departure,' Interfaces, Vol.28, No.l, pp.6-23 https://doi.org/10.1287/inte.28.1.6
  3. Ben Khedher, N., J. Kintanar, C. Queille, and W. Stripling (1998), 'Schedule Optimization at SNCF: From Conception to Day of Departure,' Interfaces, Vol.28, No.l, pp.6-23 https://doi.org/10.1287/inte.28.1.6
  4. Deboo, N. M. (1973), Aircraft Routing and Maintenance Assignment System : An Aid in Developing Airline Schedules, 13th AGIFORS Symposium, Acapulco, Mexico
  5. De Silva, A. (2001), 'Combining Constraint Programming and Linear Programming on an Example of Bus Driver Scheduling,' Annals of Operations Research, Vol.108, pp.277-291 https://doi.org/10.1023/A:1016075431943
  6. Desrochers, M., and F. Soumis (1988), 'A Generalized Permanent Labelling Algorithm for the Shortest Path Problem with Time Windows,' Infor, Vol.26, No.3, pp.191-211
  7. Forbes, M. A., J. N. Holt, and A. M. Watts (1991), 'Exact Solution of Locomotive Scheduling Problems,' Journal of the Operational Research Society, Vol.42, No.10, pp.825-831 https://doi.org/10.1057/jors.1991.163
  8. Josuttis, N. M. (1999), The C++ Standard Library: A Tutorial and Reference, Indianapolis, IN, Addison-Wesley
  9. Neapolitan, R. E., and K. Naimipour (2004), Foundations of ALG0RITHMS Using C++ Pseudocode, 3rd Edition, Jones and Bartlett Publishers Inc., MA
  10. Simpson, R. W. (1969), A Review of Scheduling and Routing Models for Airline Scheduling, 9th AGIFORS Symposium, Broadway, England
  11. Teodorovic, D. (1988), Airline Operations Research. Transportation Studies (N. Ashford, and W. G. Bell, Eds.) Gordon and Breach Science Publishers, New York
  12. Wright, M. B. (1989), 'Applying Stochastic Algorithms to a Locomotive Scheduling Problem,' JournaI of the Operational Research Society, Vol.40, No.2, pp.187-192 https://doi.org/10.1057/jors.1989.23
  13. Ziarati, K., F. Soumis, J. Desrosiers, S. Gelinas, and A. Saintonge (1997), 'Locomotive Assignment with Heterogeneous Consists at CN North America,' European Journal of Operational Research, Vol.97, pp.281-292 https://doi.org/10.1016/S0377-2217(96)00198-1