This paper proposes a novel evolutionary algorithm called Epistocracy which incorporates human socio-political behavior and intelligence to solve complex optimization problems. The inspiration of the Epistocracy algorithm originates from a political regime where educated people have more voting power than the uneducated or less educated. The algorithm is a self-adaptive, and multi-population optimizer in which the evolution process takes place in parallel for many populations led by a council of leaders. To avoid stagnation in poor local optima and to prevent a premature convergence, the algorithm employs multiple mechanisms such as dynamic and adaptive leadership based on gravitational force, dynamic population allocation and diversification, variance-based step-size determination, and regression-based leadership adjustment. The algorithm uses a stratified sampling method called Latin Hypercube Sampling (LHS) to distribute the initial population more evenly for exploration of the search space and exploitation of the accumulated knowledge. To investigate the performance and evaluate the reliability of the algorithm, we have used a set of multimodal benchmark functions, and then applied the algorithm to the MNIST dataset to further verify the accuracy, scalability, and robustness of the algorithm. Experimental results show that the Epistocracy algorithm outperforms the tested state-of-the-art evolutionary and swarm intelligence algorithms in terms of performance, precision, and convergence.
ReEvo: Large Language Models as Hyper-Heuristics with Reflective Evolution
Peking University(北京大学);Southeast University(东南大学);Singapore Management University(新加坡管理大学);KAIST(韩国科学技术院);PKU-Wuhan Institute for Artificial Intelligence(北京大学武汉人工智能研究院)
MAP-Elites based Hyper-Heuristic for the Resource Constrained Project Scheduling Problem
Commonwealth Scientific and Industrial Research Organisation(联邦科学与工业研究组织);Indian Institute of Technology(印度理工学院);University of New South Wales(新南威尔士大学)
Selection Hyper-heuristics Can Automatically Adjust the Learning Period to Optimally Solve Pseudo-Boolean Problems
Laboratoire d’Informatique (LIX), CNRS, École Polytechnique, Institut Polytechnique de Paris(信息实验室(LIX),法国国家科学研究中心,巴黎高等理工学院,巴黎理工学院);Department of Computer Science and Engineering, Southern University of Science and Technology(计算机科学与工程系,南方科技大学);School of Computing & Communications, Lancaster University Leipzig(计算与通信学院,莱斯特大学莱比锡分校)
WASHH: An Anchor-Aware Whale-Guided Selection Hyper-Heuristic for Continuous Optimization and SVC Configuration
Faculty of Applied Sciences, Macao Polytechnic University(澳门理工学院应用科学学院);School of Mechanical and Electrical Engineering and Automation, Shanghai University(上海大学机械与自动化工程学院);Pazhou Lab (Huangpu), Guangzhou(广州 Pazhou 实验室(黄埔));College of Animal Science and Technology, Zhongkai University of Agriculture and Engineering(仲恺农业工程学院动物科学与技术学院);Macao Polytechnic University(澳门理工学院)
Accelerated Genetic Programming Hyper-Heuristics for Simulation-Based Scheduling via Agentic AI
Research Engineering Team REANNZ New Zealand;Centre for Data Science;Artificial Intelligence \& School of Engineering;Computer Science Victoria University of Wellington New Zealand