| 求解车间作业调度问题的免疫粒子群算法 |
| |
| 引用本文： | 杨志勇. 求解车间作业调度问题的免疫粒子群算法[J]. 鄂州大学学报, 2006, 13(3): 16-19 |
| |
| 作者姓名： | 杨志勇 |
| |
| 作者单位： | 鄂州大学,电信学院,湖北,鄂州,436000 |
| |
| 摘 要： | 粒子群算法已成功地应用于著名的旅行商问题和其他一些组合优化难题。为了使用粒子群算法来解决生产问题，该文在原有的粒子群优化模型的基础上提出了一种新的免疫粒子群算法，由具体算例验证该算法是有效的。
|
| 关 键 词： | 车间调度 粒子群算法 免疫算法 |
| 文章编号： | 1008-9004（2006）03-0016-03 |
| 收稿时间： | 2005-09-28 |
| 修稿时间： | 2005-09-28 |
The algorithm of immunity grain subgroup of the workshop work dispatch question |
| |
| YANG Zhi-yong. The algorithm of immunity grain subgroup of the workshop work dispatch question[J]. Journal of Ezhou University, 2006, 13(3): 16-19 |
| |
| Authors: | YANG Zhi-yong |
| |
| Affiliation: | School of Electronic and Information, Ezhou University, Ezhou, Hubei 436000, China |
| |
| Abstract: | The algorithm of grain subgroup oneself successfully applies to the famous travel peddler question and other some combinations optimization difficult problem. In order to use the algorithm of grain subgroup to solve the production problem, this article optimized the model in the original grain of subgroup in the foundation proposes,one kind of new immunity algorithm of grain subgroup, by specifically calculated example it confirmed that this algorithm is effective. |
| |
| Keywords: | workshop dispatcher algorithm of grain subgroup algorithm of immunity |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
