Advertisement

Journal of Intelligent Manufacturing

, Volume 30, Issue 1, pp 405–428 | Cite as

Parallel chaotic local search enhanced harmony search algorithm for engineering design optimization

  • Jin Yi
  • Xinyu LiEmail author
  • Chih-Hsing Chu
  • Liang Gao
Article

Abstract

In this paper, we present a parallel chaotic local search enhanced harmony search algorithm (MHS–PCLS) for solving engineering design optimization problems. The concept of chaos has been previously successfully applied in metaheuristics. However, chaos sequences are sensitive to their initial conditions and cause unstable performance in algorithms. The proposed parallel chaotic local search method searches from several different initial points and diminishes the sensitivity of the initial condition, thereby increasing the robustness of the harmony search method. Numerical benchmark problems are tested to validate the effectiveness of MHS–PCLS. The simulation results confirm that MHS–PCLS obtains superior results for mathematical examples compared to other harmony search variants. Several well-known constrained engineering design problems are also tested using the new approach. The computational results demonstrate that the proposed MHS–PCLS algorithm requires a smaller number of function evaluations and in the majority of cases delivers improved and more robust results compare to other algorithms.

Keywords

Harmony search Parallel chaotic local search Intersect mutation operator Engineering design optimization 

Notes

Acknowledgments

The authors would like to thank the cloud system in HUST for providing us the computing services. This research work is supported by the National Natural Science Foundation of China (NSFC) under Grant Nos. 51435009, 61232008 and 51421062, and Youth Science & Technology Chenguang Program of Wuhan under Grant no. 2015070404010187.

