Skip to main content
SpringerLink
Log in

Hybridizing local search algorithms for global optimization

  • Published:
Computational Optimization and Applications Aims and scope Submit manuscript

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7

Similar content being viewed by others

References

  1. Chiou, W.: A subgradient optimization model for continuous road network design problem. Appl. Math. Model. 33, 1386–1396 (2009)

    Article  MATH  MathSciNet  Google Scholar 

  2. Ying, J.Q., Lu, H., Shi, J.: An algorithm for local continuous optimization of traffic signals. Eur. J. Oper. Res. 181, 1189–1197 (2007)

    Article  MATH  MathSciNet  Google Scholar 

  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–1238 (2008)

    Article  Google Scholar 

  4. Acharyya, S.K., Mandal, M.: Performance of EAs for four-bar linkage synthesis. Mech. Mach. Theory. 44, 1784–1794 (2009)

    Article  MATH  Google Scholar 

  5. Chang, W.D.: A multi-crossover genetic approach to multivariable PID controllers tuning. Expert. Syst. Appl. 33, 620–626 (2007)

    Article  Google Scholar 

  6. Kirkpatrick, S., Gelatt, C.D., Vecchi, M.P.: Optimization by simulate annealing. Science 220, 671–680 (1983)

    Article  MATH  MathSciNet  Google Scholar 

  7. Glover, F., Taillard, E., De Warra, D.A.: User’s guide to tabu search. Ann. Oper. Res. 41, 3–28 (1993)

    Article  MATH  Google Scholar 

  8. Nelder, J.A., Mead, R.: A simplex method for function minimization. Computer. J. 7, 308–313 (1965)

    Article  MATH  Google Scholar 

  9. Anderson, R.: Recent advances in finding best operating conditions. J. Am. Stat. Assoc. 48, 789–798 (1975)

    Article  Google Scholar 

  10. Holland, J.: Adaptation in Natural and Artificial Systems. The University of Michigan, Ann Arbor (1975)

    Google Scholar 

  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–359 (1997)

    MATH  MathSciNet  Google Scholar 

  13. Kennedy, J., Eberhart, R.C.: Particle swarm optimization. In: Proceedings of IEEE international conference on neural networks, vol. 4, pp. 1942–1948 (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–225 (2003)

    Article  Google Scholar 

  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–713 (2008)

    Article  Google Scholar 

  17. Hart, W.E., Krasnogor, N., Smith, J.E.: Recent Advances in Memetic Algorithms. Springer, Berlin, Heidelberg, New York (2005)

    Book  MATH  Google Scholar 

  18. Fan, S.-K.S., Zahara, E.: A hybrid simplex search and particle swarm optimization for unconstrained optimization. Eur. J. Oper Res. 181, 527–548 (2007)

    Article  MATH  MathSciNet  Google Scholar 

  19. Fan, S.-K.S., Liang, Y.-C., Zahara, E.: A genetic algorithm and a particle swarm optimizer hybridized with Nelder–Mead simplex search. Comput. Ind. Eng. 50, 401–425 (2006)

    Article  Google Scholar 

  20. Wang, Y.-J., Zhang, J.-S., Zhang, Y.-F.: A fast hybrid algorithm for global optimization. In: Proceedings of the fourth international conference on machine learning and cybernetics, vol. 5, pp. 3030–3035 (2005)

  21. Liu, B., Lu, J., Wang, Y., Tang, Y.: An effective parameter extraction method based on memetic differential evolution algorithm. Microelectron. J. 39, 1761–1769 (2008)

    Article  Google Scholar 

  22. Yuan, Q., He, Z., Leng, H.: A hybrid genetic algorithm for a class of global optimization problems with box constraints. Appl. Math. Comput. 197, 924–929 (2008)

    Article  MATH  MathSciNet  Google Scholar 

  23. Perez-Bellido, A.M., Salcedo-Sanz, S., Ortiz-Garcia, E.G., Portilla-Figueras, J.A., Lopez-Ferreras, F.: A comparison of memetic algorithms for the spread spectrum radar polyphase codes design problem. Eng. Appl. Artif. Intel. 21, 1233–1238 (2008)

    Article  Google Scholar 

  24. Yildiz, A.R.: An effective hybrid immune-hill climbing optimization approach for solving design and manufacturing optimization problems in industry. J. Mate. Process. Tech. 209, 2773–2780 (2009)

    Article  Google Scholar 

  25. Neri, F., Cotta, C., Moscato, p: Handbook of Memetic Algorithms. Studies in Computational Intelligence, vol. 379. Springer, Berlin Heidelberg (2012)

    Google Scholar 

  26. Neri, F., Cotta, C.: Memetic algorithms and memetic computing optimization: a literature review. Swarm. Evol. Comput. 2, 1–14 (2012)

    Article  Google Scholar 

  27. Shi, X.H., Liang, Y.C., Lee, H.P., Lu, C., Wang, L.N.: An improved GA and a novel PSO-GA-based hybrid GA. Inform. Process. Lett. 93, 255–261 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  28. Shelokar, P.S., Siarry, P., Jayaraman, V.K., Kulkarni, B.D.: Particle swarm and ant colony algorithm hybridized for improved continuous optimization. Appl. Math. Comput. 188, 129–142 (2007)

    Article  MATH  MathSciNet  Google Scholar 

  29. Zhang, M., Geng, H., Luo, W., Huang, L., Wang, X.: A hybrid of differential evolution and genetic algorithm for constrained multiobjective optimization problems. In: Wang, T.-D., et al. (eds.) SEAL, vol. 4247, pp. 318–327. Springer, Berlin (2006)

  30. Hendtlass, T.: A combined swarm differential evolution algorithm for optimization problems. Lect. Notes Comput. Sci. 2070, 11–18 (2001)

    Article  Google Scholar 

  31. Chiou, J.-P., Chang, C.-F., Su, C.-T.: Ant direction hybrid differential evolution for solving large capacitor placement problems. IEEE. T. Power. Syst. 19, 1794–1800 (2001)

    Article  Google Scholar 

  32. Zhang, C.Y., Lei, P.-G., Rao, Y.-Q., Guan, Z.: A very fast TS/SA algorithm for the job shop scheduling. Comput. Oper. Res. 35, 282–294 (2008)

    Article  MATH  MathSciNet  Google Scholar 

  33. Purushothama, G.K., Jenkins, L.: Simulated annealing with local search-a hybrid algorithm for unit commitment. IEEE. T. Power. Syst. 18, 273–278 (2003)

    Article  Google Scholar 

  34. Hamzacebi, C., Kutay, F.: Continuous functions minimization by dynamic random search technique. Appl. Math. Model. 31, 2189–2198 (2007)

    Article  MATH  Google Scholar 

  35. Chelouah, R., Siarry, P.: A hybrid method combining continuous tabu search and Nelder-Mead simplex algorithms for the global optimization of multiminimum functions. Eur. J. Oper. Res. 161, 636–654 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  36. Chelouah, R., Siarry, P.: Genetic and Nelder–Mead algorithms hybridized for a more accurate global optimization of continuous multiminimum functions. Eur. J. Oper. Res. 148, 335–348 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  37. Elbeltagi, E., Hegazy, T., Grierson, D.: Comparison among five evolutionary-based algorithms. Adv. Eng. Inform. 19, 43–53 (2005)

    Article  Google Scholar 

  38. Zabinsky, Z.B., Bulger, D., Khompatraporn, C.: Stopping and restarting strategy for stochastic sequential search in global optimization. J. Glob. Optim. 46, 273–286 (2010)

    Article  MATH  MathSciNet  Google Scholar 

  39. Gyorgy, A., Kocsis, L.: Efficient multi-start strategies for local search algorithms. J. Artif. Intell. Res. 41, 407–444 (2011)

    MathSciNet  Google Scholar 

  40. Nguyen, V.-P., Prins, C., Prodhon, C.: A multi-start iterated local search with tabu list and path relinking for the two-echelon location-routing problem. Eng. Appl. Artif. Intell. 25, 56–71 (2012)

    Article  Google Scholar 

  41. Essafi, M., Delorme, X., Dolgui, A.: Balancing lines with CNC machines: a multistart and based heuristic. CIRP. J. Manuf. Sci. Tech. 2, 176–182 (2010)

    Article  Google Scholar 

  42. Pacheco, J., Angel-Bello, F., Alvarez, A.: A multi-start tabu search method for a single-machine scheduling problem with periodic maintenance and sequence-dependent set-up times. J. Sched. 16(6), 661–673 (2012). doi:10.1007/s10951-012-0280-2

    Article  MathSciNet  Google Scholar 

  43. Kaucic, M.: A multi-start opposition-based particle swarm optimization algorithm with adaptive velocity for bound constrained global optimization. J. Glob. Optim. 55, 165–188 (2013)

    Article  MATH  MathSciNet  Google Scholar 

  44. Marti, R., Resende, M.G.C., Ribeiro, C.C.: Multi-start methods for combinatorial optimization. Eur. J. Oper. Res. 26, 1–8 (2013)

    Article  MathSciNet  Google Scholar 

  45. Matyas, J.: Random optimization. Autom. Rem. Contr. 26, 246–253 (1965)

    MathSciNet  Google Scholar 

  46. Ahandani, M.A., Alavi-Rad, H.: Opposition-based learning in the shuffled differential evolution algorithm. Soft. Comput. 16, 1303–1337 (2012)

    Article  Google Scholar 

  47. Choi, J.J., Oh, S., Marks, R.J.: Training layered perceptrons using low accuracy computation. In: Proceedings of the IEEE international joint conference on neural networks. 554–559 (1991)

  48. Vakil Baghmisheh, M.T., Ahandani, M.A., Talebi, M.: Frequency modulation sound parameter identification using novel hybrid evolutionary algorithms. In: Internatioal symposium on telecommunications, Tehran, Iran, pp. 67–72 (2008)

  49. Huang, Y., McColl, W.F.: An improved simplex method for function optimization. In: Proceedings of IEEE international conference on systems, man and cybernetics. vol. 3, pp. 1702–1705 (1996)

  50. Lee, M.H., Han, C.H., Chang, K.S.: Dynamic optimization of a continuous polymer reactor using a modified differential evolution algorithm. Ind. Eng. Chem. Res. 38, 4825–4831 (1999)

    Article  Google Scholar 

  51. Neri, F., Tirronen, V.: Recent advances in differential evolution: a review and experimental analysis. Artif. Intell. Rev. 33, 61–106 (2010)

    Article  Google Scholar 

  52. Mininno, E., Neri, F., Cupertino, F., Naso, D.: Compact differential evolution. IEEE. T. Evolut. Comput. 15, 32–54 (2011)

    Article  Google Scholar 

  53. Neri, F., Mininno, E.: Memetic compact differential evolution for cartesian robot control. IEEE. Comput. Intell. Mag. 5, 54–65 (2010)

    Article  Google Scholar 

  54. Ahandani, M.A., Shirjoposht, N.P., Banimahd, R.: Three modified versions of differential evolution algorithm for continuous optimization. Soft. Comput. 15, 803–830 (2010)

    Article  Google Scholar 

  55. Suganthan, P.N., Hansen, N., Liang, J.J., Deb, K., Chen, Y.-P., Auger, A., Tiwari, S.: Problem definitions and evaluation criteria for the CEC 2005 special session on real-parameter optimization. Technical Report Report #2005005, Nanyang Technological University, Singapore and IIT Kanpur, India (2005). http://www.ntu.edu.sg/home/EPNSugan/

  56. Hansen, N.: Compilation of results on the CEC benchmark function set (2005). http://www.ntu.edu.sg/home/epnsugan/index_files/CEC05/compareresults.pdf

  57. Garcia, S., Molina, D., Lozano, M., Herrera, F.: 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, 617–644 (2009)

    Article  MATH  Google Scholar 

  58. Caponio, A., Cascella, G.L., Neri, F., Salvatore, N., Sumner, M.: A fast adaptive memetic algorithm for on-line and off-line control design of PMSM drives. IEEE. T. Sys. Man. Cy. B. 37, 28–41 (2007)

    Article  Google Scholar 

  59. Neri, F., Toivanen, J., Makinen, R.A.E.: An adaptive evolutionary algorithm with intelligent mutation local searchers for designing multidrug therapies for HIV. Appl. Intell. 27, 219–235 (2007)

    Article  Google Scholar 

  60. Neri, F., Toivanen, J., Cascella, G.L., Ong, Y.S.: An adaptive multimeme algorithm for designing HIV multidrug therapies. IEEE/ACM. T. Comput. Biol. Bioinform. 4, 264–278 (2007)

    Article  Google Scholar 

  61. Neri, F., Kotilainen, N., Vapa, M.: An adaptive global-local memetic algorithm to discover resources in p2p networks. In: Proceedings of the 2007 EvoWorkshops Applications of Evolutionary Computing, Lectures Notes in Computer Science, Springer, Berlin, Germany, pp. 61–70 (2007)

  62. Tirronen, V., Neri, F., Karkkainen, T., Majava, K., Rossi, T.: A memetic differential evolution in filter design for defect detection in paper production. Proceedings of the 2007 EvoWorkshops Applications of Evolutionary Computing, Lectures Notes in Computer Science, Springer, Berlin, Germany, pp. 320–329 (2007)

  63. Neri, F., Tirronen, V., Karkkainen, T., Rossi, T.: Fitness diversity based adaptation in multimeme algorithms: a comparative study. In: Proceedings of the IEEE Congress on evolutionary computation, CEC 2007, Singapore, pp. 2374–2381 (2007)

  64. Zhang, J., Chen, W.-N., Zhan, Z.-H., Yu, W.-J., Li, Y.-L., Chen, N., Zhou, Q.: A survey on algorithm adaptation in evolutionary computation. Front. Electr. Electron. Eng. 7, 16–31 (2012)

    Google Scholar 

  65. Bui, L.T., Shan, Y., Qi, F., Abbass, H.A.: Comparing two versions of differential evolution in real parameter optimization. In: Proceedings of the 2005 IEEE congress on evolutionary computation CEC2005, Edinburgh, UK (2005)

  66. Brest, J., Greiner, S., Boskovic, B., Mernik, M., Zumer, V.: Self-adapting control parameters in differential evolution: a comparative study on numerical benchmark problems. IEEE. T. Evolut. Comput. 10, 646–657 (2006)

    Article  Google Scholar 

  67. Garcia-Martinez, C., Lozano, M.: Hybrid real-coded genetic algorithms with female and male differentiation. In: Proceedings of the 2005 IEEE congress on evolutionary computation CEC2005, Edinburgh, UK, pp. 896–903 (2005)

  68. Alonso, S., Jimenez, J., Carmona, H., Galvan, B., Winter, G.: Performance of a flexible evolutionary algorithm. In: Proceedings of the 2005 IEEE congress on evolutionary computation CEC2005, Edinburgh, UK (2005)

  69. Auger, A., Kern, S., Hansen, N.: A restart CMA evolution strategy with increasing population size. In: Proceedings of the 2005 IEEE congress on evolutionary computation CEC2005, Edinburgh, UK (2005)

  70. Becker, W., Yu, X., Tu, J.: EvLib: A parameterless self-adaptive real-valued optimisation Library. In: Proceedings of the 2005 IEEE congress on evolutionary computation CEC2005, Edinburgh, UK (2005)

  71. Molina, D., Herrera, F., Lozano, M.: Adaptive local search parameters for real-coded memetic algorithms. In: Proceedings of the 2005 IEEE congress on evolutionary computation CEC2005, Edinburgh, UK (2005)

Download references

Author information

Authors and Affiliations

  1. Young Researchers Club, Islamic Azad University, Langaroud Branch, Langarud, Iran

    Morteza Alinia Ahandani

  2. Department of Electrical Engineering, Islamic Azad University, Langaroud Branch, Langarud, Iran

    Morteza Alinia Ahandani

  3. Research Lab of Intelligent Systems, Faculty of Electrical & Computer Engineering, University of Tabriz, Tabriz, Iran

    Mohammad-Taghi Vakil-Baghmisheh & Mohammad Talebi

Authors
  1. Morteza Alinia Ahandani
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Mohammad-Taghi Vakil-Baghmisheh
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Mohammad Talebi
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Morteza Alinia Ahandani.

Electronic supplementary material

Below is the link to the electronic supplementary material.

Supplementary material 1 (pdf 73 KB)

Rights and permissions

Reprints and permissions

About this article

Cite this article

Ahandani, M.A., Vakil-Baghmisheh, MT. & Talebi, M. Hybridizing local search algorithms for global optimization. Comput Optim Appl 59, 725–748 (2014). https://doi.org/10.1007/s10589-014-9652-1

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10589-014-9652-1

Keywords

Search

Navigation