欢迎您！东篱公司
退出
-
申报数据库
-
立项数据库
-
成果数据库
-
项目获奖数据库
中文摘要：
针对以makespan为指标的批量无等待流水线调度问题,提出了一种有效的离散蛙跳算法。首先采用基于工序的编码方式使蛙跳算法直接应用于调度问题;其次采用基于NEH与改进NEH和随机产生相结合的初始化方法,保证了初始解的高质量和分布性;再次采用交叉或变异方法产生新解,保持了种群的优越性和多样性;最后对全局最优解执行快速局部搜索,有效地降低了算法的时间复杂度,平衡算法的全局和局部开发能力。对随机生成不同规模的实例进行广泛的实验,通过仿真实验结果的比较,表明所得蛙跳算法的有效性和高效性。
英文摘要：
This paper proposed an effective shuffled frog-leaping algorithm （ SFLA） for solving the lot-streaming flow shop scheduling problem with the criterion of minimizing maximum completion time （i. e. ,makespan） under no-wait production cases. Firstly,the proposed SFLA represented an individual or frog as a job permutation to make the original SFLA suitable for scheduling problem. Secondly,designed an initialization method based on the NEH heuristic. Thirdly,used a crossover operator or mutation operator to produce a new individual. Finally,in order to further enhance the algorithm’s exploitation capability and efficiency,embedded a fast local search algorithm based on the insert or swap neighborhood in the proposed shuffled frog-leaping algorithm. This can reduce CPU time. The computational results and comparisons show that the proposed SFLA is effective and efficient for random instants 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
期刊信息
位置：