An Improved Particle Swarm Optimization with Feasibility-Based Rules for Mixed-Variable Optimization Problems

This paper presents an improved particle swarm optimization algorithm with feasibility- based rules (FRIPSO) to solve mixed-variable constrained optimization problems. Different kinds of variables are dealt in different ways in FRIPSO algorithm. Constraint handling is based on simple feasibility-based rules without the use of a penalty function which is frequently cumbersome to parameterize, nor need it to guarantee the particles be in the feasible region at all time which turn out to cost much time sometimes. In order to improve the convergence speed of FRIPSO with the iteration growing and to find global optimum, the standard PSO is used to find a better position for the best history position of the swarm on the condition that the discrete value are same with those of Gbest in each iteration. Two practical benchmark mixed-variable optimization problems are tested by our FRIPSO algorithm to demonstrate the effectiveness and robustness of the proposed approach.

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

[2]  R. W. Mayne,et al.  Optimization With Discrete Variables Via Recursive Quadratic Programming: Part 2—Algorithm and Results , 1989 .

[3]  Zafer Gürdal,et al.  A penalty approach for nonlinear optimization with discrete design variables , 1990 .

[4]  R. G. Fenton,et al.  A MIXED INTEGER-DISCRETE-CONTINUOUS PROGRAMMING METHOD AND ITS APPLICATION TO ENGINEERING DESIGN OPTIMIZATION , 1991 .

[5]  Han Tong Loh,et al.  Computational Implementation and Tests of a Sequential Linearization Algorithm for Mixed-Discrete Nonlinear Design Optimization , 1991 .

[6]  Jahau Lewis Chen,et al.  Optimal design of machine elements using genetic algorithms , 1993 .

[7]  John E. Mitchell,et al.  An improved branch and bound algorithm for mixed integer nonlinear programs , 1994, Comput. Oper. Res..

[8]  Russell C. Eberhart,et al.  A new optimizer using particle swarm theory , 1995, MHS'95. Proceedings of the Sixth International Symposium on Micro Machine and Human Science.

[9]  Chun Zhang,et al.  ON MIXED-DISCRETE NONLINEAR OPTIMIZATION PROBLEMS: A COMPARATIVE STUDY , 1995 .

[10]  S. Wu,et al.  GENETIC ALGORITHMS FOR NONLINEAR MIXED DISCRETE-INTEGER OPTIMIZATION PROBLEMS VIA META-GENETIC PARAMETER OPTIMIZATION , 1995 .

[11]  James Kennedy,et al.  Particle swarm optimization , 2002, Proceedings of ICNN'95 - International Conference on Neural Networks.

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

[13]  Yue Shi,et al.  A modified particle swarm optimizer , 1998, 1998 IEEE International Conference on Evolutionary Computation Proceedings. IEEE World Congress on Computational Intelligence (Cat. No.98TH8360).

[14]  Henry Wu,et al.  A Mixed-Variable Evolutionary Programming For Optimisation Of Mechanical Design , 1999 .

[15]  Ivan Zelinka,et al.  MIXED INTEGER-DISCRETE-CONTINUOUS OPTIMIZATION BY DIFFERENTIAL EVOLUTION Part 2 : a practical example , 1999 .

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

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

[18]  C. Coello,et al.  USE OF DOMINANCE-BASED TOURNAMENT SELECTION TO HANDLE CONSTRAINTS IN GENETIC ALGORITHMS , 2001 .

[19]  Sven Leyffer,et al.  Integrating SQP and Branch-and-Bound for Mixed Integer Nonlinear Programming , 2001, Comput. Optim. Appl..

[20]  Ivan Zelinka,et al.  MIXED INTEGER-DISCRETE-CONTINUOUS OPTIMIZATION BY DIFFERENTIAL EVOLUTION Part 1: the optimization method , 2004 .

[21]  C. Guo,et al.  Swarm intelligence for mixed-variable design optimization , 2004, Journal of Zhejiang University. Science.

[22]  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).

[23]  Shang He,et al.  An improved particle swarm optimizer for mechanical design optimization problems , 2004 .

[24]  Koetsu Yamazaki,et al.  Penalty function approach for the mixed discrete nonlinear problems by particle swarm optimization , 2006 .

[25]  V. Jeet,et al.  Lagrangian relaxation guided problem space search heuristics for generalized assignment problems , 2007, Eur. J. Oper. Res..

[26]  Arthur M. Geoffrion,et al.  Lagrangian Relaxation for Integer Programming , 2010, 50 Years of Integer Programming.