Comparison of Genetic Algorithm and Harmony Search Method for 2D Geometry Optimization.

Ghozi, Mohammad; Budiati, Anik

doi:10.1051/matecconf/201815901009

Cited by 4 publications

(3 citation statements)

References 2 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The length of this array depends on the number of input variables in the given problem. According to the previous comparative studies [6][7][8][9][10], the harmony search algorithm is faster than the genetic algorithms in solving the given problem.…”

Section: The Analytical Comparisonmentioning

confidence: 99%

“…Scholars have conducted comparative studies to estimate the similarities and differences between genetic algorithms and harmony search algorithms in diverse research domains [6][7][8][9][10].…”

Section: Introductionmentioning

confidence: 99%

“…The suggested harmony search algorithm gave superior results to genetic algorithms. Ghozi et al [8] employed the harmony search algorithm and genetic algorithms to solve the geometry optimization problem of a steel structure. The results showed that the harmony search algorithm is 53% faster than genetic algorithms.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Generating of Test Data by Harmony Search Against Genetic Algorithms

Ghiduk¹,

Alharbi²

2023

Intelligent Automation &Amp; Soft Computing

View full text Add to dashboard Cite

Many search-based algorithms have been successfully applied in several software engineering activities. Genetic algorithms (GAs) are the most used in the scientific domains by scholars to solve software testing problems. They imitate the theory of natural selection and evolution. The harmony search algorithm (HSA) is one of the most recent search algorithms in the last years. It imitates the behavior of a musician to find the best harmony. Scholars have estimated the similarities and the differences between genetic algorithms and the harmony search algorithm in diverse research domains. The test data generation process represents a critical task in software validation. Unfortunately, there is no work comparing the performance of genetic algorithms and the harmony search algorithm in the test data generation process. This paper studies the similarities and the differences between genetic algorithms and the harmony search algorithm based on the ability and speed of finding the required test data. The current research performs an empirical comparison of the HSA and the GAs, and then the significance of the results is estimated using the t-Test. The study investigates the efficiency of the harmony search algorithm and the genetic algorithms according to (1) the time performance, (2) the significance of the generated test data, and (3) the adequacy of the generated test data to satisfy a given testing criterion. The results showed that the harmony search algorithm is significantly faster than the genetic algorithms because the t-Test showed that the p-value of the time values is 0.026 < α (α is the significance level = 0.05 at 95% confidence level). In contrast, there is no significant difference between the two algorithms in generating the adequate test data because the t-Test showed that the p-value of the fitness values is 0.25 > α.

show abstract

Section: The Analytical Comparisonmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%