Abstract
This article addresses the train-sequencing problem encountered in the Korean railway. It first presents a mixed integer programming model for the problem, in which the mileage must be balanced for each train route, while various field constraints must be satisfied, including overnight stay capacity and maintenance allocation restrictions. Then, it proposes a hybrid genetic algorithm as a solution approach to the problem. The proposed algorithm utilizes a modified elite group technique along with two heuristic procedures based on the mixed integer programming model. Finally, the proposed solution approach is tested with real-world data from the Korean railway. Numerical experiments under different conditions indicate that the proposed solution approach to the train-sequencing problem is promising.
Original language | English |
---|---|
Pages (from-to) | 555-565 |
Number of pages | 11 |
Journal | Omega |
Volume | 37 |
Issue number | 3 |
DOIs | |
Publication status | Published - 2009 Jun |
Keywords
- Genetic algorithm
- Integer programming
- Rail transport
- Train sequencing
ASJC Scopus subject areas
- Strategy and Management
- Management Science and Operations Research
- Information Systems and Management