A multi scalable model based on a connexity graph representation

Laurent Gély Gilles Dessagne Pierre Pesneau 1, 2 François Vanderbeck 1, 2
2 Realopt - Reformulations based algorithms for Combinatorial Optimization
LaBRI - Laboratoire Bordelais de Recherche en Informatique, IMB - Institut de Mathématiques de Bordeaux, Inria Bordeaux - Sud-Ouest
Abstract : Train operations will be greatly enhanced with the development of new decision support systems. However, when considering problems such as online rescheduling of trains, experience shows a pitfall in the communication between the different elements that compose them, namely simulation software (in charge of projection, conflict detection, validation) and optimization tools (in charge of scheduling and decision making). The main problem is the inadequacy of the infrastructure's monolithic description and the inability to manage together different description levels. Simulation uses a very precise description, while the optimization of a mathematical problem usually does not. Indeed, an exhaustive description of the whole network is usually counter-productive in optimization problems; the description must be accurate, but should rely on a less precise representation. Unfortunately, the usual model representing the railway system does not guarantee compatibility between two different description levels; a representation usually corresponds to a given (unique) description level, designed in most cases with a specific application in mind, such as platforming. Moreover, further modifications that could improve performances or precision are usually impossible. We propose, therefore, a model with a new description of the infrastructure that permits one to scroll between different description levels. These operations can be automated via dynamic aggregation and disaggregation methods. They allow one to manage heterogeneous descriptions and cooperation between various tools using different description levels. This model is based on the connexity graph representation of the infrastructure resources. We will present how to generate corresponding mathematical models based on resource occupancy and will show how the aggregation of resources leads to the aggregation of properties (e.g. capacity) that can be translated into mathematical constraints in the optimization problem.
Type de document :
Communication dans un congrès
12th International Conference on Computer System Design and Operation in the Railways and other Transit Systems, COMPRAIL 2010, Aug 2010, Beijing, China. 114, pp.193-204, 2010, WIT Transactions on the Built Environment. 〈10.2495/CR100191〉
Liste complète des métadonnées

https://hal.inria.fr/inria-00547026
Contributeur : Pierre Pesneau <>
Soumis le : mercredi 15 décembre 2010 - 13:56:54
Dernière modification le : jeudi 11 janvier 2018 - 06:22:12

Lien texte intégral

Identifiants

Collections

Citation

Laurent Gély, Gilles Dessagne, Pierre Pesneau, François Vanderbeck. A multi scalable model based on a connexity graph representation. 12th International Conference on Computer System Design and Operation in the Railways and other Transit Systems, COMPRAIL 2010, Aug 2010, Beijing, China. 114, pp.193-204, 2010, WIT Transactions on the Built Environment. 〈10.2495/CR100191〉. 〈inria-00547026〉

Partager

Métriques

Consultations de la notice

1281