An efficient hybrid genetic algorithm for the traveling salesman problem

Citation
K. Katayama et H. Narihisa, An efficient hybrid genetic algorithm for the traveling salesman problem, ELEC C JP 3, 84(2), 2001, pp. 76-83
Citations number
26
Language
INGLESE
art.tipo
Article
Categorie Soggetti
Eletrical & Eletronics Engineeing
Journal title
ELECTRONICS AND COMMUNICATIONS IN JAPAN PART III-FUNDAMENTAL ELECTRONIC SCIENCE
ISSN journal
1042-0967 → ACNP
Volume
84
Issue
2
Year of publication
2001
Pages
76 - 83
Database
ISI
SICI code
1042-0967(2001)84:2<76:AEHGAF>2.0.ZU;2-J
Abstract
This paper describes an efficient hybrid genetic algorithm (HGA) for the tr aveling salesman problem. In general, a genetic algorithm (GA) combined wit h other algorithms (e.g., a local search) is well known to be a powerful ap proach. The other algorithms are divided into local search heuristics and m etaheuristics. In incorporating the metaheuristics, it is reported that a d ifficult problem of changing processes between the GA process and the metah euristic search process appears. To avoid the difficult problem using simul ated annealing as one of the metaheuristics, we investigate an efficient HG A that does not involve the problem. (C) 2000 Scripta Technica, Electron Co mm Jpn Pt 3, 84(2): 76-83, 2001.