Column Generation Heuristic for a Rich Arc Routing Problem

Authors Sébastien Lannez, Christian Artigues, Jean Damay, Michel Gendreau

Thumbnail PDF


  • Filesize: 1.31 MB
  • 12 pages

Document Identifiers

Author Details

Sébastien Lannez
Christian Artigues
Jean Damay
Michel Gendreau

Cite AsGet BibTex

Sébastien Lannez, Christian Artigues, Jean Damay, and Michel Gendreau. Column Generation Heuristic for a Rich Arc Routing Problem. In 10th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS'10). Open Access Series in Informatics (OASIcs), Volume 14, pp. 130-141, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2010)


In this paper we address a real world optimisation problem, the Rail Track Inspection Scheduling Problem (RTISP). This problem consists of scheduling network inspection tasks. The objective is to minimise total deadhead distance. A mixed integer formulation of the problem is presented. A column generation based algorithm is proposed to solve this rich arc routing problem. Its performance is analysed by benchmarking a real world dataset from the French national railway company (SNCF). The efficiency of the algorithm is compared to an enhanced greedy algorithm. Its ability to schedule one year of inspection tasks on a sparse graph with thousand nodes, arcs and edges is assessed.
  • arc routing
  • column generation
  • heuristic
  • railtrack maintenance


  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    PDF Downloads