Michal W. Przewozniczek
ABSTRACT
Problem decomposition is an important part of many state-of-the-art Evolutionary Algorithms (EAs). The quality of the decomposition may be decisive for the EA effectiveness and efficiency. Therefore, in this paper, we focus on the recent proposition of Linkage Learning based on Local Optimization (3LO). 3LO is an empirical linkage learning (ELL) technique and is proven never to report the false linkage. False linkage is one of the possible linkage defects and occurs when linkage marks two independent genes as a dependent. Although thanks to the problem decomposition quality, the use of 3LO may lead to excellent results, its main disadvantage is its high computational cost. This disadvantage makes 3LO not applicable to state-of-the-art EAs that originally employed Statistical-based Linkage Learning (SLL) and frequently update the linkage information. Therefore, we propose the Direct Linkage Empirical Discovery technique (DLED) that preserves 3LO advantages, reduces its costs, and we prove that it is precise in recognizing the direct linkage. The concept of direct linkage, which we identify in this paper, is related to the quality of the decomposition of overlapping problems. The results show that incorporating DLED in three significantly different state-of-the-art EAs may lead to promising results.
- Rubén Aguilar-Rivera, Manuel Valenzuela-Rendón, and J.J. Rodríguez-Ortiz. 2015. Genetic algorithms and Darwinian approaches in financial applications: A survey. Expert Systems with Applications 42, 21 (2015), 7684--7697. Google Scholar
Digital Library
- Md Asafuddoula, Tapabrata Ray, and Ruhul Sarker. 2011. An adaptive differential evolution algorithm and its performance on real world optimization problems. In 2011 IEEE congress of evolutionary computation (CEC). IEEE, 1057--1062.Google Scholar
- Maumita Bhattacharya, Rafiqul Islam, and Jemal Abawajy. 2016. Evolutionary optimization: a big data perspective. Journal of network and computer applications 59 (2016), 416--426.Google ScholarDigital Library
- Peter A.N. Bosman, Ngoc Hoang Luong, and Dirk Thierens. 2016. Expanding from Discrete Cartesian to Permutation Gene-pool Optimal Mixing Evolutionary Algorithms. In Proceedings of the Genetic and Evolutionary Computation Conference 2016 (GECCO '16). ACM, 637--644.Google ScholarDigital Library
- Chia-hua Chang and Tian-Li Yu. 2016. Investigation on Parameterless Schemes for DSMGA-II. In Proceedings of the 2016 on Genetic and Evolutionary Computation Conference Companion (GECCO '16 Companion). ACM, 85--86.Google Scholar
- Ping-Lin Chen, Chun-Jen Peng, Chang-Yi Lu, and Tian-Li Yu. 2017. Two-edge Graphical Linkage Model for DSMGA-II. In Proceedings of the Genetic and Evolutionary Computation Conference (Berlin, Germany) (GECCO '17). ACM, 745--752.Google ScholarDigital Library
- Stephen Chen, James Montgomery, and Antonio Bolufé-Röhler. 2015. Measuring the curse of dimensionality and its effects on particle swarm optimization and differential evolution. Applied Intelligence 42, 3 (2015), 514--526.Google ScholarDigital Library
- Ying-ping Chen, Tian-Li Yu, Kumara Sastry, and David E. Goldberg. 2007. A Survey of Linkage Learning Techniques in Genetic and Evolutionary Algorithms. Illinois Genetic Algorithms Library, Tech. Rep..Google Scholar
- Alberto Colorni, Marco Dorigo, Francesco Maffioli, Vittorio Maniezzo, GIOVANNI Righini, and Marco Trubian. 1996. Heuristics from nature for hard combinatorial optimization problems. International Transactions in Operational Research 3, 1 (1996), 1--21.Google ScholarCross Ref
- Swagatam Das and Ponnuthurai N Suganthan. 2010. Problem definitions and evaluation criteria for CEC 2011 competition on testing evolutionary algorithms on real world optimization problems. Jadavpur University, Nanyang Technological University, Kolkata (2010), 341--359.Google Scholar
- Kalyanmoy Deb and David E. Goldberg. 1993. Sufficient Conditions for Deceptive and Easy Binary Functions. Ann. Math. Artif. Intell. 10, 4 (1993), 385--408.Google ScholarCross Ref
- Kaizhou Gao, Zhiguang Cao, Le Zhang, Zhenghua Chen, Yuyan Han, and Quanke Pan. 2019. A review on swarm intelligence and evolutionary algorithms for solving flexible job shop scheduling problems. IEEE/CAA Journal of Automatica Sinica 6, 4 (2019), 904--916.Google ScholarCross Ref
- David E. Goldberg, Kalyanmoy Deb, and Jeffrey Horn. 1992. Massive Multimodality, Deception, and Genetic Algorithms. Urbana (1992).Google Scholar
- Brian W. Goldman and William F. Punch. 2014. Parameter-less Population Pyramid. In Proceedings of the 2014 Annual Conference on Genetic and Evolutionary Computation (Vancouver, BC, Canada) (GECCO '14). ACM, 785--792.Google Scholar
- N. Hansen, S. D. Müller, and P. Koumoutsakos. 2003. Reducing the Time Complexity of the Derandomized Evolution Strategy with Covariance Matrix Adaptation (CMA-ES). Evolutionary Computation 11, 1 (2003), 1--18. Google ScholarDigital Library
- Georges R. Harik and Fernando G. Lobo. 1999. A Parameter-less Genetic Algorithm. In Proceedings of the 1st Annual Conference on Genetic and Evolutionary Computation - Volume 1 (Orlando, Florida) (GECCO'99). 258--265.Google Scholar
- Shih-Huan Hsu and Tian-Li Yu. 2015. Optimization by Pairwise Linkage Detection, Incremental Linkage Set, and Restricted / Back Mixing: DSMGA-II. In Proceedings of the 2015 Annual Conference on Genetic and Evolutionary Computation (GECCO '15). ACM, 519--526.Google ScholarDigital Library
- Marcin M. Komarnicki and Michal W. Przewozniczek. 2017. Parameter-less Population Pyramid with Feedback. In Proceedings of the Genetic and Evolutionary Computation Conference Companion (GECCO '17). ACM, 109--110.Google Scholar
- Marcin M. Komarnicki, Michal W. Przewozniczek, and Tomasz M. Durda. 2020. Comparative Mixing for DSMGA-II. In Proceedings of the 2020 Genetic and Evolutionary Computation Conference (Cancún, Mexico) (GECCO '20). Association for Computing Machinery, New York, NY, USA, 708--716. Google ScholarDigital Library
- S. Kullback and R. A. Leibler. 1951. On Information and Sufficiency. Ann. Math. Statist. 22, 1 (03 1951), 79--86. Google ScholarCross Ref
- M. N. Omidvar, M. Yang, Y. Mei, X. Li, and X. Yao. 2017. DG2: A Faster and More Accurate Differential Grouping for Large-Scale Black-Box Optimization. IEEE Transactions on Evolutionary Computation 21, 6 (Dec 2017), 929--942.Google ScholarDigital Library
- Kalia Orphanou, Dirk Thierens, and Peter A. N. Bosman. 2018. Learning Bayesian Network Structures with GOMEA. In Proceedings of the Genetic and Evolutionary Computation Conference (Kyoto, Japan) (GECCO '18). Association for Computing Machinery, New York, NY, USA, 1007--1014. Google ScholarDigital Library
- Martin Pelikan and David E. Goldberg. 2001. Escaping Hierarchical Traps with Competent Genetic Algorithms. In Proceedings of the 3rd Annual Conference on Genetic and Evolutionary Computation (San Francisco, California) (GECCO'01). Morgan Kaufmann Publishers Inc., San Francisco, CA, USA, 511--518.Google Scholar
- Michal Witold Przewozniczek, Piotr Dziurzanski, Shuai Zhao, and Leandro Soares Indrusiak. 2021. Multi-Objective parameter-less population pyramid for solving industrial process planning problems. Swarm and Evolutionary Computation 60 (2021), 100773. Google Scholar
- Michal W. Przewozniczek, Bartosz Frej, and Marcin M. Komarnicki. 2020. On Measuring and Improving the Quality of Linkage Learning in Modern Evolutionary Algorithms Applied to Solve Partially Additively Separable Problems. In Proceedings of the 2020 Genetic and Evolutionary Computation Conference (Cancún, Mexico) (GECCO '20). Association for Computing Machinery, New York, NY, USA, 742--750.Google Scholar
- Michal W. Przewozniczek and Marcin M. Komarnicki. 2018. The Influence of Fitness Caching on Modern Evolutionary Methods and Fair Computation Load Measurement. In Proceedings of the Genetic and Evolutionary Computation Conference Companion (GECCO '18). ACM, 241--242.Google Scholar
- Michal W. Przewozniczek and Marcin M. Komarnicki. 2020. Empirical Linkage Learning. IEEE Transactions on Evolutionary Computation 24, 6 (Dec 2020), 1097--1111.Google ScholarDigital Library
- Michał Witold Przewoźniczek. 2020. Subpopulation initialization driven by linkage learning for dealing with the Long-Way-To-Stuck effect. Information Sciences 521 (2020), 62--80. Google ScholarDigital Library
- Michał Witold Przewoźniczek, Krzysztof Walkowiak, Arunabha Sen, Marcin Komarnicki, and Piotr Lechowicz. 2019. The transformation of the k-Shortest Steiner trees search problem into binary dynamic problem for effective evolutionary methods application. Information Sciences 479 (2019), 1--19. Google ScholarCross Ref
- Dirk Thierens. 2010. The Linkage Tree Genetic Algorithm. In Parallel Problem Solving from Nature, PPSN XI: 11th International Conference, Kraków, Poland, September 11-15, 2010, Proceedings, Part I. 264--273.Google Scholar
- Dirk Thierens and Peter Bosman. 2012. Predetermined versus Learned Linkage Models. In Proceedings of the 14th Annual Conference on Genetic and Evolutionary Computation (Philadelphia, Pennsylvania, USA) (GECCO '12). Association for Computing Machinery, New York, NY, USA, 289--296.Google ScholarDigital Library
- Dirk Thierens and Peter A.N. Bosman. 2011. Optimal Mixing Evolutionary Algorithms. In Proceedings of the 13th Annual Conference on Genetic and Evolutionary Computation (Dublin, Ireland) (GECCO '11). ACM, New York, NY, USA, 617--624.Google Scholar
- Tian-Li Yu, David E. Goldberg, Kumara Sastry, Claudio F. Lima, and Martin Pelikan. 2009. Dependency Structure Matrix, Genetic Algorithms, and Effective Recombination. Evol. Comput. 17, 4 (2009), 595--626.Google ScholarDigital Library
Index Terms
- Direct linkage discovery with empirical linkage learning
Recommendations
Hybrid linkage learning for permutation optimization with Gene-pool optimal mixing evolutionary algorithms
GECCO '21: Proceedings of the Genetic and Evolutionary Computation Conference CompanionLinkage learning techniques are employed to discover dependencies between problem variables. This knowledge can then be leveraged in an Evolutionary Algorithm (EA) to improve the optimization process. Of particular interest is the Gene-pool Optimal ...
Empirical linkage learning
GECCO '20: Proceedings of the 2020 Genetic and Evolutionary Computation Conference CompanionLinkage learning is employed by many state-of-the-art evolutionary methods designed for solving problems in discrete domains. The effectiveness of these methods is dependent on linkage quality. The linkage may suffer to two different inaccuracy types. ...
More concise and robust linkage learning by filtering and combining linkage hierarchies
GECCO '13: Proceedings of the 15th annual conference on Genetic and evolutionary computationGenepool Optimal Mixing Evolutionary Algorithms (GOMEAs) were recently proposed as a new way of designing linkage-friendly, efficiently-scalable evolutionary algorithms (EAs). GOMEAs combine the building of linkage models with an intensive, greedy ...
Comments