Analysis of Different Approaches to Designing the Parallel Harmony Search Algorithm for ATSP

  • Krzysztof SzwarcEmail author
  • Urszula Boryczka
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 11432)


This article proposes three approaches to designing the Parallel Harmony Search Algorithm, adjusted to effectively solve the Asymmetric Traveling Salesman Problem. The paper contains a comparative study of the developed models, based on 19 varied instances of the problem, as well as recommendations concerning their appropriate configuration. The quality of developed models was assessed through determination of the percentage difference between the surplus of the values of objective function of solutions and the values describing the sequential algorithm variant. Each of the examined Parallel Harmony Search variants created better results than the sequential Harmony Search algorithm.


Parallel Harmony Search Harmony Search Asymmetric Traveling Salesman Problem 


  1. 1.
    Ayob, M., Hadwan, M., Ahmad Nazri, M.Z., Ahmad, Z.: Enhanced harmony search algorithm for nurse rostering problems. J. Appl. Sci. 13(6), 846–853 (2013)CrossRefGoogle Scholar
  2. 2.
    Bashiri-Atrabi, H., Qaderi, K., Rheinheimer, D., Sharifi, E.: Application of harmony search algorithm to reservoir operation optimization. Water Resour. Manage. 29(15), 5729–5748 (2015)CrossRefGoogle Scholar
  3. 3.
    Boryczka, U., Szwarc, K.: The adaptation of the harmony search algorithm to the ATSP. In: Nguyen, N.T., Hoang, D.H., Hong, T.-P., Pham, H., Trawiński, B. (eds.) ACIIDS 2018. LNCS (LNAI), vol. 10751, pp. 341–351. Springer, Cham (2018). Scholar
  4. 4.
    Boryczka, U., Szwarc, K.: The Adaptation of the Harmony Search Algorithm to the ATSP with the evaluation of the influence of the pitch adjustment place on the quality of results. J. Inf. Telecommun. 3, 2–18 (2018)Google Scholar
  5. 5.
    Ceylan O., Liu, G., Tomsovic, K.: Parallel harmony search based distributed energy resource optimization. In: 2015 18th International Conference on ISAP, pp. 1–6 (2015)Google Scholar
  6. 6.
    Geem, Z.W.: Optimal design of water distribution networks using harmony search. Ph.D. thesis, Korea University (2000)Google Scholar
  7. 7.
    Hong, A., Jung, D., Choi, J., Kim, J.H.: Sensitivity analysis on migration parameters of parallel harmony search. In: Del Ser, J. (ed.) ICHSA 2017. AISC, vol. 514, pp. 3–7. Springer, Singapore (2017). Scholar
  8. 8.
    Komaki, M., Sheikh, S., Teymourian, E.: A Hybrid Harmony Search algorithm to minimize total weighted tardiness in the permutation flow shop. In: CIPLS, pp. 1-8 (2014)Google Scholar
  9. 9.
    Osaba, E., Diaz, F., Onieva, E., Carballedo, R., Perallos, A.: A population metaheuristic with adaptive crossover probability and multi-crossover mechanism for solving combinatorial optimization problems. IJAI 12, 1–23 (2014)Google Scholar
  10. 10.
    Öncan, T., Altınel, I.K., Laporte, G.: A comparative analysis of several asymmetric traveling salesman problem formulations. Comput. Oper. Res. 36(3), 637–654 (2009)MathSciNetCrossRefGoogle Scholar
  11. 11.
    Peraza, C., Valdez, F., Garcia, M., Melin, P., Castillo, O.: A new fuzzy harmony search algorithm using fuzzy logic for dynamic parameter adaptation. Algorithms 9(4), 69 (2016)MathSciNetCrossRefGoogle Scholar
  12. 12.
    Peraza, C., Valdez, F., Melin, P.: Optimization of intelligent controllers using a Type-1 and interval Type-2 fuzzy harmony search algorithm. Algorithms 10, 82 (2017)MathSciNetCrossRefGoogle Scholar
  13. 13.
    Peraza, C., Valdez, F., Castro, J.R., Castillo, O.: Fuzzy dynamic parameter adaptation in the harmony search algorithm for the optimization of the ball and beam controller. Adv. Oper. Res. 2018, 16 (2018)Google Scholar
  14. 14.
    Syberfeldt, A., Rogstrom, J., Geertsen, A.: Simulation-based optimization of a real-world travelling salesman problem using an evolutionary algorithm with a repair function. IJAE 6(3), 27–39 (2015)Google Scholar

Copyright information

© Springer Nature Switzerland AG 2019

Authors and Affiliations

  1. 1.Institute of Computer ScienceUniversity of SilesiaSosnowiecPoland

Personalised recommendations