3DHKSTRA E W. A Note on two Problems in Connexion with Graphs [ J ]. Numerische Math -ematik, 1959 (1) :269 -271.
4HART E P, NILSSON N J, RAPHAEL B. A Formal basis for the Heuristic Dtermination of Minimum Cost Paths[ C]. IEEE Trans. Sci. Cy- hem, 1968, SCC - 4(2) : 100 - 107.
二级参考文献14
1铁道部.中华人民共和国铁路技术管理规程(草案)解释(第二版).[M].北京:铁道部,1950.
2铁道部.铁路货物装载加固规则[M].北京:中国铁道出版社,2006.
3铁道部.铁路超限超重货物运输规则[M].北京:中国铁道出版社,2006.
4焦永兰.管理运筹学(M].北京:中国铁道出版社,2002.
5刘统畏.(1876-1949)铁路修建史料,第一集[M].北京:中国铁道出版社,1991.
6陈宜吉.铁路货运组织[M].北京:中国铁道出版社,2002..
7Dial R B,Glover F,Karney D,et al.A computation analysis of alternative algorithms and labeling techniques for finding shortest path trees[J].Network, 1979,9 : 215-248.
8Nicholson T A J.Finding the shortest route between two points in a network[J].The Computer Journal, 1966(3): 275-280.
9Adler J L.A best neighbor heuristic search for finding minimum paths in transportation network [C]//Transportation Research Board 77th 1 Annual Meeting,1998.
10Lee J H.A real-time traffic control scheme of multiple AGV systems for collision free minimum time motion:a routing table approach[J].IEEE Transactions on System,Man,And Cybernetics, 1998, 28 : 347-358.
