Effective Multifactorial Evolutionary Algorithm for Solving the Cluster Shortest Path Tree Problem

Abstract

Arising from the need of all time for optimization of irrigation systems, distribution network and cable network, the Cluster Shortest Path Tree Problem (CSTP) has been attracting a lot of attention and interest from the research community. For such an NP-Hard problem with a great dimensionality, the approximation approach is usually taken. Evolutionary Algorithms, based on biological evolution, has been proved to be effective in finding approximate solutions to problems of various fields. The multifactorial evolutionary algorithm (MFEA) is one of the most recently exploited realms of EAs and its performance in solving optimization problems has been very promising. The main difference between the MFEA and the traditional Genetic Algorithm (GA) is that the former can solve multiple tasks at the same time and take advantage of implicit genetic transfer in a multitasking problem, while the latter solves one problem and exploit one search space at a time. Considering these characteristics, this paper proposes a MFEA for CSTP tasks, together with novel genetic operators: population initialization, crossover, and mutation operators. Furthermore, a novel decoding scheme for deriving factorial solutions from the unified representation in the MFEA, which is the key factor to the performance of any variant of the MFEA, is also introduced in this paper. For examining the efficiency of the proposed techniques, experiments on a wide range of diverse sets of instances were implemented and the results showed that the proposed algorithms outperformed an existing heuristic algorithm for most of the testing cases. In the experimental results section, we also pointed out which cases allowed for a good performance of the proposed algorithm.