抄録
The Genetic Algorithm(GA) with using previously proposed Edge Assembly Crossover(EAX) have shown a good performance for Traveling Salesman Problems(TSPs). Many crossovers for TSPs have been proposed so far. We first examine advantages of EAX by comparing it with other crossovers, and identify some properties to obtain a good performance. So previously proposed EAX was not refined well, the performance of GA using EAX can be improved by some simple modification. In this paper we give the modified version of EAX. Appling modified GA using EAX to well-known benchmarks in TSPLIB95, modified GA succeeded in finding optimal solution for almost problems up to 4461 cities.
