Formulation and Solution Approaches to the Rail Maintenance Production Gang Scheduling Problem

• Published in: Journal of transportation engineering Vol. 136; no. 8; pp. 701 - 708
• Main Authors: Gorman, Michael F, Kanet, John J
• Format: Journal Article
• Language: English
• Published: New York American Society of Civil Engineers 01.08.2010
• Subjects: Integer programming; Mathematical models; Railroad transportation; Railway networks; Repair & maintenance; Scheduling algorithms; SPECIAL SECTION: Railroad Engineering
• ISSN: 0733-947X; 1943-5436
• DOI: 10.1061/(ASCE)0733-947X(2010)136:8(701)

The rail industry spends billions of dollars each year on maintenance and renewal of its track infrastructure. The scheduling of these maintenance projects is extremely complex, with numerous hard and soft cost trade-offs and job scheduling constraints. Scheduling requires consideration of efficient maintenance production “gang” routing around the rail network while paying close attention to any train delay such maintenance projects might cause. Despite this importance and complexity, the subject has been largely ignored in the literature. We evaluate two formulations (time-space network mixed integer program and job scheduling) and three modeling formulation and solution methodologies (integer programming, constraint programming, and genetic algorithms) for scheduling rail gangs to annual renewal projects and discuss their relative merits in terms of parsimony of model formulation, solution time, and solution quality. The purpose of this paper is to identify the most fruitful avenues for further research on this novel application.