self-adapt genetic algorithms;
assignment optimize model;
multi-goal problem decision;
D O I:
暂无
中图分类号:
TP [自动化技术、计算机技术];
学科分类号:
0812 ;
摘要:
A multi-target nonlinear planning optimization model and a self-adaptive gentic algorithm are presented. The procreant individual is apparently better than the one obtained by ordinary genetic algorithm. The self-adaptive mutation operator prevents algorithm precocity. The searching speed is improved by keeping the optimal solution of the iterative process, and it convergences in the global optimal solution. The results of the algorithm instances show that this algorithm has a good effect in sol vingthe multi-target strategy optimal problems.