Parallel search strategies for TSPs using a greedy genetic algorithm

Traditional genetic algorithms often meet the occurrence of slow convergence and enclosure competition. We present a parallel algorithm for the traveling salesman problem (TSP) which incorporates several greedy heuristics based on genetic algorithms. We call this algorithm the greedy genetic algorithm (GGA) here. The ideas we incorporate in our algorithm include: (i) generating the initial population using the gene bank; (ii) double-directional greedy crossover and the local searches of greedy mutation; (iii) special-purpose immigrations to promote diversity and an open competition; (iv) stepwise parallel optimization of each individual of the population; (y) developing an overall design that attempts to strike a right balance between divers flcation and a bias towardsfitter individuals. We test all these ideas to assess their impacts on the GGA performance, and also compare our final algorithm to the simple genetic algorithm on the benchmark instances in TSPLIB, a well-known library of TSP instances. We find the greedy genetic algorithm to be a very effective and robust algorithm for TSPs