A hybrid genetic algorithm for train sequencing in the Korean railway

Ji Won Chung, Seog Moon Oh, In Chan Choi

Research output: Contribution to journalArticle

52 Citations (Scopus)

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 languageEnglish
Pages (from-to)555-565
Number of pages11
JournalOmega
Volume37
Issue number3
DOIs
Publication statusPublished - 2009 Jun 1

Fingerprint

Sequencing
Hybrid genetic algorithm
Train
Railway
Mixed integer programming
Elites
Numerical experiment
Heuristics

Keywords

  • Genetic algorithm
  • Integer programming
  • Rail transport
  • Train sequencing

ASJC Scopus subject areas

  • Strategy and Management
  • Information Systems and Management
  • Management Science and Operations Research

Cite this

A hybrid genetic algorithm for train sequencing in the Korean railway. / Chung, Ji Won; Oh, Seog Moon; Choi, In Chan.

In: Omega, Vol. 37, No. 3, 01.06.2009, p. 555-565.

Research output: Contribution to journalArticle

Chung, Ji Won ; Oh, Seog Moon ; Choi, In Chan. / A hybrid genetic algorithm for train sequencing in the Korean railway. In: Omega. 2009 ; Vol. 37, No. 3. pp. 555-565.
@article{7cc75ac87e7942fe94fca3f1e40ee7e6,
title = "A hybrid genetic algorithm for train sequencing in the Korean railway",
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.",
keywords = "Genetic algorithm, Integer programming, Rail transport, Train sequencing",
author = "Chung, {Ji Won} and Oh, {Seog Moon} and Choi, {In Chan}",
year = "2009",
month = "6",
day = "1",
doi = "10.1016/j.omega.2007.12.001",
language = "English",
volume = "37",
pages = "555--565",
journal = "Omega (United Kingdom)",
issn = "0305-0483",
publisher = "Elsevier BV",
number = "3",

}

TY - JOUR

T1 - A hybrid genetic algorithm for train sequencing in the Korean railway

AU - Chung, Ji Won

AU - Oh, Seog Moon

AU - Choi, In Chan

PY - 2009/6/1

Y1 - 2009/6/1

N2 - 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.

AB - 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.

KW - Genetic algorithm

KW - Integer programming

KW - Rail transport

KW - Train sequencing

UR - http://www.scopus.com/inward/record.url?scp=50649089826&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=50649089826&partnerID=8YFLogxK

U2 - 10.1016/j.omega.2007.12.001

DO - 10.1016/j.omega.2007.12.001

M3 - Article

AN - SCOPUS:50649089826

VL - 37

SP - 555

EP - 565

JO - Omega (United Kingdom)

JF - Omega (United Kingdom)

SN - 0305-0483

IS - 3

ER -