###
DOI:
计算机系统应用英文版:2010,19(4):152-156
本文二维码信息
码上扫一扫!
基于正交实验的蚁群算法在车间调度问题中的应用
(大理学院 数学与计算机学院 云南 大理 671003)
An Ant Colony Algorithm Based on Orthogonal Experimental Method for Job-Shop Scheduling
摘要
图/表
参考文献
相似文献
本文已被:浏览 1608次   下载 3533
Received:July 20, 2009    Revised:August 22, 2009
中文摘要: 提出用正交实验的方法来设置蚁群算法在求解车间调度问题的参数。蚁群算法在求解车间调度问题时的性能大部分依赖于参数的设置,各参数的值不同,则蚁群算法的收敛速度和得到的解也不同,使用正交实验的方法来测试各个参数对蚁群算法性能的影响,通过对实验结果的分析可得出参数的最佳组合方案。用经典的JSP的样例对这种组合方案进行了测试,实验结果表明用正交实验法得到的蚁群算法的参数设置方案可以加快算法的收敛速度,使算法能够得到问题的最优解或近似最优解。
Abstract:In this paper, an orthogonal experimental method is used to set the parameters of Ant Colony Algorithm for solving Job-Shop Scheduling Problem. The performance of Ant Colony Algorithm for Job-Shop Scheduling mostly depends on the parameters settings, the different values of each parameter, the different convergence rates and the solution of Ant Colony Algorithm. The orthogonal experimental method is used to test the parameters on the performance of Ant Colony Algorithm. The best combination of parameters can be drawn by analyzing the experimental results. This best combination of parameters has been tested based on the cases from the JSP classic. The results demonstrate the parameters setting can speed up the convergence rate and the optimal solution or the approximate optimal solution can be achieved.
文章编号:     中图分类号:    文献标志码:
基金项目:
引用文本:
张晓玲,杨健,杜英国.基于正交实验的蚁群算法在车间调度问题中的应用.计算机系统应用,2010,19(4):152-156
ZHANG Xiao-Ling,YANG Jian,DU Ying-Guo.An Ant Colony Algorithm Based on Orthogonal Experimental Method for Job-Shop Scheduling.COMPUTER SYSTEMS APPLICATIONS,2010,19(4):152-156