title: D2MOPSO: MOPSO based on decomposition and dominance with archiving using crowding distance in objective and solution spaces.
abstract: This paper improves a recently developed multi-objective particle swarm optimizer (D2MOPSO) that incorporates dominance with decomposition used in the context of multi-objective optimization. Decomposition simplifies a multi-objective problem (MOP) by transforming it to a set of aggregation problems, whereas dominance plays a major role in building the leaders' archive. D2MOPSO introduces a new archiving technique that facilitates attaining better diversity and coverage in both objective and solution spaces. The improved method is evaluated on standard benchmarks including both constrained and unconstrained test problems, by comparing it with three state of the art multi-objective evolutionary algorithms: MOEA/D, OMOPSO, and dMOPSO. The comparison and analysis of the experimental results, supported by statistical tests, indicate that the proposed algorithm is highly competitive, efficient, and applicable to a wide range of multi-objective optimization problems.
authors.affiliation: Robert Gordon University, Aberdeen, AB25 1HG, UK n.al-moubayed@rgu.ac.uk.
authors.forename: N
authors.initials: N
authors.lastname: Al Moubayed
authors.forename: A
authors.initials: A
authors.lastname: Petrovski
authors.forename: J
authors.initials: J
authors.lastname: McCall
mesh_terms: D000465:Algorithms; D001109:Archives; D003198:Computer Simulation; D003205:Computing Methodologies; D003661:Decision Support Techniques; D008962:Models, Theoretical