Prematurely and low convergent speed is the two fatal shortcoming of traditional evolution algorithm.Based on the shortcoming analysis above all

a bi-group evolutionary algorithm based on artificial immune and chaotic mutation is proposed.In this algorithm

evolutions of subgroups are parallelly performed with different mutation strategy.One of the subgroups takes chaotic mutation operator to explore the solution spare separately

and the other subgroup searches the local part detailedly using exponential decrescent operator.This algorithm can quickly plan global-optimal path.It is proved by the results of the test

this algorithm is feasible.