作业车间调度问题的自适应步进值果蝇算法研究

摘要

Job shop scheduling problem(JSP) is an important part for improving the production efficiency of enterprise.The fruit fly optimization search algorithm is designed to solve the JSP.The fruit fly individual is fromed through the coding method based on the working procedure,and the maximum completion time for each individual fruit fly is calculated.It makes the fruit fly individual to find the minimum value of the taste concentration determination function by using the classification of olfactory random searching method based on adaptive step size,and the fruit fly population is optimized.The efficiency of JSP is improved.The algorithm is easy to realize,which only need to set two parameters,and has a strong global search ability and can effectively solve the JSP.%作业车间调度问题是提高企业的生产效率的一个重要环节.设计了一种自适应步进值果蝇算法,该算法通过基于工序的编码方式形成果蝇个体,并求出每个果蝇个体相对应的最大完工时间,采用了自适应步进值的分类嗅觉搜索方法,对果蝇种群进行优化,最终使果蝇个体快速找到目标函数即味道浓度判定函数的最小值也就是最优的调度方案,从而提高作业车间的调度效率.该算法实现简单,只需要设置两个参数,并且全局寻优能力较强,能够有效地解决作业车间调度问题.