On the easiest and hardest fitness functions
- Submitting institution
-
Nottingham Trent University
- Unit of assessment
- 11 - Computer Science and Informatics
- Output identifier
- 24 - 699597
- Type
- D - Journal article
- DOI
-
10.1109/TEVC.2014.2318025
- Title of journal
- IEEE Transactions on Evolutionary Computation
- Article number
- -
- First page
- 295
- Volume
- 19
- Issue
- 2
- ISSN
- 1089-778X
- Open access status
- Out of scope for open access requirements
- Month of publication
- April
- Year of publication
- 2014
- URL
-
-
- Supplementary information
-
-
- Request cross-referral to
- -
- Output has been delayed by COVID-19
- No
- COVID-19 affected output statement
- -
- Forensic science
- No
- Criminology
- No
- Interdisciplinary
- No
- Number of additional authors
-
2
- Research group(s)
-
A - Computing and Informatics Research Centre
- Citation count
- 26
- Proposed double-weighted
- No
- Reserve for an output with double weighting
- No
- Additional information
- This paper proves “that the unimodal functions are the easiest and deceptive functions are the hardest in terms of the time-fitness landscape” [https://doi.org/10.1016/j.ins.2017.10.038]. This is significant because the conclusion was proved in a rigorous way. It was adopted as the theoretical assumption in the constructing of benchmark problems in evolutionary computation [https://doi.org/10.1016/j.swevo.2018.04.005]. The work attracted other researchers’ interest and led to new cooperation with University of Sheffield and follow-on publications on easiest functions for mutation operators in bio-Inspired optimisation [https://doi.org/10.1007/s00453-016-0201-4]. This paper was collaboration with University of Birmingham and Chinese Academy of Sciences.
- Author contribution statement
- -
- Non-English
- No
- English abstract
- -
