Abstract
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.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Paper version not known
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
