计算机工程与应用 ›› 2013, Vol. 49 ›› Issue (13): 262-265.

• 工程与应用 • 上一篇    下一篇

蜜蜂交配优化算法在车间作业调度中的应用

李小霞,刘  峰,刘建晓   

  1. 华中农业大学 理学院,武汉 430070
  • 出版日期:2013-07-01 发布日期:2013-06-28

Application of honey-bee mating optimization algorithm to job-shop scheduling

LI Xiaoxia, LIU Feng, LIU Jianxiao   

  1. College of Science, Huazhong Agricultural University, Wuhan 430070, China
  • Online:2013-07-01 Published:2013-06-28

摘要: 为了解决车间作业调度问题,在对其进行分析描述的基础上,提出了采用蜜蜂交配优化算法的求解方法。该方法把由多个作业调度方案组成的集合作为蜂群,以最小化加工时间作为算法的优化目标,通过模拟蜂群交配繁衍培养蜂王的优化过程来获得最优作业调度方案。采用车间作业调度测试案例在Matlab平台上进行实验,实验结果表明,该方法不仅能够有效地求解车间作业调度问题,而且能够取得了比传统优化方法更好的优化结果。

关键词: 蜜蜂交配优化算法, 车间作业调度问题, 组合优化

Abstract: To solve the Job-shop Scheduling Problem(JSP), a solution method—honey-bee mating optimization algorithm is presented on the basis of the JSP’s description. The method takes a set of job scheduling schemes as the bee swarm, and minimizing the processing time as the optimization goal. The optimal scheduling scheme is obtained by simulating the procedure of honey-bee mating. The test is carried out by the JSP test cases on Matlab. The experimental results show that this method can not only solve JSP but also find a better optimal scheduling scheme than the traditional optimization methods.

Key words: honey-bee mating optimization algorithm, Job-shop Scheduling Problem(JSP), combinatorial optimization