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

► This paper presents three new hybrid ACO algorithms for constrained optimization problems. ► All three algorithms are based on ACOR. ► Fourteen problems selected from various domains were tested. ► All three algorithms greatly outperform the original ACOR. ► This paper also investigated the relati...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Applied mathematics and computation Ročník 219; číslo 6; s. 3241 - 3252
Hlavní autoři: Liao, T. Warren, Kuo, R.J., Hu, J.T.L.
Médium: Journal Article
Jazyk:angličtina
Vydáno: Elsevier Inc 25.11.2012
Témata:
Ant colony optimization
Constrained optimization
Hybrid metaheuristic
Metaheuristic
Mixed discrete–continuous
Ant colony optimization
Metaheuristic
Mixed discrete–continuous
Hybrid metaheuristic
Constrained optimization
ISSN:0096-3003, 1873-5649
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:► This paper presents three new hybrid ACO algorithms for constrained optimization problems. ► All three algorithms are based on ACOR. ► Fourteen problems selected from various domains were tested. ► All three algorithms greatly outperform the original ACOR. ► This paper also investigated the relative performance of applying local search with fixed and varying probability. This paper presents three new hybrid ant colony optimization algorithms that are extended from the ACOR developed by Socha and Dorigo for solving mixed discrete–continuous constrained optimization problems. The first two hybrids, labeled ACOR-HJ and ACOR-DE, differs in philosophy with the former integrating ACOR with the effective Hooke and Jeeves local search method and the latter a cooperative hybrid between ACOR and differentia evolution. The third hybrid, labeled ACOR-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 ACOR 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.
ISSN:0096-3003
1873-5649
DOI:10.1016/j.amc.2012.09.064