Skip to Main content Skip to Navigation
Journal articles

A railroad maintenance problem solved with a cut and column generation matheuristic

Abstract : In this paper we address a real life optimization problem, the Rail Track Inspection Scheduling Problem (RTISP). This problem consists of scheduling railway network inspection tasks. The objective is to minimize the total deadhead distance while performing all inspection tasks. Different 0-1 integer formulations for the problem are presented. A heuristic based on both Benders and Dantzig-Wolfe decompositions is proposed to solve this rich arc routing problem. Its performance is analyzed on a real life dataset provided by the French national railway company (SNCF). The proposed algorithm is compared to a dynamic programming-based heuristic. Its ability to schedule the inspection tasks of one year on a sparse graph with thousand nodes and arcs is assessed.
Document type :
Journal articles
Complete list of metadata

Cited literature [23 references]  Display  Hide  Download
Contributor : Christian Artigues Connect in order to contact the contributor
Submitted on : Thursday, January 12, 2012 - 3:51:55 PM
Last modification on : Monday, July 4, 2022 - 10:24:44 AM
Long-term archiving on: : Monday, November 19, 2012 - 1:26:13 PM


Files produced by the author(s)


  • HAL Id : hal-00659349, version 1


Sébastien Lannez, Christian Artigues, Jean Damay, Michel Gendreau. A railroad maintenance problem solved with a cut and column generation matheuristic. Networks, Wiley, 2015, 66 (1), pp.40-56. ⟨hal-00659349⟩



Record views


Files downloads