Enhanced Genetic Algorithm Inspired Cuckoo Search (GACS) Algorithm for Combinatorial Optimization Travelling Salesman Problem

MLT finds potentially useful patterns in the data. Optimisation problems, either single-objective or multi-objective, are generally difficult to solve. The most famous example is probably the traveling salesman problem (TSP) in which a salesperson intends to visit a number of cities exactly once, and returning to its starting point, while minimizing the total distance traveled or the overall cost of the trip. TSP is one of the most widely studied problems in combinatorial optimization. It belongs to the class of NP-hard optimization problems, whose the computational complexity increases exponentially with the number of cities. It is often used for testing optimization algorithms. This paper proposed genetic algorithm based cuckoo search technique for TSP. Result significantly improves the performance of the TSP. The algorithm is implemented using MATLAB. Results seems to be promising when compared with the existing methods for the problem.