  Urban rail transit is a fundamental component of public transportation,
however, commonly station-based path search algorithms often overlook the
impact of transfer times on search results, leading to decreased accuracy. To
solve this problem, this paper proposes a novel shortest path query algorithm
based on adaptive topology optimization called the Adaptive Topology Extension
Road Network Structure (ATEN). This algorithm categorizes transfer stations
into different types and treats travel time and transfer time equivalently as
weights for edges in the topological graph. The proposed algorithm introduces
virtual stations to differentiate between pedestrian paths and train paths,
eliminating the need for additional operations on transfer stations. The
algorithm controls the extent of expansion in the urban rail transit topology,
overcoming query errors caused by mishandling of transfer stations in the
existing algorithm. Finally, a series of simulation experiments were conducted
on Beijing's urban rail transit network to validate both correctness and
efficiency of the proposed adaptive topology optimization algorithm. The
results demonstrate significant advantages compared to existing similar
algorithms.
