Find research datasets worth reusing

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

<p>The Experimental Data for the Study &quot;Frequency Fitness Assignment: Making Optimization Algorithms Invariant under Bijective Transformations of the Objective Function Value&quot;</p> <p><strong>1. Introduction</strong></p> <p>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.</p> <p><strong>2. Paper</strong></p> <p>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 <a href="https://arxiv.org/abs/2001.01416">arxiv</a> 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.</p> <p><strong>3. Data</strong></p> <p>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.</p> <p><strong>4. Version History</strong></p> <p>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 <a href="http://dx.doi.org/10.5281/zenodo.3598172">10.5281/zenodo.3598172</a>.</p> <p><strong>5. Contact</strong></p> <p>If you have any questions or suggestions, please contact <a href="http://iao.hfuu.edu.cn/team/director">Prof. Dr. Thomas Weise</a> of the <a href="http://iao.hfuu.edu.cn/">Institute of Applied Optimization</a> at <a href="http://www.hfuu.edu.cn">Hefei University</a> in Hefei, Anhui, China via email to <a href="mailto:tweise@hfuu.edu.cn">tweise@hfuu.edu.cn</a> with CC to <a href="mailto:tweise@ustc.edu.cn">tweise@ustc.edu.cn</a>.</p>