Header menu link for other important links
Network flow with fuzzy arc lengths using haar ranking
, S. Hariharan, P. Sekar,
Published in Asian Research Publishing Network
Volume: 10
Issue: 11
Pages: 5034 - 5038
Shortest path problem is a classical and the most widely studied phenomenon in combinatorial optimization. In a classical shortest path problem, the distance of the arcs between different nodes of a network are assumed to be certain. In some uncertain situations, the distance will be calculated as a fuzzy number depending on the number of parameters considered. This article proposes a new approach based on Haar ranking of fuzzy numbers to find the shortest path between nodes of a given network. The combination of Haar ranking and the well-known Dijkstra's algorithm for finding the shortest path have been used to identify the shortest path between given nodes of a network. The numerical examples ensure the feasibility and validity of the proposed method. © 2006-2015 Asian Research Publishing Network (ARPN).
About the journal
JournalARPN Journal of Engineering and Applied Sciences
PublisherAsian Research Publishing Network