Skip to main content
Log in

A novel global harmony search algorithm for solving numerical optimizations

  • Methodologies and Application
  • Published:
Soft Computing Aims and scope Submit manuscript

Abstract

Harmony search (HS) is a type of population-based optimization algorithm that is introduced based on the idea of musical instruments being tuned to obtain the best harmony state. Several versions of HS have been presented, with global harmony search (GHS) considered one of the most popular. Although GHS is efficient in solving various optimization problems, a new position updating mechanism has been added to improve its efficiency and help it avoid getting stuck in local minima. The novel algorithm proposed in this paper is called the intersect mutation global harmony search algorithm (IMGHSA), which has been tested and evaluated on a set of well-known benchmark functions. The IMGHSA is compared with several improved variants of the HS algorithm, such as the basic version of harmony search (HS), improved differential harmony search, generalized opposition-based learning with global harmony search , and novel global harmony search. The experimental results show that the proposed IMGHSA performs better than the state-of-the-art HS variants and has a more robust convergence when optimizing objective functions in terms of the solution accuracy and efficiency.

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

Access this article

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

Instant access to the full article PDF.

Fig. 1
Fig. 2

Similar content being viewed by others

Abbreviations

BW:

Bandwidth vector

GHS:

Global-based harmony search

GOGHS:

Generalized opposition-based learning with global harmony search

HMCR:

Harmony memory consideration rate

\(\mathrm{HMCR}_{\mathrm{min}}\) :

Minimum harmony memory consideration rate

\(\mathrm{HMR}_{\mathrm{max}}\) :

Maximum harmony memory consideration rate

HMS:

Harmony memory size

HS:

Harmony search

IDHS:

Improved differential harmony search

IMGHSA:

Intersect mutation global harmony search algorithm

LB:

Lower bound of optimization problem

NGHS:

Novel global harmony search

NI:

Maximum number of iteration

NV:

The number of decision variables

\(\mathrm{OF}^{\mathrm{new}}\) :

Fitness of new vector

\(\mathrm{OF}^{\mathrm{worst}}\) :

Fitness of the worst vector

PAR:

Pitch adjusting rate

\(\mathrm{PAR}_{\mathrm{max}}\) :

Maximum pitch adjusting rate

\(\mathrm{PAR}_{\mathrm{min}}\) :

Minimum pitch adjusting rate

Pm:

Genetic mutation probability

r1, r2:

a random number between 0 and 1

UB:

Upper bound of optimization problem

\(x^{\mathrm{new}}\) :

A new harmony vector

\(x^{}\) :

Harmony vector

References

Download references

Funding

There is no funding source.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Jafar Gholami.

Ethics declarations

Conflict of interest

The authors declare that they have no conflict of interest.

Additional information

Communicated by V. Loia.

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Gholami, J., Ghany, K.K.A. & Zawbaa, H.M. A novel global harmony search algorithm for solving numerical optimizations. Soft Comput 25, 2837–2849 (2021). https://doi.org/10.1007/s00500-020-05341-5

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00500-020-05341-5

Keywords

Navigation