%0 Journal Article
%T Research on Path Set Operation Based Algorithm for Path Searching in Public Transit Network<br>基于路径集合运算的公交网络寻径算法研究
%A WU Yan-peng
%A PENG Xiao-qi
%A HUANG Tong-cheng
%A <br>伍雁鹏
%A 彭小奇
%A 黄同成
%J 计算机科学
%D 2009
%I 
%X Path searching problem of public transit network is NP-hard,one of whose nodus is the algorithm of accurately searching shortest-time-path in large multi-transfer network.A searching algorithm of public traffic network,based on path set calculation,was proposed to solve the nodus.Path sets are generated from low to high in accordance with the number of transfer,optimized by deleting redundant paths to reduce storage space and computation,and summarized to generate summary shortest-time-path set,which is use...
%K Public transit network
%K Searching algorithm
%K Multi-transfer
%K Path set calculation
%K Shortest-time-path<br>公交网络
%K 寻径算法
%K 多换乘
%K 路径集合运算
%K 最短时间路径
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=64A12D73428C8B8DBFB978D04DFEB3C1&aid=DC13F3F4C29F5E20D6FA2ADEA9C0C713&yid=DE12191FBD62783C&vid=933658645952ED9F&iid=B31275AF3241DB2D&sid=1DF3F9D75A12D97B&eid=C812B90E96151014&journal_id=1002-137X&journal_name=计算机科学&referenced_num=0&reference_num=12