摘要
针对量子粒子群算法在求解置换流水车间调度问题时容易早熟,提出用文化量子粒子群算法求解置换流水车间调度问题。该算法的主群体空间采用量子粒子群算法,知识空间采用遗传算法。通过影响操作和接受操作,知识空间定期将自己的精英个体贡献给主群体空间,主群体空间也定期将自己的精英个体贡献给知识空间。最后将该算法应用到具体问题的求解,用MATLAB编程仿真测试,仿真结果表明,该算法收敛速度快,且具有较高的求解质量,而且其搜索性能优于一般的量子粒子群算法。
Coping with such disadvantages of quantum particle swarm optimization algorithm being easy to run into local optima,the method that Cultural-based quantum particle swarm optimization is proposed to be applied to permutation flow shop scheduling algorithm. This algorithm model consists of a QPSO-based main population space and a GA-based knowledge space, The main population space contributes elite individuals to the knowledge space periodically,and knowledge space also contributes elite individuals to the main population space .then this methodology is applied to permutation flow shop scheduling problem,the algorithm is tested with MATLAB simulation,and the result shows that this algorithm has better answers and more rapid convergence and much better than quantum particle swarm optimizations.
出处
《机械设计与制造》
北大核心
2009年第8期17-19,共3页
Machinery Design & Manufacture
基金
上海市(第三期)重点学科项目(S30504)
上海市研究生创新基金项目(JWCXSL0902)
关键词
量子粒子群算法
置换流水车间调度
文化算法
遗传算法
Quantum particle swam optimization
Permutation flow shop scheduling
Cultural algorithm
GA