Growing Competitive Ant Algorithm for Multi-Objective 0-1 Programming

摘要：

This paper proposes a new method- growing competitive ant optimization algorithm in order to solving the multi-objective 0-1 programming problem. This algorithm uses a rule of growing competitive to improve the diversity and distribution of Pareto optimal set. The algorithm is coded and implemented on microcomputer that gives satisfactory results after series of numerical tests and comparisons with other algorithm.

关键词： ant algorithm growing competitive multi-objective

作者: Zhu Gang Ma Liang

作者单位: College of Electronic and Electric Engineering Shanghai Second Polytechnic University Shanghai, Chin College of Management University of Shanghai for Science and Technology Shanghai, China

会议类型: 国际会议

会议名称: 2010 International Conference on Information Security and Artificial Intelligence(2010年信息安全与人工智能国际会议 ISAI 2010)

会议地点: 成都

会议语种:英文

页码: 484-486

在线出版日期: 2010-12-17（万方平台首次上网日期，不代表论文的发表时间）