摘要
蚁群算法是近年来新出现的一种随机搜索寻优算法.该算法为求解复杂的组合优化问题提供了一种新思路,引起了众多学者的研究兴趣.将蚁群算法引入不确定处理时间的Job Shop调度,用三角模糊数描述不确定处理时间,建立不确定处理时间的调度模型,在模糊数排序方法的基础上,用改进后的蚁群算法进行求解.仿真结果验证了本文提出的算法的有效性,考虑了算法中的参数选择对算法的求解结果的影响和模糊集的扩散程度,并就结果进行了讨论.
Ant colony system is a novel emerged stochastic searching optimization algorithm in recent years. It provides a possible algorithm to solve complicated combinatorial optimization problems and interests many scholars. Ant colony system is applied to Job Shop scheduling with uncertain processing time, processing time of Job Shop problems is described with triangular fuzzy numbers, and the scheduling model with uncertainty is established. A method of ranking of fuzzy subsets and the improved ant colony system are used to minimize the make-span in Job Shop scheduling problem. The computational results show the efficiency of the proposed algorithm, and the influence of the algorithm parameter selection on the results as well as the range of uncertainty are discussed.
出处
《山东大学学报（工学版）》
CAS
2005年第4期74-79,共6页
Journal of Shandong University（Engineering Science）
基金
国家自然科学基金项目(60274043)
上海市科委重大科技攻关项目(04dz11008)
