A Passenger Flow Routing Model for High-speed Railway Network in Different Transportation Organization Modes

Ying Wang

Bao-Ming Han

Jia-Kang Wang

Abstract

Reasonable selection of passenger flow routes considering
different transportation organization modes can meet
the demands of adapting to large-scale high-speed railway
networks and improving network efficiency. Passenger flow
routing models are developed to find and optimize a set
of passenger flow routes for a high-speed railway network considering different transportation organization modes. In this paper, we presented a new approach minimizing the operating costs, including traveling cost, cost of travel time differences between different lines, and penalties for the inter-line. The network was reconstructed to solve the directed graph with four nodes (node-in-up, node-in-down, nodes-outup, and nodes-out-down) indicating one station. To tackle our problem, we presented an integer non-linear programming model, and direct passenger demand was guaranteed owing to volume constraints. Binary variables were introduced to simplify the model, and the algorithm process was optimized. We suggested a global optimal algorithm by Lingo 11.0. Finally, the model was applied to a sub-network of the Northeast China railway system. Passenger flow routes were optimized and the transportation organization mode was discussed based on passenger volume, traveling distance, and infrastructure.