C = {c₀, c₁, …, c_n_‾1}, F ={f₀, f₁, …, f_n_‾1} // c_i = (price vector of nodes v Î V) // f_j = (profit vector of nodes v Î V), \|c_i\| = \|f_i\| = \|V\| = N
1) create initial population with \|C\| = n; 2) for (i = 0; i < n; i++) begin// initial phase 3) calculate profit vector f_i Î F of c_i Î C; 4) end for 5) while (# of generation < G) begin// main phase 6) non-dominated sorting in C; 7) select c_i and c_j using tournament selection; 8) arithmetic (average) crossover from c_i, c_j to p; 9) mutate p to p_t; 10) find the lowest non-dominated rank solution c_k from C; 11) C = C∪{p_t} ‾{c_k}; 12) end while

C = {c₀, c₁, …, c_n_‾1}, F ={f₀, f₁, …, f_n_‾1}

// c_i = (price vector of nodes v Î V)

// f_j = (profit vector of nodes v Î V), |c_i| = |f_i| = |V| = N

1) create initial population with |C| = n;

2) for (i = 0; i < n; i++) begin// initial phase

3) calculate profit vector f_i Î F of c_i Î C;

4) end for

5) while (# of generation < G) begin// main phase

6) non-dominated sorting in C;

7) select c_i and c_j using tournament selection;

8) arithmetic (average) crossover from c_i, c_j to p;

9) mutate p to p_t;

10) find the lowest non-dominated rank solution c_k from C;

11) C = C∪{p_t} ‾{c_k};

12) end while