Abstract
Ant colony optimization (ACO) algorithms have been used successfully to solve a wide variety of combinatorial optimization problems. In the recent past many modifications have been proposed in ACO algorithms to solve continuous optimization problems. However, most of the ACO variants to solve continuous optimization problems lack ability of efficient exploration of the search space and suffer from the problem of premature convergence. In this work a new ACO algorithm (ACO–LD) is proposed that incorporates Laplace distribution based interaction scheme among the ants. Also, in order to avoid the problem of stagnation, an additional diversification mechanism is introduced. The proposed ACO–LD is tested on benchmark test functions taken from Congress on Evolutionary Computation 2014 (CEC2014) and the results are compared with four state-of-the-art algorithms reported in CEC2014. ACO–LD is also applied to solve six real life problems and the results are compared with the results of six other algorithms reported in the literature. The analysis of the results shows that the overall performance of ACO–LD is found to be better than the other algorithms included in the present study.
Similar content being viewed by others
References
Ali M, Pant M, Singh V (2010) Two modified differential evolution algorithms and their applications to engineering design problems. World J Model Simul 6(1):72–80
Bilchev G, Parmee IC (1995) The ant colony metaphor for searching continuous design spaces. In: Evolutionary computing, Springer, pp 25–39
Bujok P, Tvrdik J, Polakova R (2014) Differential evolution with rotation-invariant mutation and competing-strategies adaptation. In: Evolutionary Computation (CEC), 2014 IEEE Congress on, pp. 2253–2258
Bullnheimer B, Hartl RF, Strauss C (1997) A new rank based version of the ant system: a computational study. Cent. Eur J Oper Res 7(1):25–38
Dorigo M, Gambardella LM (1997) Ant colony system: a cooperative learning approach to the traveling salesman problem. IEEE Trans Evolut Comput 1(1):53–66
Dorigo M, Maniezzo V, Colorni A (1996) Ant system: optimization by a colony of cooperating agents. IEEE Trans Syst Man Cybern Part B Cybern 26(1):29–41
Dorigo M, Stützle T (2003) The ant colony optimization metaheuristic: Algorithms, applications, and advances. In: Handbook of metaheuristics, Springer, pp 250–285
El Dor A, Clerc M, Siarry P (2012)Hybridization of differential evolution and particle swarm optimization in a new algorithm: Depso-2s. In: Swarm and evolutionary computation, Springer, pp 57–65
Guntsch M, Middendorf M (2002) A population based approach for aco. In: Applications of evolutionary computing, Springer, pp 72–81
Hu Z, Bao Y, Xiong T (2014) Partial opposition-based adaptive differential evolution algorithms: evaluation on the cec 2014 benchmark set for real-parameter optimization. In: Evolutionary computation (CEC), 2014 IEEE Congress on, pp 2259–2265
Leguizamón G, Coello CAC (2010) An alternative \(\text{ACO}_{R}\) algorithm for continuous optimization problems. In: Swarm intelligence, Springer, pp 48–59
Liang JJ, Qu BY, Suganthan PN (2013) Problem definitions and evaluation criteria for the CEC 2014 special session and competition on single objective real-parameter numerical optimization. Technical Report 201212, Computational Intelligence Laboratory, Zhengzhou University, Zhengzhou China and Technical Report, Nanyang Technological University, Singapore
Liao T, Montes de Oca MA, Aydin D, Stützle T, Dorigo M (2011) An incremental ant colony algorithm with local search for continuous optimization. In: Proceedings of the 13th annual conference on Genetic and evolutionary computation, ACM, pp 125–132
Liao T, Stützle T, de Oca MAM, Dorigo M (2014) A unified ant colony optimization algorithm for continuous optimization. Eur J Oper Res 234(3):597–609
Wodrich M, Bilchev G (1997) Cooperative distributed search: the ant’s way. IEEE Trans Syst Man Cybern Part B Cybern 26:413–445
Mohan BC, Baskaran R (2012) A survey: ant colony optimization based recent research and implementation on several engineering domain. Expert Syst Appl 39(4):4618–4627
Polakova R, Tvrdik J, Bujok P (2014) Controlled restart in differential evolution applied to cec2014 benchmark functions. In: Evolutionary computation (CEC), 2014 IEEE congress on, pp 2230–2236
Pourtakdoust SH, Nobahari H (2004) An extension of ant colony system to continuous optimization problems. In: Ant colony optimization and swarm intelligence, Springer, pp 294–301
Powell MJ (1964) An efficient method for finding the minimum of a function of several variables without calculating derivatives. Comput J 7(2):155–162
Powell MJ (2009) The BOBYQA algorithm for bound constrained optimization without derivatives. Cambridge NA Report NA2009/06, University of Cambridge, Cambridge
Socha K, Dorigo M (2008) Ant colony optimization for continuous domains. Eur J Oper Res 185(3):1155–1173
Stützle T, Hoos HH (2000) Max–min ant system. Future Gener Comput Syst 16(8):889–914
Tseng LY, Chen C (2008) Multiple trajectory search for large scale global optimization. In: Evolutionary Computation, 2008. CEC 2008. (IEEE World Congress on Computational Intelligence). IEEE Congress on, pp 3052–3059
Yu C, Kelley L, Zheng S, Tan Y (2014) Fireworks algorithm with differential mutation for solving the cec 2014 competition problems. In: Evolutionary computation (CEC), 2014 IEEE congress on, pp 3238–3245
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Kumar, A., Thakur, M. & Mittal, G. A new ants interaction scheme for continuous optimization problems. Int J Syst Assur Eng Manag 9, 784–801 (2018). https://doi.org/10.1007/s13198-017-0651-3
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s13198-017-0651-3