A biologically inspired optimization algorithm for solving fuzzy shortest path problems with mixed fuzzy Arc lengths

摘要

The shortest path problem is among fundamental problems of network optimization. Majority of the optimization algorithms assume that weights of data graph's edges are pre-determined real numbers. However, in real-world situations, the parameters (costs, capacities, demands, time) are not well defined. The fuzzy set has been widely used as it is very flexible and cost less time when compared with the stochastic approaches. We design a bio-inspired algorithm for computing a shortest path in a network with various types of fuzzy arc lengths by defining a distance function for fuzzy edge weights using cuts. We illustrate effectiveness and adaptability of the proposed method with numerical examples, and compare our algorithm with existing approaches.