Addressing the Multiplicity of Solutions in Optical Lens Design as a Niching Evolutionary Algorithms Computational Challenge

05/21/2021
by   Anna V. Kononova, et al.
0

Optimal Lens Design constitutes a fundamental, long-standing real-world optimization challenge. Potentially large number of optima, rich variety of critical points, as well as solid understanding of certain optimal designs per simple problem instances, provide altogether the motivation to address it as a niching challenge. This study applies established Niching-CMA-ES heuristic to tackle this design problem (6-dimensional Cooke triplet) in a simulation-based fashion. The outcome of employing Niching-CMA-ES `out-of-the-box' proves successful, and yet it performs best when assisted by a local searcher which accurately drives the search into optima. The obtained search-points are corroborated based upon concrete knowledge of this problem-instance, accompanied by gradient and Hessian calculations for validation. We extensively report on this computational campaign, which overall resulted in (i) the location of 19 out of 21 known minima within a single run, (ii) the discovery of 540 new optima. These are new minima similar in shape to 21 theoretical solutions, but some of them have better merit function value (unknown heretofore), (iii) the identification of numerous infeasibility pockets throughout the domain (also unknown heretofore). We conclude that niching mechanism is well-suited to address this problem domain, and hypothesize on the apparent multidimensional structures formed by the attained new solutions.

READ FULL TEXT
research
08/03/2015

Evolutionary Multimodal Optimization: A Short Survey

Real world problems always have different multiple solutions. For instan...
research
11/14/2012

A Comparison of Meta-heuristic Search for Interactive Software Design

Advances in processing capacity, coupled with the desire to tackle probl...
research
01/30/2020

Hybridization of interval methods and evolutionary algorithms for solving difficult optimization problems

Reliable global optimization is dedicated to finding a global minimum in...
research
11/16/2017

Conditional Markov Chain Search for the Simple Plant Location Problem improves upper bounds on twelve Körkel-Ghosh instances

We address a family of hard benchmark instances for the Simple Plant Loc...
research
08/25/2020

Say "Sul Sul!" to SimSim, A Sims-Inspired Platform for Sandbox Game AI

This paper proposes environment design in the life simulation game The S...
research
07/30/2019

Iterative Budgeted Exponential Search

We tackle two long-standing problems related to re-expansions in heurist...

Please sign up or login with your details

Forgot password? Click here to reset