A New Ant Colony Method for Continuous-Domain Constrained Optimization

A new method for continuous-domain constrained optimization based on Ant Colony Optimization for Continuous Domains ( ACO ) is proposed. ACO uses a ranked archive of best solutions to generate new solutions. The proposed method ) uses a ranking scheme based on both feasibility of the solutions and their cost function values. ( SRACOThe method is applied to a number of benchmark problems. The results show an improved performance with a reduced number of cost function evaluations for most of the test cases. The algorithm particularly performs well on problems where the feasible space constitutes a very small subset of the whole search space and is surrounded by infeasible regions

کلیدواژه ها:

Constrained optimization ، ant colony optimization ، continuous-domain optimization.