A Heuristic Approach to the Railroad Track Maintenance Scheduling Problem

Fan Peng, Seungmo Kang, Xiaopeng Li, Yanfeng Ouyang, Kamalesh Somani, Dharma Acharya

Research output: Contribution to journalArticle

56 Citations (Scopus)

Abstract

Every year, billions of dollars are spent on rail track maintenance to keep the serviceability of the railroad network. These maintenance projects (of different types) must be performed by suitable maintenance teams within a planning horizon. This article presents a time-space network model to solve the track maintenance scheduling problem (TMSP). The objective is to minimize the total travel costs of the maintenance teams as well as the impact of maintenance projects on railroad operation, which are formulated by three types of side constraints: mutually exclusive, time window, and precedence constraints. An iterative heuristic solution approach is proposed to solve the large-scale TMSP model with a large number of side constraints. The proposed model and solution approach are applied to a large-scale real-world problem. Compared to the current industry practice the model outcome eliminated all hard side-constraint violations and reduced the total objective value (travel costs and soft side-constraint violation penalties) by 66.8%.

Original languageEnglish
Pages (from-to)129-145
Number of pages17
JournalComputer-Aided Civil and Infrastructure Engineering
Volume26
Issue number2
DOIs
Publication statusPublished - 2011 Feb 1
Externally publishedYes

Fingerprint

Railroad tracks
Scheduling
Railroads
Rails
Costs
Planning
Industry

ASJC Scopus subject areas

  • Civil and Structural Engineering
  • Computer Science Applications
  • Computational Theory and Mathematics
  • Computer Graphics and Computer-Aided Design

Cite this

A Heuristic Approach to the Railroad Track Maintenance Scheduling Problem. / Peng, Fan; Kang, Seungmo; Li, Xiaopeng; Ouyang, Yanfeng; Somani, Kamalesh; Acharya, Dharma.

In: Computer-Aided Civil and Infrastructure Engineering, Vol. 26, No. 2, 01.02.2011, p. 129-145.

Research output: Contribution to journalArticle

Peng, Fan ; Kang, Seungmo ; Li, Xiaopeng ; Ouyang, Yanfeng ; Somani, Kamalesh ; Acharya, Dharma. / A Heuristic Approach to the Railroad Track Maintenance Scheduling Problem. In: Computer-Aided Civil and Infrastructure Engineering. 2011 ; Vol. 26, No. 2. pp. 129-145.
@article{cba0f08b29de42dd8ac4b8d53d6c86c1,
title = "A Heuristic Approach to the Railroad Track Maintenance Scheduling Problem",
abstract = "Every year, billions of dollars are spent on rail track maintenance to keep the serviceability of the railroad network. These maintenance projects (of different types) must be performed by suitable maintenance teams within a planning horizon. This article presents a time-space network model to solve the track maintenance scheduling problem (TMSP). The objective is to minimize the total travel costs of the maintenance teams as well as the impact of maintenance projects on railroad operation, which are formulated by three types of side constraints: mutually exclusive, time window, and precedence constraints. An iterative heuristic solution approach is proposed to solve the large-scale TMSP model with a large number of side constraints. The proposed model and solution approach are applied to a large-scale real-world problem. Compared to the current industry practice the model outcome eliminated all hard side-constraint violations and reduced the total objective value (travel costs and soft side-constraint violation penalties) by 66.8{\%}.",
author = "Fan Peng and Seungmo Kang and Xiaopeng Li and Yanfeng Ouyang and Kamalesh Somani and Dharma Acharya",
year = "2011",
month = "2",
day = "1",
doi = "10.1111/j.1467-8667.2010.00670.x",
language = "English",
volume = "26",
pages = "129--145",
journal = "Computer-Aided Civil and Infrastructure Engineering",
issn = "1093-9687",
publisher = "Wiley-Blackwell",
number = "2",

}

TY - JOUR

T1 - A Heuristic Approach to the Railroad Track Maintenance Scheduling Problem

AU - Peng, Fan

AU - Kang, Seungmo

AU - Li, Xiaopeng

AU - Ouyang, Yanfeng

AU - Somani, Kamalesh

AU - Acharya, Dharma

PY - 2011/2/1

Y1 - 2011/2/1

N2 - Every year, billions of dollars are spent on rail track maintenance to keep the serviceability of the railroad network. These maintenance projects (of different types) must be performed by suitable maintenance teams within a planning horizon. This article presents a time-space network model to solve the track maintenance scheduling problem (TMSP). The objective is to minimize the total travel costs of the maintenance teams as well as the impact of maintenance projects on railroad operation, which are formulated by three types of side constraints: mutually exclusive, time window, and precedence constraints. An iterative heuristic solution approach is proposed to solve the large-scale TMSP model with a large number of side constraints. The proposed model and solution approach are applied to a large-scale real-world problem. Compared to the current industry practice the model outcome eliminated all hard side-constraint violations and reduced the total objective value (travel costs and soft side-constraint violation penalties) by 66.8%.

AB - Every year, billions of dollars are spent on rail track maintenance to keep the serviceability of the railroad network. These maintenance projects (of different types) must be performed by suitable maintenance teams within a planning horizon. This article presents a time-space network model to solve the track maintenance scheduling problem (TMSP). The objective is to minimize the total travel costs of the maintenance teams as well as the impact of maintenance projects on railroad operation, which are formulated by three types of side constraints: mutually exclusive, time window, and precedence constraints. An iterative heuristic solution approach is proposed to solve the large-scale TMSP model with a large number of side constraints. The proposed model and solution approach are applied to a large-scale real-world problem. Compared to the current industry practice the model outcome eliminated all hard side-constraint violations and reduced the total objective value (travel costs and soft side-constraint violation penalties) by 66.8%.

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

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

U2 - 10.1111/j.1467-8667.2010.00670.x

DO - 10.1111/j.1467-8667.2010.00670.x

M3 - Article

VL - 26

SP - 129

EP - 145

JO - Computer-Aided Civil and Infrastructure Engineering

JF - Computer-Aided Civil and Infrastructure Engineering

SN - 1093-9687

IS - 2

ER -