Optimal Driving Strategies for a Fleet of Trains on Level Track with Prescribed Intermediate Signal Times and Safe Separation

Phil Howlett (), Peter Pudney () and Amie Albrecht ()
Additional contact information
Phil Howlett: UniSA, STEM, Scheduling and Control Group, University of South Australia, Adelaide, South Australia 5091, Australia
Peter Pudney: UniSA, STEM, Scheduling and Control Group, University of South Australia, Adelaide, South Australia 5091, Australia
Amie Albrecht: School of Mathematics and Statistics, University of South Australia, Mawson Lakes, South Australia 5095, Australia

Transportation Science, 2023, vol. 57, issue 2, 399-423

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 traveling on the same track in the same direction subject to clearance-time equality constraints that ensure safe separation and compress the headway timespan. We assume the track is divided into sections by a set of trackside signals at fixed positions. For each intermediate signal there is an associated signal segment consisting of the two adjacent sections. Successive trains are safely separated only if the leading train leaves the signal segment before the following train enters. Although 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 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, find the optimal strategies for each train, 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 defined at selected signals. We show that this problem can be formulated as an unconstrained convex optimization and propose a solution algorithm that finds the optimal schedule and the associated optimal strategies for each train. Finally we find optimal schedules for a case study using realistic parameters on a busy metropolitan line.

Keywords: transportation; train control; safe separation; optimal schedules (search for similar items in EconPapers)
Date: 2023
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/trsc.2022.1170 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:ortrsc:v:57:y:2023:i:2:p:399-423

Access Statistics for this article

More articles in Transportation Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().