A feature rich distance-based many-objective visualisable test problem generator
Fieldsend, J., Chugh, T., Allmendinger, R., & Miettinen, K. (2019). A feature rich distance-based many-objective visualisable test problem generator. In GECCO '19 : Proceedings of the Genetic and Evolutionary Computation Conference (pp. 541-549). ACM. https://doi.org/10.1145/3321707.3321727
© 2019 Association for Computing Machinery
In optimiser analysis and design it is informative to visualise how a search point/population moves through the design space over time. Visualisable distance-based many-objective optimisation problems have been developed whose design space is in two-dimensions with arbitrarily many objective dimensions. Previous work has shown how disconnected Pareto sets may be formed, how problems can be projected to and from arbitrarily many design dimensions, and how dominance resistant regions of design space may be defined. Most recently, a test suite has been proposed using distances to lines rather than points. However, active use of visualisable problems has been limited. This may be because the type of problem characteristics available has been relatively limited compared to many practical problems (and non-visualisable problem suites). Here we introduce the mechanisms required to embed several widely seen problem characteristics in the existing problem framework. These include variable density of solutions in objective space, landscape discontinuities, varying objective ranges, neutrality, and non-identical disconnected Pareto set regions. Furthermore, we provide an automatic problem generator (as opposed to hand-tuned problem definitions). The flexibility of the problem generator is demonstrated by analysing the performance of popular optimisers on a range of sampled instances. ...
Parent publication ISBN978-1-4503-6111-8
ConferenceGenetic and Evolutionary Computation Conference
Is part of publicationGECCO '19 : Proceedings of the Genetic and Evolutionary Computation Conference
Publication in research information system
MetadataShow full item record
Additional information about fundingThis work was supported by the Engineering and Physical Sciences Research Council [grant number EP/N017846/1] and the Natural Environment Research Council [grant number NE/P017436/1]. This research is related to the thematic research area DEMO (jyu.fi/demo) of the University of Jyväskylä.
Showing items with similar title or keywords.
A Visualizable Test Problem Generator for Many-Objective Optimization Fieldsend, Jonathan E.; Chugh, Tinkle; Allmendinger, Richard; Miettinen, Kaisa (Institute of Electrical and Electronics Engineers (IEEE), 2022)Visualizing the search behavior of a series of points or populations in their native domain is critical in understanding biases and attractors in an optimization process. Distancebased many-objective optimization test ...
Surrogate-Assisted Evolutionary Optimization of Large Problems Chugh, Tinkle; Sun, Chaoli; Wang, Handing; Jin, Yaochu (Springer, 2020)This chapter presents some recent advances in surrogate-assisted evolutionary optimization of large problems. By large problems, we mean either the number of decision variables is large, or the number of objectives is ...
A Surrogate-assisted Reference Vector Guided Evolutionary Algorithm for Computationally Expensive Many-objective Optimization Chugh, Tinkle; Jin, Yaochu; Miettinen, Kaisa; Hakanen, Jussi; Sindhya, Karthik (Institute of Electrical and Electronics Engineers, 2018)We propose a surrogate-assisted reference vector guided evolutionary algorithm (EA) for computationally expensive optimization problems with more than three objectives. The proposed algorithm is based on a recently developed ...
A New Paradigm in Interactive Evolutionary Multiobjective Optimization Saini, Bhupinder Singh; Hakanen, Jussi; Miettinen, Kaisa (Springer, 2020)Over the years, scalarization functions have been used to solve multiobjective optimization problems by converting them to one or more single objective optimization problem(s). This study proposes a novel idea of solving ...
Probabilistic Selection Approaches in Decomposition-based Evolutionary Algorithms for Offline Data-Driven Multiobjective Optimization Mazumdar, Atanu; Chugh, Tinkle; Hakanen, Jussi; Miettinen, Kaisa (IEEE, 2022)In offline data-driven multiobjective optimization, no new data is available during the optimization process. Approximation models, also known as surrogates, are built using the provided offline data. A multiobjective ...