SH: A Novel Method for the Dynamic and Shortest Path Problem

Abstract:

Article Preview

For the dynamic and shortest path problem, a novel algorithm SH(simulate human) is designed by simulating the process of our searching path in real life. The algorithm adopts the idea of heuristic search and integrates with the ant colony algorithm, in which the saved current path, the idea of “ask once every junction”, the bypassing barrier search and other some related definitions are proposed, as well as the ant colony algorithm is improved, so as to find the better solution and reduce the searching time. The experimental results show that the algorithm runs better than other existing methods. Moreover, it can find the shortest path or the approximate shortest one in a shorter time on road networks of any scales. Especially, SH algorithm is more effective for the large scale road network.

Info:

Periodical:

Advanced Materials Research (Volumes 129-131)

Edited by:

Xie Yi and Li Mi

Pages:

1013-1017

DOI:

10.4028/www.scientific.net/AMR.129-131.1013

Citation:

Y. F. Guo et al., "SH: A Novel Method for the Dynamic and Shortest Path Problem", Advanced Materials Research, Vols. 129-131, pp. 1013-1017, 2010

Online since:

August 2010

Export:

Price:

$35.00

In order to see related information, you need to Login.

In order to see related information, you need to Login.