Remember Me
Or use your Academic/Social account:


Or use your Academic/Social account:


You have just completed your registration at OpenAire.

Before you can login to the site, you will need to activate your account. An e-mail will be sent to you with the proper instructions.


Please note that this site is currently undergoing Beta testing.
Any new content you create is not guaranteed to be present to the final version of the site upon release.

Thank you for your patience,
OpenAire Dev Team.

Close This Message


Verify Password:
Verify E-mail:
*All Fields Are Required.
Please Verify You Are Human:
fbtwitterlinkedinvimeoflicker grey 14rssslideshare1
Zhang, J.; Chen, W.; Zhong, J.; Tan, X.; Li, Y. (2006)
Publisher: Springer
Languages: English
Types: Article
Subjects: TK, QA75

Classified by OpenAIRE into

A hybrid Orthogonal Scheme Ant Colony Optimization (OSACO) algorithm for continuous function optimization (CFO) is presented in this paper. The methodology integrates the advantages of Ant Colony Optimization (ACO) and Orthogonal Design Scheme (ODS). OSACO is based on the following principles: a) each independent variable space (IVS) of CFO is dispersed into a number of random and movable nodes; b) the carriers of pheromone of ACO are shifted to the nodes; c) solution path can be obtained by choosing one appropriate node from each IVS by ant; d) with the ODS, the best solved path is further improved. The proposed algorithm has been successfully applied to 10 benchmark test functions. The performance and a comparison with CACO and FEP have been studied.
  • The results below are discovered through our pilot algorithms. Let us know how we are doing!

    • [1] M. Dorigo, V. Maniezzo and A. Colorni, “Ant system: optimization by a colony of cooperating agents,” IEEE Trans. on systems man, and cybernetics - part B: cybernetics, vol. 26, 1996, pp. 29-41.
    • [2] M. Dorigo and L. M. Gambardella, “Ant colony system: A cooperative learning approach to TSP”, IEEE Trans. Evol. Comput., vol. 1, 1997, pp. 53-66.
    • [3] M. Dorigo, G. Di Caro, and L. M. Gambardella, “Ant algorithms for discrete optimization,” Artificial Life, 1999,5(2), pp. 137-172.
    • [4] R. S. Parpinelli, H. S. Lopes, and A. A. Freitas, “Data mining with an ant colony optimization algorithm,” IEEE Transactions on Evolutionary Computation, vol. 4, 2002, pp. 321-332.
    • [5] K. M. Sim and W. H. Sun, “Ant colony optimization for routing and load-balancing: survey and new directions,” IEEE Trans. on systems man, and cybernetics - part A: system and humans, vol. 33, 2003, pp. 560-572.
    • [6] G. Bilchev and I. C. Parmee, “The ant colony metaphor for searching continuous design spaces,” AISB Workshop on evolutionary computation, 1995.
    • [7] M. Wodrich and G. Bilchev, “Corporative distributed search: the ants' way”, Control Cybernetics, 1997, 26, 413
    • [8] M. Mathur, S. B. Karale, S. Priye, V. K. Jayaraman, and B. D. Kulkarni, “Ant colony approach to continuous function optimization,” Ind. Eng. Chem. Res. 2000, pp3814-3822.
    • [9] N. Monmarché, G. Venturini, and M. Slimane, “On how Pachycondyla apicalis ants suggest a new search algorithm,” Future Generation Computer Systems, 16:937-946, 2000.
    • [10] J. Dréo and P. Siarry, “Continues interacting ant colony algorithm based on based on dense heterarchy,” Future Generation Computer Systems, 20(5):841-856, 2004.
    • [11] K. T. Fang and Y. Wang, Number-Theoretic Methods in Statistics, New York: Chapman & Hall, 1994.
    • [12] A. S. Hedayat, N. J. A. Solane, and John Stufken, Orthogonal Arrays: Theory and Applications, New York: Springer-Verlag, 1999.
    • [13] X. Yao, Y. Liu and G. Lin, “Evolutionary programming made faster”, IEEE Transactions on Evolutionary Computation, vol. 8, 2004, pp. 456-470.
  • No related research data.
  • No similar publications.

Share - Bookmark

Download from

Cite this article