A Greedy Heuristic for Optimizing Metro Regenerative Energy Usage - INRIA - Institut National de Recherche en Informatique et en Automatique Accéder directement au contenu
Communication Dans Un Congrès Année : 2014

A Greedy Heuristic for Optimizing Metro Regenerative Energy Usage

Résumé

When the regenerative braking energy cannot be stored by the metro producing it, it has to be used instantaneously on the network, otherwise it is lost. In this case, the accelerating and braking trains need be synchronized to fully benefit from the regenerative energy, and a metro timetable is energetically optimized when all the re-generative braking is utilized to power other trains. This synchronization consists in lining up each braking train with an accelerating one in its neighbourhood. Doing so, the latter will benefit from the regenerative energy of the former. We propose a fast greedy heuristic to tackle the problem of minimizing the energy consumption of a metro timetable by modifying solely the dwell times in stations. This heuristic is compared to a state-of-the-art meta heuristic called the covariance matrix adaptation evolution strategy (CMA-ES) and shows similar results with much faster computation time. Finally, we show that a run of the algorithm on a full timetable may reduce its energy consumption by 5.1%.
Fichier principal
Vignette du fichier
FFMrailways.pdf (470.01 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01103710 , version 1 (15-01-2015)

Licence

Paternité - Pas d'utilisation commerciale - Pas de modification

Identifiants

Citer

David Fournier, François Fages, Denis Mulard. A Greedy Heuristic for Optimizing Metro Regenerative Energy Usage. Railways 2014, Apr 2014, Ajaccio, France. ⟨10.4203/ccp.104.240⟩. ⟨hal-01103710⟩

Collections

INRIA INRIA2
1035 Consultations
207 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More