Simulating non-stationary operators in search algorithms |
| |
Affiliation: | 1. Dipartimento di Ingegneria Elettrica, Elettronica e Informatica, University of Catania, viale A. Doria 6, 95125 Catania, Italy;2. National Institute of Biostructures and Biosystems (INBB), Viale delle Medaglie d׳Oro 305, 00136 Rome, Italy;1. Department of Applied Mathematics and Computer Science, Ghent University, Belgium;2. Affectv Limited, London, United Kingdom;3. Department of Computer Science and AI, Research Center on Information and Communications Technology (CITIC-UGR), University of Granada, Spain;4. Department of Information Systems, Faculty of Computing and Information Technology, King Abdulaziz University, Jeddah, Saudi Arabia;1. CAS Key Laboratory of Technology in Geo-spatial Information Processing and Application Systems, University of Science and Technology of China, Hefei, China;2. USTC-Birmingham Joint Research Institute in Intelligent Computation and Its Applications (UBRI), University of Science and Technology of China, Hefei, China |
| |
Abstract: | In this paper, we propose new scenarios for simulating search operators whose behaviors often change continuously during the search. In these scenarios, the performance of such operators decreases while they are applied. This is motivated by the fact that operators for optimization problems are often roughly classified into exploitation and exploration operators. Our simulation model is used to compare the performances of operator selection policies and to identify their ability to handle specific non-stationary operators. An experimental study highlights respective behaviors of operator selection policies when faced to such non-stationary search scenarios. |
| |
Keywords: | Adaptive operator selection Operator-based algorithms Multi-armed bandit Island models |
本文献已被 ScienceDirect 等数据库收录! |
|