Efficient particle swarm optimization: a termination condition based on the decision-making approach

Publication Type:
Conference Proceeding
Proceedings of the IEEE Congress on Evolutionary Computation, 2007, 2007, pp. 3353 - 3360
Issue Date:
Full metadata record
Files in This Item:
Filename Description SizeFormat
2006009447.pdf1.03 MBAdobe PDF
Evolutionary computation algorithms, such as the particle swarm optimization (PSO), have been widely applied in numerical optimizations and real-world product design, not only for their satisfactory performances but also in their relaxing the need for detailed mathematical modelling of complex systems. However, as iterative heuristic searching methods, they often suffer from difficulties in obtaining high quality solutions in an efficient manner. Since unnecessary resources used in computation iterations should be avoided, the determination of a proper termination condition for the algorithms is desirable. In this work, termination is cast as a decision-making process to end the algorithm. Specifically, the non-parametric sign- test is incorporated as a hypothetical test method such that a quantifiable termination in regard to specifiable decision-errors can be assured. Benchmark optimization problems are tackled using the PSO as an illustrative optimizer to demonstrate the effectiveness of the proposed termination condition.
Please use this identifier to cite or link to this item: