Effective and optimized software reliability prediction using Harmony search algorithm
| Autor: | Insha Altaf, Khan Arshid Iqbal, Insha Majeed |
|---|---|
| Rok vydání: | 2016 |
| Předmět: |
Mathematical optimization
021103 operations research Heuristic (computer science) Computer science business.industry 0211 other engineering and technologies Particle swarm optimization Best-first search 02 engineering and technology Software quality 0202 electrical engineering electronic engineering information engineering Beam search Harmony search 020201 artificial intelligence & image processing Algorithm design Artificial intelligence business Metaheuristic |
| Zdroj: | 2016 Online International Conference on Green Engineering and Technologies (IC-GET). |
| DOI: | 10.1109/get.2016.7916698 |
| Popis: | The first section means to survey and psychoanalyze the capacious and New Harmony search (HS) algorithm as per the perspective of metaheuristics algorithms. At first I will discuss the basic steps of Harmony Search and how it works as per the expectations. I then try to recognize the attributes of metaheuristics and dissect why Harmony Search is a useful metaheuristics algorithm. I then retrace concisely other well-known metaheuristics, for example particle swarm optimization in order to discover their similarities and differences from Harmony Search. At last I will examine the different approaches to enhance and grow new variations of Harmony Search. This paper results in an improved harmony search (IHS) algorithm in order to solve highly optimized problems. Improved harmony Search utilizes a novel technique for creating new arrangement vectors that improves exactness and union rate of harmony search algorithm. I will explain the impact of constant parameters on harmony search algorithm. Moreover a technique for tuning these parameters is also exhibited. The improved harmony search algorithm has been effectively applied to different benchmarking and standard designing optimization issues. Numerical results uncover that the proposed algorithm can discover better arrangements at the point when contrasted with Harmony Search and other heuristic or deterministic routines and is an intense quest calculation for different designing optimization issues. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|