A node combination approach with fuzziness in shortest path problem
by Pushpi Rani; Dilip K. Shaw; Jayakrushna Sahoo
International Journal of Advanced Intelligence Paradigms (IJAIP), Vol. 26, No. 3/4, 2023

Abstract: Shortest path problem is one of the most popular and frequently used network optimisation problems. In this paper, a method fuzzy node combination is proposed to find the shortest path under uncertain environment. The proposed method incorporates fuzziness in node combination algorithm, an alternative to Dijkstra's algorithm. An illustration for the proposed fuzzy node combination method is presented and impact of the method is evaluated in a transportation network. Experimental results reveal that the fuzzy node combination algorithm is more efficient than the existing fuzzy shortest path finding methods.

Online publication date: Tue, 09-Jan-2024

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
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 Advanced Intelligence Paradigms (IJAIP):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your 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