Stagnation detection has been proposed as a mechanism for randomized search heuristics to escape from local optima by automatically increasing the size of the neighborhood to find the so-called gap size, i.e., the distance to the next improvement. Its usefulness has mostly been considered in simple multimodal landscapes with few local optima that could be crossed one after another. In multimodal landscapes with a more complex location of optima of similar gap size, stagnation detection suffers from the fact that the neighborhood size is frequently reset to $1$ without using gap sizes that were promising in the past.
In this paper, we investigate a new mechanism called radius memory which can be added to stagnation detection to control the search radius more carefully by giving preference to values that were successful in the past. We implement this idea in an algorithm called SD-RLS$^{\text{m}}$ and show compared to previous variants of stagnation detection that it yields speed-ups for linear functions under uniform constraints and the minimum spanning tree problem. Moreover, its running time does not significantly deteriorate on unimodal functions and a generalization of the Jump benchmark. Finally, we present experimental results carried out to study SD-RLS$^{\text{m}}$ and compare it with other algorithms.
Octopus Inspired Optimization (OIO): A Hierarchical Framework for Navigating Protein Fitness Landscapes
College of Communication Engineering, Jilin University(吉林大学通信工程学院);College of Mathematics and System Science, Xinjiang University(新疆大学数学与系统科学学院);Department of Industrial and Systems Engineering, The Hong Kong Polytechnic University(香港理工大学工业及系统工程学系);Tsinghua University-Peking University Joint Center for Life Sciences, Tsinghua University(清华大学-北京大学生命科学联合中心)
Fitness Landscape of Large Language Model-Assisted Automated Algorithm Search
Department of Computer Science, City University of Hong Kong(香港城市大学计算机科学系);School of Mathematics and Statistics, Xi’ an Jiaotong University(西安交通大学数学与统计学学院);HUAWEI Noah’s Ark Lab(华为诺亚实验室);Huawei Cloud EI Service Product Department(华为云EI服务产品部)
Clustering of Local Optima in Combinatorial Fitness Landscapes
University of Nottingham(诺丁汉大学);INRIA Lille - Nord Europe(法国国家信息与自动化研究所里尔-北欧分所);University of Nice Sophia-Antipolis(尼斯索菲亚·安提波利斯大学);University of Lausanne(洛桑大学)
Local Optima Networks: A New Model of Combinatorial Fitness Landscapes
University of Stirling(斯特林大学);INRIA Lille - Nord Europe(法国国家信息与自动化研究所里尔-北欧分所);University of Nice Sophia-Antipolis(尼斯索菲亚-安提波利斯大学);University of Lausanne(洛桑大学)
Land Operations Division, Defence Science and Technology Organisation(国防科学技术组织陆地作战分部)
理解系统如何被设计成可进化的是优化、进化和复杂系统科学研究的基础。因此,许多研究人员已经认识到可进化性的重要性,即在生物进化和演化计算领域中发现更高适应度的新变体的能力。Ciliberti等人(Proc.Nat.Acad.科学,2007)和Wagner(Proc. R. Soc. B.,2008)提出了一个潜在的重要联系之间的鲁棒性和系统的可进化性。特别是,有人认为,鲁棒性实际上可能导致进化的出现。在这里,我们研究了两个设计原则,冗余和退化,实现鲁棒性,我们表明,他们有一个显着不同的影响系统的演化。特别是,纯冗余系统被发现有很少的进化,而系统退化,即分布式鲁棒性,可以是数量级更进化。这些结果提供了深入了解的一般原则,实现进化,并可能被证明是一个重要的一步,在追求进化表示演化计算。