A novel algorithm for TOP-K optimal path on complex multiple attribute graph Online publication date: Wed, 03-Jun-2020
by Kehong Zhang; Keqiu Li
International Journal of Embedded Systems (IJES), Vol. 12, No. 4, 2020
Abstract: In the rapidly-changing information world, the various users and personalised requirements lead to an urgent need for complex multiple attribute decision-making. In addition, the TOP-K path of single attribute decision cannot meet the actual needs. The TOP-K mainly has non-repeatable vertex, repeatable vertex, index and other algorithms. But these techniques are mainly based on the single attribute. There are few documents introducing the complex multiple attribute decision-making problem so for. Therefore, a Tdp algorithm is presented in this paper. Firstly, it uses the technology of interval number and extreme value to solve the uncertain attribute value. Then, TOPSIS technique solves the complex multiple attribute decision-making problems. By this way, the comprehensive score is achieved. Secondly, the paper proposes blocking and bidirectional shortest path algorithm for TOP-K optimal path. Finally, comparison and analysis between Tdp and the Yen were made. Result confirms that Tdp algorithm improves the TOP-K optimal technology.
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 Embedded Systems (IJES):
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