A fast search strategy to optimise path founding in big data graph computing environments Online publication date: Tue, 21-Nov-2017
by Wentian Qu; Dawei Sun
International Journal of Wireless and Mobile Computing (IJWMC), Vol. 13, No. 2, 2017
Abstract: In big data graph computing environments, the shortest path problem is very important and widely applied in various scenarios. But sometimes, in order to find the shortest path, it always entails a lot of cost. So, weighing the various aspects of the problems, it's a good choice to find optimal path. In this paper, an improved A-star algorithm is proposed to define the optimal path. A-star algorithm has two kinds of parameters named actual cost and estimated cost and the second one plays an important part in the algorithm. Based on the traditional A-star algorithm, this paper will propose new parameters and improved heuristic function to enhance the performance of the A-star algorithm. Compared with the traditional A-star algorithm, the simulation experiment shows that the improved A-star algorithm runs at high efficiency. Two factors which affect the best situation are also discussed in the end of this paper.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Wireless and Mobile Computing (IJWMC):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook