• Title/Summary/Keyword: Harmony Search (HS) algorithm

Search Result 55, Processing Time 0.024 seconds

A Study on the Performance Improvement of Harmony Search Optimization Algorithm (HS 최적화 알고리즘 성능 향상에 관한 연구)

  • Lee, Tae-Bong
    • Journal of Advanced Navigation Technology
    • /
    • v.25 no.5
    • /
    • pp.403-408
    • /
    • 2021
  • Harmony Search(HS) algorithm is an emerging meta-heuristic optimization algorithm, which is inspired by the music improvisation process and has been successfully applied to solve different optimization problems. In order to further improve the performance of HS, this paper proposes a new method which is called Fast Harmony Search(FSH) algorithm. For the purpose, this paper suggest a method to unify two independent improvisation processes by newly defining the boundary value of a object variable using HM. As the result, the process time of the algorithm is shorten and explicit decision of bandwidth is no more needed. Furthermore, exploitative power of random selection is improved. The numerical results reveal that the proposed algorithm can find better solutions and is faster when compared to the conventional HS.

Development of the Meta-heuristic Optimization Algorithm: Exponential Bandwidth Harmony Search with Centralized Global Search (새로운 메타 휴리스틱 최적화 알고리즘의 개발: Exponential Bandwidth Harmony Search with Centralized Global Search)

  • Kim, Young Nam;Lee, Eui Hoon
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.21 no.2
    • /
    • pp.8-18
    • /
    • 2020
  • An Exponential Bandwidth Harmony Search with Centralized Global Search (EBHS-CGS) was developed to enhance the performance of a Harmony Search (HS). EBHS-CGS added two methods to improve the performance of HS. The first method is an improvement of bandwidth (bw) that enhances the local search. This method replaces the existing bw with an exponential bw and reduces the bw value as the iteration proceeds. This form of bw allows for an accurate local search, which enables the algorithm to obtain more accurate values. The second method is to reduce the search range for an efficient global search. This method reduces the search space by considering the best decision variable in Harmony Memory (HM). This process is carried out separately from the global search of the HS by the new parameter, Centralized Global Search Rate (CGSR). The reduced search space enables an effective global search, which improves the performance of the algorithm. The proposed algorithm was applied to a representative optimization problem (math and engineering), and the results of the application were compared with the HS and better Improved Harmony Search (IHS).

Discrete Optimization of Structural System by Using the Harmony Search Heuristic Algorithm with Penalty Function (벌칙함수를 도입한 하모니서치 휴리스틱 알고리즘 기반 구조물의 이산최적설계법)

  • Jung, Ju-Seong;Choi, Yun-Chul;Lee, Kang-Seok
    • Journal of the Architectural Institute of Korea Structure & Construction
    • /
    • v.33 no.12
    • /
    • pp.53-62
    • /
    • 2017
  • Many gradient-based mathematical methods have been developed and are in use for structural size optimization problems, in which the cross-sectional areas or sizing variables are usually assumed to be continuous. In most practical structural engineering design problems, however, the design variables are discrete. The main objective of this paper is to propose an efficient optimization method for structures with discrete-sized variables based on the harmony search (HS) meta-heuristic algorithm that is derived using penalty function. The recently developed HS algorithm was conceptualized using the musical process of searching for a perfect state of harmony. It uses a stochastic random search instead of a gradient search so that derivative information is unnecessary. In this paper, a discrete search strategy using the HS algorithm with a static penalty function is presented in detail and its applicability using several standard truss examples is discussed. The numerical results reveal that the HS algorithm with the static penalty function proposed in this study is a powerful search and design optimization technique for structures with discrete-sized members.

Identification of Continuous System from Step Response using HS Optimization Algorithm (HS 최적화 알고리즘을 이용한 계단응답과 연속시스템 인식)

  • Lee, Tae-bong;Shon, Jin-geun
    • The Transactions of the Korean Institute of Electrical Engineers P
    • /
    • v.65 no.4
    • /
    • pp.292-297
    • /
    • 2016
  • The first-order plus dead time(FOPDT) and second-order plus dead time(SOPDT), which describes a linear monotonic process quite well in most chemical and industrial processes and is often sufficient for PID and IMC controller tuning. This paper presents an application of heuristic harmony search(HS) optimization algorithm to the identification of linear continuous time-delay systems from step response. This recently developed HS algorithm is conceptualized using the musical process of searching for a perfect state of harmony. It uses a stochastic random search instead of a gradient search so that derivative information is unnecessary. The effectiveness of the proposed identification method has been demonstrated through a number of simulation examples.

Harmony Search Algorithm for Optimal Placement Problem of Distributed Generations (분산전원 최적설치를 위한 Harmony Search 알고리즘 응용)

  • Rhee, Sang-Bong;Kim, Kyu-Ho
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.59 no.5
    • /
    • pp.866-870
    • /
    • 2010
  • This paper presents a application of Harmony Search (HS) algorithm for optimal placement of distributed generations(DGs) in distribution systems. In optimization procedure, the HS algorithm denotes the searching ability for the global optimal solution with simple coding of the iteration procedure, and shows the fast convergence characteristics for getting solutions. The HS algorithm is tested on 9 buses and 69 buses distribution systems, and the results prove its effectiveness to determine appropriate placement points of DGs and reducing amount of active power without the occurrence of any mis-determination in selection of its capacity.

