Multifactorial evolutionary algorithm for solving clustered tree problems: competition among Cayley codes

The Multifactorial Evolutionary Algorithm (MFEA) has emerged as an effective variant of the evolutionary algorithm. MFEA has been successfully applied to deal with various problems with many different types of solution encodings. Although clustered tree problems play an important role in real life, there haven’t been much research on exploiting the strengths of MFEA to solve these problems. One of the challenges in applying the MFEA is to build specific evolutionary operators of the MFEA algorithm. To exploit the advantages of the Cayley Codes in improving the MFEA’s performance, this paper introduces MFEA with representation scheme based on the Cayley Code to deal with the clustered tree problems. The new evolutionary operators in MFEA have two different levels. The purpose of the first level is to construct a spanning tree which connects to a vertex in each cluster, while the objective of the second one is to determine the spanning tree for each cluster. We focus on evaluating the efficiency of the new MFEA algorithm on known Cayley Codes when solving clustered tree problems. In the aspect of the execution time and the quality of the solutions found, each encoding type of the Cayley Codes is analyzed when performed on both single-task and multi-task to find the solutions of one or two different clustered tree problems respectively. In addition, we also evaluate the effect of those encodings on the convergence speed of the algorithms. Experimental results show the level of effectiveness for each encoding type and prove that the Dandelion Code outperforms the remaining encoding mechanisms when solving clustered tree problems.

[1]  Franz Rothlauf,et al.  Representations for genetic and evolutionary algorithms , 2002, Studies in Fuzziness and Soft Computing.

[2]  Luiz Satoru Ochi,et al.  GRASP with path relinking for the symmetric Euclidean clustered traveling salesman problem , 2013, Comput. Oper. Res..

[3]  Huynh Thi Thanh Binh,et al.  New approach to solving the clustered shortest-path tree problem based on reducing the search space of evolutionary algorithm , 2019, Knowl. Based Syst..

[4]  Kay Chen Tan,et al.  Multiobjective Multifactorial Optimization in Evolutionary Multitasking , 2017, IEEE Transactions on Cybernetics.

[5]  Bang Ye Wu,et al.  On the clustered Steiner tree problem , 2013, J. Comb. Optim..

[6]  Yew-Soon Ong,et al.  Multifactorial Evolution: Toward Evolutionary Multitasking , 2016, IEEE Transactions on Evolutionary Computation.

[7]  Javier Del Ser,et al.  Dandelion-Encoded Harmony Search Heuristics for Opportunistic Traffic Offloading in Synthetically Modeled Mobile Networks , 2015, ICHSA.

[8]  Bryant A. Julstrom,et al.  The blob code is competitive with edge-sets in genetic algorithms for the minimum routing cost spanning tree problem , 2005, GECCO '05.

[9]  Hua Xu,et al.  Evolutionary multitasking in permutation-based combinatorial optimization problems: Realization with TSP, QAP, LOP, and JSP , 2016, 2016 IEEE Region 10 Conference (TENCON).

[10]  Yew-Soon Ong,et al.  Evolutionary multitasking in bi-level optimization , 2015 .

[11]  Bang Ye Wu,et al.  Clustered Trees with Minimum Inter-cluster Distance , 2014, 2014 IEEE 17th International Conference on Computational Science and Engineering.

[12]  Young-Soo Myung,et al.  On the generalized minimum spanning tree problem , 1995, Networks.

[13]  Mattia D'Emidio,et al.  Hardness, approximability, and fixed-parameter tractability of the clustered shortest-path tree problem , 2018, J. Comb. Optim..

[14]  Bryant A. Julstrom,et al.  Edge sets: an effective evolutionary coding of spanning trees , 2003, IEEE Trans. Evol. Comput..

[15]  Huynh Thi Thanh Binh,et al.  An Effective Representation Scheme in Multifactorial Evolutionary Algorithm for Solving Cluster Shortest-Path Tree Problem , 2018, 2018 IEEE Congress on Evolutionary Computation (CEC).

[16]  Yew-Soon Ong,et al.  Evolutionary Multitasking: A Computer Science View of Cognitive Multitasking , 2016, Cognitive Computation.

[17]  Liang Feng,et al.  Evolutionary multitasking across single and multi-objective formulations for improved problem solving , 2016, 2016 IEEE Congress on Evolutionary Computation (CEC).

[18]  Abhishek Gupta,et al.  Multifactorial Evolutionary Algorithm With Online Transfer Parameter Estimation: MFEA-II , 2020, IEEE Transactions on Evolutionary Computation.

[19]  Gerhard Reinelt,et al.  TSPLIB - A Traveling Salesman Problem Library , 1991, INFORMS J. Comput..

[20]  Thomas Bäck,et al.  Evolutionary algorithms in theory and practice - evolution strategies, evolutionary programming, genetic algorithms , 1996 .

[21]  Charles C. Palmer,et al.  Representing trees in genetic algorithms , 1994, Proceedings of the First IEEE Conference on Evolutionary Computation. IEEE World Congress on Computational Intelligence.

[22]  Francisco Herrera,et al.  Analyzing convergence performance of evolutionary algorithms: A statistical approach , 2014, Inf. Sci..

[23]  Rohitash Chandra,et al.  Evolutionary Multi-task Learning for Modular Training of Feedforward Neural Networks , 2016, ICONIP.

[24]  Bang Ye Wu,et al.  On the minimum routing cost clustered tree problem , 2017, J. Comb. Optim..

[25]  David K. Smith,et al.  The Dandelion Code: A New Coding of Spanning Trees for Genetic Algorithms , 2007, IEEE Transactions on Evolutionary Computation.