A Bi-Objective Railroad Track Inspection Planning Problem

Abstract

Track inspection, specifically automated ultrasonic inspections of railroad tracks, is one of the most important safety operations that State Department of Transportation and railroad companies need to plan. This study analyzes a track inspection scheduling problem (TISP) considering the practical constraints and objectives of track inspections. TISP is a bi-objective binary optimization problem, where the total time to complete the predetermined number of inspections on a given set of railroad tracks is minimized and the total weighted importance of the inspections is maximized. We explicitly consider the track inspection times, the travel times between tracks, and the time required between two consecutive inspections of the same track. Two greedy algorithms are proposed and used to approximate a set of Pareto efficient inspection schedules.

Meeting Name

IIE Annual Conference and Expo (2015: May 30-Jun. 2, Nashville, TN)

Department(s)

Engineering Management and Systems Engineering

Keywords and Phrases

Bi-Objective; Greedy Algorithm; Optimization; Track Inspection

International Standard Book Number (ISBN)

978-0983762447

Document Type

Article - Conference proceedings

Document Version

Citation

File Type

text

Language(s)

English

Rights

© 2015 Institute of Industrial Engineers (IIE), All rights reserved.

Publication Date

01 May 2015

This document is currently not available here.

Share

 
COinS