%0 Journal Article
%T Discrete Time Dependent Shortest Paths Considering Node-waiting Cost<br>含结点等待费用的离散时变最短路径
%A YANG Xuan-hui
%A LIU Zhen-yu
%A <br>杨煊会
%A 刘震宇
%J 系统工程理论与实践
%D 2007
%I 
%X A special version of the Time Dependent Shortest Paths(TDSP) problem is studied in this paper.The objective is to find the minimum cost path considering node-waiting cost in a network,in which,waiting is allowed at every node and the arc-traversing cost,node-waiting cost and arc-traversing time are all discrete functions of time.An label correcting algorithm is introduced to find all the minimum cost paths from every node to the destination node simultaneously with time complexity of O(n~3M~3),where n is the number of the nodes in the network and M is the time interval count.
%K discrete time dependent shortest paths
%K minimum cost path
%K label correcting algorithm<br>离散时变最短路径
%K 最小费用路径
%K 标号更新算法
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=01BA20E8BA813E1908F3698710BBFEFEE816345F465FEBA5&cid=962324E222C1AC1D&jid=1D057D9E7CAD6BEE9FA97306E08E48D3&aid=E046B1D27763BF17&yid=A732AF04DDA03BB3&vid=DB817633AA4F79B9&iid=CA4FD0336C81A37A&sid=A63576421B012172&eid=7F5DDA4924737DF5&journal_id=1000-6788&journal_name=系统工程理论与实践&referenced_num=0&reference_num=7