152
Views
3
CrossRef citations to date
0
Altmetric
Section B

Two effective hybrid metaheuristic algorithms for minimization of multimodal functions

, &
Pages 2415-2428 | Received 22 Feb 2009, Accepted 12 Nov 2010, Published online: 14 Apr 2011

References

  • Alba , E. , Luna , F. , Nebro , A. J. and Troya , J. M. 2004 . Parallel heterogeneous genetic algorithms for continuous optimization . Parallel Comput. , 30 ( 5–6 ) : 699 – 719 .
  • Al-Sultan , K. S. and Al-Fawzan , M. A. 1997 . A tabu search Hooke and Jeeves algorithm for unconstrained optimization . European J. Oper. Res. , 103 : 198 – 208 .
  • Babaie-Kafaki , S. , Ghanbari , R. and Mahdavi-Amiri , N. Two new metaheuristic algorithms for unconstrained optimization . Extended Abstracts of the 39th Annual Iranian Mathematics Conference . pp. 110 – 113 . Kerman, , Iran : Shahid Bahonar University of Kerman . 24–27
  • Beyer , H. G. and Schwefel , H. P. 2002 . Evolution strategies: A comprehensive introduction . Nat. Comput. , 1 : 3 – 52 .
  • Deb , K. 2001 . Multi-objective Optimization Using Evolutionary Algorithms , New York : John Wiley and Sons .
  • Deb , K. and Agrawal , R. B. 1994 . “ Simulated binary crossover for continuous search space ” . Department of Mechanical Engineering, Indian Institute of Technology . Tech. Rep
  • Dekkers , A. and Aarts , E. 1991 . Global optimization by simulated annealing . Math. Program. , 50 : 367 – 393 .
  • Dražić , M. , Lavor , C. , Maculan , N. and Mladenović , N. 2008 . A continuous variable neighborhood search heuristic for finding the three-dimensional structure of a molecule . European J. Oper. Res. , 185 : 1265 – 1273 .
  • Drezner , Z. 2008 . Extensive experiments with hybrid genetic algorithms for the solution of the quadratic assignment problem . Comput. Oper. Res. , 35 : 717 – 736 .
  • Gao , J. , Sun , L. and Gen , M. 2008 . A hybrid genetic and variable neighborhood descent algorithm for flexible job shop scheduling problems . Comput. Oper. Res. , 35 : 2897 – 2907 .
  • García , S. , Molina , D. , Lozano , M. and Herrera , F. 2009 . A study on the use of non-parametric tests for analyzing the evolutionary algorithms’ behaviour: A case study on the CEC’2005 special session on real-parameter optimization . J. Heuristics , 15 ( 6 ) : 617 – 644 .
  • Ghanbari , R. and Mahdavi-Amiri , N. A new hybrid metaheuristic algorithm for solving uncapacitated facility location problem . Extended Abstracts of the 39th Annual Iranian Mathematics Conference . Kerman, Iran. pp. 231 – 234 . Shahid Bahonar University of Kerman . 24–27
  • Goldberg , D. E. 1989 . Genetic Algorithms in Search, Optimization and Machine Learning , Boston : Addison-Wesley .
  • Hamzaçebi , C. and Kutay , F. 2007 . Continuous functions minimization by dynamic random search technique . Appl. Math. Model , 31 ( 10 ) : 2189 – 2198 .
  • Hansen , P. and Mladenović , N. 2001 . Variable neighborhood search: Principles and applications . European J. Oper. Res. , 130 : 449 – 467 .
  • Hong , L. and Shibo , X. On Ant Colony Algorithm for Solving Continuous Optimization Problem . Proceedings of International Conference on Intelligent Information Hiding and Multimedia Signal Processing . Harbin, China. pp. 1450 – 1453 . 15–17
  • Jaszkiewicz , A. and Kominek , P. 2003 . Genetic local search with distance preserving recombination operator for a vehicle routing problem . European J. Oper. Res. , 51 : 352 – 364 .
  • Ji , M. and Tang , H. 2004 . Global optimizations and tabu search based on memory . Appl. Math. Comput , 159 ( 2 ) : 449 – 457 .
  • Kwon , Y. D. , Kwon , S. B. , Jin , S. B. and Kim , J. Y. 2003 . Convergence enhanced genetic algorithm with successive zooming method for solving continuous optimization problems . Comput. Struct , 81 ( 17 ) : 1715 – 1725 .
  • Lee , K. S. and Geem , Z. W. 2005 . A new meta-heuristic algorithm for continuous engineering optimization: Harmony search theory and practice . Comput. Methods Appl. Mech. Engrg. , 194 : 3902 – 3933 . (36–38)
  • Lee , Z. J. , Su , S. F. , Chuang , C. C. and Liu , K. H. 2008 . Genetic algorithm with ant colony optimization (GA-ACO) for multiple sequence alignment . Appl. Soft Comput. , 8 : 55 – 78 .
  • Liang , J. J. , Baskar , S. , Suganthan , P. N. and Qin , A. K. 2006 . Performance evaluation of multiagent genetic algorithm . Nat. Comput. , 5 : 83 – 96 .
  • Masri , S. E. , Bekcy , G. A. and Safford , E. B. 1980 . A global optimization algorithm using adaptive random search . Appl. Math. Comput. , 7 : 353 – 375 .
  • Mladenović , N. , Dražić , M. , Kovačevic-Vujčić , V. and Čangalović , M. 2008 . General variable neighborhood search for the continuous optimization . European J. Oper. Res , 191 ( 3 ) : 753 – 770 .
  • Montgomery , D. C. and Runger , G. C. 2003 . Applied Statistics and Probability for Engineers , 3 , New York : John Wiley & Sons .
  • Nelder , J. A. and Mead , R. 1964 . A simlex method for function minimization . Comput. J. , 7 : 308 – 313 .
  • Nocedal , J. and Wright , S. J. 1999 . Numerical Optimization , Berlin : Springer .
  • Suganthan , P. N. , Hansen , N. , Liang , J. J. , Deb , K. , Chen , Y.-P. , Auger , A. and Tiwari , S. 2005 . “ Problem definitions and evaluation criteria for the CEC2005 special session on real-parameter optimization ” . Singapore : Nanyang Technological University . Tech. Rep., KanGAL Report Number 2005005 Available at http://www.ntu.edu.sg/home/epnsugan/index_files/CEC-05/Tech-Report-May-30-05.pdf
  • Taillard , É. D. 1995 . Comparison of iterative searches for quadratic assignment problem . Locat. Sci. , 3 : 87 – 105 .
  • Toksari , M. D. 2006 . Ant colony optimization for finding the global minimum . Appl. Math. Comput , 176 ( 1 ) : 308 – 316 .
  • Toksari , M. D. 2009 . Minimizing the multimodal functions with Ant Colony Optimization approach . Expert Syst. Appl. , 36 : 6030 – 6035 .
  • Toksari , M. D. and Güner , E. 2007 . Solving the unconstrained optimization problem by a variable neighborhood search . J. Math. Anal. Appl. , 328 : 1178 – 1187 .
  • Wang , L. and Zheng , D. Z. 2001 . An effective hybrid optimization strategy for job-shop scheduling problems . Comput. Oper. Res. , 28 : 585 – 596 .

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.