Please use this identifier to cite or link to this item:
|Title:||Efficient particle swarm optimization: A termination condition based on the decision-making approach|
|Citation:||Kwok, N.M., Ha, Q.P., Liu, D.K., Fang, G., Tan, K.C. (2007). Efficient particle swarm optimization: A termination condition based on the decision-making approach. 2007 IEEE Congress on Evolutionary Computation, CEC 2007 : 3353-3360. ScholarBank@NUS Repository. https://doi.org/10.1109/CEC.2007.4424905|
|Abstract:||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. © 2007 IEEE.|
|Source Title:||2007 IEEE Congress on Evolutionary Computation, CEC 2007|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Jul 17, 2018
WEB OF SCIENCETM
checked on Jun 27, 2018
checked on Jun 29, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.