Algorithm 2.
Archive Update
| Input: POPi, Ai, arp, n(size of Ai) |
| Output: Ai |
| 1: /* Sorting */ |
| 2: Sorting population POPi according to the fitness value |
| 3: Sorting archive Ai according to the fitness value |
| 4: |
| 5: /* Update */ |
| 6: j ← 0 |
| 7: For j < n Do |
| 8: If (rand(0, 1) < arp) Then |
| 9: Ai, j ← POPi, j |
| 10: (Ai, j, POPi, j amount to the j-th individual in Ai, POPi) |
| 11: j ← j+1 |
| 12: End For |
| 13: Return Ai |