Abstract

According to the slow convergence speed of the classical ant colony and the disadvantages of selecting certain paths repeatedly, this paper uses the combination of ant colony optimization and tabu search algorithm to optimize the TSP problem.Under the same parameters, the search time is shortened greatly and the optimal solution can be obtained. Experimental results show the effectiveness of the ant colony optimization with tabu table.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call