Algorithm 1. nondominated sorting differential evolution based offloading strategy acquisition.

Input: the size of the population NP, the number of the cloudlets M, the number of the iterations G, the mutation factor F, the crossover factor CR Output: the better solution set S 01: g = 0 02: P = Initialization (NP, M) 03: while g < G do 04:  Q = Crossover and mutation(P, F, CR) 05:  O = P + Q) 06:  L = nondominated sort(O)) 07:  P = Ø, Q = Ø, i = 0) 08:  while size(P) + num (Li) < NP do 09:    P += Li 10:    i ++ 11:  end while 12:  Calculate crowding distance (Li) by (16) 13:  Li,j = Sort (Li) according to Dj from large to small 14:  j = 0 15:  while size(P) < NP do 16:    P += Li,j 17:    j ++ 18:  end while 19: g ++ 20: end while 21: return the better solution set S