Research Article
An Improved MOEA/D Algorithm for Complex Data Analysis
Algorithm 1
MOEA/D-AEE pseudocode description. MOEA/D-AEE.
1 Select Neighbour B; | 2 Initialize population P; | 3 Compute extreme points F1 and F2; | 4 whilestop condition not reacgeddo | 5 forin opulationdo | 6 if random then | 7 Set B(i) as neighbor of ; | 8 else. | 9 Set Set B(i) as population; | 10 end. | 11 Select parents from B(i). | 12 Use proposed method to reproduce offspring y; | 13 Repair y to reasonable range; | 14 Update extreme points F1 and F3; | 15 Set update counter ; | 16 Shuffle B(i) randomly; | 17 forin neighbor of B(i) do | 18 ifthen | 19 Set ; | 20 Set ; | 21 ifthen | 22 Break; | 24 end | 25 end | 26 end | 27 end |
|