An efficient strategy for using multifactorial optimization to solve the clustered shortest path tree problem

[1]  Petrică C. Pop,et al.  The generalized minimum spanning tree problem: An overview of formulations, solution procedures and latest advances , 2020, Eur. J. Oper. Res..

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

[3]  Huynh Thi Thanh Binh,et al.  New Mechanism of Combination Crossover Operators in Genetic Algorithm for Solving the Traveling Salesman Problem , 2020, KSE.

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

[5]  Huynh Thi Thanh Binh,et al.  A Heuristic Based on Randomized Greedy Algorithms for the Clustered Shortest-Path Tree Problem , 2019, 2019 IEEE Congress on Evolutionary Computation (CEC).

[6]  Laith Mohammad Abualigah,et al.  Feature Selection and Enhanced Krill Herd Algorithm for Text Document Clustering , 2018, Studies in Computational Intelligence.

[7]  Huynh Thi Thanh Binh,et al.  Effective Multifactorial Evolutionary Algorithm for Solving the Cluster Shortest Path Tree Problem , 2018, CEC.

[8]  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).

[9]  Chi-Keong Goh,et al.  Evolutionary Multi-task Learning for Modular Knowledge Representation in Neural Networks , 2018, Neural Processing Letters.

[10]  Mário Mestria,et al.  New hybrid heuristic algorithm for the clustered traveling salesman problem , 2018, Comput. Ind. Eng..

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

[12]  Chuan-Kang Ting,et al.  Evolutionary many-tasking based on biocoenosis through symbiosis: A framework and benchmark problems , 2017, 2017 IEEE Congress on Evolutionary Computation (CEC).

[13]  Chuan-Kang Ting,et al.  Parting ways and reallocating resources in evolutionary multitasking , 2017, 2017 IEEE Congress on Evolutionary Computation (CEC).

[14]  Yew-Soon Ong,et al.  Linearized domain adaptation in evolutionary multitasking , 2017, 2017 IEEE Congress on Evolutionary Computation (CEC).

[15]  Laith Mohammad Abualigah,et al.  Unsupervised text feature selection technique based on hybrid particle swarm optimization algorithm with genetic operators for the text clustering , 2017, The Journal of Supercomputing.

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

[17]  Ehab Morsy,et al.  Genetic algorithms to balanced tree structures in graphs , 2017, Swarm Evol. Comput..

[18]  Lei Zhou,et al.  Evolutionary multitasking in combinatorial search spaces: A case study in capacitated vehicle routing problem , 2016, 2016 IEEE Symposium Series on Computational Intelligence (SSCI).

[19]  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).

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

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

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

[23]  Thi Thanh Binh Huynh,et al.  An effective combination of Genetic Algorithms and the Variable Neighborhood Search for solving Travelling Salesman Problem , 2015, 2015 Conference on Technologies and Applications of Artificial Intelligence (TAAI).

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

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

[26]  Zhaohui Liu,et al.  An improved approximation algorithm for the clustered traveling salesman problem , 2012, Inf. Process. Lett..

[27]  Franz Rothlauf.  Representations for evolutionary algorithms , 2008, GECCO '08.

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

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

[30]  Luigi Fratta,et al.  Tree structured fiber optics MANs , 1988, IEEE J. Sel. Areas Commun..

[31]  John J. Prisco,et al.  Fiber Optic Regional Area Networks in New York and Dallas , 1986, IEEE J. Sel. Areas Commun..

[32]  R. Prim.  Shortest connection networks and some generalizations , 1957 .

[33]  Jing Li,et al.  Metaheuristics for the tabu clustered traveling salesman problem , 2018, Comput. Oper. Res..

[34]  Rafael Martí,et al.  Handbook of Heuristics , 2018 .

[35]  Mattia D'Emidio,et al.  On the Clustered Shortest-Path Tree Problem , 2016, ICTCS.

[36]  A. E. Eiben,et al.  Evolutionary Computing: The Origins , 2015 .

[37]  Wang Shu-xi,et al.  The Improved Dijkstra's Shortest Path Algorithm and Its Application , 2012 .

[38]  Wang Shu-xi,et al.  Improved Dijkstra Shortest Path Algorithm and its Application , 2012 .