On the edge of feasibility: A case study of the particle swarm optimizer

In many real-world constrained optimization problems (COPs) it is highly probable that some constraints are active at optimum points, i.e. some optimum points are boundary points between feasible and infeasible parts of the search space. A method is proposed which narrows the feasible area of a COP to its boundary. In the proposed method the thickness of the narrowed boundary is adjustable by a parameter. The method is extended in a way that it is able to limit the feasible regions to boundaries where at least one of the constraints in a given subset of all constraints is active and the remaining constraints might be active or not. Another extension is able to limit the search to cases where all constraints in a given subset are active and the rest might be active or not. The particle swarm optimization algorithm is used as a framework to compare the proposed methods. Results show that the proposed methods can limit the search to the requested boundary and they are effective in locating optimal solutions on the boundaries of the feasible and infeasible area.

[1]  Xiang Li,et al.  Solving a real-world wheat blending problem using a hybrid evolutionary algorithm , 2013, 2013 IEEE Congress on Evolutionary Computation.

[2]  Jing J. Liang,et al.  Problem Deflnitions and Evaluation Criteria for the CEC 2006 Special Session on Constrained Real-Parameter Optimization , 2006 .

[3]  Andries Petrus Engelbrecht,et al.  Particle Swarms for Linearly Constrained Optimisation , 2007, Fundam. Informaticae.

[4]  Zbigniew Michalewicz,et al.  Evolutionary Algorithms for Constrained Parameter Optimization Problems , 1996, Evolutionary Computation.

[5]  Zbigniew Michalewicz,et al.  Genetic Algorithms + Data Structures = Evolution Programs , 1996, Springer Berlin Heidelberg.

[6]  Zbigniew Michalewicz,et al.  Boundary Operators for Constrained Parameter Optimization Problems , 1997, ICGA.

[7]  Xiang Li,et al.  A hybrid particle swarm with velocity mutation for constraint optimization problems , 2013, GECCO '13.

[8]  Zhigang Shang,et al.  Coevolutionary Comprehensive Learning Particle Swarm Optimizer , 2010, IEEE Congress on Evolutionary Computation.

[9]  Zbigniew Michalewicz,et al.  Locating Potentially Disjoint Feasible Regions of a Search Space with a Particle Swarm Optimizer , 2015 .

[10]  Zbigniew Michalewicz,et al.  Genetic Algorithms + Data Structures = Evolution Programs , 1992, Artificial Intelligence.

[11]  Carlos A. Coello Coello,et al.  Boundary Search for Constrained Numerical Optimization Problems With an Algorithm Inspired by the Ant Colony Metaphor , 2009, IEEE Transactions on Evolutionary Computation.

[12]  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.

[13]  Angus R. Simpson,et al.  A self-adaptive boundary search genetic algorithm and its application to water distribution systems , 2002 .

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

[15]  Zbigniew Michalewicz,et al.  A Note on Usefulness of Geometrical Crossover for Numerical Optimization Problems , 1996, Evolutionary Programming.

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

[17]  Zbigniew Michalewicz,et al.  Evolutionary Computation at the Edge of Feasibility , 1996, PPSN.

[18]  N. Hansen,et al.  Markov Chain Analysis of Cumulative Step-Size Adaptation on a Linear Constrained Problem , 2015, Evolutionary Computation.