%0 Journal Article
%T Improved discrete PSO algorithm and its application in winner determination problem<br>改进的离散粒子群优化算法及其在竞胜标确定问题中的应用
%A WANG Zhen
%A MA Fei-teng
%A <br>王真
%A 马飞腾
%J 计算机应用
%D 2008
%I 
%X A kind of discrete Particle Swarm Optimization (PSO) algorithm named NDPSO was proposed for extending the classic PSO model to solve the discrete optimization problems with high effectiveness and stability. The concept of comparison with probability was also introduced based on NDPSO, and then the stochastic repairing operator was constructed for heuristic search to solve the Winner Determination Problem (WDP) in combinatory auction. The experimental results show that NDPSO has great advantages in both success rate and convergence speed compared with other discrete PSO algorithms and genetic algorithm.
%K combinatory auction
%K winner determination
%K discrete Particle Swarm Optimization (PSO)
%K stochastic repairing operator
%K artificial life computation<br>组合拍卖
%K 竞胜标确定
%K 离散粒子群优化算法
%K 随机修补算子
%K 人工生命计算
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=831E194C147C78FAAFCC50BC7ADD1732&aid=A8A67C245A2F71242D5B74C0F2E90DED&yid=67289AFF6305E306&vid=D3E34374A0D77D7F&iid=F3090AE9B60B7ED1&sid=E4C02974137E9C5F&eid=16A32B3F11A2E663&journal_id=1001-9081&journal_name=计算机应用&referenced_num=1&reference_num=15