A hybrid particle swarm optimization with a feasibility-based rule for constrained optimization

During the past decade, hybrid algorithms combining evolutionary computation and constraint-handling techniques have shown to be effective to solve constrained optimization problems. For constrained optimization, the penalty function method has been regarded as one of the most popular constraint-handling technique so far, whereas its drawback lies in the determination of suitable penalty factors, which greatly weakens the efficiency of the method. As a novel population-based algorithm, particle swarm optimization (PSO) has gained wide applications in a variety of fields, especially for unconstrained optimization problems. In this paper, a hybrid PSO (HPSO) with a feasibility-based rule is proposed to solve constrained optimization problems. In contrast to the penalty function method, the rule requires no additional parameters and can guide the swarm to the feasible region quickly. In addition, to avoid the premature convergence, simulated annealing (SA) is applied to the best solution of the swarm to help the algorithm escape from local optima. Simulation and comparisons based on several well-studied benchmarks demonstrate the effectiveness, efficiency and robustness of the proposed HPSO. Moreover, the effects of several crucial parameters on the performance of the HPSO are studied as well.

[1]  Kalyanmoy Deb,et al.  GeneAS: A Robust Optimal Design Technique for Mechanical Component Design , 1997 .

[2]  Xin Yao,et al.  Stochastic ranking for constrained evolutionary optimization , 2000, IEEE Trans. Evol. Comput..

[3]  E. Sandgren,et al.  Nonlinear Integer and Discrete Programming in Mechanical Design Optimization , 1990 .

[4]  Dimitri P. Bertsekas,et al.  Constrained Optimization and Lagrange Multiplier Methods , 1982 .

[5]  Zbigniew Michalewicz,et al.  Evolutionary Algorithms, Homomorphous Mappings, and Constrained Parameter Optimization , 1999, Evolutionary Computation.

[6]  Ashok Dhondu Belegundu,et al.  A Study of Mathematical Programming Methods for Structural Optimization , 1985 .

[7]  Rainer Storn,et al.  Differential Evolution – A Simple and Efficient Heuristic for global Optimization over Continuous Spaces , 1997, J. Glob. Optim..

[8]  Ling Wang,et al.  An effective co-evolutionary particle swarm optimization for constrained engineering design problems , 2007, Eng. Appl. Artif. Intell..

[9]  Carlos A. Coello Coello,et al.  Use of a self-adaptive penalty approach for engineering optimization problems , 2000 .

[10]  Zbigniew Michalewicz,et al.  Evolutionary Algorithms in Engineering Applications , 1997, Springer Berlin Heidelberg.

[11]  Carlos A. Coello Coello,et al.  A constraint-handling mechanism for particle swarm optimization , 2004, Proceedings of the 2004 Congress on Evolutionary Computation (IEEE Cat. No.04TH8753).

[12]  T. Ray,et al.  A swarm with an effective information sharing mechanism for unconstrained and constrained single objective optimisation problems , 2001, Proceedings of the 2001 Congress on Evolutionary Computation (IEEE Cat. No.01TH8546).

[13]  David E. Goldberg,et al.  A niched Pareto genetic algorithm for multiobjective optimization , 1994, Proceedings of the First IEEE Conference on Evolutionary Computation. IEEE World Congress on Computational Intelligence.

[14]  Abdollah Homaifar,et al.  Constrained Optimization Via Genetic Algorithms , 1994, Simul..

[15]  Christopher R. Houck,et al.  On the use of non-stationary penalty functions to solve nonlinear constrained optimization problems with GA's , 1994, Proceedings of the First IEEE Conference on Evolutionary Computation. IEEE World Congress on Computational Intelligence.

[16]  Zbigniew Michalewicz,et al.  A Survey of Constraint Handling Techniques in Evolutionary Computation Methods , 1995 .

[17]  Ricardo Landa Becerra,et al.  Efficient evolutionary optimization through the use of a cultural algorithm , 2004 .

[18]  Carlos A. Coello Coello,et al.  THEORETICAL AND NUMERICAL CONSTRAINT-HANDLING TECHNIQUES USED WITH EVOLUTIONARY ALGORITHMS: A SURVEY OF THE STATE OF THE ART , 2002 .

[19]  Riccardo Poli,et al.  Particle swarm optimization , 1995, Swarm Intelligence.

[20]  K. Deb.  An Efficient Constraint Handling Method for Genetic Algorithms , 2000 .

[21]  Jasbir S. Arora,et al.  Introduction to Optimum Design , 1988 .

[22]  Carlos A. Coello Coello,et al.  Constraint-handling in genetic algorithms through the use of dominance-based tournament selection , 2002, Adv. Eng. Informatics.

[23]  S. N. Kramer,et al.  An Augmented Lagrange Multiplier Based Method for Mixed Integer Discrete Continuous Optimization and Its Applications to Mechanical Design , 1994 .

[24]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.