| 求解布局问题的混合萤火虫群优化算法 |
| |
| 引用本文： | 方瑛,曾宇. 求解布局问题的混合萤火虫群优化算法[J]. 江西师范大学学报(自然科学版), 2012, 0(4): 403-406 |
| |
| 作者姓名： | 方瑛 曾宇 |
| |
| 作者单位： | 湖北工业大学理学院, 湖北 武汉 430068 |
| |
| 基金项目： | 湖北省自然科学基金(2009CDB312);武汉市科技攻关课题(201010621218)资助项目 |
| |
| 摘 要： | 为了充分发挥萤火虫算法的优点,将人工萤火虫群优化算法与启发式策略相结合,设计了一个新的求解布局问题的高效萤火虫优化算法.实例测试和实验对比结果表明:相对于已有文献中的算法,提出的混合布局方法更加有效.
|
| 关 键 词： | 矩形布局 启发式策略 萤火虫算法 |
Hybrid Glowworm Swarm Optimization Algorithm for Solving Packing Problem |
| |
| FANG Ying,ZENG Yu. Hybrid Glowworm Swarm Optimization Algorithm for Solving Packing Problem[J]. Journal of Jiangxi Normal University (Natural Sciences Edition), 2012, 0(4): 403-406 |
| |
| Authors: | FANG Ying ZENG Yu |
| |
| Affiliation: | (School of Science,Hubei University of Technology,Wuhan Hubei 430068,China) |
| |
| Abstract: | In order to give full play to the advantages of glowworm swarm algorithm,the paper designed a new efficient algorithm in which the glowworm swarm optimization algorithm has been combined with heuristic strategy to solve the packing problem.Through the comparison of experimental data,the results show that the proposed layout method is more effective than other known algorithms. |
| |
| Keywords: | layout problem heuristic tactics glowworm swarm algorithm |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
| 点击此处可从《江西师范大学学报(自然科学版)》浏览原始摘要信息 |
|
点击此处可从《江西师范大学学报(自然科学版)》下载全文 |
