A Decomposition-Based Multiobjective Evolutionary Algorithm with Adaptive Weight Adjustment
Pseudocode 1
The pseudocode of the algorithm IMOEA/DA.
Input:
MOP (1)
A stopping criterion
: the number of the initial weight vectors (the sub-problems)
: the number of weight vectors in the neighborhood of each weight vector,
: a set of uniformly distributed weight vectors
Output: Approximation to the PF:
Initialization: Generate an initial population randomly or by a problem-specific method; determine by a problem-specific method; determine , where are the closet weight vectors to ; set and .
Whilethe stopping criterion is not metdo
Step 1: Update the utility function as follows:
According to , use the 10-tournament selection method [46] to select indices which are denoted as
Step 2: For ,do
Select mating scope: uniformly create a random from and set
Generate offspring : set and randomly choose one index from , use the SBX operator [47] to generate a solution from and and apply the polynomial mutation operator [47] on to generate a new offspring . Set
Update of : For , if , then set
Update the population by the updated strategy of the literature [44].
end for
Step 3: If is a multiple of 50, then, use Algorithm 1 to modify the weight vectors , re-determine (where is the size of ), and randomly select solutions from to allocate the new sub-problem as their current solution.
