Optimal driving strategies for a fleet of trains on level track with prescribed intermediate signal times and safe separation

TL;DR

This paper presents an analytic, convex optimization-based method to determine energy-efficient driving strategies for a fleet of trains, ensuring safe separation and optimized scheduling on level tracks with fixed signals.

Contribution

It introduces a novel convex optimization approach for large train fleets, overcoming the complexity of previous methods limited to two trains, enabling optimal scheduling with safety constraints.

Findings

The method efficiently computes optimal schedules for multiple trains.

It guarantees safe separation through prescribed clearance times.

The approach reduces energy consumption while maintaining safety constraints.

Abstract

We propose an analytic solution to the problem of finding optimal driving strategies that minimize total tractive energy consumption for a fleet of trains travelling on the same track in the same direction subject to clearance-time equality constraints that ensure safe separation and compress the line-occupancy timespan. We assume the track is divided into sections by a set of trackside signals at fixed locations. For each intermediate signal there is a signal-location segment consisting of the two adjacent sections. Successive trains are safely separated only if the leading train leaves each signal-location segment before the following train enters. The fleet can be safely separated by a complete set of clearance times and associated clearance-time inequality constraints. The problem of finding optimal schedules with safe separation has been solved for two trains but for larger fleets the problem rapidly becomes intractable as the number of trains and signals increases. The main difficulty is in distinguishing between active equality constraints and inactive inequality constraints. The curse of dimensionality means it is not feasible to check every different combination of active constraints, optimize the corresponding prescribed times and calculate the cost. Nevertheless we can formulate and solve an alternative problem with active clearance-time equality constraints for successive trains on every signal-location segment. We show that this problem can be formulated as an unconstrained convex optimization and we propose a viable solution algorithm that finds the optimal schedule and the associated optimal strategies for each train. Finally we use our solution to find optimal schedules for a busy inter-city shuttle service.