| 基于改进粒子群算法求解单级多资源约束生产批量计划问题 |
| |
| 引用本文： | 马慧民,柳毅,叶春明.基于改进粒子群算法求解单级多资源约束生产批量计划问题[J].工业工程与管理,2005,10(6):66-70. |
| |
| 作者姓名： | 马慧民 柳毅 叶春明 |
| |
| 作者单位： | 上海理工大学,管理学院,上海,200093;上海理工大学,管理学院,上海,200093;上海理工大学,管理学院,上海,200093 |
| |
| 摘 要： | 本文提出了用于求解单级多资源约束的生产批量计划问题的改进二进制粒子群算法，阐明了算法的具体实现过程。通过对其它文献中的例子进行计算和结果比较，表明了该算法在寻优能力、求解速度和稳定性方面都明显优于文献中的传统遗传算法和退火惩罚混合遗传算法。
|
| 关 键 词： | 生产批量计划 多资源约束 粒子群算法 二进制 |
| 文章编号： | 1007-5429(2005)06-0066-05 |
| 收稿时间： | 2005-01-20 |
| 修稿时间： | 2005-03-20 |
Improved Particle Swarm Optimization Algorithm for the Single Level Capacitated Dynamic Lot-sizing Problem |
| |
| MA Hui-min,LIU Yi,YE Chun-ming.Improved Particle Swarm Optimization Algorithm for the Single Level Capacitated Dynamic Lot-sizing Problem[J].Industrial Engineering and Management,2005,10(6):66-70. |
| |
| Authors: | MA Hui-min LIU Yi YE Chun-ming |
| |
| Affiliation: | College of Management, University of Shanghai for Science and Technology, Shanghai 200093, China |
| |
| Abstract: | In this paper,the improved particle swarm optimization algorithm for the single level capacitated dynamic lot-sizing problem is presented.The detailed realization of the algorithm is illustrated.Using the new algorithm,this paper computes the examples from other literatures,and compares the both results.It can be found that the ability of optimal value searching,the speed and the stability of the new algorithm mentioned in this paper is better than both the traditional genetic algorithm and \the annealing penailty hybrid genetic algorithm. |
| |
| Keywords: | dynamic lot-sizing problem capacitated Particle swarm optimization algorithm Binary |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
