首页> 外文会议>Innovative Computing, Information and Control (ICICIC-2009), 2009 >A Hybrid Particle Swarm Optimization Algorithm with Diversity for Flow-Shop Scheduling Problem
【24h】

A Hybrid Particle Swarm Optimization Algorithm with Diversity for Flow-Shop Scheduling Problem

机译:流水车间调度问题的一种具有多样性的混合粒子群优化算法

获取原文

摘要

This paper proposed a hybrid particle swarm optimization algorithm (Shadow hybrid PSO, SHPSO) to solve the flow-shop scheduling problem (FSSP). SHPSO adopts the idea of Kuoa's HPSO model by not only combines the random-key (RK) encoding scheme, individual enhancement (IE) scheme, but also adds the diversification mechanism such as ARPSO model and competitive shadow particles to prevent premature convergence. Computation experiments results of Taillard's seven representative instances of FSSP show that the SHPSO perform close to HPSO for FSSP to minimize makespan. Further recommendations and improved ideas will be discussed later in this paper.
机译:提出了一种混合粒子群优化算法(Shadow hybrid PSO,SHPSO)来解决流水车间调度问题。 SHPSO采用Kuoa的HPSO模型的思想,不仅结合了随机密钥(RK)编码方案,个人增强(IE)方案,而且还增加了ARPSO模型和竞争性影子粒子等多样化机制来防止过早收敛。 Taillard的FSSP的七个代表性实例的计算实验结果表明,SHPSO的性能与FSSP的HPSO接近,从而最大程度地缩短了制造时间。进一步的建议和改进的想法将在本文后面讨论。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号