The Practical Use of Problem Encoding Allowing Cheap Fitness Computation of Mutated Individuals

The usual assumption in the Evolutionary Computation field is that a cost of computing single fitness function evaluation is at last similar for all cases. Such assumption does not have to be true. In this paper we consider the recently proposed Problem Encoding Allowing Cheap Fitness Computation of Mutated Individuals (PEACh) effect that allows to significantly reduce the computation load of some of the fitness computations that occur during the evolutionary method run. To the best of our knowledge, it is the first experimental analysis that investigates the results of PEACh application to methods solving NP-hard practical problems.

[1]  Michal Aibin,et al.  The evolutionary cost of Baldwin effect in the routing and spectrum allocation problem in elastic optical networks , 2017, Appl. Soft Comput..

[2]  Kalyanmoy Deb,et al.  Messy Genetic Algorithms: Motivation, Analysis, and First Results , 1989, Complex Syst..

[3]  Tian-Li Yu,et al.  Optimization by Pairwise Linkage Detection, Incremental Linkage Set, and Restricted / Back Mixing: DSMGA-II , 2015, GECCO.

[4]  Pawel B. Myszkowski,et al.  Constructive heuristics for technology-driven Resource Constrained Scheduling Problem , 2015, 2015 Federated Conference on Computer Science and Information Systems (FedCSIS).

[5]  Krzysztof Walkowiak,et al.  Towards solving practical problems of large solution space using a novel pattern searching hybrid evolutionary algorithm - An elastic optical network optimization case study , 2015, Expert Syst. Appl..

[6]  Wayne D. Grover,et al.  Mesh-based Survivable Transport Networks: Options and Strategies for Optical, MPLS, SONET and ATM Networking , 2003 .

[7]  William F. Punch,et al.  Parameter-less population pyramid , 2014, GECCO.

[8]  Xiaoping Zheng,et al.  A Kind of Topology Aggregation Algorithm in Hierarchical Wavelength-Routed Optical Networks , 2004, Photonic Network Communications.

[9]  Dirk Thierens,et al.  Hierarchical problem solving with the linkage tree genetic algorithm , 2013, GECCO '13.

[10]  Pawel B. Myszkowski,et al.  Hybrid ant colony optimization in solving multi-skill resource-constrained project scheduling problem , 2014, Soft Computing.

[11]  Donald R. Jones,et al.  A Taxonomy of Global Optimization Methods Based on Response Surfaces , 2001, J. Glob. Optim..

[12]  Richard J. Povinelli,et al.  IMPROVING GENETIC ALGORITHMS PERFORMANCE BY HASHING FITNESS VALUES , 1999 .

[13]  Michal Witold Przewozniczek,et al.  Problem Encoding Allowing Cheap Fitness Computation of Mutated Individuals , 2017, 2017 IEEE Congress on Evolutionary Computation (CEC).

[14]  Marcin M. Komarnicki,et al.  The influence of fitness caching on modern evolutionary methods and fair computation load measurement , 2018, GECCO.

[15]  Michal Przewozniczek,et al.  Active Multi-Population Pattern Searching Algorithm for flow optimization in computer networks - The novel coevolution schema combined with linkage learning , 2016, Inf. Sci..

[16]  Krzysztof Walkowiak,et al.  Quasi-hierarchical Evolutionary Algorithm for Flow Optimization in Survivable MPLS Networks , 2007, ICCSA.

[17]  Luigi Fratta,et al.  The flow deviation method: An approach to store-and-forward communication network design , 1973, Networks.

[18]  Deep Medhi,et al.  Routing, flow, and capacity design in communication and computer networks , 2004 .

[19]  Halina Kwasnicka,et al.  Multi Population Pattern Searching Algorithm: A New Evolutionary Method Based on the Idea of Messy Genetic Algorithm , 2011, IEEE Transactions on Evolutionary Computation.