欢迎您！东篱公司
退出
-
申报数据库
-
立项数据库
-
成果数据库
-
项目获奖数据库
中文摘要：
针对作业车间调度问题JSP(Job-shop scheduling problem)，提出一种入侵式杂草优化算法。该算法中，子代以正态分布方式在父代个体周围扩散，兼顾全局搜索和局部搜索，并根据迭代次数不同对二者强度进行调节。通过典型算例进行仿真试验，并在反复实验中对算法参数进行修正。测试结果表明杂草算法求解作业车间调度问题的可行性和有效性，优于萤火虫算法和基本粒子群算法，是解决生产调度问题的一种有效方法。
英文摘要：
This paper introduces an invasive weed optimisation algorithm aimed at solving job shop scheduling problem.In this algorithm, the offspring diffuses around the parent individuals in the way of normal distribution,combining the global search and local search and adjusting different strength of both according to the number of iterations.Simulation tests are carried out through typical examples,and in repeated experiments the parameters of the algorithm are corrected.Test results demonstrate the feasibility and effectiveness of IWO in solving job shop scheduling problem,it is superior to the firefly algorithm and basic particle swarm optimisation,and is an effective approach for solving production scheduling problem.
同期刊论文项目
同项目期刊论文
期刊信息
位置：