TY  - EJOU
AU  - Ahmed, Zakir Hussain 
AU  - Al-Furhood, Maha Ata 
AU  - Saudagar, Abdul Khader Jilani 
AU  - Khan, Shakir 

TI  - Solving the Generalized Traveling Salesman Problem Using Sequential Constructive Crossover Operator in Genetic Algorithm
T2  - Computer Systems Science and Engineering

PY  - 2024
VL  - 48
IS  - 5
SN  - 

AB  - 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 SCX is verified on some GTSP Library (GTSPLIB) instances first and then compared against GAs using the other crossover methods. The computational results show the success of the GA using SCX for this problem. Our proposed GA using SCX, and swap mutation could find average solutions whose average percentage of excesses from the best-known solutions is between 0.00 and 14.07 for our investigated instances.
KW  - Generalized travelling salesman problem; NP-hard; genetic algorithms; sequential constructive crossover; swap mutation

DO  - 10.32604/csse.2024.053574