欢迎您！东篱公司
退出
-
申报数据库
-
立项数据库
-
成果数据库
-
项目获奖数据库
中文摘要：
针对批量流水线调度问题，提出了一种改进的人工蜂群算法优化最大完成时间。该算法用NEH方法产生初始解，利用混沌的遍历性生成新的邻域解。为了跳出局部最优，使用最优解插入扰动替换一些连续若干步不能改进的解以提高算法的全局搜索能力，仿真实验结果验证了算法的可行性。
英文摘要：
Aiming at the scheduling problem of lot-streaming flow shop, an improved artificial bee colony algorithm is proposed to attain the objective of minimizing the maximum completion time. In the proposed algorithm, the NEH heuristic is used to produce an initial solution, and the chaos is employed to generate a new candidate. In order to avoid trapping into local optima, the solution not improved in successively generations will be replaced by the perturbation of the found best solution so far. The simulation results verify the effectiveness of the algorithm.
同期刊论文项目
同项目期刊论文
A Discrete Artificial Bee Colony Algorithm for Minimizing the Total Flow Time in the Blocking Flow S
A multi-population cultural algorithm with adaptive diversity preservation and its application in am
A hybrid discrete differential evolution algorithm to minimise total tardiness on identical parallel
An improved discrete artificial bee colony algorithm to minimize the makespan on hybrid flow shop pr
A novel 3-layer mixed cultural evolutionary optimization framework for optimal operation of syngas p
An iterated greedy algorithm for the single-machine total weighted tardiness problem with sequence-d
A Local and Global Search Combined Particle Swarm Optimization Algorithm and Its Convergence Analysi
An effective discrete artificial bee colony algorithm for flow shop scheduling problem with intermed
An improved Bayesian-based wavelet package denoising method for data reconciliation to coking chemic
Optimal Operation for 3 Control Parameters of Texaco Coal-Water Slurry Gasifier with MO-3LM-CDE Algo
期刊信息
位置：