An improved ant colony algorithm in continuous optimization

Abstract

A modified ant colony algorithm for solving optimization problem with continuous parameters is presented. In the method, groups of candidate values of the components are constructed, and each value in the group has its trail information. In each iteration of the ant colony algorithm, the method first chooses initial values of the components using the trail information. Then GA operations of crossover and mutation can determine the values of the components in the solution. Our experimental results on the problem of nonlinear programming show that our method has a much higher convergence speed and stability than those of simulated annealing (SA) and GA.

Keywords

Ant colony algorithm / optimization / nonlinear programming

References

[1] Aarts E., Korst J.. Simulated Annealing and Boltamann Machines, 1989, New York: John Willy & Sons, Inc.

[2] Bilchev, G., I. C. Parmee, “The ant colony metaphor for searching continuous design spaces”. In: Lecture Notes in Computer Science (Fogarty, Y., ed.) Vol. 993, pp25–39, Springer-Verlag, 1995.

[3] Botee, H. M., E. Bonabeau, “Evolving ant colony optimization”, Adv. Complex Systems, No.1, pp149–159, 1998.

[4] Colorni A., Dorigo M., Maniezzo V.. Ant colony system for job-shop scheduling. Belgian J. of Operations Research Statistics and Computer Science, 1994, 34(1): 39-53.

[5] Dorigo M., Maniezzo V., Colorni A.. Ant system: Optimization by a colony of coorperating agents. IEEE Trans. on SMC, 1996, 26(1): 28-41.

[6] Dorigo M., Luca M.. A study of Ant-Q. Proceedings of 4th International Conference on Parallel Problem from Nature, 1996, Berlin: Springer Verlag 656-665.

[7] Dorigo M., Gambardella L.M.. Ant Colony System: A cooperative learning approach to the traveling salesman problem. IEEE Trans. on Evolutionary Computing, 1997, 1(1): 53-56.

[8] Gambardella L. M., Dorigo M.. HAS-SOP: An hybrid ant system for the sequential ordering problem. Technical Report IDSIA, 1997, Switzerland: Lugano 97-11.

[9] Gambardella, L. M., M. Dorigo, “Ant-Q: A reinforcement learning approach to the traveling salesman problem”, Proceedings of the 11 ^th International Conference on Evolutionary Computation, IEEE Press, pp616–621, 1996.

[10] Maniezzo, V., A. Carbonaro, “An ANTS heuristic for the frequency assignment problem”, Future Generation Computer Systems, No. 16, pp 927–935, 2000.

[11] Maniezzo, V., “Exact and approximate nonditerministic tree search procedures for the quadratic assignment problem”, INFORMS J. Comput. No. 11, pp358–369, 1999.

[12] Shen J., Chen L.. A new approach to solving nonlinear programming. Journal of Systems Science and Systems Engineering, 2002, 11(1): 28-36.

[13] Stutzle T., Hoos H.H.. Improvements on the Ant System: Introducting the MAX-MIN Ant System. Artificial Neural Networks and Genetic Algorithms, 1988, New York: Springer Verlag 245-249.

[14] Michalewicz Z.. Genetic Algorithms+ Data Structures=Evolutionary Programs, 1996, 3rd ed. Berlin: Springer-Verlag Berlin Heidelberg Press 261-262.