Dataset Open Access

The Experimental Data for the Study "Frequency Fitness Assignment: Making Optimization Algorithms Invariant under Bijective Transformations of the Objective Function Value"

Thomas Weise; Zhize WU; Xinlu LI; Yan CHEN

The Experimental Data for the Study "Frequency Fitness Assignment: Making Optimization Algorithms Invariant under Bijective Transformations of the Objective Function Value"

1. Introduction

Frequency Fitness Assignment (FFA) replaces the objective value in the selection step of an optimization method with its encounter frequency in any selection step so far. It turns static problems into dynamic ones. Here we experimentally investigated this approach in two important contexts: First, we integrated it into a basic (1+1)-EA, obtaining the (1+1)-FEA. We applied both algorithms to several well-known benchmark problems with bit-string based search spaces, including the OneMax, LeadingOnes, TwoMax, Jump, Plateau, and W-Model functions. We also applied them to the Max-3-Sat instances from SATLib. We then also integrated FFA into a Memetic Algorithm for the Job Shop Problem.

2. Paper

This data is used as the basis for the following article: Thomas Weise, Zhize Wu, Xinlu Li, and Yan Chen. Frequency Fitness Assignment: Making Optimization Algorithms Invariant under Bijective Transformations of the Objective Function Value, originally submitted to arxiv on 2020-01-06 (under the title Frequency Fitness Assignment: Making Optimization Algorithms Invariant under Bijective Transformations of the Objective Function), updated with the new data in June 2020, and submitted to the IEEE Transactions on Evolutionary Computation.

3. Data

This data set contains all the results of these experiments, the source codes used in the experiments (i.e., the algorithm implementations), as well as the scripts used for evaluating the results.

4. Version History

This is the second version of the data set, including extended experiments and more evaluation results. Most importantly, data for larger scales of OneMax and LeadingOnes has been added. The original version is at 10.5281/zenodo.3598172.

5. Contact

If you have any questions or suggestions, please contact Prof. Dr. Thomas Weise of the Institute of Applied Optimization at Hefei University in Hefei, Anhui, China via email to tweise@hfuu.edu.cn with CC to tweise@ustc.edu.cn.

Files (1.6 GB)
Name Size
ffa-empirical-complexity_v2_zenodo.tar.xz
md5:1310d23f17538feef916da7eafb00f9c
1.6 GB Download
30
4
views
downloads
All versions This version
Views 304
Downloads 42
Data volume 3.4 GB3.1 GB
Unique views 254
Unique downloads 32

Share

Cite as