An efficient hybrid genetic algorithm for the traveling salesman problem
Kengo Katayama, Hiroyuki Narihisa · Electronics and Communications in Japan (Part III Fundamental Electronic Science) · 2000
This paper describes an efficient hybrid genetic algorithm (HGA) for the traveling salesman problem. In general, a genetic algorithm (GA) combined with other algorithms (e.g., a local search) is well known to be a powerful approach. The other algorithms are divided into local search heuristics and metaheuristics. In incorporating the metaheuristics, it is reported that a difficult problem of changing processes between the GA process and the metaheuristic search process appears. To avoid the difficult problem using simulated annealing as one of the metaheuristics, we investigate an efficient HGA that does not involve the problem. © 2000 Scripta Technica, Electron Comm Jpn Pt 3, 84(2): 76–83, 2001