Harmony Search Algorithm for Network Reconfiguration Problem in Distribution Systems (배전계통 재구성 문제를 위한 Harmony Search 알고리즘 응용)

  • Rhee, Sang-Bong;Kim, Kyu-Ho;Kim, Chul-Hwan
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.58 no.9
    • /
    • pp.1667-1673
    • /
    • 2009
  • This paper presents a application of new algorithm for feeder reconfiguration problem in distribution systems. Harmony Search (HS) algorithm, which is motivated from the musical performance, is used to reconfigure distribution systems so that active power losses are globally minimized with turning on/off the sectionalizing and the tie-line switches. In optimization processing, the HS algorithm has searching ability for the global optimal solution, simple coding of the iteration procedure, and fast convergence to get the solution. The HS algorithm is tested on 15 buses and 69 buses distribution systems, and the results prove its effectiveness to determine appropriate switching options without the occurrence of any misdetermination in switching and get the minimum power loss.

HS-PSO Hybrid Optimization Algorithm for HS Performance Improvement (HS 성능 향상을 위한 HS-PSO 하이브리드 최적화 알고리즘)

  • Tae-Bong Lee
    • The Journal of Korea Institute of Information, Electronics, and Communication Technology
    • /
    • v.16 no.4
    • /
    • pp.203-209
    • /
    • 2023
  • Harmony search(HS) does not use the evaluation of individual harmony when referring to HM when constructing a new harmony, but particle swarm optimization(PSO), on the contrary, uses the evaluation value of individual particles and the evaluation value of the population to find a solution. However, in this study, we tried to improve the performance of the algorithm by finding and identifying similarities between HS and PSO and applying the particle improvement process of PSO to HS. To apply the PSO algorithm, the local best of individual particles and the global best of the swam are required. In this study, the process of HS improving the worst harmony in harmony memory(HM) was viewed as a process very similar to that of PSO. Therefore, the worst harmony of HM was regarded as the local best of a particle, and the best harmony was regarded as the global best of swam. In this way, the performance of the HS was improved by introducing the particle improvement process of the PSO into the HS harmony improvement process. The results of this study were confirmed by comparing examples of optimization values for various functions. As a result, it was found that the suggested HS-PSO was much better than the existing HS in terms of accuracy and consistency.

HS Optimization Implementation Based on Tuning without Maximum Number of Iterations (최대 반복 횟수 없이 튜닝에 기반을 둔 HS 최적화 구현)

  • Lee, Tae-bong
    • The Transactions of the Korean Institute of Electrical Engineers P
    • /
    • v.67 no.3
    • /
    • pp.131-136
    • /
    • 2018
  • Harmony search (HS) is a relatively recently developed meta-heuristic optimization method imitating the music improvisation process where musicians improvise their instruments' pitches searching for a perfect state of harmony. In the conventional HS algorithm, it is necessary to determine the maximum number of iterations with some algorithm parameters. However, there is no criterion for determining the number of iterations, which is a very difficult problem. To solve this problem, a new method is proposed to perform the algorithm without setting the maximum number of iterations in this paper. The new method allows the algorithm to be performed until the desired tuning is achieved. To do this, a new variable bandwidth is introduced. In addition, the types and probability of harmonies composed of variables is analyzed to help to decide the value of HMCR. The performance of the proposed method is investigated and compared with classical HS. The experiments conducted show that the new method generally outperformed conventional HS when applied to seven benchmark problems.

Economic Life Assessment of Power Transformer using HS Optimization Algorithm (HS 최적화 알고리즘을 이용한 전력용 변압기의 경제적 수명평가)

  • Lee, Tae-bong;Shon, Jin-geun
    • The Transactions of the Korean Institute of Electrical Engineers P
    • /
    • v.66 no.3
    • /
    • pp.123-128
    • /
    • 2017
  • Electric utilities has been considered the necessity to introduce AM(asset management) of electric power facilities in order to reduce maintenance cost of existing facilities and to maximize profit. In order to make decisions in terms of repairs and replacements for power transformers, not only measuring by counting parts and labor costs, but comprehensive comparison including reliability and cost is needed. Therefore, this study is modeling input cost for power transformer during its entire life and also the life cycle cost (LCC) technique is applied. In particular, this paper presents an application of heuristic harmony search(HS) optimization algorithm to the convergence and the validity of economic life assessment of power transformer from LCC technique. This recently developed HS algorithm is conceptualized using the musical process of searching for a perfect state of harmony. It uses a stochastic random search instead of a gradient search so that derivative information is unnecessary. The effectiveness of the proposed identification method has been demonstrated through an economic life assessment simulation of power transformer using HS optimization algorithm.

Hybrid of the fuzzy logic controller with the harmony search algorithm to PWR in-core fuel management optimization

  • Mahmoudi, Sayyed Mostafa;Rad, Milad Mansouri;Ochbelagh, Dariush Rezaei
    • Nuclear Engineering and Technology
    • /
    • v.53 no.11
    • /
    • pp.3665-3674
    • /
    • 2021
  • One of the important parts of the in-core fuel management is loading pattern optimization (LPO). The loading pattern optimization as a reasonable design of the in-core fuel management can improve both economic and safe aspects of the nuclear reactor. This work proposes the hybrid of fuzzy logic controller with harmony search algorithm (HS) for loading pattern optimization in a pressurized water reactor. The music improvisation process to find a pleasing harmony is inspiring the harmony search algorithm. In this work, the adjustment of the harmony search algorithm parameters such as the bandwidth and the pitch adjustment rate are increasing performance of the proposed algorithm which is done through a fuzzy logic controller. Hence, membership functions and fuzzy rules are designed to improve the performance of the HS algorithm and achieve optimal results. The objective of the method is finding an optimum core arrangement according to safety and economic aspects such as reduction of power peaking factor (PPF) and increase of effective multiplication factor (Keff). The proposed approach effectiveness has been tried in two cases, Michalewicz's bivariate function problem and NEACRP LWR core. The results show that by using fuzzy harmony search algorithm the value of the fitness function is improved by 15.35%. Finally, with regard to the new solutions proposed in this research it could be used as a trustworthy method for other optimization issues of engineering field.