Column generation heuristic for a rich arc routing problem - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2010

Column generation heuristic for a rich arc routing problem

Résumé

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.
Fichier principal
Vignette du fichier
article-RL.pdf (798.59 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00560749 , version 1 (29-01-2011)

Identifiants

Citer

Sébastien Lannez, Christian Artigues, Jean Damay, Michel Gendreau. Column generation heuristic for a rich arc routing problem. 10th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS'10), Sep 2010, Liverpool, United Kingdom. pp.130--141, ⟨10.4230/OASIcs.ATMOS.2010.130⟩. ⟨hal-00560749⟩
122 Consultations
160 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More