欢迎您！东篱公司
退出
-
申报数据库
-
立项数据库
-
成果数据库
-
项目获奖数据库
中文摘要：
提出了基于Pareto边界和档案集的改进蛙跳算法，解决以最大完工时间、最大拖后时间和总流经时间为目标值的无等待流水线调度问题．首先，采用NEH（Nawaz—Enscore—Ham）启发式与随机解相结合的初始化方法，保证了初始群体的质量和分布性；其次，采用两点交叉方法生成新解，使蛙跳算法能够直接用于解决调度问题；再次，利用非支配解集动态更新群体，改善了群体的质量和多样性；最后，将基于插入邻域的快速局部搜索算法嵌入到蛙跳算法中，增强了算法的开发能力和效率．仿真试验表明了所得蛙跳算法的有效性和高效性．
英文摘要：
An enhanced shuffled frog-leaping algorithm（ESFLA） is presented based on the Pareto front and archive set for solving the no-wait flowshop scheduling problems with makespan, maximum tardiness and total flow time criteria. Firstly, an initialization method based on the NEH（Nawaz-Enscore-Ham） heuristic is designed. Secondly, a two-point crossover operator is used to produce a new individual. Thirdly, a part of the non-dominated solutions are added to the population to improve their diversity and quality. Finally, to further enhance the exploitation capability and efficiency of the algorithm, a fast local search algorithm based on the insert neighborhood is embedded in the proposed shuffled frogleaping algorithm. The computational results and comparisons show that the proposed ESFLA is effective and efficient in finding better solutions for the problem considered.
同期刊论文项目
同项目期刊论文
A hybrid variable neighborhood search algorithm for solving multi-objective flexible job shop proble
An ensemble of discrete differential evolution algorithms for solving the generalized traveling sale
A hybrid tabu search algorithm with an efficient neighborhood structure for the flexible job shop sc
Minimizing the total flow time in a flow shop with blocking by using hybrid harmony search algorithm
An effective hybrid quantum-inspired evolutionary algorithm for parameter estimation of chaotic syst
Solving manpower scheduling problem in manufacturing using mixed-integer programming with a two-stag
A hybrid particle swarm optimization and tabu search algorithm for flexible job-shop scheduling prob
A novel hybrid evolutionary algorithm for the integrated model of collaborative planning and schedul
A hybrid Pareto-based local search algorithm for multi-objective flexible job shop scheduling proble
A novel hybrid harmony search algorithm for the no-wait flow shop scheduling problems with total flo
Memetic Algorithm based on Improved Inver-over operator and Lin-Kernighan local search for the Eucli
An effective hybrid discrete differential evolution algorithm for the flow shop scheduling with inte
位置：