Zakir Hussain Ahmed

Genetic Algorithm with Comprehensive Sequential Constructive Crossover for the Travelling Salesman Problem

2020 · International Journal of Advanced Computer Science and Applications

The travelling salesman problem (TSP) is a very famous NP-hard problem in operations research as well as in computer science. To solve the problem several genetic algorithms (GAs) are developed which depend primarily on crossover …