Heuristics for railway infrastructure saturation

Abstract : This research concerns the problem of the evaluation of the railway infrastructure capacity. It is an important question when railway authorities have to choose between different infrastructure investment projects. We developped independently two heuristic approaches to solve the infrastructure saturation problem. The first is based on a constraint programming model which is solved using a greedy heuristic. The second approach identifies the saturation problem as a unicost set packing problem and its resolution is ensured by an adaption of GRASP metaheuristic. Currently, both resolution techniques are not in competition. The goal is to grasp the resolution ability of the heuristics and to analyse the kind of solutions produced. The Pierrefitte-Gonesse junction has been used as experimental support. A software environment allows to simulate several timetables involving TGV, Inter City and Freight trains.
Type de document :
Article dans une revue
Electronic Notes in Theoretical Computer Science, Elsevier, 2001, 50 (1), pp.39 - 53. 〈10.1016/S1571-0661(04)00164-1〉
Liste complète des métadonnées

Contributeur : Xavier Gandibleux <>
Soumis le : lundi 8 mars 2010 - 11:15:35
Dernière modification le : vendredi 7 décembre 2018 - 12:50:03

Lien texte intégral




Xavier Delorme, Joaquín Rodriguez, Xavier Gandibleux. Heuristics for railway infrastructure saturation. Electronic Notes in Theoretical Computer Science, Elsevier, 2001, 50 (1), pp.39 - 53. 〈10.1016/S1571-0661(04)00164-1〉. 〈hal-00462018〉



Consultations de la notice