The Research on Shortest Path Base on Yantai Vocational College

Abstract:

This paper based on the complex network, this paper expounds the advantages and disadvantages of traditional shortest path algorithm, this paper puts forward the traditional path finding algorithm of the improved algorithm, the improved algorithm is compared with the traditional algorithm between the search efficiency, and all the differences between the improved algorithm to solve complex network in size, number of nodes under the condition of the shortest path problem. The test shows that the improved algorithm efficiency in the later has obviously advantages, which are embodied in the space greatly reduce the complexity, the execution time also greatly reduced. But the individual the improved algorithm also has limitations. At last, this paper introduces the improved algorithm in yantai vocational college for the application of road map.

• Periodical: Advanced Materials Research (Volumes 482-484)
• Pages: 368-371
• DOI: https://doi.org/10.4028/www.scientific.net/AMR.482-484.368
• Online since: February 2012
• Authors: Peng Li, Rui Feng Wang
• Keywords: Algorithm of Search Path, Artificial Intelligence (AI), Complex Network

References

[1] Erdos P, Renyi A Publ. On the Evolution of Random Graphs. Math Inst Hung Acad Sci, 1960, 5: 17-61.

[2] Lei Guo, Xiaoming Xu. Complex Networks [M].Shanghai: Science and technology education press.2006.

[3] Albert R, Barabasi A-L. Statistical Mechanics of Complex Networks. Rev of modern phys, 2002,74:47-97.

[4] Newman M E J. The Structure and Function of Complex Networks. SIAM Rev, 2003, 45:167-256.

[5] Barabasi A-L, Albert R, Jeong H. Mean-Field Theory for Scale-Free Random Networks. Physica A,1999,272:173-187.

DOI: 10.1016/s0378-4371(99)00291-5

[6] Xiaofan Wang,Xiang Li, Guanrong Chen. The complex network theory and its application [M].Beijing: Tsinghua university press,2006.

[7] Daren He, Zonghua Liu, Binghong Wang Complex system and the complex network [M]. Beijing: Higher education press,2009.

[8] Zhihe Wang, Ling Yun. DijkstraThe shortest path algorithm of optimization and its realization[J]. Micro computer information. 2007, 11(3):275-277.

[9] Hu Jie states. Floyd shortest path algorithm in distribution center of the application of the location [J]. Journal of human agricultural university: natural science edition, 2004, 12 (4) : 382-384.

[10] Zouliang, XuJian Min, zhu ling played on human. A* algorithm in public transportation of the application of the induction system [A]; The sustainable development of China's traffic-2005 national doctoral academic BBS (transportation engineering discipline) proceedings (man) [C]; 2005:358-424.