scholarly journals An Effective Hybrid Firefly Algorithm with Harmony Search for Global Numerical Optimization

2013 ◽  
Vol 2013 ◽  
pp. 1-9 ◽  
Author(s):  
Lihong Guo ◽  
Gai-Ge Wang ◽  
Heqi Wang ◽  
Dinan Wang
Keyword(s):  
Numerical Optimization ◽  
Firefly Algorithm ◽  
Harmony Search ◽  
Optimization Methods ◽  
Convergence Speed ◽  
Function Optimization ◽  
Global Numerical Optimization ◽  
Running Time ◽  
Hybrid Metaheuristic ◽  
Better Than

A hybrid metaheuristic approach by hybridizing harmony search (HS) and firefly algorithm (FA), namely, HS/FA, is proposed to solve function optimization. In HS/FA, the exploration of HS and the exploitation of FA are fully exerted, so HS/FA has a faster convergence speed than HS and FA. Also, top fireflies scheme is introduced to reduce running time, and HS is utilized to mutate between fireflies when updating fireflies. The HS/FA method is verified by various benchmarks. From the experiments, the implementation of HS/FA is better than the standard FA and other eight optimization methods.

scholarly journals A Novel Hybrid Bat Algorithm with Harmony Search for Global Numerical Optimization

2013 ◽  
Vol 2013 ◽  
pp. 1-21 ◽  
Author(s):  
Gaige Wang ◽  
Lihong Guo
Keyword(s):  
Numerical Optimization ◽  
Optimization Problems ◽  
Harmony Search ◽  
Bat Algorithm ◽  
Optimization Methods ◽  
Population Based ◽  
Optimization Approach ◽  
Global Numerical Optimization ◽  
Hybrid Metaheuristic ◽  
Real World Applications

A novel robust hybrid metaheuristic optimization approach, which can be considered as an improvement of the recently developed bat algorithm, is proposed to solve global numerical optimization problems. The improvement includes the addition of pitch adjustment operation in HS serving as a mutation operator during the process of the bat updating with the aim of speeding up convergence, thus making the approach more feasible for a wider range of real-world applications. The detailed implementation procedure for this improved metaheuristic method is also described. Fourteen standard benchmark functions are applied to verify the effects of these improvements, and it is demonstrated that, in most situations, the performance of this hybrid metaheuristic method (HS/BA) is superior to, or at least highly competitive with, the standard BA and other population-based optimization methods, such as ACO, BA, BBO, DE, ES, GA, HS, PSO, and SGA. The effect of the HS/BA parameters is also analyzed.

scholarly journals Adaptive Opposition Slime Mould Algorithm

2021 ◽  
Author(s):  
Manoj Kumar Naik ◽  
Rutuparna Panda ◽  
Ajith Abraham
Keyword(s):  
Random Search ◽  
Optimal Solution ◽  
Optimization Methods ◽  
Function Optimization ◽  
Rank Test ◽  
Test Functions ◽  
Slime Mould ◽  
Opposition Based Learning ◽  
Suggested Technique ◽  
Better Than

Abstract Recently, the slime mould algorithm (SMA) has become popular in function optimization, because it effectively uses exploration and exploitation to reach an optimal solution or near-optimal solution. However, the SMA uses two random search agents from the whole population to decide the future displacement and direction from the best search agents, which limits its exploitation and exploration. To solve this problem, we investigate an adaptive approach to decide whether opposition based learning (OBL) will be used or not. Sometimes the OBL is used to further increase the exploration. In addition, it maximizes the exploitation by replacing one random search agent with the best one in the position updating. The suggested technique is called an adaptive opposition slime mould algorithm (AOSMA). The qualitative and quantitative analysis of AOSMA is reported using 29 test functions consisting of 23 classical test functions and 6 recently used composition functions from the IEEE CEC 2014 test suite. The results are compared with state-of-the-art optimization methods. Results presented in this paper show that AOSMA’s performance is better than other optimization algorithms. The AOSMA is evaluated using Wilcoxon’s rank-sum test. It also ranked one in Friedman’s mean rank test. The proposed AOSMA algorithm would be useful for function optimization to solve real-world engineering problems.

A New Structural Optimization Method Based on Group Hunting of Animals: Hunting Search (HuS)

2010 ◽  
Author(s):  
R. Oftadeh ◽  
M. J. Mahjoob
Keyword(s):  
Structural Optimization ◽  
Numerical Optimization ◽  
Optimization Problems ◽  
Optimization Technique ◽  
Harmony Search ◽  
Optimization Methods ◽  
Optimization Method ◽  
Global Optimization Methods ◽  
Multi Level ◽  
Group Hunting

This paper presents a novel structural optimization algorithm based on group hunting of animals such as lions, wolves, and dolphins. Although these hunters have differences in the way of hunting but they are common in that all of them look for a prey in a group. The hunters encircle the prey and gradually tighten the ring of siege until they catch the prey. In addition, each member of the group corrects its position based on its own position and the position of other members. If the prey escapes from the ring, the hunters reorganize the group to siege the prey again. A benchmark numerical optimization problems is presented to show how the algorithm works. Three benchmark structural optimization problems are also presented to demonstrate the effectiveness and robustness of the proposed Hunting Search (HuS) algorithm for structural optimization. The objective in these problems is to minimize the weight of bar trusses. Both sizing and layout optimization variables are included, too. The proposed algorithm is compared with other global optimization methods such as CMLPSA (Corrected Multi-Level & Multi-Point Simulated Annealing) and HS (Harmony Search). The results indicate that the proposed method is a powerful search and optimization technique. It yields comparable and in some cases, better solutions compared to those obtained using current algorithms when applied to structural optimization problems.

