返回
Automatic generation of algorithms for robust optimisation problems using Grammar-Guided Genetic Programming
DOI:10.1016/j.cor.2021.105364.png)
摘要
En 中文
We develop algorithms capable of tackling robust black-box optimisation problems, where the number of model runs is limited. When a desired solution cannot be implemented exactly the aim is to find a robust one, where the worst case in an uncertainty neighbourhood around a solution still performs well. To investigate improved methods we employ an automatic generation of algorithms approach: Grammar-Guided Genetic Programming. We develop algorithmic building blocks in a Particle Swarm Optimisation framework, define the rules for constructing heuristics from these components, and evolve populations of search algorithms for robust problems. Our algorithmic building blocks combine elements of existing techniques and new features, resulting in the investigation of a novel heuristic solution space. We obtain algorithms which improve upon the current state of the art. We also analyse the component level breakdowns of the populations of algorithms developed against their performance, to identify high-performing heuristic components for robust problems.
Keyword:
Robust optimisation
Implementation uncertainty
Metaheuristics
Global optimisation
Genetic programming
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
C
IF:
4.3
论文数:
6.5K
被引数:
1.8W
机构
引用论文
Particle swarm metaheuristics for robust optimisation with implementation uncertainty具有实现不确定性的鲁棒优化的粒子群元启发式算法
A largest empty hypersphere metaheuristic for robust optimisation with implementation uncertainty具有实现不确定性的鲁棒优化的最大空超球元启发式

