Modified Krill Herd Algorithm for Global Numerical Optimization Problems

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.

Download Full-text

Chaotic catfish particle swarm optimization for solving global numerical optimization problems

Applied Mathematics and Computation ◽

10.1016/j.amc.2011.01.081 ◽

2011 ◽

Vol 217 (16) ◽

pp. 6900-6916 ◽

Cited By ~ 26

Author(s):

Li-Yeh Chuang ◽

Sheng-Wei Tsai ◽

Cheng-Hong Yang

Keyword(s):

Particle Swarm Optimization ◽

Numerical Optimization ◽

Optimization Problems ◽

Particle Swarm ◽

Global Numerical Optimization ◽

Swarm Optimization

Download Full-text

ONE IMPROVED AGENT GENETIC ALGORITHM — RING-LIKE AGENT GENETIC ALGORITHM FOR GLOBAL NUMERICAL OPTIMIZATION

Asia Pacific Journal of Operational Research ◽

10.1142/s0217595909002316 ◽

2009 ◽

Vol 26 (04) ◽

pp. 479-502 ◽

Cited By ~ 2

Author(s):

BIN LIU ◽

TEQI DUAN ◽

YONGMING LI

Keyword(s):

Genetic Algorithm ◽

Numerical Optimization ◽

Optimization Problem ◽

Optimization Problems ◽

Genetic Operators ◽

Global Numerical Optimization ◽

Candidate Solution ◽

Low Dimension ◽

Multi Agent ◽

Agent Structure

In this paper, a novel genetic algorithm — dynamic ring-like agent genetic algorithm (RAGA) is proposed for solving global numerical optimization problem. The RAGA combines the ring-like agent structure and dynamic neighboring genetic operators together to get better optimization capability. An agent in ring-like agent structure represents a candidate solution to the optimization problem. Any agent interacts with neighboring agents to evolve. With dynamic neighboring genetic operators, they compete and cooperate with their neighbors, and they can also use knowledge to increase energies. Global numerical optimization problems are the most important ones to verify the performance of evolutionary algorithm, especially of genetic algorithm and are mostly of interest to the corresponding researchers. In the corresponding experiments, several complex benchmark functions were used for optimization, several popular GAs were used for comparison. In order to better compare two agents GAs (MAGA: multi-agent genetic algorithm and RAGA), the several dimensional experiments (from low dimension to high dimension) were done. These experimental results show that RAGA not only is suitable for optimization problems, but also has more precise and more stable optimization results.

Download Full-text

Improved Krill Herd Algorithm with neighborhood distance concept for numerical optimization

2016 IEEE International Conference on Engineering and Technology (ICETECH) ◽

10.1109/icetech.2016.7569421 ◽

2016 ◽

Cited By ~ 1

Author(s):

Prasun Kumar Agrawal ◽

Manjaree Pandit

Keyword(s):

Numerical Optimization ◽

Krill Herd Algorithm ◽

Krill Herd

Download Full-text