Bi-Objective Track Inspection Scheduling: Formulation and Solution Analysis

Abstract

One of the most important railroad safety operations that State Departments of Transportation and/or railroad companies need to plan is the inspection of railroad tracks. In this study, the authors formulate and solve a track inspection scheduling problem with practical restrictions and realistic objectives. Specifically, they model a bi-objective mixed-integer optimization problem where the total time to complete the predetermined number of inspections on a given set of railroad tracks is minimized while the total weighted inspection is maximized. They explicitly consider the travel time from one track to another and the time required between two consecutive inspections of the same track. They propose a genetic algorithm to approximate a set of Pareto efficient schedules for the resulting model and compare it with a naïve greedy approach that can be used for inspection scheduling. Their results indicate that the proposed solution method finds improved schedules not only in terms of total time but also better weighted inspections.

Meeting Name

Transportation Research Board 94th Annual Meeting (2015: Jan. 11-15, Washington, DC)

Department(s)

Engineering Management and Systems Engineering

Comments

This paper was sponsored by TRB committee AR060 Railway Maintenance.

Document Type

Article - Conference proceedings

Document Version

Citation

File Type

text

Language(s)

English

Rights

© 2015 Transportation Research Board, All rights reserved.

Publication Date

01 Jan 2015

Link to Full Text

Share

 
COinS