| 基于改进粒子群算法的生产批量计划问题研究 |
| |
| 引用本文： | 马慧民,叶春明,柳毅.基于改进粒子群算法的生产批量计划问题研究[J].计算机集成制造系统,2006,12(9):1417-1421. |
| |
| 作者姓名： | 马慧民 叶春明 柳毅 |
| |
| 作者单位： | 1. 上海理工大学,管理学院,上海,200093;上海电机学院,经济管理学院,上海,200245
2. 上海理工大学,管理学院,上海,200093 |
| |
| 基金项目： | 上海市重点学科建设项目 |
| |
| 摘 要： | 为求解基于成组单元有能力约束的生产批量计划问题，提出了一种基于二进制粒子群算法和免疫记忆机制相结合的方法，并阐明了该方法的具体实现过程。在该方法中，采用罚函数法处理约束条件，每个粒子都代表一组可用于描述具体批量计划方案的规则组合。通过对其他文献中一个仿真实例的计算和结果比较，表明该算法在寻优能力、求解速度和稳定性等方面都明显优于文献中的遗传算法。
|
| 关 键 词： | 有能力约束的生产批量计划 成组技术 二进制粒子群优化算法 |
| 文章编号： | 1006-5911(2006)09-1417-04 |
| 修稿时间： | 2005年6月20日 |
Improved particle swarm optimization algorithm for dynamic lot-sizing problem |
| |
| MA Hui-min,YE Chun-ming,LIU Yi.Improved particle swarm optimization algorithm for dynamic lot-sizing problem[J].Computer Integrated Manufacturing Systems,2006,12(9):1417-1421. |
| |
| Authors: | MA Hui-min YE Chun-ming LIU Yi |
| |
| Abstract: | To solve the capacitated dynamic lot-sizing problem in group technology cell,a method based on binary Particle Swarm Optimization(PSO) algorithm and immune memory mechanism was proposed and its implementation was illustrated in detail.In this method,penalty functions were used as constraints,and each particle was used to represent a group of rules set to describe concrete batching planning.Through computation of a simulation instance and result comparison,the proposed algorithm has demonstrated its higher searching efficiency and better stability than the genetic algorithms mentioned in other literatures. |
| |
| Keywords: | capacitated dynamic lot-sizing problem group technology binary particle swarm optimization algorithm |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
