Improved discrete PSO algorithm and its application in winner determination problem

DOI10.3724/SP.J.1087.2008.02521MaRDI QIDQ5188872zbMATH OpenOpenAlexFDO

Authors Zhen Wang, Yang Yi

Publication date 6 March 2010

Published in Journal of Computer Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3724/sp.j.1087.2008.02521

zbMATH Keywords

artificial life computationcombinatory auctiondiscrete particle swarm optimization (PSO)stochastic repairing operatorwinner determination

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• An improved binary particle swarm optimization for discrete optimization problems
• An effective discrete dynamic convexized method for solving the winner determination problem
• A knowledge-supported improvement of the PSO method
• Application of an improved PSO algorithm to reliability problems
• An improved PSO algorithm for function optimization
• Improved PSO algorithm with adaptive neighborhood
• Research on Hybrid Improved PSO Algorithm
• An improved GA and a novel PSO-GA-based hybrid algorithm

Cited in

(1)

• The new treatment mode research of hepatitis B based on ant colony algorithm

This page was built for publication: Improved discrete PSO algorithm and its application in winner determination problem

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