Combining Genetic and Artificial Bee Colony Algorithms to solve Travelling Salesman Problem

چکیده مقاله

One of the main graph algorithmic problems is Travelling Salesman Problem (TSP). This problem is one of the NP-Hard optimization problems that has no calculating solution and maybe there’s no exact solution in polynominal time. The goal of TSP is achieving the shortest path among a collection of cities, so that each city is visited just once in the path and constructed path leads to the first city. In this article, for solving TSP, artificial bee colony (ABC) and genetic algorithm (GA) were combined, we compared it with GA and ABC algorithms

دریافت لینک دانلود مقاله