C = {c // c // f |

1) create initial population with |C| = n; 2) for (i = 0; i < n; i++) begin// initial phase 3) calculate profit vector f 4) end for 5) while (# of generation < G) begin// main phase 6) non-dominated sorting in C; 7) select c 8) arithmetic (average) crossover from c 9) mutate p to p 10) find the lowest non-dominated rank solution c 11) C = C∪{p 12) end while |