Solve Shortest Paths Problem by Using Artificial Bee Colony Algorithm

Nature-inspired algorithms are among the most powerful algorithms to solve optimization problems. This paper intends to provide a detailed description of a new iterative method to solve the shortest path problem for given directed graph(dgraph) G = (V, E) from source node s to target node t. Each edge\( \left( {i, j} \right) \in E \) has an associated weight \( w_{ij} \). This problem is known as NP-hard problems, so an efficient solution is not likely to exist. Weights are assigned by the network operator. A path cost is the sum of the weights of the edges in the path. The efficiency of this approach is shown with some numerical simulations. For large data network, this method reaches to shortest path from s to t in polynomial time.