@article{oai:miyazaki-u.repo.nii.ac.jp:00002366,
 author = {Yoshihara, Ikuo and Sato, Masakazu and Nguyen, Hung Dinh and Yamanori, Kunihito},
 journal = {宮崎大学工学部紀要, Memoirs of Faculty of Engineering, University of Miyazaki},
 month = {Oct},
 note = {Abstract 
Traveling Salesman Problem (TSP) is one of the representative combinatorial optimization prob-
lems. The promising approach to solve TSP is Genetic Algorithm (GA). GA has global search ability, 
and heuristic is used in order to compensate local search ability, because GA is lack of local search abil-
ity. Hybrid (GA (HGA) combined with heuristics can be expected to obtain high quality solutions.We 
employ Lin-Kernighan heuristics which is very effective in TSP. Because crossover is one of the impor-
tant operators of GA, lots of crossovers are proposed for TSP. We employ Edge Assembly Crossover 
(EAX) which can obtain high quality solutions. We evaluate the proposed HGA combined EAX and 
heuristics and show that it finds the best solutions.},
 pages = {319--324},
 title = {Evaluation of Edge Assembly Crossover for Hybrid GA},
 volume = {33},
 year = {2004}
}