عنوان مقاله [English]
نویسندگان [English]چکیده [English]
Ant Colony Optimisation (ACO) algorithm and adaptive refinement mechanism are used in this paper for solution of optimization problems. Many of the real engineering problems are، however، of continuous nature and finding their solution by discrete ant based algorithms requires discretisation of the decision variables in which affected the convergence and performance of the algorithm. In this paper an adaptive refinement mechanism is suggested to improve the performance of ant algorithms in solving continuous optimization problems. The proposed mechanism is an iterative method in which the search space of the problem at each iteration is limited to a small range around the optimal solution obtained in previous iteration. The application of the proposed mechanism to solve some benchmark function optimization problems and reservoir operation problem is considered and the results are presented.Compression of the results indicate the efficiency and effectiveness of the proposed method to improve the performance of the ant algorithms for continuous optimization problems.