Subpopulation initialization driven by linkage learning for dealing with the Long-Way-To-Stuck effect

Abstract The maintenance of many subpopulations is an important technique employed in evolutionary methods. However, the use of a multi-population approach has its drawbacks. Among all, it requires spending high amounts of available resources. Therefore, the methods that dynamically manage the number of subpopulations gain an increasing interest due to their capability of adjusting the subpopulation number to their current state. They are shown to be capable of reaching excellent results. In this paper, we identify the Long-Way-To-Stuck effect and show it on the base of the practical, NP-complete problem. Such a phenomenon occurs when a randomly initialized population of an evolutionary method must be processed through many iterations before it is incapable of improving the best-found solution. If so, then a large amount of computational resources must be spent on subpopulation initialization, which may turn multi-population methods ineffective. Therefore, in this paper, we propose the Linkage Learning-Driven Subpopulation Initialization (LLDSI) that limits the costs of subpopulation initialization and significantly improves the effectiveness methods dynamically managing the subpopulation number.

[1]  Wei-Der Chang,et al.  A modified particle swarm optimization with multiple subpopulations for multimodal function optimization problems , 2015, Appl. Soft Comput..

[2]  Gexiang Zhang,et al.  Enhancing distributed differential evolution with multicultural migration for global numerical optimization , 2013, Inf. Sci..

[3]  Larry Bull,et al.  Toward the Coevolution of Novel Vertical-Axis Wind Turbines , 2013, IEEE Transactions on Evolutionary Computation.

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

[5]  G. Üçoluk,et al.  A building block favoring reordering method for gene positions in genetic algorithms , 2001 .

[6]  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..

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

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

[9]  De-Shuang Huang,et al.  Multi-sub-swarm particle swarm optimization algorithm for multimodal function optimization , 2007, 2007 IEEE Congress on Evolutionary Computation.

[10]  Henri Pierreval,et al.  A novel hybrid evolutionary approach for capturing decision maker knowledge into the unequal area facility layout problem , 2015, Expert Syst. Appl..

[11]  Ferrante Neri,et al.  An Adaptive Multimeme Algorithm for Designing HIV Multidrug Therapies , 2007, IEEE/ACM Transactions on Computational Biology and Bioinformatics.

[12]  Halina Kwasnicka,et al.  Managing of cooperative genetic algorithms by intelligent agent , 2005, 5th International Conference on Intelligent Systems Design and Applications (ISDA'05).

[13]  Krzysztof Walkowiak A New Method of Primary Routes Selection for Local Restoration , 2004, NETWORKING.

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

[15]  Arunabha Sen,et al.  The transformation of the k-Shortest Steiner trees search problem into binary dynamic problem for effective evolutionary methods application , 2019, Inf. Sci..

[16]  Ferrante Neri,et al.  An Optimization Spiking Neural P System for Approximately Solving Combinatorial Optimization Problems , 2014, Int. J. Neural Syst..

[17]  Wayne D. Grover,et al.  Comparison of k-shortest paths and maximum flow routing for network facility restoration , 1994, IEEE J. Sel. Areas Commun..

[18]  Yang Yan,et al.  Parallel multi-population Particle Swarm Optimization Algorithm for the Uncapacitated Facility Location problem using OpenMP , 2008, 2008 IEEE Congress on Evolutionary Computation (IEEE World Congress on Computational Intelligence).

[19]  Günter Rudolph,et al.  How Mutation and Selection Solve Long-Path Problems in Polynomial Expected Time , 1996, Evolutionary Computation.

[20]  Xin Yao,et al.  Large scale evolutionary optimization using cooperative coevolution , 2008, Inf. Sci..

[21]  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.

[22]  Xinghuo Yu,et al.  A Maximum-Flow-Based Complex Network Approach for Power System Vulnerability Analysis , 2013, IEEE Transactions on Industrial Informatics.

[23]  Wen-Chih Peng,et al.  Particle Swarm Optimization With Recombination and Dynamic Linkage Discovery , 2007, IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics).

[24]  Nasser Mozayani,et al.  The impact of diversity on performance of holonic multi-agent systems , 2016, Eng. Appl. Artif. Intell..

[25]  Penousal Machado,et al.  Island models for cluster geometry optimization: how design options impact effectiveness and diversity , 2015, Journal of Global Optimization.

[26]  Mohamed Kurdi,et al.  An improved island model memetic algorithm with a new cooperation phase for multi-objective job shop scheduling problem , 2017, Comput. Ind. Eng..

[27]  Helton do Nascimento Alves A Multi-population Hybrid Algorithm to Solve Multi-objective Remote Switches Placement Problem in Distribution Networks , 2015 .

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

[29]  Martin V. Butz,et al.  Hierarchical BOA on random decomposable problems , 2006, GECCO '06.

[30]  David E. Goldberg,et al.  Dependency Structure Matrix, Genetic Algorithms, and Effective Recombination , 2009, Evolutionary Computation.

[31]  Michal Przewozniczek,et al.  The Practical Use of Problem Encoding Allowing Cheap Fitness Computation of Mutated Individuals , 2018, 2018 Federated Conference on Computer Science and Information Systems (FedCSIS).

[32]  Kalyanmoy Deb,et al.  RapidAccurate Optimization of Difficult Problems Using Fast Messy Genetic Algorithms , 1993, ICGA.

[33]  Kalyanmoy Deb,et al.  Long Path Problems , 1994, PPSN.

[34]  Edwin Lughofer,et al.  DECMO2: a robust hybrid and adaptive multi-objective evolutionary algorithm , 2014, Soft Computing.

[35]  Michal Przewozniczek,et al.  Towards Finding an Effective Uniform and Single Point Crossover Balance for Optimization of Elastic Optical Networks , 2015, 2015 Second European Network Intelligence Conference.

[36]  Pedro Sousa,et al.  Segment Routing Single Link Failure Congestion Optimization. , 2018 .

[37]  Ilpo Poikolainen,et al.  Cluster-Based Population Initialization for differential evolution frameworks , 2015, Inf. Sci..

[38]  Vijay P. Kumar,et al.  Switched optical backbone for cost-effective scalable core IP networks , 2003, IEEE Commun. Mag..

[39]  Xiaodong Li,et al.  Cooperative Co-Evolution With Differential Grouping for Large Scale Optimization , 2014, IEEE Transactions on Evolutionary Computation.

[40]  Michal Aibin,et al.  The Effectiveness of the Simplicity in Evolutionary Computation , 2017, ACIIDS.

[41]  Weiwei Zhang,et al.  Cooperative Differential Evolution With Multiple Populations for Multiobjective Optimization , 2016, IEEE Transactions on Cybernetics.

[42]  Jonathan E. Fieldsend,et al.  Running Up Those Hills: Multi-modal search with the niching migratory multi-swarm optimiser , 2014, 2014 IEEE Congress on Evolutionary Computation (CEC).

[43]  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..

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