An Improved Nondominated Sorting Genetic Algorithm III Method for Solving Multiobjective Weapon-Target Assignment Part I: The Value of Fighter Combat

Algorithm 2

The Proposed NSGA-III Algorithm.

Input: , , ,

Output: Pareto solutions

1:   Initialize uniform distribution reference points ;

2:   ;

3:   while termination conditions are not satisfied () do

4:      ←Select operator();

5:       Recombination & Mutation ();

6:      () = Non-dominated-sort ();

7:      ;

8:      repeat

9:           ;

10:         ;

11:       until ;

12:       if then

13:         break;

14:       else

15:         Normalize the objectives;

16:         Delete the useless reference points;

17:         Associate each solution in with a reference point;

18:         Compute niche count of reference points;

19:         Fill with solutions from using niching information;

20:         Generate new reference points;

21:       end if

22:       Calculate operator rewards (, );

23:       Update operator information ();

24:       ;

25: end while

26: return Pareto-optimal front.