Hybrid ant colony optimization algorithms for mixed discrete-continuous optimization problems

Abstract This paper presents three new hybrid ant colony optimization algorithms that are extended from the ACO R developed by Socha and Dorigo for solving mixed discrete–continuous constrained optimization problems. The first two hybrids, labeled ACO R -HJ and ACO R -DE, differs in philosophy with the former integrating ACO R with the effective Hooke and Jeeves local search method and the latter a cooperative hybrid between ACO R and differentia evolution. The third hybrid, labeled ACO R -DE-HJ, is the second cooperative hybrid enhanced with the Hooke and Jeeves local search. All three algorithms incorporate a method to handle mixed discrete–continuous variables and the Deb’s parameterless penalty method for handling constraints. Fourteen problems selected from various domains were used for testing the performance of both algorithms. It was showed that all three algorithms greatly outperform the original ACO R in finding the exact or near global optima. An investigation was also carried out to determine the relative performance of applying local search with a fixed probability or varying probability.

[1]  Johann Dréo,et al.  A New Ant Colony Algorithm Using the Heterarchical Concept Aimed at Optimization of Multiminima Continuous Functions , 2002, Ant Algorithms.

[2]  Thomas Stützle,et al.  Ant Colony Optimization , 2009, EMO.

[3]  T. Warren Liao,et al.  Two hybrid differential evolution algorithms for engineering design optimization , 2010, Appl. Soft Comput..

[4]  Ian C. Parmee,et al.  The Ant Colony Metaphor for Searching Continuous Design Spaces , 1995, Evolutionary Computing, AISB Workshop.

[5]  Rainer Storn,et al.  Differential Evolution – A Simple and Efficient Heuristic for global Optimization over Continuous Spaces , 1997, J. Glob. Optim..

[6]  Patrick Siarry,et al.  Particle swarm and ant colony algorithms hybridized for improved continuous optimization , 2007, Appl. Math. Comput..

[7]  Marco Dorigo,et al.  Ant colony optimization for continuous domains , 2008, Eur. J. Oper. Res..

[8]  Jing Xiao,et al.  A hybrid ant colony optimization for continuous domains , 2011, Expert Syst. Appl..

[9]  Luca Maria Gambardella,et al.  Ant Algorithms for Discrete Optimization , 1999, Artificial Life.

[10]  Marco Dorigo,et al.  Ant system: optimization by a colony of cooperating agents , 1996, IEEE Trans. Syst. Man Cybern. Part B.

[11]  Akbar Karimi,et al.  Continuous ant colony system and tabu search algorithms hybridized for global minimization of continuous multi-minima functions , 2010, Comput. Optim. Appl..

[12]  B. Babu,et al.  Optimization of process synthesis and design problems: A modified differential evolution approach , 2006 .

[13]  Robert Hooke,et al.  `` Direct Search'' Solution of Numerical and Statistical Problems , 1961, JACM.

[14]  V. K. Jayaraman,et al.  Ant Colony Approach to Continuous Function Optimization , 2000 .

[15]  K. Deb An Efficient Constraint Handling Method for Genetic Algorithms , 2000 .