Research on the Connecting Path Search Algorithm for Air-Rail Integration

With the rapid development of high-speed railway and the changes of the tourists’ requirement, it is imperative to the integrate advantages of aviation and rail. This paper constructs the air-rail integration model based on the current development situation and characteristics of Chinese railways. In allusion to the search problem of connecting path in air-rail integration network, a constrained Yen* algorithm is proposed to solve the problem in this paper. The constrained Yen* algorithm is set up by using the heuristic strategy of A* algorithm and two certain constraints by reducing running time to generate candidate paths. The experimental results show that the search problem of connecting path in air-rail integration network can be obtained fast by the constrained Yen* algorithm. Therefore, constrained Yen* algorithm is more efficient than constrained Yen algorithm in application.

[1]  Qiang Zhang,et al.  GA-based Global Path Planning for Mobile Robot Employing A* Algorithm , 2012, J. Comput..

[2]  A. Puri,et al.  Algorithms for Routing with Multiple Constraints , 1999 .

[3]  Klara Nahrstedt,et al.  On finding multi-constrained paths , 1998, ICC '98. 1998 IEEE International Conference on Communications. Conference Record. Affiliated with SUPERCOMM'98 (Cat. No.98CH36220).

[4]  Piet Van Mieghem,et al.  Hop-by-hop quality of service routing , 2001, Comput. Networks.

[5]  Qiu Zheng.  Exact Algorithm for Multi-Constrained Shortest Link-Disjoint Paths , 2010 .

[6]  M. S. Leeson,et al.  K- shortest path network problem solution with a hybrid Genetic Algorithm: Particle Swarm Optimization algorithm , 2011, 2011 13th International Conference on Transparent Optical Networks.

[7]  Gang Liu,et al.  A*Prune: an algorithm for finding K shortest paths subject to multiple constraints , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[8]  Ning Shi,et al.  K Constrained Shortest Path Problem , 2010, IEEE Trans Autom. Sci. Eng..

[9]  Min-Hyung Choi,et al.  Enhancing usability of flight and fare search functions for airline and travel Web sites , 2004, International Conference on Information Technology: Coding and Computing, 2004. Proceedings. ITCC 2004..

[10]  Mohd Fadzil Hassan,et al.  Flight connections multi-leg searching by adopting Partial Constraint Satisfaction , 2010, 2010 International Symposium on Information Technology.

[11]  Pascal Fua,et al.  Ieee Transactions on Pattern Analysis and Machine Intelligence 1 Multiple Object Tracking Using K-shortest Paths Optimization , 2022 .

[12]  Dachuan Wei,et al.  An Optimized Floyd Algorithm for the Shortest Path Problem , 2010, J. Networks.

[13]  Marwan Krunz,et al.  Multi-constrained optimal path selection , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[14]  Mingfu Wang.  The New Algorithm for Finding the Paths based on Coding Graph , 2012, J. Softw..

[15]  Ziang Zhang,et al.  Multi-constraint-pruning: an algorithm for finding K shortest paths subject to multiple constraints , 2008, 2008 14th Asia-Pacific Conference on Communications.