Particle swarm optimization method in multiobjective problems
Proceedings of the 2002 ACM symposium on Applied computing
Multi-Objective Optimization Using Evolutionary Algorithms
Multi-Objective Optimization Using Evolutionary Algorithms
Controlled Elitist Non-dominated Sorting Genetic Algorithms for Better Convergence
EMO '01 Proceedings of the First International Conference on Evolutionary Multi-Criterion Optimization
Constrained Test Problems for Multi-objective Evolutionary Optimization
EMO '01 Proceedings of the First International Conference on Evolutionary Multi-Criterion Optimization
An evolutionary algorithm for constrained multi-objective optimization
CEC '02 Proceedings of the Evolutionary Computation on 2002. CEC '02. Proceedings of the 2002 Congress - Volume 02
Evolutionary algorithms for constrained parameter optimization problems
Evolutionary Computation
Solving Constrained Optimization via a Modified Genetic Particle Swarm Optimization
WKDD '08 Proceedings of the First International Workshop on Knowledge Discovery and Data Mining
Dynamic Crowding Distance?A New Diversity Maintenance Strategy for MOEAs
ICNC '08 Proceedings of the 2008 Fourth International Conference on Natural Computation - Volume 01
Constraint handling in multiobjective evolutionary optimization
IEEE Transactions on Evolutionary Computation
Dynamic multiple swarms in multiobjective particle swarm optimization
IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans
An adaptive penalty formulation for constrained evolutionary optimization
IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans
Constrained multi-objective optimization using steady state genetic algorithms
GECCO'03 Proceedings of the 2003 international conference on Genetic and evolutionary computation: PartI
Constraint-handling method for multi-objective function optimization: Pareto descent repair operator
EMO'07 Proceedings of the 4th international conference on Evolutionary multi-criterion optimization
Multi-level ranking for constrained multi-objective evolutionary optimisation
PPSN'06 Proceedings of the 9th international conference on Parallel Problem Solving from Nature
A novel multi-objective PSO algorithm for constrained optimization problems
SEAL'06 Proceedings of the 6th international conference on Simulated Evolution And Learning
SEAL'06 Proceedings of the 6th international conference on Simulated Evolution And Learning
SEAL'06 Proceedings of the 6th international conference on Simulated Evolution And Learning
Improving PSO-Based multi-objective optimization using crowding, mutation and ∈-dominance
EMO'05 Proceedings of the Third international conference on Evolutionary Multi-Criterion Optimization
An evolutionary algorithm for constrained bi-objective optimization using radial slots
KES'05 Proceedings of the 9th international conference on Knowledge-Based Intelligent Information and Engineering Systems - Volume Part IV
A fast and elitist multiobjective genetic algorithm: NSGA-II
IEEE Transactions on Evolutionary Computation
Performance assessment of multiobjective optimizers: an analysis and review
IEEE Transactions on Evolutionary Computation
Handling multiple objectives with particle swarm optimization
IEEE Transactions on Evolutionary Computation
A Generic Framework for Constrained Optimization Using Genetic Algorithms
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
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
PSO-Based Multiobjective Optimization With Dynamic Population Size and Adaptive Local Archives
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans
Hi-index | 0.00 |
Constraint handling techniques are mainly designed for evolutionary algorithms to solve constrained multiobjective optimization problems CMOPs. Most multiojective particle swarm optimization MOPSO designs adopt these existing constraint handling techniques to deal with CMOPs. In the proposed constrained MOPSO, information related to particles' infeasibility and feasibility status is utilized effectively to guide the particles to search for feasible solutions and improve the quality of the optimal solution. This information is incorporated into the four main procedures of a standard MOPSO algorithm. The involved procedures include the updating of personal best archive based on the particles' Pareto ranks and their constraint violation values; the adoption of infeasible global best archives to store infeasible nondominated solutions; the adjustment of acceleration constants that depend on the personal bests' and selected global best's infeasibility and feasibility status; and the integration of personal bests' feasibility status to estimate the mutation rate in the mutation procedure. Simulation to investigate the proposed constrained MOPSO in solving the selected benchmark problems is conducted. The simulation results indicate that the proposed constrained MOPSO is highly competitive in solving most of the selected benchmark problems.