scholarly journals Lifecycle-Based Swarm Optimization Method for Numerical Optimization

2014 ◽  
Vol 2014 ◽  
pp. 1-11 ◽  
Author(s):  
Hai Shen ◽  
Yunlong Zhu ◽  
Xiaodan Liang
Keyword(s):  
Numerical Optimization ◽  
Optimization Problems ◽  
Mechanical Design ◽  
Optimization Method ◽  
Optimization Techniques ◽  
Benchmark Problems ◽  
Swarm Optimization ◽  
Individual Organism ◽  
Engineering Problems ◽  
Mechanical Design Problem

Bioinspired optimization algorithms have been widely used to solve various scientific and engineering problems. Inspired by biological lifecycle, this paper presents a novel optimization algorithm called lifecycle-based swarm optimization (LSO). Biological lifecycle includes four stages: birth, growth, reproduction, and death. With this process, even though individual organism died, the species will not perish. Furthermore, species will have stronger ability of adaptation to the environment and achieve perfect evolution. LSO simulates Biological lifecycle process through six optimization operators: chemotactic, assimilation, transposition, crossover, selection, and mutation. In addition, the spatial distribution of initialization population meets clumped distribution. Experiments were conducted on unconstrained benchmark optimization problems and mechanical design optimization problems. Unconstrained benchmark problems include both unimodal and multimodal cases the demonstration of the optimal performance and stability, and the mechanical design problem was tested for algorithm practicability. The results demonstrate remarkable performance of the LSO algorithm on all chosen benchmark functions when compared to several successful optimization techniques.

Taguchi-Particle Swarm Optimization for Numerical Optimization

2012 ◽  
pp. 44-59
Author(s):  
T. O. Ting ◽  
H. C. Ting ◽  
T. S. Lee
Keyword(s):  
Particle Swarm Optimization ◽  
Taguchi Method ◽  
Numerical Optimization ◽  
Optimization Problems ◽  
Computational Cost ◽  
Particle Swarm ◽  
Benchmark Problems ◽  
Discrete Variables ◽  
Swarm Optimization ◽  
Continuous And Discrete Variables

In this work, a hybrid Taguchi-Particle Swarm Optimization (TPSO) is proposed to solve global numerical optimization problems with continuous and discrete variables. This hybrid algorithm combines the well-known Particle Swarm Optimization Algorithm with the established Taguchi method, which has been an important tool for robust design. This paper presents the improvements obtained despite the simplicity of the hybridization process. The Taguchi method is run only once in every PSO iteration and therefore does not give significant impact in terms of computational cost. The method creates a more diversified population, which also contributes to the success of avoiding premature convergence. The proposed method is effectively applied to solve 13 benchmark problems. This study’s results show drastic improvements in comparison with the standard PSO algorithm involving continuous and discrete variables on high dimensional benchmark functions.

Lifecycle-Based Swarm Optimization for Constrained Problem of Engineering

2013 ◽  
Vol 281 ◽  
pp. 710-714 ◽  
Author(s):  
Zhuang Wei Yin ◽  
Hai Shen ◽  
Yu Fu Deng ◽  
Mo Zhang
Keyword(s):  
Life Cycle ◽  
Optimization Problems ◽  
Time Windows ◽  
Optimization Techniques ◽  
Constrained Optimization Problems ◽  
Swarm Optimization ◽  
Routing Problem ◽  
Constrained Problem ◽  
Engineering Problems ◽  
Life Cycle Process

There are many constrained optimization problems in engineering. Bio-inspired optimization algorithms have been widely used to solve various engineering problems. This paper presents a novel optimization algorithm called Lifecycle-based Swarm Optimization, inspired by biology life cycle. LSO algorithm imitates biologic life cycle process through six optimization operators: chemotactic, assimilation, transposition, crossover, selection and mutation. In addition, the spatial distribution of initialization population meets clumped distribution. Experiments were conducted on a Vehicle Routing Problem with Time Windows for demonstration the effectiveness and stability. The results demonstrate remarkable performance of the LSO algorithm on chosen case when compared to two successful optimization techniques.

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.

AN OPTIMIZATION METHOD INSPIRED BY "CHAOTIC" ANT BEHAVIOR

2006 ◽  
Vol 16 (08) ◽  
pp. 2351-2364 ◽  
Author(s):  
LIXIANG LI ◽  
YIXIAN YANG ◽  
HAIPENG PENG ◽  
XIANGDONG WANG
Keyword(s):  
Numerical Optimization ◽  
Chaotic Dynamics ◽  
Optimization Problems ◽  
Chaotic Behavior ◽  
Optimization Method ◽  
Ant Algorithm ◽  
Swarm Optimization ◽  
Intelligent Optimization ◽  
Ant Behavior ◽  
Chaotic Ant Swarm Optimization

Inspired by the behavior of the ants in nature, we propose an optimization method, which combines the chaotic behavior of individual ants with the intelligent optimization action of an ant colony. Our method includes both effects of chaotic dynamics and swarm-based search. It is a deterministic process different from the conventional ant algorithm. The nonlinear dynamics of the proposed method are analyzed, and we show how the algorithm, called chaotic ant swarm optimization, can be applied to numerical optimization problems with encouraging results.

Extrapolated Biogeography-Based Optimization (eBBO) for Global Numerical Optimization and Microstrip Patch Antenna Design

