A Fast Path Searching Algorithm of Public Transport Based on Region Division
Huang Ke-kun · Journal of Jiaying University · 2009
In this paper,a fast path searching algorithm of public transport based on region division is proposed.First,all stations are divided into several regions,then the search priority of line set is confirmed by the count of its stations in target region,and the search priority of station set is confirmed by whether the station is in target region.The proposed algorithm only searches part of the top-priority lines and stations.The technique of searching from beginning station and final station together is also used.And then the search area is greatly reduced.Experiment results show that the algorithm is fast and effective.