An improved weighted sum-fuzzy Dijkstra’s algorithm for shortest path problem (iWSFDA)

Most of the time, people experience difficulty in identifying the best shortest paths to reach their destination while travelling. This becomes the main motive to research the shortest path identification problem. In this work, an undirected network is considered for the research evaluation of the proposed method. Previously, various types of techniques have been developed by many researchers for this shortest path issue in a networking environment. However, most of them exhibit computational complexity issues when updating their weights for every iteration. Based on this observation, the proposed work plans to solve SPP (Shortest Path Problem) in an undirected network using Fuzzy Dijkstra’s approach based on improved WSM (Weighted Sum Method) with heuristic optimization. Here, the weight updating process of WSM is optimized by Sea Lion Optimization approach in order to improve the working performance of WSM while combining with Fuzzy Dijkstra method. The proposed concept is evaluated in MATLAB, and the performance evaluation is done using time consumption, energy utilization, network lifetime and prediction accuracy by comparing it with Dijkstra, Fuzzy-MPSO and WSDA methods.