{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

Lecture 10

# 3 2 1 0 0 2 4 6 8 10 12 14 idenfy the

This preview shows page 1. Sign up to view the full content.

This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: 15 Iden/fy the 1st Pareto Front: c, e 3 2/11/14 Itera/on 2 data a b d dominated by b,d,f f Itera/on 3 6 a data a 5 4 b b 2 5 4 2 2 4 6 8 10 12 Iden/fy the 2nd Pareto Front: d,f 14 0 0 2 4 6 8 10 12 14 Iden/fy the 3rd Pareto Front: b Itera/on 4 dominated by 1 d 0 0 b 3 f 1 a a 6 3 f data dominated by b Faster Non ­dominated Sor/ng: O(MN2) 6 a 5 4 •  For each solu/on i in the popula/on, calculate (ni, Si): –  ni: the number of solu/ons domina/ng i; –  Si: set of solu/ons dominated by i. 3 2 1 0 0 2 4 6 8 10 12 14 Iden/fy the fourth Pareto Front: a 4 2/11/14 Pareto Ranking •  For each solu/on i in the popula/on –  If ni is 0, •  rank ni •  go over the Si and for each element q, reduce the dominate count (n) by 1 •  if the dominate count (n) of q becomes 0, –  Rank q and and go over its Si and so on O(N2) complexity •  •  O(N2) + O(MN2) = O(MN2) Crowding Distance •  The crowding distance of solu/on i is the average of E...
View Full Document

{[ snackBarMessage ]}

Ask a homework question - tutors are online