A computationally efficient evolutionary algorithm for real-parameter optimization
Evolutionary Computation
Multiple Objective Optimization with Vector Evaluated Genetic Algorithms
Proceedings of the 1st International Conference on Genetic Algorithms
Using Genetic Algorithms in Engineering Design Optimization with Non-Linear Constraints
Proceedings of the 5th International Conference on Genetic Algorithms
Theoretical Analysis of Simplex Crossover for Real-Coded Genetic Algorithms
PPSN VI Proceedings of the 6th International Conference on Parallel Problem Solving from Nature
An Adaptive Penalty Scheme In Genetic Algorithms For Constrained Optimiazation Problems
GECCO '02 Proceedings of the Genetic and Evolutionary Computation Conference
Solving fuzzy optimization problems by evolutionary algorithms
Information Sciences: an International Journal
A new adaptive penalty scheme for genetic algorithms
Information Sciences: an International Journal - Special issue: Evolutionary computation
The second generation of self-organizing adaptive penalty strategy for constrained genetic search
Advances in Engineering Software
Information Sciences: an International Journal
Evolutionary algorithms for constrained parameter optimization problems
Evolutionary Computation
Differential evolution with dynamic stochastic selection for constrained optimization
Information Sciences: an International Journal
An adaptive penalty formulation for constrained evolutionary optimization
IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans
Covering arrays from cyclotomy
Designs, Codes and Cryptography
C-PSA: Constrained Pareto simulated annealing for constrained multi-objective optimization
Information Sciences: an International Journal
Information Sciences: an International Journal
Differential evolution in constrained numerical optimization: An empirical study
Information Sciences: an International Journal
On-the-fly calibrating strategies for evolutionary algorithms
Information Sciences: an International Journal
An improved vector particle swarm optimization for constrained optimization problems
Information Sciences: an International Journal
Analytical and numerical comparisons of biogeography-based optimization and genetic algorithms
Information Sciences: an International Journal
Information Sciences: an International Journal
Search biases in constrained evolutionary optimization
IEEE Transactions on Systems, Man, and Cybernetics, Part C: Applications and Reviews
No free lunch theorems for optimization
IEEE Transactions on Evolutionary Computation
Stochastic ranking for constrained evolutionary optimization
IEEE Transactions on Evolutionary Computation
An orthogonal genetic algorithm with quantization for globalnumerical optimization
IEEE Transactions on Evolutionary Computation
A fast and elitist multiobjective genetic algorithm: NSGA-II
IEEE Transactions on Evolutionary Computation
Self-adaptive fitness formulation for constrained optimization
IEEE Transactions on Evolutionary Computation
A simple multimembered evolution strategy to solve constrained optimization problems
IEEE Transactions on Evolutionary Computation
A Generic Framework for Constrained Optimization Using Genetic Algorithms
IEEE Transactions on Evolutionary Computation
IEEE Transactions on Evolutionary Computation
A Multiobjective Optimization-Based Evolutionary Algorithm for Constrained Optimization
IEEE Transactions on Evolutionary Computation
An Adaptive Tradeoff Model for Constrained Evolutionary Optimization
IEEE Transactions on Evolutionary Computation
Hi-index | 0.07 |
The existence of infeasible solutions makes it very difficult to handle constrained optimization problems (COPs) in a way that ensures efficient, optimal and constraint-satisfying convergence. Although further optimization from feasible solutions will typically lead in a direction that generates further feasible solutions, certain infeasible solutions can also provide useful information about the optimal direction of improvement for the objective function. How well an algorithm makes use of these two solutions determines its performance on COPs. This paper proposes a novel selection evolutionary strategy (NSES) for constrained optimization. A self-adaptive selection method is introduced to exploit both informative infeasible and feasible solutions from a perspective of combining feasibility with multi-objective problem (MOP) techniques. Since the global optimal solution of a COP is a feasible non-dominated solution, both non-dominated solutions with low constraint violation and feasible ones with low objective values are beneficial to an evolution process. Thus, the exploration and exploitation of both of these two kinds of solutions are preferred during the selection procedure. Several theorems and properties are given to prove the above assertion. Furthermore, the performance of our method is evaluated using 22 well-known benchmark functions. Experimental results show that the proposed method outperforms state-of-the-art algorithms in terms of the speed of finding feasible solutions and the stability of converging to global optimal solutions. In particular, when dealing with problems that have zero feasibility ratios and more than one active constraint, our method provides feasible solutions within fewer fitness evaluations (FES) and converges to the optimal solutions more reliably than other popular methods from the literature.