An Algorithm to Calculate Feasible Turnback Time in Complex Route Conditions

Abstract

This article presents a linear search algorithm based on scanning lines. It resolves calculation of turnback time under conditions of multiple loops of X-type lines, Y-type lines, and ring-type lines in urban rail transit. With this algorithm, a turnback scheme adaptive to passenger flow may be calculated quickly to implement fast and automatic plotting of train diagrams.