Afficher la notice abrégée

A multi scalable model based on a connexity graph representation

hal.structure.identifierSNCF : Innovation & Recherche
dc.contributor.authorGÉLY, Laurent
hal.structure.identifierSNCF : Innovation & Recherche
dc.contributor.authorDESSAGNE, Gilles
hal.structure.identifierInstitut de Mathématiques de Bordeaux [IMB]
hal.structure.identifierReformulations based algorithms for Combinatorial Optimization [Realopt]
dc.contributor.authorPESNEAU, Pierre
hal.structure.identifierInstitut de Mathématiques de Bordeaux [IMB]
hal.structure.identifierReformulations based algorithms for Combinatorial Optimization [Realopt]
dc.contributor.authorVANDERBECK, François
dc.date.accessioned2024-04-04T02:27:44Z
dc.date.available2024-04-04T02:27:44Z
dc.date.issued2010
dc.date.conference2010-08-31
dc.identifier.urihttps://oskar-bordeaux.fr/handle/20.500.12278/190043
dc.description.abstractEnTrain 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.
dc.language.isoen
dc.title.enA multi scalable model based on a connexity graph representation
dc.typeCommunication dans un congrès
dc.identifier.doi10.2495/CR100191
dc.subject.halInformatique [cs]/Recherche opérationnelle [cs.RO]
bordeaux.page193-204
bordeaux.volume114
bordeaux.hal.laboratoriesInstitut de Mathématiques de Bordeaux (IMB) - UMR 5251*
bordeaux.institutionUniversité de Bordeaux
bordeaux.institutionBordeaux INP
bordeaux.institutionCNRS
bordeaux.conference.title12th International Conference on Computer System Design and Operation in the Railways and other Transit Systems, COMPRAIL 2010
bordeaux.countryCN
bordeaux.conference.cityBeijing
bordeaux.peerReviewedoui
hal.identifierinria-00547026
hal.version1
hal.invitednon
hal.proceedingsoui
hal.conference.end2010-09-02
hal.popularnon
hal.audienceInternationale
hal.origin.linkhttps://hal.archives-ouvertes.fr//inria-00547026v1
bordeaux.COinSctx_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.date=2010&rft.volume=114&rft.spage=193-204&rft.epage=193-204&rft.au=G%C3%89LY,%20Laurent&DESSAGNE,%20Gilles&PESNEAU,%20Pierre&VANDERBECK,%20Fran%C3%A7ois&rft.genre=unknown


Fichier(s) constituant ce document

FichiersTailleFormatVue

Il n'y a pas de fichiers associés à ce document.

Ce document figure dans la(les) collection(s) suivante(s)

Afficher la notice abrégée