A Modified Genetic Algorithm for Finding Fuzzy Shortest Paths in Uncertain Networks

Abstract

ABSTRACT:In realistic network analysis, there are several uncertainties in the measurements and computation of the arcs and vertices. These uncertainties should also be considered in realizing the shortest path problem (SPP) due to the inherent fuzziness in the body of expert's knowledge. In this paper, we investigated the SPP under uncertainty to evaluate our modified genetic strategy. We improved the performance of genetic algorithm (GA) to investigate a class of shortest path problems on networks with vague arc weights. The solutions of the uncertain SPP with considering fuzzy path lengths are examined and compared in detail. As a robust metaheuristic, GA algorithm is modified and evaluated to tackle the fuzzy SPP (FSPP) with uncertain arcs. For this purpose, first, a dynamic operation is implemented to enrich the exploration/exploitation patterns of the conventional procedure and mitigate the premature convergence of GA technique. Then, the modified GA (MGA) strategy is used to resolve the FSPP. The attained results of the proposed strategy are compared to those of GA with regard to the cost, quality of paths and CPU times. Numerical insta nces are provided to demonstrate the success of the proposed MGA-FSPP strategy in comparison with GA. The simulations affirm that not only the proposed technique can outperform GA, but also the qualities of the paths are effectively improved. The results clarify that the competence of the proposed GA is preferred in view of quality quantities. The results also demonstrate that the proposed method can efficiently be utilized to handle FSPP in uncertain networks.

A hybrid feed-forward neural network with grasshopper optimization for observing pattern of scour depth around bridge piers

“…Hamidzadeh et al, (2017) suggested a chaotic bat algorithm for the weighted support vector data description. Heidari and Delavar (2016) utilized the evolutionary and swarmbased meta-heuristic algorithms (MHAs) to handle MLP networks. The meta-trainers were deployed in order to optimize not only the connection weights but also the parameters and structure of the MLP network.…”

Asynchronous accelerating multi-leader salp chains for feature selection

“…A key significant strength of the SI algorithms is their global search capability as they can produce multiple solutions in each run. A common challenge for all metaheuristics is the parameter settings since they usually have a set of initial parameters to be tuned [33]. The process of tuning parameter has significant impacts on the performance of the searching process, but it is very timeconsuming.…”