Skip to main content
SpringerLink
Log in

A Comparative Study of Techniques for Avoiding Premature Convergence in Harmony Search Algorithm

  • Conference paper
  • First Online:
Intelligent Information and Database Systems (ACIIDS 2019)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 11432))

Included in the following conference series:

Abstract

The present article summarizes two techniques allowing to avoid premature convergence in Harmony Search algorithm, which was adapted for solving the instances of the Asymmetric Traveling Salesman Problem (ATSP). The efficiency of both approaches was demonstrated on the basis of the results of statistical test and ‘test bed’ consisting of nineteen instances of ATSP. The conclusion was that the best results were obtained in case of applying mechanisms which enable to reset the components of harmony memory at the moment of reaching stagnation. This process is controlled by parameters which are depended on the problem size.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. 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). https://doi.org/10.1007/978-3-319-75417-8_32

    Chapter  Google Scholar 

  2. 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 (2019)

    Google Scholar 

  3. Chen, S., Chen, R., Gao, J.: A modified harmony search algorithm for solving the dynamic vehicle routing problem with time windows. Sci. Program. 2017, 13 (2017)

    Google Scholar 

  4. Geem, Z.W.: Optimal design of water distribution networks using harmony search. Ph.D. thesis, Korea University (2000)

    Google Scholar 

  5. Geem, Z.W., Kim, J.H., Loganathan, G.V.: Harmony search optimization: application to pipe network design. Int. J. Model. Simul. 22(2), 125–133 (2002)

    Article  Google Scholar 

  6. Glover, F.: Future paths for integer programming and links to artificial intelligence. Comput. Oper. Res. 13(5), 533–549 (1986)

    Article  MathSciNet  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  8. Komaki, M., Sheikh, S., Teymourian, E.: A hybrid harmony search algorithm to minimize total weighted tardiness in the permutation flow shop. In: 2014 IEEE Symposium on Computational Intelligence in Production and Logistics Systems (CIPLS), Orlando, FL, pp. 1–8 (2014)

    Google Scholar 

  9. Nowakowski, P., Szwarc, K., Boryczka, U.: Vehicle route planning in e-waste mobile collection on demand supported by artificial intelligence algorithms. Transp. Res. Part D: Transp. Environ. 63, 1–22 (2018)

    Article  Google Scholar 

  10. 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. Int. J. Artif. Intell. 12, 1–23 (2014)

    Google Scholar 

  11. Ö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)

    Article  MathSciNet  Google Scholar 

  12. Rocha, M., Neves, J.: Preventing premature convergence to local optima in genetic algorithms via random offspring generation. In: Imam, I., Kodratoff, Y., El-Dessouki, A., Ali, M. (eds.) IEA/AIE 1999. LNCS (LNAI), vol. 1611, pp. 127–136. Springer, Heidelberg (1999). https://doi.org/10.1007/978-3-540-48765-4_16

    Chapter  Google Scholar 

  13. Syberfeldt, A., Rogstrom, J., Geertsen, A.: Simulation-based optimization of a real-world travelling salesman problem using an evolutionary algorithm with a repair function. Int. J. Artif. Intell. Expert Syst. (IJAE) 6(3), 27–39 (2015)

    Google Scholar 

  14. Zou, D., Gao, L., Li, S., Wu, J.: Solving 0–1 knapsack problem by a novel global harmony search algorithm. Appl. Soft Comput. 11(2), 1556–1564 (2011)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Computer Science, University of Silesia, ul. Bedzinska 39, 41-200, Sosnowiec, Poland

    Krzysztof Szwarc & Urszula Boryczka

Authors
  1. Krzysztof Szwarc
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Urszula Boryczka
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Krzysztof Szwarc .

Editor information

Editors and Affiliations

  1. Ton Duc Thang University, Ho Chi Minh City, Vietnam

    Ngoc Thanh Nguyen

  2. Bina Nusantara University, Jakarta, Indonesia

    Ford Lumban Gaol

  3. National University of Kaohsiung, Kaohsiung, Taiwan

    Tzung-Pei Hong

  4. Wrocław University of Science and Technology, Wrocław, Poland

    Bogdan Trawiński

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Szwarc, K., Boryczka, U. (2019). A Comparative Study of Techniques for Avoiding Premature Convergence in Harmony Search Algorithm. In: Nguyen, N., Gaol, F., Hong, TP., Trawiński, B. (eds) Intelligent Information and Database Systems. ACIIDS 2019. Lecture Notes in Computer Science(), vol 11432. Springer, Cham. https://doi.org/10.1007/978-3-030-14802-7_18

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-14802-7_18

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-14801-0

  • Online ISBN: 978-3-030-14802-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation