Home > Research > Publications & Outputs > Automatic generation of algorithms for robust o...

Associated organisational unit


Text available via DOI:

View graph of relations

Automatic generation of algorithms for robust optimisation problems using Grammar-Guided Genetic Programming

Research output: Contribution to Journal/MagazineJournal articlepeer-review

Article number105364
<mark>Journal publication date</mark>30/09/2021
<mark>Journal</mark>Computers and Operations Research
Number of pages25
Publication StatusPublished
Early online date7/05/21
<mark>Original language</mark>English


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. © 2021 The Authors