Hybridizing Harmony Search with Biogeography Based Optimization for Global Numerical Optimization

2013 ◽  
Vol 10 (10) ◽  
pp. 2312-2322 ◽  
Author(s):  
Gaige Wang ◽  
Lihong Guo ◽  
Hong Duan ◽  
Heqi Wang ◽  
Luo Liu ◽  
...  
Keyword(s):  
Numerical Optimization ◽  
Harmony Search ◽  
Global Numerical Optimization

Hybridizing harmony search algorithm with cuckoo search for global numerical optimization

2014 ◽  
Vol 20 (1) ◽  
pp. 273-285 ◽  
Author(s):  
Gai-Ge Wang ◽  
Amir H. Gandomi ◽  
Xiangjun Zhao ◽  
Hai Cheng Eric Chu
Keyword(s):  
Numerical Optimization ◽  
Search Algorithm ◽  
Harmony Search ◽  
Cuckoo Search ◽  
Harmony Search Algorithm ◽  
Global Numerical Optimization

A NOVEL EVOLUTIONARY ALGORITHM ENSEMBLE FOR GLOBAL NUMERICAL OPTIMIZATION

2013 ◽  
Vol 22 (04) ◽  
pp. 1350022
Author(s):  
YONGYONG NIU ◽  
ZIXING CAI ◽  
MIN JIN
Keyword(s):  
Evolutionary Algorithm ◽  
Evolutionary Computation ◽  
Numerical Optimization ◽  
Global Numerical Optimization ◽  
Covariance Matrix Adaptation ◽  
The Individual ◽  
Benchmark Test Functions ◽  
Adaptation Evolution ◽  
Better Than

In the past few years, evolutionary algorithm ensembles have gradually attracted more and more attention in the community of evolutionary computation. This paper proposes a novel evolutionary algorithm ensemble for global numerical optimization, named NEALE. In order to make a good tradeoff between the exploration and exploitation, NEALE is composed of two constituent algorithms, i.e., the composite differential evolution (CoDE) and the covariance matrix adaptation evolution strategy (CMA-ES). During the evolution, CoDE aims at probing more promising regions and refining the overall quality of the population, while the purposes of CMA-ES are to accelerate the convergence speed and to enhance the accuracy of the solutions. In addition, NEALE encourages the interaction between the constituent algorithms. In NEALE, the interaction is controlled by a predefined generation number and different interaction strategies are designed according to the features of the constituent algorithms. The performance of NEALE has been tested on 25 benchmark test functions developed for the special session on real-parameter optimization of the 2005 IEEE Congress on Evolutionary Computation (IEEE CEC2005). Compared with other state-of-the-art evolutionary algorithms and the individual constituent algorithms, NEALE performs significantly better than them.

A Multi-Stage Krill Herd Algorithm for Global Numerical Optimization

2016 ◽  
Vol 25 (02) ◽  
pp. 1550030 ◽  
Author(s):  
Gai-Ge Wang ◽  
Amir H. Gandomi ◽  
Amir H. Alavi ◽  
Suash Deb
Keyword(s):  
Numerical Optimization ◽  
Optimization Problems ◽  
Optimization Methods ◽  
Optimization Method ◽  
Fine Tuning ◽  
Benchmark Problems ◽  
Global Numerical Optimization ◽  
Candidate Solution ◽  
Multi Stage ◽  
Krill Herd

A multi-stage krill herd (MSKH) algorithm is presented to fully exploit the global and local search abilities of the standard krill herd (KH) optimization method. The proposed method involves exploration and exploitation stages. The exploration stage uses the basic KH algorithm to select a good candidate solution set. This phase is followed by fine-tuning a good candidate solution in the exploitation stage with a focused local mutation and crossover (LMC) operator in order to enhance the reliability of the method for solving global numerical optimization problems. Moreover, the elitism scheme is introduced into the MSKH method to guarantee the best solution. The performance of MSKH is verified using twenty-five standard and rotated and shifted benchmark problems. The results show the superiority of the proposed algorithm to the standard KH and other well-known optimization methods.

A Modified Harmony Search Algorithm Solve Numerical Optimization Problems

2014 ◽  
Vol 602-605 ◽  
pp. 3589-3592
Author(s):  
Hong Gang Xia ◽  
Qing Zhou Wang
Keyword(s):  
Numerical Optimization ◽  
Optimization Problems ◽  
Search Algorithm ◽  
Local Development ◽  
Harmony Search ◽  
Harmony Search Algorithm ◽  
Test Functions ◽  
Optimal Value ◽  
Pitch Adjustment ◽  
Better Than

This paper proposes a new effective MHS algorithm to solve numerical optimization problems. The MHS algorithm first adopt a novel self-studying strategy, which makes it easy balance the global search ability and local development ability, prevent the MHS algorithm trapped into local optimal value. besides, the harmony memory consideration rate (HMCR), pitch adjustment rate (PAR) and bandwidth distance (bw) is changed with function values dynamically, it can effectively improve the convergence speed and precision of the algorithm Based on five test functions , experiments results obtained by the MHS algorithm are better than those obtained using HS, IHS and NGHS algorithm in the literature.

Sign in / Sign up

Export Citation Format

Share Document