%0 Journal Article
%T Algorithm for Searching Shortest Path Piecewise and Its Implementation<br>分段路径寻优算法研究及实现*
%A ZHOU Peng
%A ZHANG Jun
%A SHI Zhong-ke
%A <br>周鹏
%A 张骏
%A 史忠科
%J 计算机应用研究
%D 2005
%I 
%X One kind of special shortest path search algorithm is studied in order to obtain the shortest path with some constraint conditions. Some locations should go and some locations should be avoid are considered. First, the locations should go are ordered according to the direction of shortest path; then shortest path is searched piecewise according to the locations should go, at the same time the location should be avoided are considered; at last, the shortest path is accomplished by connecting the piecewise shortest paths.
%K Search Shortest Path Piecewise
%K Search Time
%K Necessary Locations
%K Avoided Locations<br>分段路径寻优
%K 搜索时间
%K 必经节点序列
%K 避开节点序列
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=A9D9BE08CDC44144BE8B5685705D3AED&aid=7F64ECD379DC1D53&yid=2DD7160C83D0ACED&vid=BC12EA701C895178&iid=59906B3B2830C2C5&sid=6A73B36E85DB0CE9&eid=B78CD622C1934236&journal_id=1001-3695&journal_name=计算机应用研究&referenced_num=3&reference_num=5