Metaheuristics in the Balance: A Survey on Memory‐Saving Approaches for Platforms with Seriously Limited Resources
Souheila Khalfi, Fabio Caraffini, Giovanni Iacca
Centre Universitaire de Mila Université Constantine 2 Swansea University University of Trento
阅读操作
确认中在文库中上传 PDF 后可生成中文音频讲解。
摘要与影响
In the last three decades, the field of computational intelligence has seen a profusion of population‐based metaheuristics applied to a variety of problems, where they achieved state‐of‐the‐art results. This remarkable growth has been fuelled and, to some extent, exacerbated by various sources of inspiration and working philosophies, which have been thoroughly reviewed in several recent survey papers. However, the present survey addresses an important gap in the literature. Here, we reflect on a systematic categorisation of what we call “lightweight” metaheuristics, i.e., optimisation algorithms characterised by purposely limited memory and computational requirements. We focus mainly on two classes of lightweight algorithms: single‐solution metaheuristics and “compact” optimisation algorithms. Our analysis is mostly focused on single‐objective continuous optimisation. We provide an updated and unified view of the most important achievements in the field of lightweight metaheuristics, background concepts, and most important applications. We then discuss the implications of these algorithms and the main open questions and suggest future research directions.
逐年被引趋势
关键指标
同类平均 = 1
同领域 · 同年份 · 同类型
Google Scholar 与 OpenAlex 的被引统计范围不同,数值存在差异属正常。
AI 辅助阅读
依据:摘要
可就本文提问;依据不足时会说明。
学术脉络
学科主题
计算机 / AIMetaheuristic Optimization Algorithms Research
Advanced Multi-Objective Optimization Algorithms · Advanced Optimization Algorithms Research