A VNS-based hyper-heuristic with adaptive computational budget of local search

Ping Che Hsiao, Tsung-Che Chiang, Li Chen Fu

研究成果: 書貢獻/報告類型會議論文篇章

20 引文 斯高帕斯(Scopus)

摘要

Hyper-heuristics solve problems by manipulating low-level domain-specific heuristics. The aim is to raise the level of generality of the algorithm to solve problems in different domains. In this paper we propose a hyper-heuristic based on Variable Neighborhood Search (VNS), which consists of two main steps: shaking and local search. Shaking disturbs solutions, and then local search seeks for the local optima. In our algorithm, we propose a mechanism to adjust the computational budget of local search periodically based on the search status. We also use a dynamically-sized population to store good solutions during the search process. Performance of the proposed algorithm is compared with four benchmark algorithms by four kinds of problems, Max-SAT, bin packing, flow shop scheduling, and personnel scheduling. Our algorithm finds the best solutions for around 90% of the tested instances.

原文英語
主出版物標題2012 IEEE Congress on Evolutionary Computation, CEC 2012
DOIs
出版狀態已發佈 - 2012 十月 4
事件2012 IEEE Congress on Evolutionary Computation, CEC 2012 - Brisbane, QLD, 澳大利亚
持續時間: 2012 六月 102012 六月 15

出版系列

名字2012 IEEE Congress on Evolutionary Computation, CEC 2012

其他

其他2012 IEEE Congress on Evolutionary Computation, CEC 2012
國家澳大利亚
城市Brisbane, QLD
期間2012/06/102012/06/15

ASJC Scopus subject areas

  • Computational Theory and Mathematics
  • Theoretical Computer Science

指紋 深入研究「A VNS-based hyper-heuristic with adaptive computational budget of local search」主題。共同形成了獨特的指紋。

引用此