Reducing the Adaptation Costs of a Rolling Stock Schedule with Adaptive Solution: the Case of Demand Changes - ENSTA Paris - École nationale supérieure de techniques avancées Paris
Conference Papers Year : 2019

Reducing the Adaptation Costs of a Rolling Stock Schedule with Adaptive Solution: the Case of Demand Changes

Abstract

In railway scheduling, a nominal traffic schedule is established well in advance for the main resources: train-paths, rolling stock and crew. However, it has to be adapted each time a change in the input data occurs. In this paper, we focus on the costs in the adaptation phase. We introduce the concept of adaptive nominal solution which minimizes adaptation costs with respect to a given set of potential changes. We illustrate this framework with the rolling stock scheduling problem with scenarios corresponding to increasing demand in terms of rolling stock units. We define adaptation costs for a rolling stock schedule and propose two MILPs. The first one adapts, at minimal cost, an existing rolling stock schedule with respect to a given scenario. The second MILP considers a set of given scenarios and computes an adaptive nominal rolling stock schedule together with an adapted solution to each scenario, again while minimizing adaptation costs. We illustrate our models with computational experiments on realistic SNCF instances.
Fichier principal
Vignette du fichier
ecp19069056.pdf (777.43 Ko) Télécharger le fichier
Origin Publisher files allowed on an open archive
Loading...

Dates and versions

hal-02428735 , version 1 (03-02-2020)

Identifiers

  • HAL Id : hal-02428735 , version 1

Cite

Rémi Lucas, Zacharie Alès, François Ramond, Sourour Elloumi. Reducing the Adaptation Costs of a Rolling Stock Schedule with Adaptive Solution: the Case of Demand Changes. RailNorrköping 2019. 8th International Conference on Railway Operations Modelling and Analysis (ICROMA), Jun 2019, Norrköping, Sweden. pp.857-876. ⟨hal-02428735⟩
222 View
193 Download

Share

More