Premium
A Heuristic Approach to the Railroad Track Maintenance Scheduling Problem
Author(s) -
Peng Fan,
Kang Seungmo,
Li Xiaopeng,
Ouyang Yanfeng,
Somani Kamalesh,
Acharya Dharma
Publication year - 2011
Publication title -
computer‐aided civil and infrastructure engineering
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 2.773
H-Index - 82
eISSN - 1467-8667
pISSN - 1093-9687
DOI - 10.1111/j.1467-8667.2010.00670.x
Subject(s) - serviceability (structure) , time horizon , scheduling (production processes) , computer science , operations research , track (disk drive) , heuristic , mathematical optimization , engineering , mathematics , civil engineering , artificial intelligence , operating system
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%.