The existence of an urban external hub ensures the interconnection of urban internal and external transportation, and several passengers choose to transfer to rail transit at the external transport hub to enter the city. Passengers who enter the city usually carry more luggage and, consequently, require higher comfort than commuters do. Analyzing passenger route planning based on rail transit supplemented by other public transport modes can reduce pressure on road networks, improve passenger comfort, and further attract passenger flow by “avoiding” congested sections and adjusting transportation. This study uses the web crawler method to obtain the running time and cost of urban rail transit from Beijing Daxing International Airport to Beijing from open data sources, and it involves an analysis of the accessibility, advantages, and disadvantages of the Beijing rail transit network as compared to car riding. Based on the above results, a generalized cost is arrived at, considering congestion and other factors, for connecting urban rail transit passengers. Based on the generalized cost, a passenger route planning algorithm is designed to solve the shortest path by dividing sub-networks. When compared with the algorithms used to provide routes in the existing route planning system, the algorithm in this study provides a more comfor table travel route for passengers.