2012 ◽  
pp. 165-191
Author(s):  
M. R. Lohokare ◽  
S.S. Pattnaik ◽  
S. Devi ◽  
B.K. Panigrahi ◽  
S. Das ◽  
...  
Keyword(s):  
Patch Antenna ◽  
Numerical Optimization ◽  
Optimization Problems ◽  
Global Optimum ◽  
Microstrip Patch Antenna ◽  
Benchmark Problems ◽  
Global Numerical Optimization ◽  
Swarm Optimization ◽  
Paired T Test

Biogeography-Based Optimization (BBO) uses the idea of probabilistically sharing features between solutions based on the solutions’ fitness values. Therefore, its exploitation ability is good but it lacks in exploration ability. In this paper, the authors extend the original BBO and propose a hybrid version combined with ePSO (particle swarm optimization with extrapolation technique), namely eBBO, for unconstrained global numerical optimization problems in the continuous domain. eBBO combines the exploitation ability of BBO with the exploration ability of ePSO effectively, which can generate global optimum solutions. To validate the performance of eBBO, experiments have been conducted on 23 standard benchmark problems with a range of dimensions and diverse complexities and compared with original BBO and other versions of BBO in terms of the quality of the final solution and the convergence rate. Influence of population size and scalability study is also considered and results are compared with statistical paired t-test. Experimental analysis indicates that the proposed approach is effective and efficient and improves the exploration ability of BBO.

Extrapolated Biogeography-Based Optimization (eBBO) for Global Numerical Optimization and Microstrip Patch Antenna Design

2010 ◽  
Vol 1 (3) ◽  
pp. 1-26 ◽  
Author(s):  
M. R. Lohokare ◽  
S.S. Pattnaik ◽  
S. Devi ◽  
B.K. Panigrahi ◽  
S. Das ◽  
...  
Keyword(s):  
Numerical Optimization ◽  
Optimization Problems ◽  
Global Optimum ◽  
Antenna Design ◽  
Benchmark Problems ◽  
Final Solution ◽  
Global Numerical Optimization ◽  
Swarm Optimization ◽  
Microstrip Patch

Biogeography-Based Optimization (BBO) uses the idea of probabilistically sharing features between solutions based on the solutions’ fitness values. Therefore, its exploitation ability is good but it lacks in exploration ability. In this paper, the authors extend the original BBO and propose a hybrid version combined with ePSO (particle swarm optimization with extrapolation technique), namely eBBO, for unconstrained global numerical optimization problems in the continuous domain. eBBO combines the exploitation ability of BBO with the exploration ability of ePSO effectively, which can generate global optimum solutions. To validate the performance of eBBO, experiments have been conducted on 23 standard benchmark problems with a range of dimensions and diverse complexities and compared with original BBO and other versions of BBO in terms of the quality of the final solution and the convergence rate. Influence of population size and scalability study is also considered and results are compared with statistical paired t-test. Experimental analysis indicates that the proposed approach is effective and efficient and improves the exploration ability of BBO.

Taguchi-Particle Swarm Optimization for Numerical Optimization

2010 ◽  
Vol 1 (2) ◽  
pp. 18-33
Author(s):  
T. O. Ting ◽  
H. C. Ting ◽  
T. S. Lee
Keyword(s):  
Particle Swarm Optimization ◽  
Taguchi Method ◽  
Numerical Optimization ◽  
Optimization Problems ◽  
Computational Cost ◽  
Particle Swarm ◽  
Benchmark Problems ◽  
Discrete Variables ◽  
Swarm Optimization ◽  
Continuous And Discrete Variables

In this work, a hybrid Taguchi-Particle Swarm Optimization (TPSO) is proposed to solve global numerical optimization problems with continuous and discrete variables. This hybrid algorithm combines the well-known Particle Swarm Optimization Algorithm with the established Taguchi method, which has been an important tool for robust design. This paper presents the improvements obtained despite the simplicity of the hybridization process. The Taguchi method is run only once in every PSO iteration and therefore does not give significant impact in terms of computational cost. The method creates a more diversified population, which also contributes to the success of avoiding premature convergence. The proposed method is effectively applied to solve 13 benchmark problems. This study’s results show drastic improvements in comparison with the standard PSO algorithm involving continuous and discrete variables on high dimensional benchmark functions.

scholarly journals Evolutionary Algorithms for Constrained Parameter Optimization Problems

1996 ◽  
Vol 4 (1) ◽  
pp. 1-32 ◽  
Author(s):  
Zbigniew Michalewicz ◽  
Marc Schoenauer
Keyword(s):  
Nonlinear Programming ◽  
Evolutionary Algorithms ◽  
Evolutionary Computation ◽  
Numerical Optimization ◽  
Optimization Problems ◽  
Optimization Techniques ◽  
Test Cases ◽  
Nonlinear Constraints ◽  
Nonlinear Programming Problem ◽  
General Nonlinear Programming

Evolutionary computation techniques have received a great deal of attention regarding their potential as optimization techniques for complex numerical functions. However, they have not produced a significant breakthrough in the area of nonlinear programming due to the fact that they have not addressed the issue of constraints in a systematic way. Only recently have several methods been proposed for handling nonlinear constraints by evolutionary algorithms for numerical optimization problems; however, these methods have several drawbacks, and the experimental results on many test cases have been disappointing. In this paper we (1) discuss difficulties connected with solving the general nonlinear programming problem; (2) survey several approaches that have emerged in the evolutionary computation community; and (3) provide a set of 11 interesting test cases that may serve as a handy reference for future methods.

Sign in / Sign up

Export Citation Format

Share Document