返回
A continuous-state cellular automata algorithm for global optimization
DOI:10.1016/j.eswa.2021.114930.png)
摘要
En 中文
Cellular automata are capable of developing complex behaviors based on simple local interactions between their elements. Some of these characteristics have been used to propose and improve metaheuristics for global optimization; however, the properties offered by the evolution rules in cellular automata have not yet been used directly in optimization tasks. Inspired by the complexity that various evolution rules of cellular automata can offer, the continuous-state cellular automata algorithm is proposed. In this way, the algorithm takes advantage of different evolution rules to maintain a balance that maximizes the exploration and exploitation properties in each iteration. The efficiency of the algorithm is proven with 48 test problems widely used in the literature, 4 engineering applications that were also used in recent literature, and the design of adaptive infinite-impulse response filters, with the reference functions of 10 full-order filters being tested. The numerical results prove its competitiveness in comparison with state-of-the-art algorithms. The source codes of the proposed algorithm are publicly available at https://github.com/juanseck/CCAA.git.
Keyword:
Global optimization
Cellular automata
Metaheuristics
Engineering applications
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7.5
论文数:
3.1W
被引数:
13.6W
机构
引用论文
The solution of the concurrent layout scheduling problem in the job-shop environment through a local neighborhood search algorithm通过局部邻域搜索算法解决job-shop环境中的并发布局调度问题

