A MOPSO Algorithm Based Exclusively on Pareto Dominance Concepts

By Julio E. Alvarez-Benitez, Richard M. Everson, Jonathan Edward Fieldsend. International Conference on Evolutionary Multi-Criterion Optimization, 2005

325 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Multi-Objective Particle Swarm Optimizers: A Survey of the State-of-the-Art (2006, methodology): “[2]: The authors propose methods based exclusively on Pareto dominance for selecting leaders from an unconstrained nondominated (external) archive.”
Particle swarm optimization algorithm embedded with maximum deviation theory for solving multi-objective flexible job shop scheduling problem (2015, background): “Archive size control is critical because the number of non-dominated solutions can grow very fast although there are studies where archive size is unconstrained [33].”
Multi-objective process optimization for micro-end milling of Ti-6Al-4V titanium alloy (2012, unknown): “[1] is adopted.”
Two-echelon multiple-vehicle location-routing problem with time windows for optimization of sustainable supply chain network of perishable food (2014, unknown): “A simplified approach to select the leader might be performed as a random selection of non-dominated solutions (Alvarez-Benitez et al., 2005).”