Computational Technology Resources - CCP

D. Fournier, F. Fages, D. Mulard, "A Greedy Heuristic for Optimizing Metro Regenerative Energy Usage", in J. Pombo, (Editor), "Proceedings of the Second International Conference on Railway Technology: Research, Development and Maintenance", Civil-Comp Press, Stirlingshire, UK, Paper 240, 2014. doi:10.4203/ccp.104.240

Keywords: energy optimization, regenerative braking, metro timetabling.

Summary

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 regenerative 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. In this paper a fast greedy heuristic, is proposed, 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, it is shown that a run of the algorithm on a full timetable may reduce its energy consumption by 5.1%.

purchase the full-text of this paper (price £20)

go to the previous paper
go to the next paper
return to the table of contents
return to the book description
purchase this book (price £65 +P&P)

	Computational & Technology Resources an online resource for computational, engineering & technology publications
	not logged in - login
Front Page Browse CCP CSETS CTR IJRT Other Authors Search Purchase Guide FAQ Contact us	Civil-Comp Proceedings ISSN 1759-3433 CCP: 104 PROCEEDINGS OF THE SECOND INTERNATIONAL CONFERENCE ON RAILWAY TECHNOLOGY: RESEARCH, DEVELOPMENT AND MAINTENANCE Edited by: J. Pombo Paper 240 A Greedy Heuristic for Optimizing Metro Regenerative Energy Usage D. Fournier^1,2, F. Fages¹ and D. Mulard² ¹Contraintes Team, Inria Rocquencourt, France ²General Electric Transportation ICS Delta, Paris La Défense, France doi:10.4203/ccp.104.240 purchase the full-text of this paper Full Bibliographic Reference for this paper D. Fournier, F. Fages, D. Mulard, "A Greedy Heuristic for Optimizing Metro Regenerative Energy Usage", in J. Pombo, (Editor), "Proceedings of the Second International Conference on Railway Technology: Research, Development and Maintenance", Civil-Comp Press, Stirlingshire, UK, Paper 240, 2014. doi:10.4203/ccp.104.240 Keywords: energy optimization, regenerative braking, metro timetabling. Summary 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 regenerative 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. In this paper a fast greedy heuristic, is proposed, 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, it is shown that a run of the algorithm on a full timetable may reduce its energy consumption by 5.1%. purchase the full-text of this paper (price £20) go to the previous paper go to the next paper return to the table of contents return to the book description purchase this book (price £65 +P&P)
Back to top	©Civil-Comp Limited 2023 - terms & conditions