IDEAS home Printed from https://ideas.repec.org/a/eee/apmaco/v266y2015icp1127-1152.html
   My bibliography  Save this article

Harmony Search algorithm: a variant with Self-regulated Fretwidth

Author

Listed:
  • Amaya, Ivan
  • Cruz, Jorge
  • Correa, Rodrigo

Abstract

This article presents a novel modification of the Harmony Search (HS) algorithm that is able to self-tune as the search progress. This adaptive behavior is independent of total iterations. Moreover, it requires less iterations and provides more precision than other variants of HS. Its effectiveness and performance was assessed, comparing our data against four well known and recent modifications of HS: IHS (Improved Harmony Search, 2007), ABHS (Adjustable Bandwidth Harmony Search, 2014), PAHS (Parameter Adaptive Harmony Search, 2014), and IGHS (Intelligent Global Harmony Search, 2014). Unlike other works, we did not analyze the data for a given number of iterations. Instead, we ran each algorithm until it achieved a given level of precision, and analyzed the number of iterations it required. Our test benchmark contained 30 standard test functions distributed like this: 11 unimodal, 8 multimodal with fixed dimensions, and 11 multimodal with variable dimensions. The latter also included a function whose optima was located at a different coordinate in each dimension. The search domain for each function was fixed according to the literature, though we also executed tests regarding the effect of varying it. We carried out a parameter sweep to find adequate values for each parameter of our proposed algorithm, analyzing 100 independent runs for 648 different combinations. Data confirm the implemented procedure outperformed the other variants for problems in 2D and in 5D. Scaling the test functions to 10D, 30D, and 50D reduced the convergence rate of the implemented procedure, but it still outperformed IHS, ABHS, and PAHS. In some cases (e.g. Schwefel function in 30D), the Self-regulated Fretwidth Harmony Search algorithm (SFHS) was found to be the fastest approach. It was also found that IGHS performs well for optimization problems whose optima is located at the same coordinates in all dimensions, but not as well in other scenarios. Our proposed algorithm (SFHS) is not hindered by this. SFHS was able to achieve full convergence for a test function with optima located at different coordinates, even in 50D and while exploring a search domain of [–1250, 1250]. SFHS is able to achieve a more precise solution than HS (several orders of smaller magnitude), and so it stands as a good improvement over HS, as well as over the tested variants (IHS, ABHS, PAHS, IGHS). Still, our proposed method exhibited some limitations, such as requiring more parameters than other variants, being unable to converge 100% of the times for all high dimensional functions, and sometimes needing several iterations to converge. In the first case, we think this allows for more freedom in the evolution of parameters. In the second case, we consider it can be addressed by replicating the self-tuning behavior to the remaining parameters. In the final aspect, we estimate that accelerating the evolution of SFHS could prove a very useful strategy. Regarding other optimization strategies, we ran tests in up to 30 dimensions, and compared our data against the Firefly algorithm. We found that our proposed method retains 100% convergence rate, while the convergence rate of Firefly drops drastically (in some cases), even yielding 0% at 30 dimensions.

Suggested Citation

  • Amaya, Ivan & Cruz, Jorge & Correa, Rodrigo, 2015. "Harmony Search algorithm: a variant with Self-regulated Fretwidth," Applied Mathematics and Computation, Elsevier, vol. 266(C), pages 1127-1152.
  • Handle: RePEc:eee:apmaco:v:266:y:2015:i:c:p:1127-1152
    DOI: 10.1016/j.amc.2015.06.040
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0096300315008218
    Download Restriction: Full text for ScienceDirect subscribers only

    File URL: https://libkey.io/10.1016/j.amc.2015.06.040?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Santos Coelho, Leandro dos & de Andrade Bernert, Diego Luis, 2009. "An improved harmony search algorithm for synchronization of discrete-time chaotic systems," Chaos, Solitons & Fractals, Elsevier, vol. 41(5), pages 2526-2532.
    2. Valian, Ehsan & Tavakoli, Saeed & Mohanna, Shahram, 2014. "An intelligent global harmony search approach to continuous optimization problems," Applied Mathematics and Computation, Elsevier, vol. 232(C), pages 670-684.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Josephy Dias Santos & Frederico Marques & Lina Paola Garcés Negrete & Gelson A. Andrêa Brigatto & Jesús M. López-Lezama & Nicolás Muñoz-Galeano, 2022. "A Novel Solution Method for the Distribution Network Reconfiguration Problem Based on a Search Mechanism Enhancement of the Improved Harmony Search Algorithm," Energies, MDPI, vol. 15(6), pages 1-15, March.
    2. Hallaji, Majid & Dideban, Abbas & Khanesar, Mojtaba Ahmadieh & kamyad, Ali vahidyan, 2018. "Optimal synchronization of non-smooth fractional order chaotic systems with uncertainty based on extension of a numerical approach in fractional optimal control problems," Chaos, Solitons & Fractals, Elsevier, vol. 115(C), pages 325-340.
    3. Po-Chou Shih & Chui-Yu Chiu & Chi-Hsun Chou, 2019. "Using Dynamic Adjusting NGHS-ANN for Predicting the Recidivism Rate of Commuted Prisoners," Mathematics, MDPI, vol. 7(12), pages 1-25, December.
    4. Hu, Gang & Du, Bo & Li, Huinan & Wang, Xupeng, 2022. "Quadratic interpolation boosted black widow spider-inspired optimization algorithm with wavelet mutation," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 200(C), pages 428-467.
    5. Bereg, Sergey & Díaz-Báñez, José-Miguel & Kroher, Nadine & Ventura, Inmaculada, 2019. "Computing melodic templates in oral music traditions," Applied Mathematics and Computation, Elsevier, vol. 344, pages 219-229.
    6. Khoroshiltseva, Marina & Slanzi, Debora & Poli, Irene, 2016. "A Pareto-based multi-objective optimization algorithm to design energy-efficient shading devices," Applied Energy, Elsevier, vol. 184(C), pages 1400-1410.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:apmaco:v:266:y:2015:i:c:p:1127-1152. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: https://www.journals.elsevier.com/applied-mathematics-and-computation .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.