A novel artificial bee colony algorithm for shortest path problems with fuzzy arc weights
The shortest path (SP) problem is a network optimization problem with a wide range of applications in business and engineering. Conventional network problems assume precise values for the weights of the edges. However, these weights are often vague and ambiguous in practical applications. Several heuristics have been proposed to find the shortest path (SP) weight and the corresponding SP on a network with fuzzy arc weights. These heuristics largely use α-cuts and the least squares method. We propose an artificial bee colony (ABC) algorithm to solve the fuzzy SP (FSP) problems with fuzzy arc weights. The performance of the proposed ABC algorithm is compared with the performance of other competing algorithms with two SP problems taken from the literature. We present a wireless sensor network (WSN) problem and demonstrate the applicability of the proposed method and exhibit the efficiency of the procedures and algorithms.
Ebrahimnejad, Ali; Tavana, Madjid; and Alrezaamiri, Hamidreza, "A novel artificial bee colony algorithm for shortest path problems with fuzzy arc weights" (2016). Business Systems and Analytics Faculty Work. 155.