摘要
针对最小化最大完工时间的作业车间调度问题,提出一种基于变邻域趋化操作的细菌觅食优化算法。邻域搜索是一类改进型局部搜索算法,在每一步迭代过程中通过搜索当前解的邻域得到一个改进的解,利用邻域搜索可大大提高局部最优解的精确度。本算法采用基于操作的编码,使得细菌觅食优化算法适用于作业车间调度求解;将3种不同的邻域结构引入趋化操作中,以便扩大可行解的搜索空间,细菌个体按照自适应学习策略根据邻域的各自贡献率选择搜索方式,减少陷入局部极小的机会;同时使用自适应步长更新各邻域内趋化操作的位置,根据适应度值动态调整搜索精度,避免早熟收敛。典型算例试验表明,该算法具有一定的鲁棒性,并有效地提高了搜索精度和收敛性。
A bacterial foraging optimization algorithm based on variable neighborhood is proposed to solve job-shop scheduling problem （JSP） with objective function of minimize the maximum completion time. The neighborhood search is a kind of improved local search algorithm, and it can greatly improve accuracy of the local optimal solution. By searching neighborhood of the current solution, an improved solution can be obtained. The operation-based encoding is firstly used to allow bacteria foraging optimization algorithm for JSP solving. Three different neighborhood structures are used for chemotaxis operation to expand the feasible solution space. In the proposed algorithm, each bacterial Can select different search method in accordance with contribution of the neighborhood to reduce the chance of local minimum. The location of bacterial can be also updated using adaptive step size of chemotaxis Operation in different neighborhoods. Therefore, search accuracy can be adjusted according to the fitness value of each bacterial to avoid premature convergence. Typical example experiments show that the algorithm has certainly robustness and effectively improve search accuracy and convergence.
出处
《机械工程学报》
EI
CAS
CSCD
北大核心
2012年第12期178-183,共6页
Journal of Mechanical Engineering
基金
国家自然科学基金(50905194)
重庆市自然科学基金(CSTC2008BB2356)
重庆科技学院校内科研基金(CK2011B04)
重庆市自然科学基金计划重点(cstc2012jjB40006)资助项目
关键词
作业车间调度
细菌觅食优化算法
变邻域搜索
趋化操作
自适应步长
Job-shop scheduling problem Bacterial foraging optimization algorithm Variable neighborhood searchChemotaxis operation Adaptive step size
