摘要
蚂蚁算法是近年来新出现的一种随机型搜索寻优算法,自从在TSP等著名问题中得到富有成效的应用之后,已引起越来越多的关注和重视。论文进一步将这种新型的生物优化思想进行扩展,提出了一种解决车间作业调度问题(JSSP:JobShopSchedulingProblem)的蚂蚁优化算法,给出了求解的一般步骤和流程。通过计算实例的结果,说明了该算法优于传统算法。
Ant algorithm is a newly emerged stochastic searching optimization algorithm in recent years.It has been paid much attention to since the successful application in the famous traveling salesman problem.This paper further ex-tends the idea of this new biological optimization strategy to solve the Job Shop Scheduling Problem(JSSP)in this pa-per.The concrete realization steps in the algorithm are designed.The results of the example verify its better performance compared with the conventional algorithms.
出处
《计算机工程与应用》
CSCD
北大核心
2003年第22期6-8,共3页
Computer Engineering and Applications
基金
国家自然科学基金资助(编号:60274026
60174047)