References

  1. Abedinpourshotorban, H., Hasan, S., Shamsuddin, S. M., & As’ Sahra, N. F. (2016). A differential-based harmony search algorithm for the optimization of continuous problems. Expert Systems with Applications, 62, 317–332Google Scholar
  2. Akay, B., & Karaboga, D. (2012). Artificial bee colony algorithm for large-scale problems and engineering design optimization. Journal of Intelligent Manufacturing, 23(4), 1001–1014.Google Scholar
  3. Alatas, B. (2010). Chaotic bee colony algorithms for global numerical optimization. Expert Systems with Applications, 37(8), 5682–5687.Google Scholar
  4. Al-Betar, M. A., Awadallah, M. A., Khader, A. T., & Abdalkareem, Z. A. (2015). Island-based harmony search for optimization problems. Expert Systems with Applications, 42(4), 2026–2035.Google Scholar
  5. Al-Betar, M. A., Doush, I. A., Khader, A. T., & Awadallah, M. A. (2012). Novel selection schemes for harmony search. Applied Mathematics and Computation, 218(10), 6095–6117.Google Scholar
  6. Al-Betar, M. A., Khader, A. T., Geem, Z. W., Doush, I. A., & Awadallah, M. A. (2013). An analysis of selection methods in memory consideration for harmony search. Applied Mathematics and Computation, 219(22), 10753–10767.Google Scholar
  7. Arora, J. (2004). Introduction to optimum design. New York: Academic Press.Google Scholar
  8. Askarzadeh, A., & Zebarjadi, M. (2014). Wind power modeling using harmony search with a novel parameter setting approach. Journal of Wind Engineering and Industrial Aerodynamics, 135, 70–75.Google Scholar
  9. Baykasoglu, A. (2012). Design optimization with chaos embedded great deluge algorithm. Applied Soft Computing, 12(3), 1055–1067.Google Scholar
  10. Baykasoğlu, A., & Ozsoydan, F. B. (2015). Adaptive firefly algorithm with chaos for mechanical design optimization problems. Applied Soft Computing, 36, 152–164.Google Scholar
  11. Brajevic, I., & Tuba, M. (2013). An upgraded artificial bee colony (abc) algorithm for constrained optimization problems. Journal of Intelligent Manufacturing, 24(4), 729–740.Google Scholar
  12. Castelli, M., Silva, S., Manzoni, L., & Vanneschi, L. (2014). Geometric selective harmony search. Information Sciences, 279, 468–482.Google Scholar
  13. Coello, C. A. C. (2000). Use of a self-adaptive penalty approach for engineering optimization problems. Computers in Industry, 41(2), 113–127.Google Scholar
  14. Coello, C. A. C., & Montes, E. M. (2002). Constraint-handling in genetic algorithms through the use of dominance-based tournament selection. Advanced Engineering Informatics, 16(3), 193–203.Google Scholar
  15. Cuevas, E., & Cienfuegos, M. (2014). A new algorithm inspired in the behavior of the social-spider for constrained optimization. Expert Systems with Applications, 41(2), 412–425.Google Scholar
  16. Das, S., Mukhopadhyay, A., Roy, A., Abraham, A., & Panigrahi, B. K. (2011). Exploratory power of the harmony search algorithm: Analysis and improvements for global numerical optimization. IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics, 41(1), 89–106.Google Scholar
  17. Das, S., & Suganthan, P. N. (2011). Differential evolution: A survey of the state-of-the-art. IEEE Transactions on Evolutionary Computation, 15(1), 4–31.Google Scholar
  18. Deb, K. (2000). An efficient constraint handling method for genetic algorithms. Computer Methods in Applied Mechanics and Engineering, 186(2), 311–338.Google Scholar
  19. Dorigo, M., Birattari, M., & Stützle, T. (2006). Ant colony optimization. IEEE Computational Intelligence Magazine, 1(4), 28–39.Google Scholar
  20. Eberhart, R. C., Kennedy, J., et al. (1995). A new optimizer using particle swarm theory. In Proceedings of the sixth international symposium on micro machine and human science, New York, NY (Vol. 1, pp. 39–43).Google Scholar
  21. Enayatifar, R., Yousefi, M., Abdullah, A. H., & Darus, A. N. (2013). Lahs: A novel harmony search algorithm based on learning automata. Communications in Nonlinear Science and Numerical Simulation, 18(12), 3481–3497.Google Scholar
  22. Gandomi, A. H., Yang, X. S., & Alavi, A. H. (2011). Mixed variable structural optimization using firefly algorithm. Computers & Structures, 89(23), 2325–2336.Google Scholar
  23. Gandomi, A. H., Yang, X. S., & Alavi, A. H. (2013a). Cuckoo search algorithm: A metaheuristic approach to solve structural optimization problems. Engineering with Computers, 29(1), 17–35.Google Scholar
  24. Gandomi, A., Yang, X. S., Talatahari, S., & Alavi, A. (2013b). Firefly algorithm with chaos. Communications in Nonlinear Science and Numerical Simulation, 18(1), 89–98.Google Scholar
  25. Gandomi, A. H., Yun, G. J., Yang, X. S., & Talatahari, S. (2013c). Chaos-enhanced accelerated particle swarm optimization. Communications in Nonlinear Science and Numerical Simulation, 18(2), 327–340.Google Scholar
  26. Gao, W. F., Liu, S. Y., & Huang, L. L. (2012). Particle swarm optimization with chaotic opposition-based population initialization and stochastic search technique. Communications in Nonlinear Science and Numerical Simulation, 17(11), 4316–4327.Google Scholar
  27. Gao, L. Q., Li, S., Kong, X., & Zou, D. X. (2014a). On the iterative convergence of harmony search algorithm and a proposed modification. Applied Mathematics and Computation, 247, 1064–1095.Google Scholar
  28. Gao, K., Suganthan, P. N., Pan, Q. K., Chua, T. J., Cai, T. X., & Chong, C. (2014b). Pareto-based grouping discrete harmony search algorithm for multi-objective flexible job shop scheduling. Information Sciences, 289, 76–90.Google Scholar
  29. García-Torres, J. M., Damas, S., Cordón, O., & Santamaría, J. (2014). A case study of innovative population-based algorithms in 3d modeling: Artificial bee colony, biogeography-based optimization, harmony search. Expert Systems with Applications, 41(4), 1750–1762.Google Scholar
  30. Geem, Z. W., Kim, J. H., & Loganathan, G. (2001). A new heuristic optimization algorithm: Harmony search. Simulation, 76(2), 60–68.Google Scholar
  31. Gu, L., Yang, R., Tho, C., Makowskit, M., Faruquet, O., Li, Y., et al. (2001). Optimisation and robustness for crashworthiness of side impact. International Journal of Vehicle Design, 26(4), 348–360.Google Scholar
  32. He, Q., & Wang, L. (2007a). An effective co-evolutionary particle swarm optimization for constrained engineering design problems. Engineering Applications of Artificial Intelligence, 20(1), 89–99.Google Scholar
  33. He, Q., & Wang, L. (2007b). A hybrid particle swarm optimization with a feasibility-based rule for constrained optimization. Applied Mathematics and Computation, 186(2), 1407–1422.Google Scholar
  34. Hosseini, S. D., Shirazi, M. A., & Ghomi, S. M. T. F. (2014). Harmony search optimization algorithm for a novel transportation problem in a consolidation network. Engineering Optimization, 46(11), 1538–1552.Google Scholar
  35. Huang, F. Z., Wang, L., & He, Q. (2007). An effective co-evolutionary differential evolution for constrained optimization. Applied Mathematics and computation, 186(1), 340–356.Google Scholar
  36. Jaberipour, M., & Khorram, E. (2010). Two improved harmony search algorithms for solving engineering optimization problems. Communications in Nonlinear Science and Numerical Simulation, 15(11), 3316–3331.Google Scholar
  37. Jia, D., Zheng, G., & Khan, M. K. (2011). An effective memetic differential evolution algorithm based on chaotic local search. Information Sciences, 181(15), 3175–3187.Google Scholar
  38. Jordehi, A. R. (2015). Chaotic bat swarm optimisation (cbso). Applied Soft Computing, 26, 523–530.Google Scholar
  39. Kannan, B., & Kramer, S. N. (1994). An augmented lagrange multiplier based method for mixed integer discrete continuous optimization and its applications to mechanical design. Journal of Mechanical Design, 116(2), 405–411.Google Scholar
  40. Karaboga, D., & Basturk, B. (2007). A powerful and efficient algorithm for numerical function optimization: Artificial bee colony (abc) algorithm. Journal of Global Optimization, 39(3), 459–471.Google Scholar
  41. Kaveh, A. (2014). Chaos embedded metaheuristic algorithms. In Advances in metaheuristic algorithms for optimal design of structures (pp. 369–391). Cham, Switzerland: Springer.Google Scholar
  42. Koceski, S., Panov, S., Koceska, N., Zobel, P. B., & Durante, F. (2014). A novel quad harmony search algorithm for grid-based path finding. International Journal of Advanced Robotic Systems, 11, 144–155.Google Scholar
  43. Kramer, O. (2010). A review of constraint-handling techniques for evolution strategies. Applied Computational Intelligence and Soft Computing, 2010, 1–11.Google Scholar
  44. Kundu, S., & Parhi, D. R. (2016). Navigation of underwater robot based on dynamically adaptive harmony search algorithm. Memetic Computing, 8(2), 125–146.Google Scholar
  45. Li, X., Qin, K., Zeng, B., Gao, L., & Su, J. (2016). Assembly sequence planning based on an improved harmony search algorithm. The International Journal of Advanced Manufacturing Technology 84(9), 2367–2380.Google Scholar
  46. Long, W., Liang, X., Huang, Y., & Chen, Y. (2014). An effective hybrid cuckoo search algorithm for constrained global optimization. Neural Computing and Applications, 25(3–4), 911–926.Google Scholar
  47. Mahdavi, M., Fesanghary, M., & Damangir, E. (2007). An improved harmony search algorithm for solving optimization problems. Applied Mathematics and Computation, 188(2), 1567–1579.Google Scholar
  48. Maleki, A., & Pourfayaz, F. (2015). Sizing of stand-alone photovoltaic/wind/diesel system with battery and fuel cell storage devices by harmony search algorithm. Journal of Energy Storage, 2, 30–42.Google Scholar
  49. Manjarres, D., Landa-Torres, I., Gil-Lopez, S., Del Ser, J., Bilbao, M. N., Salcedo-Sanz, S., et al. (2013). A survey on applications of the harmony search algorithm. Engineering Applications of Artificial Intelligence, 26(8), 1818–1831.Google Scholar
  50. Mezura-Montes, E., & Coello, C. A. C. (2011). Constraint-handling in nature-inspired numerical optimization: Past, present and future. Swarm and Evolutionary Computation, 1(4), 173–194.Google Scholar
  51. Mohamed, A. W., & Sabry, H. Z. (2012). Constrained optimization based on modified differential evolution algorithm. Information Sciences, 194, 171–208.Google Scholar
  52. Moraglio, A., Togelius, J., & Silva, S. (2013). Geometric differential evolution for combinatorial and programs spaces. Evolutionary Computation, 21(4), 591–624.Google Scholar
  53. Omran, M. G., & Mahdavi, M. (2008). Global-best harmony search. Applied Mathematics and Computation, 198(2), 643–656.Google Scholar
  54. Pan, Q. K., Suganthan, P. N., Tasgetiren, M. F., & Liang, J. J. (2010). A self-adaptive global best harmony search algorithm for continuous optimization problems. Applied Mathematics and Computation, 216(3), 830–848.Google Scholar
  55. Pearl, R., & Reed, L. J. (1920). On the rate of growth of the population of the united states since 1790 and its mathematical representation. Proceedings of the National Academy of Sciences, 6(6), 275–288.Google Scholar
  56. Phatak, S., & Rao, S. S. (1995). Logistic map: A possible random-number generator. Physical Review E, 51(4), 3670.Google Scholar
  57. Rao, R. V., Savsani, V. J., & Vakharia, D. (2011). Teaching-learning-based optimization: A novel method for constrained mechanical design optimization problems. Computer-Aided Design, 43(3), 303–315.Google Scholar
  58. Sadollah, A., Bahreininejad, A., Eskandar, H., & Hamdi, M. (2013). Mine blast algorithm: A new population based algorithm for solving constrained engineering optimization problems. Applied Soft Computing, 13(5), 2592–2612.Google Scholar
  59. Sarvari, H., & Zamanifar, K. (2012). Improvement of harmony search algorithm by using statistical analysis. Artificial Intelligence Review, 37(3), 181–215.Google Scholar
  60. Schuster, H. G., & Just, W. (2006). Deterministic chaos: An introduction. New York: Wiley.Google Scholar
  61. Simon, D. (2008). Biogeography-based optimization. IEEE Transactions on Evolutionary Computation, 12(6), 702–713.Google Scholar
  62. Sivaraj, R., & Ravichandran, T. (2011). A review of selection methods in genetic algorithm. International Journal of Engineering Science and Technology, 1(3), 3792–3797.Google Scholar
  63. Talatahari, S., Azar, B. F., Sheikholeslami, R., & Gandomi, A. (2012). Imperialist competitive algorithm combined with chaos for global optimization. Communications in Nonlinear Science and Numerical Simulation, 17(3), 1312–1319.Google Scholar
  64. Wang, Y., & Yao, M. (2009). A new hybrid genetic algorithm based on chaos and pso. In IEEE International conference on intelligent computing and intelligent systems, 2009. ICIS 2009. IEEE (Vol. 1, pp. 699–703).Google Scholar
  65. Wang, G. G., Guo, L., Gandomi, A. H., Hao, G. S., & Wang, H. (2014). Chaotic krill herd algorithm. Information Sciences, 274, 17–34.Google Scholar
  66. Yang, X. S., & Deb, S., (2009). Cuckoo search via lévy flights. In World congress on nature and biologically inspired computing 2009. NaBIC 2009. IEEE (pp. 210–214).Google Scholar
  67. Yang, X. S. (2010). Nature-inspired metaheuristic algorithms. Beckington: Luniver press.Google Scholar
  68. Yang, D., Liu, Z., & Zhou, J. (2014). Chaos optimization algorithms based on chaotic maps with different probability distribution and search speed for global optimization. Communications in Nonlinear Science and Numerical Simulation, 19(4), 1229–1246.Google Scholar
  69. Yassen, E. T., Ayob, M., Nazri, M. Z. A., & Sabar, N. R. (2015). Meta-harmony search algorithm for the vehicle routing problem with time windows. Information Sciences, 325, 140–158.Google Scholar
  70. Yi, J., Gao, L., Li, X., & Gao, J. (2016a). An efficient modified harmony search algorithm with intersect mutation operator and cellular local search for continuous function optimization problems. Applied Intelligence, 44(3), 725–753.Google Scholar
  71. Yi, J., Li, X., Xiao, M., Xu, J., & Zhang, L. (2016b). Construction of nested maximin designs based on successive local enumeration and modified novel global harmony search algorithm. Engineering Optimization, 1–20.Google Scholar
  72. Yuan, X., Zhao, J., Yang, Y., & Wang, Y. (2014). Hybrid parallel chaos optimization algorithm with harmony search algorithm. Applied Soft Computing, 17, 12–22.Google Scholar
  73. Zahara, E., & Kao, Y. T. (2009). Hybrid nelder-mead simplex search and particle swarm optimization for constrained engineering design problems. Expert Systems with Applications, 36(2), 3880–3886.Google Scholar
  74. Zarei, O., Fesanghary, M., Farshi, B., Saffar, R. J., & Razfar, M. (2009). Optimization of multi-pass face-milling via harmony search algorithm. Journal of Materials Processing Technology, 209(5), 2386–2392.Google Scholar
  75. Zeng, B., & Dong, Y. (2016). An improved harmony search based energy-efficient routing algorithm for wireless sensor networks. Applied Soft Computing, 41, 135–147.Google Scholar
  76. Zhao, F., Liu, Y., Zhang, C., & Wang, J. (2015). A self-adaptive harmony pso search algorithm and its performance analysis. Expert Systems with Applications, 42(21), 7436–7455.Google Scholar
  77. Zheng, Y. J., Zhang, M. X., & Zhang, B. (2016). Biogeographic harmony search for emergency air transportation. Soft Computing, 20(3), 967–977.Google Scholar
  78. Zhou, Y. (2015). Analysis, improvement and application of differential evolution (Unpublished doctoral dissertation). China: Huazhong University of Science and Technology.Google Scholar

Copyright information

© Springer Science+Business Media New York 2016

Authors and Affiliations

  1. 1.The State Key Laboratory of Digital Manufacturing Equipment and Technology, School of Mechanical Science and TechnologyHuazhong University of Science and TechnologyWuhanPeople’s Republic of China
  2. 2.Department of Industrial Engineering and Engineering ManagementNational Tsing-Hua UniversityHsinchuTaiwan

Personalised recommendations