A novel multi-objective optimization algorithm based on artificial bee colony
文献类型：会议论文
| 作者 | Zou WP(邹文平); Zhu YL(朱云龙) ; Chen HN(陈瀚宁); Shen H(申海)
|
| 出版日期 | 2011 |
| 会议名称 | 13th Annual Genetic and Evolutionary Computation Conference, GECCO'11 |
| 会议日期 | July 12-16, 2011 |
| 会议地点 | Dublin, Ireland |
| 关键词 | Evolutionary algorithms Pareto principle |
| 页码 | 103-104 |
| 中文摘要 | Multi-objective optimization has been a difficult problem and focus for research in fields of science and engineering. This paper presents a novel algorithm based on Artificial Bee Colony (ABC) to deal with multi-objective optimization problems. ABC is one of the most recently introduced algorithms based on the intelligent foraging behavior of a honey bee swarm. It uses less control parameters and it can be efficiently used for solving multimodal and multidimensional optimization problems. Our algorithm uses the concept of Pareto dominance to determine the flight direction of a bee and it maintains nondominated solution vectors which have been found in an external archive. The proposed algorithm is validated using the standard test problems ZDT1 to ZDT3 and ZDT6, and simulation results show that the proposed approach is highly competitive and that can be considered a viable alternative to solve multi-objective optimization problems. © 2011 Authors. |
| 收录类别 | EI |
| 产权排序 | 1 |
| 会议主办者 | Assoc. Comput. Mach., Spec. Interest; Group Genet. Evol. Comput. (ACM SIGEVO) |
| 会议录 | Genetic and Evolutionary Computation Conference, GECCO'11 - Companion Publication
 |
| 会议录出版者 | Association for Computing Machinery |
| 会议录出版地 | New York |
| 语种 | 英语 |
| ISBN号 | 978-1-4503-0690-4 |
| 源URL | [http://ir.sia.cn/handle/173321/8310]  |
| 专题 | 沈阳自动化研究所_工业信息学研究室 |
| 推荐引用方式 GB/T 7714 | Zou WP,Zhu YL,Chen HN,et al. A novel multi-objective optimization algorithm based on artificial bee colony[C]. 见:13th Annual Genetic and Evolutionary Computation Conference, GECCO'11. Dublin, Ireland. July 12-16, 2011. |
入库方式： OAI收割
来源：沈阳自动化研究所
浏览0
下载0
收藏0
其他版本
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。