@article{oai:miyazaki-u.repo.nii.ac.jp:00002954,
 author = {吉原, 郁夫 and Yoshihara, Ikuo and 寺岡, 麻美 and 黒田, 正文 and 山森, 一人 and Yamamori, Kunihito and 相川, 勝 and Aikawa, Masaru and Teraoka, Asami and Kuroda, Masahumi},
 journal = {宮崎大学工学部紀要, Memoirs of Faculty of Engineering, University of Miyazaki},
 month = {Sep},
 note = {Lin-Kernighan (LK) algorithm has been considered as one of the most effective heuristics to solve traveling salesman problem (TSP). However, LK does not have an ability to jump out of local minima, because it is substantially a greedy algorithm. This paper proposes a method to search for another local optimum, by slightly displacing the cities in the given problem just as perturbation. Benchmark tests validates usefulness of our method comparing with the original LK method and with so-called SA method.},
 pages = {283--288},
 title = {摂動を加えることによるリン・カーニハン法による解の改良法},
 volume = {38},
 year = {2009},
 yomi = {ヨシハラ, イクオ and テラオカ, アサミ and クロダ, マサフミ and ヤマモリ, クニヒト and アイカワ, マサル}
}