首页> 外文会议>International Conference on Natural Computation;ICNC '09 >A Hybrid PSO Algorithm for Job-Shop Scheduling Problems with Fuzzy Processing Time and Fuzzy Due Date
【24h】

A Hybrid PSO Algorithm for Job-Shop Scheduling Problems with Fuzzy Processing Time and Fuzzy Due Date

机译:带有模糊处理时间和模糊到期日的作业车间调度问题的混合PSO算法

获取原文

摘要

This paper presents a hybrid PSO (HPSO) algorithm to the solution of job-shop fuzzy scheduling problem. The proposed algorithm uses processing encoding random key to generate initial population, takes parameter uniformity crossover operator as particle swarmȁ9;s update operator, and evaluates each particle properties according to customer satisfaction, and then completes particle individual extremum and neighborhood extremum update according to the above-mentioned evaluation. The algorithm utilizes neighborhood knowledge to direct its local search procedure, which overcome the blindness or randomness introduced by meta-heuristics. Simulation results show that HPSO algorithm can speed up convergence as well as improve the quality of shop scheduling solution.
机译:针对作业车间模糊调度问题,提出了一种混合PSO算法。提出的算法采用处理编码随机密钥生成初始种群,将参数均匀性交叉算子作为粒子群; 9; s更新算子,根据客户满意度评估每个粒子的性质,然后根据上述方法完成粒子个体极值和邻域极值的更新。提到的评价。该算法利用邻域知识指导其局部搜索过程,克服了元启发式算法引入的盲目性或随机性。仿真结果表明,HPSO算法可以加快收敛速度​​,提高车间调度解决方案的质量。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号