id	author	title	date	pages	extension	mime	words	sentences	flesch	summary	cache	txt
work_yokg7gijqvg7dosuvszkjtj5qm	Yuichi Nagata	A new genetic algorithm for the asymmetric traveling salesman problem	2012	21	.pdf	application/pdf	7066	898	82	Keywords: Asymmetric traveling salesman problem, genetic algorithm, crossover operator, metaheuristics All these facts have encouraged us to present a powerful new approximation algorithm to solve the ATSP, with the aim of improving results given by previous ATSP The main feature of our GA is the use of an edge assembly crossover (EAX) operator, which was originally proposed by Nagata and Kobayashi (1997) for both the STSP Section 2 presents the genetic algorithm for the ATSP, Section 3 shows the computational results obtained for the set of of parents, EAX-1AB generates offspring solutions, where nch refers to the number the population diversity because EAX-1AB frequently generates offspring solutions Thus, we have a set of 126 ATSP instances with known optimal solution obtained from the aforementioned work, and with a number of vertices between 64 In Table 3, we show the results on this set of ATSP instances obtained with our	./cache/work_yokg7gijqvg7dosuvszkjtj5qm.pdf	./txt/work_yokg7gijqvg7dosuvszkjtj5qm.txt