A New Swarm-Based Simulated Annealing Hyper-Heuristic Algorithm for Clustering Problem
| Autor: | Mohammad Babrdel Bonab, Tay Yong Haur, Goh Yong Kheng, Siti Zaiton Mohd Hashim |
|---|---|
| Rok vydání: | 2019 |
| Předmět: |
Optimization problem
Computer science Heuristic Swarm behaviour 020206 networking & telecommunications 02 engineering and technology Simulated annealing 0202 electrical engineering electronic engineering information engineering Benchmark (computing) General Earth and Planetary Sciences 020201 artificial intelligence & image processing Hyper-heuristic Heuristics Cluster analysis Algorithm General Environmental Science |
| Zdroj: | Procedia Computer Science. 163:228-236 |
| ISSN: | 1877-0509 |
| DOI: | 10.1016/j.procs.2019.12.104 |
| Popis: | Hyper-heuristic is a new generation of heuristic algorithms which include a set of heuristics that could generate a set of heuristics or automate the process of selecting a batch of heuristics to address different optimization problems. Most of the heuristic and meta-heuristic algorithms work in solution space and are highly problem-dependent and they are limited to use certain number of heuristic models only. Hyper-heuristic consists of two different sections, namely high-level heuristic and low level heuristics; to deal with optimization problems and work in heuristic spaces instead of solution spaces in selecting appropriate heuristics. In this article, we propose a new novel swarm-based simulated annealing hyper-heuristic model to solve clustering problem for analyzing data. The performance of proposed model has been evaluated by several benchmark and real data sets and compared with its state of the art in the literature. The experimental results show that the proposed algorithm provide better results than the alternative methods. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|