Simplex search-based brain storm optimization

Wei Chen, Yingying Cao, Shi Cheng, Yifei Sun, Qunfeng Liu, Yun Li

Research output: Contribution to journalArticle

1 Citation (Scopus)

Abstract

Through modeling human's brainstorming process, the brain storm optimization (BSO) algorithm has become a promising population-based evolutionary algorithm. However, BSO is pointed out that it possesses a degenerated L-curve phenomenon, i.e., it often gets near optimum quickly but needs much more cost to improve the accuracy. To overcome this question in this paper, an excellent direct search-based local solver, the Nelder-Mead Simplex method is adopted in BSO. Through combining BSO's exploration ability and NMS's exploitation ability together, a simplex search-based BSO (Simplex-BSO) is developed via a better balance between global exploration and local exploitation. Simplex-BSO is shown to be able to eliminate the degenerated L-curve phenomenon on unimodal functions, and alleviate significantly this phenomenon on multimodal functions. Large number of experimental results shows that Simplex-BSO is a promising algorithm for global optimization problems.

LanguageEnglish
Pages75997-76006
Number of pages10
JournalIEEE Access
Volume6
DOIs
Publication statusPublished - 27 Nov 2018

Fingerprint

Brain
Global optimization
Evolutionary algorithms
Costs

Keywords

  • brain storm optimization
  • global exploration
  • local exploitation
  • Nelder-Mead simplex method
  • visualizing confidence intervals

Cite this

Chen, W., Cao, Y., Cheng, S., Sun, Y., Liu, Q., & Li, Y. (2018). Simplex search-based brain storm optimization. IEEE Access, 6, 75997-76006. https://doi.org/10.1109/ACCESS.2018.2883506
Chen, Wei ; Cao, Yingying ; Cheng, Shi ; Sun, Yifei ; Liu, Qunfeng ; Li, Yun. / Simplex search-based brain storm optimization. In: IEEE Access. 2018 ; Vol. 6. pp. 75997-76006.
@article{4f6f66c32f33401cab114a91d0e3fb0d,
title = "Simplex search-based brain storm optimization",
abstract = "Through modeling human's brainstorming process, the brain storm optimization (BSO) algorithm has become a promising population-based evolutionary algorithm. However, BSO is pointed out that it possesses a degenerated L-curve phenomenon, i.e., it often gets near optimum quickly but needs much more cost to improve the accuracy. To overcome this question in this paper, an excellent direct search-based local solver, the Nelder-Mead Simplex method is adopted in BSO. Through combining BSO's exploration ability and NMS's exploitation ability together, a simplex search-based BSO (Simplex-BSO) is developed via a better balance between global exploration and local exploitation. Simplex-BSO is shown to be able to eliminate the degenerated L-curve phenomenon on unimodal functions, and alleviate significantly this phenomenon on multimodal functions. Large number of experimental results shows that Simplex-BSO is a promising algorithm for global optimization problems.",
keywords = "brain storm optimization, global exploration, local exploitation, Nelder-Mead simplex method, visualizing confidence intervals",
author = "Wei Chen and Yingying Cao and Shi Cheng and Yifei Sun and Qunfeng Liu and Yun Li",
note = "{\circledC} 2018 IEEE. Translations and content mining are permitted for academic research only. Personal use is also permitted, but republication/redistribution requires IEEE permission.",
year = "2018",
month = "11",
day = "27",
doi = "10.1109/ACCESS.2018.2883506",
language = "English",
volume = "6",
pages = "75997--76006",
journal = "IEEE Access",
issn = "2169-3536",
publisher = "IEEE",

}

Chen, W, Cao, Y, Cheng, S, Sun, Y, Liu, Q & Li, Y 2018, 'Simplex search-based brain storm optimization' IEEE Access, vol. 6, pp. 75997-76006. https://doi.org/10.1109/ACCESS.2018.2883506

Simplex search-based brain storm optimization. / Chen, Wei; Cao, Yingying; Cheng, Shi; Sun, Yifei; Liu, Qunfeng; Li, Yun.

In: IEEE Access, Vol. 6, 27.11.2018, p. 75997-76006.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Simplex search-based brain storm optimization

AU - Chen, Wei

AU - Cao, Yingying

AU - Cheng, Shi

AU - Sun, Yifei

AU - Liu, Qunfeng

AU - Li, Yun

N1 - © 2018 IEEE. Translations and content mining are permitted for academic research only. Personal use is also permitted, but republication/redistribution requires IEEE permission.

PY - 2018/11/27

Y1 - 2018/11/27

N2 - Through modeling human's brainstorming process, the brain storm optimization (BSO) algorithm has become a promising population-based evolutionary algorithm. However, BSO is pointed out that it possesses a degenerated L-curve phenomenon, i.e., it often gets near optimum quickly but needs much more cost to improve the accuracy. To overcome this question in this paper, an excellent direct search-based local solver, the Nelder-Mead Simplex method is adopted in BSO. Through combining BSO's exploration ability and NMS's exploitation ability together, a simplex search-based BSO (Simplex-BSO) is developed via a better balance between global exploration and local exploitation. Simplex-BSO is shown to be able to eliminate the degenerated L-curve phenomenon on unimodal functions, and alleviate significantly this phenomenon on multimodal functions. Large number of experimental results shows that Simplex-BSO is a promising algorithm for global optimization problems.

AB - Through modeling human's brainstorming process, the brain storm optimization (BSO) algorithm has become a promising population-based evolutionary algorithm. However, BSO is pointed out that it possesses a degenerated L-curve phenomenon, i.e., it often gets near optimum quickly but needs much more cost to improve the accuracy. To overcome this question in this paper, an excellent direct search-based local solver, the Nelder-Mead Simplex method is adopted in BSO. Through combining BSO's exploration ability and NMS's exploitation ability together, a simplex search-based BSO (Simplex-BSO) is developed via a better balance between global exploration and local exploitation. Simplex-BSO is shown to be able to eliminate the degenerated L-curve phenomenon on unimodal functions, and alleviate significantly this phenomenon on multimodal functions. Large number of experimental results shows that Simplex-BSO is a promising algorithm for global optimization problems.

KW - brain storm optimization

KW - global exploration

KW - local exploitation

KW - Nelder-Mead simplex method

KW - visualizing confidence intervals

UR - http://www.scopus.com/inward/record.url?scp=85057857076&partnerID=8YFLogxK

UR - https://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=6287639

U2 - 10.1109/ACCESS.2018.2883506

DO - 10.1109/ACCESS.2018.2883506

M3 - Article

VL - 6

SP - 75997

EP - 76006

JO - IEEE Access

T2 - IEEE Access

JF - IEEE Access

SN - 2169-3536

ER -

Chen W, Cao Y, Cheng S, Sun Y, Liu Q, Li Y. Simplex search-based brain storm optimization. IEEE Access. 2018 Nov 27;6:75997-76006. https://doi.org/10.1109/ACCESS.2018.2883506