Models and Genetic Algorithms for the Optimal Riding Routes in Railway Passenger Transport

In railway passenger transportation systems, it is a practical significance to find riding route. It is very difficult for passengers to choose the best transfer routes when a transportation network is complex. Considering the traits of railway transportation networks, we formulate a 0–1 programming model and a hypergraph model to the optimal path problem with transfer times limited. An improved priority-based encoding genetic algorithm is presented to solve the models. By using the method proposed in the paper, the transfer paths in the railway transportation network are analyzed and calculated. Finally, we give a numerical example. The computer simulations show the effectiveness of the proposed methods.