An effective discrete artificial bee colony(DABC) algorithm is proposed for the flow shop scheduling problem with intermediate buffers(IBFSP) in order to minimize the maximum completion time(i.e makespan). The effecti...An effective discrete artificial bee colony(DABC) algorithm is proposed for the flow shop scheduling problem with intermediate buffers(IBFSP) in order to minimize the maximum completion time(i.e makespan). The effective combination of the insertion and swap operator is applied to producing neighborhood individual at the employed bee phase. The tournament selection is adopted to avoid falling into local optima, while, the optimized insert operator embeds in onlooker bee phase for further searching the neighborhood solution to enhance the local search ability of algorithm. The tournament selection with size 2 is again applied and a better selected solution will be performed destruction and construction of iterated greedy(IG) algorithm, and then the result replaces the worse one. Simulation results show that our algorithm has a better performance compared with the HDDE and CHS which were proposed recently. It provides the better known solutions for the makespan criterion to flow shop scheduling problem with limited buffers for the Car benchmark by Carlier and Rec benchmark by Reeves. The convergence curves show that the algorithm not only has faster convergence speed but also has better convergence value.展开更多
充分考虑实际生产过程中的批量生产形式,构建以最小最大完工时间为目标的置换流水车间分批调度问题的数学模型,并提出一种改进的人工兔优化算法。在编码阶段,采用最小位置值(smallest position value,SPV)规则实现连续解向离散解的转变...充分考虑实际生产过程中的批量生产形式,构建以最小最大完工时间为目标的置换流水车间分批调度问题的数学模型,并提出一种改进的人工兔优化算法。在编码阶段,采用最小位置值(smallest position value,SPV)规则实现连续解向离散解的转变;在解码阶段,采用动态策略对工件进行分批;通过NEH启发式规则改善初始种群的质量;引入差分进化算子提高解的多样性;提出基于交换和逆序的局部搜索策略增强算法跳出局部最优解的能力。将所提算法和其他对比算法对不同规模的算例进行求解,通过消融实验、对比实验、统计检验等证明了算法的有效性。最后对某汽车外饰件厂喷涂车间排产问题进行求解,求解结果优于其他对比算法,进一步证明了所提算法的有效性。展开更多
基金Projects(61174040,61104178,61374136) supported by the National Natural Science Foundation of ChinaProject(12JC1403400) supported by Shanghai Commission of Science and Technology,ChinaProject supported by the Fundamental Research Funds for the Central Universities,China
文摘An effective discrete artificial bee colony(DABC) algorithm is proposed for the flow shop scheduling problem with intermediate buffers(IBFSP) in order to minimize the maximum completion time(i.e makespan). The effective combination of the insertion and swap operator is applied to producing neighborhood individual at the employed bee phase. The tournament selection is adopted to avoid falling into local optima, while, the optimized insert operator embeds in onlooker bee phase for further searching the neighborhood solution to enhance the local search ability of algorithm. The tournament selection with size 2 is again applied and a better selected solution will be performed destruction and construction of iterated greedy(IG) algorithm, and then the result replaces the worse one. Simulation results show that our algorithm has a better performance compared with the HDDE and CHS which were proposed recently. It provides the better known solutions for the makespan criterion to flow shop scheduling problem with limited buffers for the Car benchmark by Carlier and Rec benchmark by Reeves. The convergence curves show that the algorithm not only has faster convergence speed but also has better convergence value.
基金国家科技公关计划项目(the Key Technologies R&D Program of China under Grant No.2001BA201A32)国家高技术研究发展计划(863) (the National High-Tech Research and Development Plan of China under Grant No.2002AA415270)
基金This work was supported by National Natural Science Foundation of China(NNSFC) 10471096and Shenyang Normal University Doctoral Foundation 55440101007.
文摘充分考虑实际生产过程中的批量生产形式,构建以最小最大完工时间为目标的置换流水车间分批调度问题的数学模型,并提出一种改进的人工兔优化算法。在编码阶段,采用最小位置值(smallest position value,SPV)规则实现连续解向离散解的转变;在解码阶段,采用动态策略对工件进行分批;通过NEH启发式规则改善初始种群的质量;引入差分进化算子提高解的多样性;提出基于交换和逆序的局部搜索策略增强算法跳出局部最优解的能力。将所提算法和其他对比算法对不同规模的算例进行求解,通过消融实验、对比实验、统计检验等证明了算法的有效性。最后对某汽车外饰件厂喷涂车间排产问题进行求解,求解结果优于其他对比算法,进一步证明了所提算法的有效性。
