论文部分内容阅读
遗传算法的性能主要取决于算法对满意解的搜索和优化的能力。本文提出的自适应遗传算法可以自动均衡搜索和优化关系。该算法采用六个模糊控制器对符号编码遗传算法的遗传操作实施动态参数控制。对旅行商( TSP)问题的求解结果表明该算法在解决类似于 TSP的组合优化问题时具有比标准遗传算法更好的性能
The performance of GA mainly depends on the ability of algorithm to search and optimize satisfactory solution. The proposed adaptive genetic algorithm can automatically balance the search and optimize the relationship. The algorithm uses six fuzzy controllers to implement dynamic parameter control of the genetic operation of symbol-coded genetic algorithm. The solution to the traveling salesman (TSP) problem shows that this algorithm has better performance than the standard genetic algorithm in solving combinatorial optimization problems such as TSP