Multiobjective particle swarm optimization with nondominated local and global sets

DOI10.1007/S11047-009-9171-7MaRDI QIDQ601035zbMATH OpenOpenAlexFDO

Authors Mohammad Ali Abido

Publication date 3 November 2010

Published in Natural Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s11047-009-9171-7

zbMATH Keywords

Pareto-optimal set

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• A novel strategy of Pareto-optimal solution searching in multi-objective particle swarm optimization (MOPSO)
• Multiobjective particle swarm optimization based on Pareto entropy
• Evolutionary Multi-Criterion Optimization
• Multi-objective particle swarm optimization algorithm with local optimal particles search method
• An attractor-based multiobjective particle swarm optimization

Cites work

• scientific article; zbMATH DE number 2013444 (Why is no real title available?)
• A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem
• Comprehensive learning particle swarm optimizer for solving multiobjective optimization problems
• Multi-objective optimization using evolutionary algorithms

Cited in

(3)

• Evolutionary Multi-Criterion Optimization
• Immune clonal coevolutionary algorithm for dynamic multiobjective optimization
• A novel multiobjective quantum-behaved particle swarm optimization based on the ring model

Describes a project that uses

Uses Software

• SPEA2
• MOPSO

This page was built for publication: Multiobjective particle swarm optimization with nondominated local and global sets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q601035)