Hostname: page-component-89b8bd64d-nlwjb Total loading time: 0 Render date: 2026-05-07T16:21:53.181Z Has data issue: false hasContentIssue false

THE TWO-TRAIN SEPARATION PROBLEM ON LEVEL TRACK WITH DISCRETE CONTROL

Published online by Cambridge University Press:  29 October 2018

PHIL HOWLETT*
Affiliation:
Scheduling and Control Group (SCG), Centre for Industrial and Applied Mathematics (CIAM), School of Information Technology and Mathematical Sciences, University of South Australia, South Australia 5095, Australia email phil.howlett@unisa.edu.au
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

When two trains travel along the same track in the same direction, it is a common safety requirement that the trains must be separated by at least two signals. This means that there will always be at least one clear section of track between the two trains. If the safe-separation condition is violated, then the driver of the following train must adopt a revised strategy that will enable the train to stop at the next signal if necessary. One simple way to ensure safe separation is to define a prescribed set of latest allowed section exit times for the leading train and a corresponding prescribed set of earliest allowed section entry times for the following train. We will find strategies that minimize the total tractive energy required for both trains to complete their respective journeys within the overall allowed journey times and subject to the additional prescribed section clearance times. We assume that the drivers use a discrete control mechanism and show that the optimal driving strategy for each train is defined by a sequence of approximate speedholding phases at a uniquely defined optimal driving speed on each section and that the sequence of optimal driving speeds is a decreasing sequence for the leading train and an increasing sequence for the following train. We illustrate our results by finding optimal strategies and associated speed profiles for both trains in some elementary but realistic examples.

Information

Type
Research Article
Copyright
© 2018 Australian Mathematical Society