Ant colony optimization for energy-efficient train operations

8Citations
Citations of this article
9Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Traffic perturbations in railway systems may give rise to conflicts, which cause delays w.r.t. the timetable. Dealing with them requires solving the real-time Rail Traffic Management Problem (rtRTMP). A subproblem of the rtRTMP is the real-time Energy Consumption Minimization Problem (rtECMP). It defines the speed profiles along with the timing of multiple trains in a given network and time horizon. It takes as input the train routing and precedences computed by a rtRTMP solver and its objective is to minimize the weighted sum of train energy consumption and total delay. In this paper, we propose an Ant Colony Optimization algorithm for the rtECMP and we test it on the French Pierrefitte-Gonesse control area with dense mixed traffic. The results show that, in 30 seconds, a remarkable exploration of the search space is performed before convergence.

Cite

CITATION STYLE

APA

Naldini, F., Pellegrini, P., & Rodriguez, J. (2021). Ant colony optimization for energy-efficient train operations. In GECCO 2021 Companion - Proceedings of the 2021 Genetic and Evolutionary Computation Conference Companion (pp. 75–76). Association for Computing Machinery, Inc. https://doi.org/10.1145/3449726.3459436

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free