-
- TAMURA Hiroki
- Faculty of Engineering, University of Miyazaki
-
- ZHANG Zongmei
- Faculty of Computer Science, Shandong University
-
- TANG Zheng
- Faculty of Engineering, University of Toyama
-
- ISHII Masahiro
- Faculty of Engineering, University of Toyama
この論文をさがす
説明
An improved algorithm of Guided Local Search called objective function adjustment algorithm is proposed for combinatorial optimization problems. The performance of Guided Local Search is improved by objective function adjustment algorithm using multipliers which can be adjusted during the search process. Moreover, the idea of Tabu Search is introduced into the objective function adjustment algorithm to further improve the performance. The simulation results based on some TSPLIB benchmark problems showed that the objective function adjustment algorithm could find better solutions than Local Search, Guided Local Search and Tabu Search.
収録刊行物
-
- IEICE transactions on fundamentals of electronics, communications and computer sciences
-
IEICE transactions on fundamentals of electronics, communications and computer sciences 89 (9), 2441-2444, 2006-09-01
一般社団法人電子情報通信学会
- Tweet
詳細情報 詳細情報について
-
- CRID
- 1571980077498505856
-
- NII論文ID
- 110007537962
-
- NII書誌ID
- AA10826239
-
- ISSN
- 09168508
-
- 本文言語コード
- en
-
- データソース種別
-
- CiNii Articles
