Next Article in Journal
FCNS: A Fuzzy Routing-Forwarding Algorithm Exploiting Comprehensive Node Similarity in Opportunistic Social Networks
Previous Article in Journal
Steganalysis of Inactive Voice-Over-IP Frames Based on Poker Test
Previous Article in Special Issue
Detectability Improved Tamper Detection Scheme for Absolute Moment Block Truncation Coding Compressed Images
Article Menu

Article Versions

Export Article

Open AccessArticle
Symmetry 2018, 10(8), 337; https://doi.org/10.3390/sym10080337

A Dynamic Adjusting Novel Global Harmony Search for Continuous Optimization Problems

1
Industrial Engineering and Management, National Taipei University of Technology, Taipei 10632, Taiwan
2
College of Management, National Taipei University of Technology, Taipei 10632, Taiwan
3
Department of Computer Science, Concordia University Chicago, Chicago, IL 60305, USA
*
Author to whom correspondence should be addressed.
Received: 10 July 2018 / Revised: 6 August 2018 / Accepted: 8 August 2018 / Published: 12 August 2018
(This article belongs to the Special Issue Information Technology and Its Applications 2018)
Download PDF [3575 KB, uploaded 12 August 2018]

Abstract

A novel global harmony search (NGHS) algorithm, as proposed in 2010, is an improved algorithm that combines the harmony search (HS), particle swarm optimization (PSO), and a genetic algorithm (GA). Moreover, the fixed parameter of mutation probability was used in the NGHS algorithm. However, appropriate parameters can enhance the searching ability of a metaheuristic algorithm, and their importance has been described in many studies. Inspired by the adjustment strategy of the improved harmony search (IHS) algorithm, a dynamic adjusting novel global harmony search (DANGHS) algorithm, which combines NGHS and dynamic adjustment strategies for genetic mutation probability, is introduced in this paper. Moreover, extensive computational experiments and comparisons are carried out for 14 benchmark continuous optimization problems. The results show that the proposed DANGHS algorithm has better performance in comparison with other HS algorithms in most problems. In addition, the proposed algorithm is more efficient than previous methods. Finally, different strategies are suitable for different situations. Among these strategies, the most interesting and exciting strategy is the periodic dynamic adjustment strategy. For a specific problem, the periodic dynamic adjustment strategy could have better performance in comparison with other decreasing or increasing strategies. These results inspire us to further investigate this kind of periodic dynamic adjustment strategy in future experiments.
Keywords: metaheuristic; global optimization; harmony search algorithm; dynamic adjustment strategy metaheuristic; global optimization; harmony search algorithm; dynamic adjustment strategy
This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. (CC BY 4.0).
SciFeed

Share & Cite This Article

MDPI and ACS Style

Chiu, C.-Y.; Shih, P.-C.; Li, X. A Dynamic Adjusting Novel Global Harmony Search for Continuous Optimization Problems. Symmetry 2018, 10, 337.

Show more citation formats Show less citations formats

Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Related Articles

Article Metrics

Article Access Statistics

1

Comments

[Return to top]
Symmetry EISSN 2073-8994 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert
Back to Top