Framework and experimental analysis of generalised surrogate-assisted particle swarm optimisation Online publication date: Tue, 04-Oct-2022
by Rui Dai; Jing Jie; Hui Zheng; Miao Zhang; Yixiao Lu
International Journal of Computing Science and Mathematics (IJCSM), Vol. 15, No. 4, 2022
Abstract: The paper develops a framework of generalised surrogate-assisted particle swarm optimisation (GS-PSO) to solve computationally expensive problems. To ensure the generalisation ability and optimisation accuracy of the algorithm, some researches about the factors of GS-PSO and selection of surrogates have been done. Some statistics indexes such as accuracy, robustness, and scalability are formulated to evaluate six popular metamodels, which can help to choose the proper surrogates for GS-PSO during the optimisation process. A series of simulation experiments are conducted based on some notable benchmark functions. The results show that GS-PSO with RBF is a robust surrogate-assisted algorithm for computationally expensive problems. Meanwhile, a proper combination of optimisers and surrogates can contribute to an improvement of GS-PSO for different optimisation problems.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Computing Science and Mathematics (IJCSM):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook