• 中国计算机学会会刊
  • 中国科技核心期刊
  • 中文核心期刊

J4 ›› 2012, Vol. 34 ›› Issue (3): 128-131.

• 论文 • Previous Articles     Next Articles

A Growing Competitive Ant Algorithm for the 01 Programming Problem

GUAN Ping1,ZHU Gang1,MA Liang2,QIU Yongping1   

  1. (1.School of Electronic and Electric Engineering,Shanghai Second Polytechnic University,Shanghai 201209;
    2.Business School,University of Shanghai for Science and Technology,Shanghai 200093,China)
  • Received:2010-09-20 Revised:2011-03-15 Online:2012-03-26 Published:2012-03-25

Abstract:

The 0-1 programming is a special class of integer programming, with a deep background and a wide range of applications. In order to solve the problem of 0-1 programming, we present a growing competition ant optimization algorithm. This algorithm uses a rule of growing competition in order to improve the ability of global optimization. The experimental results illustrate that the algorithm is feasible and effective.

Key words: ant algorithm;growing competitive;0-1 programming