首页> 外文会议>International conference on human centered computing >A Hybrid Particle Swarm Optimization Method for Permutation Flow Shop Scheduling Problem
【24h】

A Hybrid Particle Swarm Optimization Method for Permutation Flow Shop Scheduling Problem

机译:置换流水车间调度问题的混合粒子群优化方法

获取原文

摘要

The Permutation Row Shop Scheduling Problem (PFSP) is a typical example in Production Scheduling, which has attracted many researchers' attention. This paper takes to the advantage of the swarm characteristic of Particle Swarm optimization (PSO) algorithm to find the best particle in the solution space. The objective is to minimize the makespan. Firstly, the initial solution of the algorithm is generated by the famous heuristic NEH algorithm. The NEH algorithm was used to initialize the particle of global extreme values. Secondly, we take some optimized strategy to set the parameters, acceleration constant and nonlinear inertia weight strategy which based on random self-adaptively by means of chaos method for setting parameters. These optimized methods can avoid algorithm to be trapped in local optimum. At last, simulated results demonstrate that the hybrid PSO method is feasible and effective for the PFSP.
机译:排列行车间调度问题(PFSP)是生产调度中的典型示例,引起了许多研究人员的关注。本文利用粒子群优化(PSO)算法的群特征来寻找解空间中的最佳粒子。目的是使制造期最小化。首先,该算法的初始解是由著名的启发式NEH算法产生的。 NEH算法用于初始化全局极值的粒子。其次,采用混沌参数法,基于随机自适应,采用最优的参数设置策略,加速度常数和非线性惯性权重策略。这些优化方法可以避免算法陷入局部最优状态。最后,仿真结果表明,混合PSO方法对于PFSP是可行且有效的。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号