Sciweavers

ATMOS
2010

Column Generation Heuristic for a Rich Arc Routing Problem

13 years 1 months ago
Column Generation Heuristic for a Rich Arc Routing Problem
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. 1998 ACM Subject Classification J.m [COMPUTER APPLICATIONS]: Miscellaneous Keywords and phrases arc routing, column generation, heuristic, railtrack maintenance Digital Object Identifier 10.4230/OASIcs.ATMOS.2010.130
Sébastien Lannez, Christian Artigues, Jean
Added 12 Jan 2011
Updated 12 Jan 2011
Type Journal
Year 2010
Where ATMOS
Authors Sébastien Lannez, Christian Artigues, Jean Damay, Michel Gendreau
Comments (0)