Orthogonal Methods Based Ant Colony Search for Solving Continuous Optimization Problems
- 200 Downloads
Research into ant colony algorithms for solving continuous optimization problems forms one of the most significant and promising areas in swarm computation. Although traditional ant algorithms are designed for combinatorial optimization, they have shown great potential in solving a wide range of optimization problems, including continuous optimization. Aimed at solving continuous problems effectively, this paper develops a novel ant algorithm termed “continuous orthogonal ant colony” (COAC), whose pheromone deposit mechanisms would enable ants to search for solutions collaboratively and effectively. By using the orthogonal design method, ants in the feasible domain can explore their chosen regions rapidly and efficiently. By implementing an “adaptive regional radius” method, the proposed algorithm can reduce the probability of being trapped in local optima and therefore enhance the global search capability and accuracy. An elitist strategy is also employed to reserve the most valuable points. The performance of the COAC is compared with two other ant algorithms for continuous optimization — API and CACO by testing seventeen functions in the continuous domain. The results demonstrate that the proposed COAC algorithm outperforms the others.
Keywordsant algorithm function optimization orthogonal design
Unable to display preview. Download preview PDF.
- Dorigo M, Stützle T. Ant Colony Optimization. the MIT Press, 2003.Google Scholar
- Toth P, Vigo D. The Vehicle Routing Problem. SIAM Monographs on Discrete Mathematics and Applications, Philadelphia, Society for Industrial & Applied Mathematics, 2001.Google Scholar
- Gambardella L M, Taillard É D, Agazzi G. MACS-VRPTW: A Multiple Ant Colony System for Vehicle Routing Problems with Time Windows. New Ideas in Optimization, Corne D, Dorigo M, Glover F (eds.), London, McGraw Hill, 1999, pp.63–76.Google Scholar
- Bilchev G, Parmee I C. The ant colony metaphor for searching continuous design spaces. In Proc. the AISB Workshop on Evolutionary Computation, University of Sheffield, UK, LNCS 933, Springer-Verlag, Berlin, Germany, 1995, pp.25–39.Google Scholar
- Holland J H. Adaptation in Natural and Artificial Systems. Second Edition (First Edition, 1975), Cambridge: the MIT Press, MA, 1992.Google Scholar
- Dréo J, Siarry P. A new ant colony algorithm using the heterarchical concept aimed at optimization of multiminima continuous functions. In Proc. ANTS 2002, Brussels, Belgium, LNCS 2463, 2002, pp.216–221.Google Scholar
- Socha K. ACO for continuous and mixed-variable optimization. In Proc. ANTS 2004, Brussels, Belgium, LNCS 3172, 2004, pp.25–36.Google Scholar
- Pourtakdoust S H, Nobahari H. An extension of ant colony system to continuous optimization problems. In Proc. ANTS 2004, Brussels, Belgium, LNCS 3172, 2004, pp.294–301.Google Scholar
- Kong M, Tian P. A binary ant colony optimization for the unconstrained function optimization problem. In Proc. International Conference on Computational Intelligence and Security (CIS'05), Xi’an, China, LNAI 3801, 2005, pp.682–687.Google Scholar
- Kong M, Tian P. A direct application of ant colony optimization to function optimization problem in continuous domain. In Proc. ANTS 2006, Brussels, Belgium, LNCS 4150, 2006, pp.324–331.Google Scholar
- Feng Y J, Feng Z R. An immunity-based ant system for continuous space multi-modal function optimization. In Proc. the Third International Conference on Machine Learning and Cybernetics, Shanghai, August 26–29, 2004, pp.1050–1054.Google Scholar
- Shelokar P S, Siarry P, Jayaraman V K, Kulkarni B D. Particle swarm and ant colony algorithms hybridized for improved continuous optimization. Appl. Math. Comput., 2006, doi: 10.1016/j.amc.2006.09.098.
- Rao C R. Factorial experiments derivable from combinatorial arrangements of arrays. J. Royal Statist. Soc., 1947, 9(Suppl.): 128–139.Google Scholar
- Bush K A. Orthogonal arrays [Dissertation]. University of North Carolina, Chapel Hill, 1950.Google Scholar
- Math Stat Res Group, Chinese Acad Sci. Orthogonal Design. Bejing: People Education Pub., 1975. (in Chinese)Google Scholar
- Ho S Y, Chen J H. A genetic-based systematic reasoning approach for solving traveling salesman problems using an orthogonal array crossover. In Proc. the Fourth Internal Conference/Exhibition on High Performance Computing in the Asia-Pacific Region, May 2000, 2: 659–663.Google Scholar
- Tanaka H. Simple genetic algorithm started by orthogonal design of experiments. In Proc. SICE Annual Conference in Sapporp, August 2004, pp.1075–1078.Google Scholar