Preselection via Classification: A Case Study on Evolutionary Multiobjective Optimization

08/03/2017
by   Jinyuan Zhang, et al.
0

In evolutionary algorithms, a preselection operator aims to select the promising offspring solutions from a candidate offspring set. It is usually based on the estimated or real objective values of the candidate offspring solutions. In a sense, the preselection can be treated as a classification procedure, which classifies the candidate offspring solutions into promising ones and unpromising ones. Following this idea, we propose a classification based preselection (CPS) strategy for evolutionary multiobjective optimization. When applying classification based preselection, an evolutionary algorithm maintains two external populations (training data set) that consist of some selected good and bad solutions found so far; then it trains a classifier based on the training data set in each generation. Finally it uses the classifier to filter the unpromising candidate offspring solutions and choose a promising one from the generated candidate offspring set for each parent solution. In such cases, it is not necessary to estimate or evaluate the objective values of the candidate offspring solutions. The classification based preselection is applied to three state-of-the-art multiobjective evolutionary algorithms (MOEAs) and is empirically studied on two sets of test instances. The experimental results suggest that classification based preselection can successfully improve the performance of these MOEAs.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/10/2019

Evolutionary Multi-Objective Optimization Driven by Generative Adversarial Networks

Recently, more and more works have proposed to drive evolutionary algori...
research
10/11/2019

Evolutionary Multi-Objective Optimization Driven by Generative Adversarial Networks (GANs)

Recently, more and more works have proposed to drive evolutionary algori...
research
04/14/2014

A Theoretical Assessment of Solution Quality in Evolutionary Algorithms for the Knapsack Problem

Evolutionary algorithms are well suited for solving the knapsack problem...
research
12/18/2017

Selective-Candidate Framework with Similarity Selection Rule for Evolutionary Optimization

This paper proposes to resolve limitations of the traditional one-reprod...
research
02/20/2020

Uncovering Coresets for Classification With Multi-Objective Evolutionary Algorithms

A coreset is a subset of the training set, using which a machine learnin...
research
07/18/2021

Multi-objective Test Case Selection Through Linkage Learning-based Crossover

Test Case Selection (TCS) aims to select a subset of the test suite to r...
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...

Please sign up or login with your details

Forgot password? Click here to reset