%0 Journal Article
%T A Shortest Path Algorithm on Multi-stage Weighted Network with Quadratic Parameter<br>带二次参数赋权的多阶段网络最短路算法
%A LIU Gui-zhi
%A GAO Tai-ping
%A <br>刘桂枝
%A 高太平
%J 系统工程理论与实践
%D 2007
%I 
%X The static network shortest path algorithms have been developed thoroughly,whereas the studies for dynamic network shortest path algorithms are few.To satisfy the need of theoretical research and application,the dynamic network shortest path problems have been a hot spot in the field of geographic information science and computer science.When the weights of the network are functions with parameter,the network is called a dynamic network,in which it is difficult to resolve shortest path by the traditional algorithms.In this paper,we first propose the shortest path problem in a multi-stage weighted network with quadratic parameter.Next,we give the implicit enumerative labelling algorithm to look for the shortest path of this network based on the thought of the Dijkstra algorithm and the implicit enumerative method.Finally,we analyse the complexity of the algorithm.The theory analysis and the experiment indicate that the algorithm is not polynomial but effective for proper scale of the network.
%K multi-stage network
%K quadratic parameter
%K the shortest path
%K critical point
%K labelling algorithm<br>多阶段网络
%K 二次参数
%K 最短路
%K 临界点
%K 标号算法
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=01BA20E8BA813E1908F3698710BBFEFEE816345F465FEBA5&cid=962324E222C1AC1D&jid=1D057D9E7CAD6BEE9FA97306E08E48D3&aid=14B291FBEEF8F68A&yid=A732AF04DDA03BB3&vid=DB817633AA4F79B9&iid=DF92D298D3FF1E6E&sid=08805F9252973BA4&eid=C3BF5C58156BEDF0&journal_id=1000-6788&journal_name=系统工程理论与实践&referenced_num=0&reference_num=8