Afficher la notice abrégée

dc.contributor.authorCacchiani, Valentina
dc.contributor.authorFurini, Fabio
dc.contributor.authorKidd, Martin Philip
dc.date.accessioned2017-03-17T17:10:51Z
dc.date.available2017-03-17T17:10:51Z
dc.date.issued2016
dc.identifier.issn0305-0483
dc.identifier.urihttps://basepub.dauphine.fr/handle/123456789/16384
dc.language.isoenen
dc.subjectTrain Timetablingen
dc.subjectInteger Linear Programmingen
dc.subjectRelaxationen
dc.subjectHeuristic algorithmen
dc.subject.ddc519en
dc.subject.classificationjelC61en
dc.titleApproaches to a real-world Train Timetabling Problem in a railway nodeen
dc.typeArticle accepté pour publication ou publié
dc.description.abstractenWe consider the Train Timetabling Problem (TTP) in a railway node (i.e. a set of stations in an urban area interconnected by tracks), which calls for determining the best schedule for a given set of trains during a given time horizon, while satisfying several track operational constraints. In particular, we consider the context of a highly congested railway node in which different Train Operators wish to run trains according to timetables that they propose, called ideal timetables. The ideal timetables altogether may be (and usually are) conflicting, i.e. they do not respect one or more of the track operational constraints. The goal is to determine conflict-free timetables that differ as little as possible from the ideal ones.The problem was studied for a research project funded by Rete Ferroviaria Italiana (RFI), the main Italian railway Infrastructure Manager, who also provided us with real-world instances. We present an Integer Linear Programming (ILP) model for the problem, which adapts previous ILP models from the literature to deal with the case of a railway node. The Linear Programming (LP) relaxation of the model is used to derive a dual bound. In addition, we propose an iterative heuristic algorithm that is able to obtain good solutions to real-world instances with up to 1500 trains in short computing times. The proposed algorithm is also used to evaluate the capacity saturation of the railway nodes.en
dc.relation.isversionofjnlnameOmega
dc.relation.isversionofjnlvol58en
dc.relation.isversionofjnldate2016-01
dc.relation.isversionofjnlpages97-110en
dc.relation.isversionofdoi10.1016/j.omega.2015.04.006en
dc.relation.isversionofjnlpublisherPergamon Pressen
dc.subject.ddclabelProbabilités et mathématiques appliquéesen
dc.relation.forthcomingnonen
dc.relation.forthcomingprintnonen
dc.description.ssrncandidatenonen
dc.description.halcandidateouien
dc.description.readershiprechercheen
dc.description.audienceInternationalen
dc.relation.Isversionofjnlpeerreviewedouien
dc.relation.Isversionofjnlpeerreviewedouien
dc.date.updated2017-03-17T17:02:13Z
hal.person.labIds461036
hal.person.labIds989
hal.person.labIds461036
hal.identifierhal-01492033*


Fichiers attachés à cette notice

FichiersTailleFormatConsulter

Il n'y a pas de fichiers associés à cette notice.

Ce document fait partie de la (des) collection(s) suivante(s)

Afficher la notice abrégée