改进优化问题混合算法研究.pdfVIP

计算机工程与设计 Computer Engineering and Design 孙泽宇，邢萧飞：改进优化问题混合算法研究 2011, Vol.32, No.4 1445 改进优化问题混合算法研究 1 2 孙泽宇 ， 邢萧飞 (1. 洛阳理工学院计算机与信息工程系，河南洛阳471023;2. 中南大学信息科学与工程学院，湖南长沙4 10083) 摘 要：针对蚁群算法和遗传算法存在的不足，提出了一种优化混合算法。利用遗传算法快速搜索性和改变选择算子、交叉 算子和变异算子操作来确定路径上信息素的分布，然后通过蚁群算法的并行性和正反馈机制，反复迭代进行高效求解，从 而克服了两种算法的缺点，降低了算法空间复杂度，提高了算法运行效率，进而达到了组合优化的目的。通过对旅行商问题 仿真实验结果表明了该算法的有效性和可行性。 关键词：蚁群算法; 组合优化; 旅行商问题; 信息素; 遗传算法 中图法分类号：TP301 文献标识码：A 文章编号：1000-7024 (2011) 04-1445-04 Study on mixed algorithm for improvement optimization 1 2 SUN Ze-yu , XING Xiao-fei (1. Department of Computer and Information Engineering, Luoyang Institute of Science and Technology, Luoyang 471023, China; 2. School of Information Science and Engineering, Central South University, Changsha 4 10083, China) Abstract ：Optimization mixed algorithm is proposed to avoid the faults of both ant algorithm and generic algorithm. The proposed al- gorithm determines distribution of pheromones on path through fast searching and changing the operation of selection operator, crossover operator and mutation operator of genetic ant colony, and then solves the problems efficiently through parallelism, positive feedback and iteration of ant colony algorithm. Therefore, the faults of both algorithms are conqueredspace complexity of algorithm is decreased and the efficiency of algorithm is enhanced, and the aim of combinational optimization is achieved. At last, the validity and feasibility is demonstrated by means of simulation experiment of traveling salesman problem.