Chaotic Multiobjective Evolutionary Algorithm Based on Decomposition for Test Task Scheduling Problem

الملخص EN

Test task scheduling problem (TTSP) is a complex optimization problem and has many local optima.

In this paper, a hybrid chaotic multiobjective evolutionary algorithm based on decomposition (CMOEA/D) is presented to avoid becoming trapped in local optima and to obtain high quality solutions.

First, we propose an improving integrated encoding scheme (IES) to increase the efficiency.

Then ten chaotic maps are applied into the multiobjective evolutionary algorithm based on decomposition (MOEA/D) in three phases, that is, initial population and crossover and mutation operators.

To identify a good approach for hybrid MOEA/D and chaos and indicate the effectiveness of the improving IES several experiments are performed.

The Pareto front and the statistical results demonstrate that different chaotic maps in different phases have different effects for solving the TTSP especially the circle map and ICMIC map.

The similarity degree of distribution between chaotic maps and the problem is a very essential factor for the application of chaotic maps.

In addition, the experiments of comparisons of CMOEA/D and variable neighborhood MOEA/D (VNM) indicate that our algorithm has the best performance in solving the TTSP.