Solving the Curfew Planning Problem

Ashish K. Nemani (), Suat Bog () and Ravindra K. Ahuja ()
Additional contact information
Ashish K. Nemani: Department of Industrial and Systems Engineering, University of Florida, Gainesville, Florida 32611
Suat Bog: Department of Industrial and Systems Engineering, University of Florida, Gainesville, Florida 32611
Ravindra K. Ahuja: Innovative Scheduling, Inc., Gainesville Technology Enterprise Center (GTEC), Gainesville, Florida 32641, and Department of Industrial and Systems Engineering, University of Florida, Gainesville, Florida 32611

Transportation Science, 2010, vol. 44, issue 4, 506-523

Abstract: In this paper, we study the curfew planning problem (CPP) encountered by railroads for the maintenance of their railway tracks. The CPP is to design an optimal annual timetable to complete a given set of repairs and replacement jobs (rail work and tie work) on the railway tracks for a set of crews specialized in rail work (rail crew) or tie work (tie crew). We develop the work schedule for each crew such that the disruptions in train routes because of subdivision curfews are minimized. A subdivision is said to be under curfew if any crew is working in it. The solution to the problem must also satisfy several operational and regulatory requirements such as the crew continuity, time windows, the maximum interproject distance travelled by crews, etc. Our paper presents four solution approaches for the CPP: (i) time-space network model (TSNM), (ii) duty-generation model (DGM), (iii) column-generation model (CGM), and (iv) decomposition-based heuristics. We solve each model using CPLEX and present the computational results based on real-life instances.

Keywords: curfew planning; timetabling; track maintenance; column generation (search for similar items in EconPapers)
Date: 2010
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (4)

Downloads: (external link)
http://dx.doi.org/10.1287/trsc.1100.0323 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:ortrsc:v:44:y:2010:i:4:p:506-523

Access Statistics for this article

More articles in Transportation Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().