摘要
针对经典作业车间调度问题的局限性,结合实际生产情况,给出了具有路径柔性的作业车间调度模型,提出了机器选择规则,给出了改进蚁群算法的具体实现过程。当所有蚂蚁爬行完毕后,针对算法是否陷入局部收敛分别对各路径上的信息素进行调整,这样有助于快速的得到全局最优解。最后通过实例仿真验证了算法的有效性。
Aiming at the limit of classical job-shop problem, combining with actual manufacture instance, a rout flexible job-shop model was given, a machine choose rule was advanced, the process of improved ant colony algorithm was given. After all ants crawled, this algorithm could adjust pheromone aiming at whether it got into part convergence, this could help algorithm to get best solution faster. In the end the simulation results show that this algorithm has good performance.
出处
《系统仿真学报》
EI
CAS
CSCD
北大核心
2008年第16期4326-4329,共4页
Journal of System Simulation
基金
国家863计划(2007AA04Z155)
国家自然科学基金(60374056
60573123)资助项目。
关键词
蚁群算法
改进蚁群算法
柔性作业车间调度
生产调度
ant colony algorithm
improved ant colony algorithm
flexible job-shop scheduling
production scheduling