Zakir Hussain Ahmed1,*, Maha Ata Al-Furhood2, Abdul Khader Jilani Saudagar3, Shakir Khan4
Computer Systems Science and Engineering, Vol.48, No.5, pp. 1113-1131, 2024, DOI:10.32604/csse.2024.053574
Abstract The generalized travelling salesman problem (GTSP), a generalization of the well-known travelling salesman problem (TSP), is considered for our study. Since the GTSP is NP-hard and very complex, finding exact solutions is highly expensive, we will develop genetic algorithms (GAs) to obtain heuristic solutions to the problem. In GAs, as the crossover is a very important process, the crossover methods proposed for the traditional TSP could be adapted for the GTSP. The sequential constructive crossover (SCX) and three other operators are adapted to use in GAs to solve the GTSP. The effectiveness of GA using More >
Login
Register
