Hybridizing local search algorithms for global optimization

详细信息    查看全文

• 作者：Morteza Alinia Ahandani (1) (2)
  Mohammad-Taghi Vakil-Baghmisheh (3)
  Mohammad Talebi (3)
  
• 关键词：Local search ; Global optimization ; Nelder–Mead simplex ; Bidirectional random optimization ; Hybrid strategy
• 刊名：Computational Optimization and Applications
• 出版年：2014
• 出版时间：December 2014
• 年：2014
• 卷：59
• 期：3
• 页码：725-748
• 全文大小：497 KB
• 参考文献：1. Chiou, W.: A subgradient optimization model for continuous road network design problem. Appl. Math. Model. 33, 1386-396 (2009) CrossRef
  2. Ying, J.Q., Lu, H., Shi, J.: An algorithm for local continuous optimization of traffic signals. Eur. J. Oper. Res. 181, 1189-197 (2007) CrossRef
  3. Perez-Bellid, A.M., Salcedo-Sanz, S., Ortiz-Garc?a, E.G., Portilla-Figueras, J.A., Lopez-Ferreras, F.: A comparison of memetic algorithms for the spread spectrum radar poly phase codes design problem. Eng. Appl. Arti. Intel. 21, 1233-238 (2008) CrossRef
  4. Acharyya, S.K., Mandal, M.: Performance of EAs for four-bar linkage synthesis. Mech. Mach. Theory. 44, 1784-794 (2009) CrossRef
  5. Chang, W.D.: A multi-crossover genetic approach to multivariable PID controllers tuning. Expert. Syst. Appl. 33, 620-26 (2007) CrossRef
  6. Kirkpatrick, S., Gelatt, C.D., Vecchi, M.P.: Optimization by simulate annealing. Science 220, 671-80 (1983) CrossRef
  7. Glover, F., Taillard, E., De Warra, D.A.: User’s guide to tabu search. Ann. Oper. Res. 41, 3-8 (1993) CrossRef
  8. Nelder, J.A., Mead, R.: A simplex method for function minimization. Computer. J. 7, 308-13 (1965) CrossRef
  9. Anderson, R.: Recent advances in finding best operating conditions. J. Am. Stat. Assoc. 48, 789-98 (1975) CrossRef
  10. Holland, J.: Adaptation in Natural and Artificial Systems. The University of Michigan, Ann Arbor (1975)
  11. Moscato, P.: On evolution, search, optimization, genetic algorithms and martial arts: toward memetic algorithm. Technical Report Caltech Concurrent Computation Program: Report 26, California Institute of Technology (1989)
  12. Storn, R., Price, K.: Differential evolution-a simple and efficient heuristic for global optimization over continuous spaces. Chaos. Solton. Fract. 11, 341-59 (1997)
  13. Kennedy, J., Eberhart, R.C.: Particle swarm optimization. In: Proceedings of IEEE international conference on neural networks, vol. 4, pp. 1942-948 (1995)
  14. Eusuff, M.M., Lansey, K.E.: Optimization of water distribution network design using the shuffled frog leaping algorithm. J. Water. Resour. Plng. Mgmt. 129, 210-25 (2003) CrossRef
  15. Karaboga, D.: An idea based on honeybee swarm for numerical optimization, Technical Report TR06. Erciyes University, Engineering Faculty, Computer Engineering Department (2005)
  16. Simon, D.: Biogeography-based optimization. IEEE. Trans. Evolut. Comput. 12, 702-13 (2008) CrossRef
  17. Hart, W.E., Krasnogor, N., Smith, J.E.: Recent Advances in Memetic Algorithms. Springer, Berlin, Heidelberg, New York (2005) CrossRef
  18. Fan, S.-K.S., Zahara, E.: A hybrid simplex search and particle swarm optimization for unconstrained optimization. Eur. J. Oper Res. 181, 527-48 (2007) CrossRef
  19. Fan, S.-K.S., Liang, Y.-C., Zahara, E.: A genetic algorithm and a particle swarm optimizer
• 作者单位：Morteza Alinia Ahandani (1) (2)
  Mohammad-Taghi Vakil-Baghmisheh (3)
  Mohammad Talebi (3)
  
  1. Young Researchers Club, Islamic Azad University, Langaroud Branch, Langarud, Iran
  2. Department of Electrical Engineering, Islamic Azad University, Langaroud Branch, Langarud, Iran
  3. Research Lab of Intelligent Systems, Faculty of Electrical & Computer Engineering, University of Tabriz, Tabriz, Iran
  
• ISSN：1573-2894

文摘

In this paper, we combine two types of local search algorithms for global optimization of continuous functions. In the literature, most of the hybrid algorithms are produced by combination of a global optimization algorithm with a local search algorithm and the local search is used to improve the solution quality, not to explore the search space to find independently the global optimum. The focus of this research is on some simple and efficient hybrid algorithms by combining the Nelder–Mead simplex (NM) variants and the bidirectional random optimization (BRO) methods for optimization of continuous functions. The NM explores the whole search space to find some promising areas and then the BRO local search is entered to exploit optimal solution as accurately as possible. Also a new strategy for shrinkage stage borrowed from differential evolution (DE) is incorporated in the NM variants. To examine the efficiency of proposed algorithms, those are evaluated by 25 benchmark functions designed for the special session on real-parameter optimization of CEC2005. A comparison study between the hybrid algorithms and some DE algorithms and non-parametric analysis of obtained results demonstrate that the proposed algorithms outperform most of other algorithms and their difference in most cases is statistically considerable. In a later part of the comparative experiments, a comparison of the proposed algorithms with some other evolutionary algorithms reported in the CEC2005 confirms a better performance of our proposed algorithms.