Introduction to algorithms
Opposition-Based Learning: A New Scheme for Machine Intelligence
CIMCA '05 Proceedings of the International Conference on Computational Intelligence for Modelling, Control and Automation and International Conference on Intelligent Agents, Web Technologies and Internet Commerce Vol-1 (CIMCA-IAWTIC'06) - Volume 01
No Velocity Particle Swarm Optimiser with Forgetting Factor and Center
ICNC '09 Proceedings of the 2009 Fifth International Conference on Natural Computation - Volume 03
A fast and elitist multiobjective genetic algorithm: NSGA-II
IEEE Transactions on Evolutionary Computation
Handling multiple objectives with particle swarm optimization
IEEE Transactions on Evolutionary Computation
Hi-index | 0.00 |
A velocity-free multi-objective particle swarm optimizer with centroid is proposed and applied to optimization of wireless sensor network. Different from the standard PSO, particles in swarm only have position without velocity in the algorithm. Besides, not only the personal best position and the global best position but also the centroid is considered to update the particle position. The initial swarm is generated using the opposition-based learning, and an archive with maximum capacity is used to maintain the non-dominated solutions. The global best solution is selected from the archive on the basis of the diversity of the solutions, and the crowding-distance measure is used for the diversity measurement. The archive gets updated with the inclusion of the non-dominated solutions from the combined population of the swarm and current archive, and the archive which exceeds the maximum capacity is cut using the diversity consideration. The proposed algorithm is applied to some well-known benchmark and optimization of wireless sensor network by maximizing network coverage and lifetime. The relative experimental results show that the algorithm has better performance and is effective.