The Experimental Data for the Study "Frequency Fitness Assignment: Making Optimization Algorithms Invariant under Bijective Transformations of the Objective Function" 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. 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. 3. 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.