Computing the shortest path with words Online publication date: Wed, 13-Mar-2019
by Arindam Dey; Anita Pal
International Journal of Advanced Intelligence Paradigms (IJAIP), Vol. 12, No. 3/4, 2019
Abstract: Computing with words is a soft computing technique to solve the decision-making problem with the information described in natural language. In this paper, we proposed a generalised Diskrtra's algorithm for finding shortest paths from a source node to every other node in a fuzzy graph where the arc lengths are represented by some natural words taken from natural language. Human being generally describes the arc lengths of any shortest path problem in real life by the terms small, large, some, etc. term which do not supply any natural numbers or fuzzy numbers. We describe those terms as words. Here, we use interval type 2 fuzzy set (IT2FS) to capture the uncertainty of the words. A perceptual computer model is introduced to determine the rank of the shortest path which is a collection of words. A numerical example of transportation network is used to illustrate the effectiveness of the proposed method.
Online publication date: Wed, 13-Mar-2019
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:
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 firstname.lastname@example.org