Green Chameleon Algorithm: A New Bio-inspired Meta-Heuristic Algorithm to Solve the Traveling Salesman Problem

Even with the current advancements in modern technology, there still exists a few Non- Deterministic Polynomial-Time Hard (NP Hard) Problems that pose a challenge to scientists. The Traveling Salesman Problem (TSP) is one such classic example of NP Hard Problem. Nature inspired computing techniques implement adaptive tools to solve optimization problems and these can be utilized to solve NP hard problems. It is proved that the rate of success is high for such algorithms due to their flexibility. The “Green Chameleon Algorithm (GCA)” is a bio-inspired algorithm that is based on the color changing nature of chameleons. The GCA consists of fewer parameters as opposed to other Nature Inspired Algorithms, thereby reducing its computational time, thus equipping it to efficiently solve the Traveling Salesman Problem.