A Cooperative Coevolutionary and ε-Dominance Based MOPSO
نویسندگان
چکیده
Particle Swarm Optimizers (PSOs) have been applied to solve Multi-Objective Optimization Problems (MOPs) for its successful applications in solving single objective optimization problems and are named as Multi-Objective PSOs (MOPSOs). However, MOPSOs are often trapped in local optima, cost more function evaluations and suffer from the curse of dimensionality. A cooperative coevolutionary and ε-dominance based MOPSO (CEPSO) is proposed to attack the above disadvantages. In CEPSO, the MOPs are decomposed according to their decision variables and are optimized by corresponding subswarms respectively. Uniform distribution mutation operator is adopted to avoid premature convergence. All subswarms share one archive based on ε-dominance, which is also used as leader set. Collaborators are selected randomly from archive and used to construct context vector in order to evaluate particles in subswarm. CEPSO is tested on several classical MOP benchmark functions and the simulation results show that CEPSO can escape from local optima, optimize high dimension problems and generate more Pareto solutions. Therefore, CEPSO is competitive in solving MOPs.
منابع مشابه
A scalable coevolutionary multi-objective particle swarm optimizer
Multi-Objective Particle Swarm Optimizers (MOPSOs) are easily trapped in local optima, cost more function evaluations and suffer from the curse of dimensionality. A scalable cooperative coevolution and -dominance based MOPSO (CEPSO) is proposed to address these issues. In CEPSO, Multi-objective Optimization Problems (MOPs) are decomposed in terms of their decision variables and are optimized b...
متن کاملHandling multi-objective optimization problems with a multi-swarm cooperative particle swarm optimizer
This paper presents a new multi-objective optimization algorithm in which multi-swarm cooperative strategy is incorporated into particle swarm optimization algorithm, called multi-swarm cooperative multi-objective particle swarm optimizer (MC-MOPSO). This algorithm consists of multiple slave swarms and one master swarm. Each slave swarm is designed to optimize one objective function of the mult...
متن کاملCyclic Dominance in the Spatial Coevolutionary Optional Prisoner's Dilemma Game
This paper studies scenarios of cyclic dominance in a coevolutionary spatial model in which game strategies and links between agents adaptively evolve over time. The Optional Prisoner’s Dilemma (OPD) game is employed. The OPD is an extended version of the traditional Prisoner’s Dilemma where players have a third option to abstain from playing the game. We adopt an agent-based simulation approac...
متن کاملOptimizing a multi-product closed-loop supply chain using NSGA-II, MOSA, and MOPSO meta-heuristic algorithms
This study aims to discuss the solution methodology for a closed-loop supply chain (CLSC) network that includes the collection of used products as well as distribution of the new products. This supply chain is presented on behalf of the problems that can be solved by the proposed meta-heuristic algorithms. A mathematical model is designed for a CLSC that involves three objective functions of ma...
متن کاملMulti objective particle swarm optimization using enhanced dominance and guide selection
Nowadays, the core of the Particle Swarm Optimization (PSO) algorithm has proved to be reliable. However, faced with multi-objective problems, adaptations are needed. Deeper researches must be conducted on its key steps, such as solution set management and guide selection, in order to improve its efficiency in this context. Indeed, numerous parameters and implementation strategies can impact on...
متن کامل