Genetic algorithm for mobile Agent tasks scheduling
Liyun Chen · Journal of Computer Applications · 2007
A chaos genetic algorithm was proposed to search the optimal solution in the whole feasible solution space.The problem model and chromosome representation were defined.The initial population was generated by the greedy algorithm,in which the communication cost was taken into account.To make the new scheduling generated by crossover mechanism valid,a new crossover mechanism was presented.The heuristic mutation operator was adopted.The chaos theory was used to dynamically control crossover and mutation operation.And the parent best chromosomes preserving strategy was adopted.Finally 18 task graphs simulation results on three kinds of communication-to-computation ratio,two kinds of task number and three kinds of host nodes were given.