Selection Methods To Relax Strict Acceptance Condition In Test-Based Coevolution

Keywords

Pareto coevolution; Strict acceptance condition; Test-based coevolutionary algorithm

Abstract

The Population-based Pareto Hill Climber (P-PHC) algorithm exemplifies coevolutionary computation approaches that manage a group of candidate solutions both used as a population to explore the underlying search space as well as an archive preserving solutions that meet the adopted solution concept. In some circumstances when parsimonious evaluations are desired, inefficiencies can arise from using the same group of candidate solutions for both purposes. The reliance, in such algorithms, on the otherwise beneficial Pareto dominance concept can create bottlenecks on search progress as most newly generated solutions are non-dominated, and thus appear equally qualified to selection, when compared to the current ones they should eventually replace. We propose new selection conditions that include both Pareto dominated and Pareto non-dominated solutions, as well as other factors to help provide distinctions for selection. The potential benefits of also considering Pareto non-dominated solutions are illustrated by a visualization of the underlying interaction space in terms of levels. In addition, we define some new performance metrics that allow one to compare our various selection methods in terms of ideal evaluation of coevolution. Fewer duplicate solutions are retained in the final generation, thus allowing for more efficient usage of the fixed population size.

Publication Date

9-28-2018

Publication Title

2018 IEEE Congress on Evolutionary Computation, CEC 2018 - Proceedings

Document Type

Article; Proceedings Paper

Personal Identifier

scopus

DOI Link

https://doi.org/10.1109/CEC.2018.8477934

Socpus ID

85056271900 (Scopus)

Source API URL

https://api.elsevier.com/content/abstract/scopus_id/85056271900

This document is currently not available here.

Share

COinS