Efficient Surrogate Modeling Method for Evolutionary Algorithm to Solve Bilevel Optimization Problems

The purpose of this study was to develop an evolutionary algorithm (EA) with bilevel surrogate modeling, called BL-SAEA, for tackling bilevel optimization problems (BLOPs), in which an upper level problem is to be solved subject to the optimality of a corresponding lower level problem. The motivatio...

Full description

Saved in:
Bibliographic Details
Published inIEEE transactions on cybernetics Vol. 54; no. 7; pp. 4335 - 4347
Main Authors Jiang, Hao, Chou, Kang, Tian, Ye, Zhang, Xingyi, Jin, Yaochu
Format Journal Article
LanguageEnglish
Published United States IEEE 01.07.2024
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects
Online AccessGet full text

Cover

Loading…
Abstract The purpose of this study was to develop an evolutionary algorithm (EA) with bilevel surrogate modeling, called BL-SAEA, for tackling bilevel optimization problems (BLOPs), in which an upper level problem is to be solved subject to the optimality of a corresponding lower level problem. The motivation of this article is that the extensive lower level optimization required by each upper level solution consumes too many function evaluations, leading to poor optimization performance of EAs. To this end, during the upper level optimization, the BL-SAEA builds an upper level surrogate model to select several promising upper level solutions for the lower level optimization. Because only a small number of upper level solutions require the lower level optimization, the number of function evaluations can be considerably reduced. During the lower level optimization, the BL-SAEA constructs multiple lower level surrogate models to initialize the population of the lower level optimization, thus further decreasing the number of function evaluations. Experimental results on two widely used benchmarks and two real-world BLOPs demonstrate the superiority of our proposed algorithm over six state-of-the-art algorithms in terms of effectiveness and efficiency.
AbstractList The purpose of this study was to develop an evolutionary algorithm (EA) with bilevel surrogate modeling, called BL-SAEA, for tackling bilevel optimization problems (BLOPs), in which an upper level problem is to be solved subject to the optimality of a corresponding lower level problem. The motivation of this article is that the extensive lower level optimization required by each upper level solution consumes too many function evaluations, leading to poor optimization performance of EAs. To this end, during the upper level optimization, the BL-SAEA builds an upper level surrogate model to select several promising upper level solutions for the lower level optimization. Because only a small number of upper level solutions require the lower level optimization, the number of function evaluations can be considerably reduced. During the lower level optimization, the BL-SAEA constructs multiple lower level surrogate models to initialize the population of the lower level optimization, thus further decreasing the number of function evaluations. Experimental results on two widely used benchmarks and two real-world BLOPs demonstrate the superiority of our proposed algorithm over six state-of-the-art algorithms in terms of effectiveness and efficiency.The purpose of this study was to develop an evolutionary algorithm (EA) with bilevel surrogate modeling, called BL-SAEA, for tackling bilevel optimization problems (BLOPs), in which an upper level problem is to be solved subject to the optimality of a corresponding lower level problem. The motivation of this article is that the extensive lower level optimization required by each upper level solution consumes too many function evaluations, leading to poor optimization performance of EAs. To this end, during the upper level optimization, the BL-SAEA builds an upper level surrogate model to select several promising upper level solutions for the lower level optimization. Because only a small number of upper level solutions require the lower level optimization, the number of function evaluations can be considerably reduced. During the lower level optimization, the BL-SAEA constructs multiple lower level surrogate models to initialize the population of the lower level optimization, thus further decreasing the number of function evaluations. Experimental results on two widely used benchmarks and two real-world BLOPs demonstrate the superiority of our proposed algorithm over six state-of-the-art algorithms in terms of effectiveness and efficiency.
The purpose of this study was to develop an evolutionary algorithm (EA) with bilevel surrogate modeling, called BL-SAEA, for tackling bilevel optimization problems (BLOPs), in which an upper level problem is to be solved subject to the optimality of a corresponding lower level problem. The motivation of this article is that the extensive lower level optimization required by each upper level solution consumes too many function evaluations, leading to poor optimization performance of EAs. To this end, during the upper level optimization, the BL-SAEA builds an upper level surrogate model to select several promising upper level solutions for the lower level optimization. Because only a small number of upper level solutions require the lower level optimization, the number of function evaluations can be considerably reduced. During the lower level optimization, the BL-SAEA constructs multiple lower level surrogate models to initialize the population of the lower level optimization, thus further decreasing the number of function evaluations. Experimental results on two widely used benchmarks and two real-world BLOPs demonstrate the superiority of our proposed algorithm over six state-of-the-art algorithms in terms of effectiveness and efficiency.
Author Zhang, Xingyi
Chou, Kang
Tian, Ye
Jin, Yaochu
Jiang, Hao
Author_xml – sequence: 1
  givenname: Hao
  surname: Jiang
  fullname: Jiang, Hao
  email: haojiang@ahu.edu.cn
  organization: Key Laboratory of Intelligent Computing and Signal Processing of Ministry of Education, School of Artificial Intelligence, Anhui University, Hefei, China
– sequence: 2
  givenname: Kang
  surname: Chou
  fullname: Chou, Kang
  email: e20201002@stu.ahu.edu.cn
  organization: Key Laboratory of Intelligent Computing and Signal Processing of Ministry of Education, School of Artificial Intelligence, Anhui University, Hefei, China
– sequence: 3
  givenname: Ye
  orcidid: 0000-0002-3487-5126
  surname: Tian
  fullname: Tian, Ye
  email: field910921@gmail.com
  organization: Key Laboratory of Intelligent Computing and Signal Processing of Ministry of Education, Institutes of Physical Science and Information Technology, Anhui University, Hefei, China
– sequence: 4
  givenname: Xingyi
  orcidid: 0000-0002-5052-000X
  surname: Zhang
  fullname: Zhang, Xingyi
  email: xyzhanghust@gmail.com
  organization: Key Laboratory of Intelligent Computing and Signal Processing of Ministry of Education, School of Artificial Intelligence, Anhui University, Hefei, China
– sequence: 5
  givenname: Yaochu
  surname: Jin
  fullname: Jin, Yaochu
  email: yaochu.jin@uni-bielefeld.de
  organization: Chair of Nature Inspired Computing and Engineering, Faculty of Technology, Bielefeld University, Bielefeld, Germany
BackLink https://www.ncbi.nlm.nih.gov/pubmed/37703145$$D View this record in MEDLINE/PubMed
BookMark eNp9kU1vEzEQhi1UREvpD0BCyBKXXhL8seuPYxulgNSqSC0HTpbXmU1dedfB9kaCX49DUoR6YC4ejZ535Hnf1-hojCMg9JaSOaVEf7xffL-cM8L4nHOiW61eoBNGhZoxJtujv72Qx-gs50dSS9WRVq_QMZeScNq0JwiWfe-dh7HguymluLYF8E1cQfDjGt9AeYgr3MeEl9sYpuLjaNNPfBHWMfnyMOAS8V0MW8CXPsAWAr7dFD_4X3aH4q8pdgGG_Aa97G3IcHZ4T9G3q-X94vPs-vbTl8XF9czxlpRZRxVtuHWuV4r1omsFOKVXyrqO9ERzLay2TtB6L4VGcV3nIAmlksmmsvwUne_3blL8MUEuZvDZQQh2hDhlw5RolK5mtRX98Ax9jFMa6-8MJ1JzKTSjlXp_oKZugJXZJD9UA8yTgRWQe8ClmHOC3jhf_hxfkvXBUGJ2aZldWmaXljmkVZX0mfJp-f807_YaDwD_8KylhAr-GxmWn1M
CODEN ITCEB8
CitedBy_id crossref_primary_10_1007_s10479_024_06182_3
crossref_primary_10_1016_j_swevo_2025_101892
crossref_primary_10_1109_TCYB_2024_3492075
ContentType Journal Article
Copyright Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2024
Copyright_xml – notice: Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2024
DBID 97E
RIA
RIE
AAYXX
CITATION
NPM
7SC
7SP
7TB
8FD
F28
FR3
H8D
JQ2
L7M
L~C
L~D
7X8
DOI 10.1109/TCYB.2023.3309598
DatabaseName IEEE All-Society Periodicals Package (ASPP) 2005-present
IEEE All-Society Periodicals Package (ASPP) 1998–Present
IEEE Electronic Library (IEL)
CrossRef
PubMed
Computer and Information Systems Abstracts
Electronics & Communications Abstracts
Mechanical & Transportation Engineering Abstracts
Technology Research Database
ANTE: Abstracts in New Technology & Engineering
Engineering Research Database
Aerospace Database
ProQuest Computer Science Collection
Advanced Technologies Database with Aerospace
Computer and Information Systems Abstracts – Academic
Computer and Information Systems Abstracts Professional
MEDLINE - Academic
DatabaseTitle CrossRef
PubMed
Aerospace Database
Technology Research Database
Computer and Information Systems Abstracts – Academic
Mechanical & Transportation Engineering Abstracts
Electronics & Communications Abstracts
ProQuest Computer Science Collection
Computer and Information Systems Abstracts
Engineering Research Database
Advanced Technologies Database with Aerospace
ANTE: Abstracts in New Technology & Engineering
Computer and Information Systems Abstracts Professional
MEDLINE - Academic
DatabaseTitleList MEDLINE - Academic
Aerospace Database
PubMed

Database_xml – sequence: 1
  dbid: NPM
  name: PubMed
  url: https://proxy.k.utb.cz/login?url=http://www.ncbi.nlm.nih.gov/entrez/query.fcgi?db=PubMed
  sourceTypes: Index Database
– sequence: 2
  dbid: RIE
  name: IEEE Electronic Library (IEL)
  url: https://proxy.k.utb.cz/login?url=https://ieeexplore.ieee.org/
  sourceTypes: Publisher
DeliveryMethod fulltext_linktorsrc
Discipline Statistics
Sciences (General)
EISSN 2168-2275
EndPage 4347
ExternalDocumentID 37703145
10_1109_TCYB_2023_3309598
10251016
Genre orig-research
Journal Article
GrantInformation_xml – fundername: National Natural Science Foundation of China
  grantid: U21A20512; 61906001; 62372001
  funderid: 10.13039/501100001809
– fundername: Collaborative Innovation Program of Universities in Anhui Province
  grantid: GXXT-2020-051
– fundername: Anhui Provincial Natural Science Foundation
  grantid: 1808085J06; 1908085QF271
  funderid: 10.13039/501100003995
GroupedDBID 0R~
4.4
6IK
97E
AAJGR
AARMG
AASAJ
AAWTH
ABAZT
ABQJQ
ABVLG
ACIWK
AENEX
AGQYO
AGSQL
AHBIQ
AKJIK
AKQYR
ALMA_UNASSIGNED_HOLDINGS
ATWAV
BEFXN
BFFAM
BGNUA
BKEBE
BPEOZ
EBS
EJD
HZ~
IFIPE
IPLJI
JAVBF
M43
O9-
OCL
PQQKQ
RIA
RIE
RNS
AAYXX
CITATION
RIG
NPM
7SC
7SP
7TB
8FD
F28
FR3
H8D
JQ2
L7M
L~C
L~D
7X8
ID FETCH-LOGICAL-c350t-b18143accf882f6b56ec89d8acb0f09396a9ac613091e4839cb0e701172746ec3
IEDL.DBID RIE
ISSN 2168-2267
2168-2275
IngestDate Fri Jul 11 03:53:46 EDT 2025
Sun Jun 29 15:19:28 EDT 2025
Mon Jul 21 05:32:28 EDT 2025
Tue Jul 01 00:54:05 EDT 2025
Thu Apr 24 23:08:47 EDT 2025
Wed Aug 27 03:03:27 EDT 2025
IsPeerReviewed true
IsScholarly true
Issue 7
Language English
License https://ieeexplore.ieee.org/Xplorehelp/downloads/license-information/IEEE.html
https://doi.org/10.15223/policy-029
https://doi.org/10.15223/policy-037
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c350t-b18143accf882f6b56ec89d8acb0f09396a9ac613091e4839cb0e701172746ec3
Notes ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
content type line 23
ORCID 0000-0002-3487-5126
0000-0002-5052-000X
PMID 37703145
PQID 3079376921
PQPubID 85422
PageCount 13
ParticipantIDs proquest_journals_3079376921
pubmed_primary_37703145
ieee_primary_10251016
crossref_citationtrail_10_1109_TCYB_2023_3309598
crossref_primary_10_1109_TCYB_2023_3309598
proquest_miscellaneous_2864899595
ProviderPackageCode CITATION
AAYXX
PublicationCentury 2000
PublicationDate 2024-07-01
PublicationDateYYYYMMDD 2024-07-01
PublicationDate_xml – month: 07
  year: 2024
  text: 2024-07-01
  day: 01
PublicationDecade 2020
PublicationPlace United States
PublicationPlace_xml – name: United States
– name: Piscataway
PublicationTitle IEEE transactions on cybernetics
PublicationTitleAbbrev TCYB
PublicationTitleAlternate IEEE Trans Cybern
PublicationYear 2024
Publisher IEEE
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher_xml – name: IEEE
– name: The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
SSID ssj0000816898
Score 2.411818
Snippet The purpose of this study was to develop an evolutionary algorithm (EA) with bilevel surrogate modeling, called BL-SAEA, for tackling bilevel optimization...
SourceID proquest
pubmed
crossref
ieee
SourceType Aggregation Database
Index Database
Enrichment Source
Publisher
StartPage 4335
SubjectTerms Bilevel optimization problem (BLOP)
evolutionary algorithm (EA)
Evolutionary algorithms
Evolutionary computation
Genetic algorithms
Kriging model
Linear programming
Modelling
Optimization
Performance evaluation
Search problems
Signal processing algorithms
Social factors
State-of-the-art reviews
Statistics
surrogate model
Title Efficient Surrogate Modeling Method for Evolutionary Algorithm to Solve Bilevel Optimization Problems
URI https://ieeexplore.ieee.org/document/10251016
https://www.ncbi.nlm.nih.gov/pubmed/37703145
https://www.proquest.com/docview/3079376921
https://www.proquest.com/docview/2864899595
Volume 54
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwjV3fT9swED6NPvGyAWMsg02etAc2KSG_7MaPBRWhSbBJgARPkeM6bFrboDSpxP763dluxSaB9hYljuPozvZ3tu_7AD5pw4XC0CoUvNZhLpIiLKp4Eta0ZsH5RCWccofPL8TZdf71ht_4ZHWbC2OMsYfPTESXdi9_0uielsqwh6fkQmIDNrB6l6y1XlCxChJW-zbFixBhxdDvYiaxPLo6uT2OSCo8wgBeckk6fdnQkrfzv6Ykq7HyNNy0087pK7hYNdidNvkV9V0V6d__cDn-9x9twUsPQNnIecw2vDDzHdj2XXzBDj0P9ecd2CQg6nicX4MZW64JrI1d9m3b0OobIyE1Smdn51aHmiEAZuOld2bVPrDR9K5pf3Y_Zqxr2GUzXRp2jMPQ0kzZNxyrZj4JlH13sjaLXbg-HV-dnIVeoiHUGY-7sEKAkGdK6xqRei0qLowu5KRQuorrWGZSKKk0xSgyMTmCMbxvhsRDh9Ewls3ewGDezM1bYGmCblPj-IEIJC84zpIGp0rBh7mqE4yjA4hXViq15y8nGY1paeOYWJZk45JsXHobB_Bl_cq9I-94rvAu2edRQWeaAA5WvlD6_r0oM8srKGSaBPBx_Rh7Jm23qLlp-kWZFiIviM6NB7DnfGhd-cr13j3x0X3YxLbl7lzwAQy6tjfvEf101Qfr9X8ADwb7ig
linkProvider IEEE
linkToHtml http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwjV3fb9MwED7BeGAvg40BgQFG4gGQkuWX3fhxmzoVWAvSOmk8WY7rwETXoDSpBH89d45bAdIQb1Hrponuzved7fs-gFfGcqGxtAoFr0yYi6QIizKehRWtWXA-0wmn3uHxRIwu8veX_NI3q7teGGutO3xmI7p0e_mz2nS0VIYRnpILidtwBxM_T_p2rc2SitOQcOq3KV6ECCwGfh8zieXh9OTzcURi4RGW8JJLUurLBo6-nf-RlJzKys2A0yWe03swWT9yf97kW9S1ZWR-_sXm-N_vdB92PARlR73P7MItu9iDXR_kS_baM1G_2YNtgqI9k_MDsEPHNoF3Y-dd09S0_sZISo0a2tnYKVEzhMBsuPLurJsf7Gj-pW6u2q_XrK3ZeT1fWXaME9HKztlHnK2ufRso-9QL2yz34eJ0OD0ZhV6kITQZj9uwRIiQZ9qYCrF6JUourCnkrNCmjKtYZlJoqQ1VKTKxOcIx_NwOiIkO62Ecmz2ErUW9sI-BpQk6ToUzCGKQvOCYJy0mS8EHua4SrKQDiNdWUsYzmJOQxly5SiaWimysyMbK2ziAt5uffO_pO_41eJ_s89vA3jQBHKx9QfkIX6rMMQsKmSYBvNx8jbFJGy56YetuqdJC5AURuvEAHvU-tLn52vWe3PCnL-DuaDo-U2fvJh-ewjY-Z96fEj6Arbbp7DPEQm353EXAL1Td_tM
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Efficient+Surrogate+Modeling+Method+for+Evolutionary+Algorithm+to+Solve+Bilevel+Optimization+Problems&rft.jtitle=IEEE+transactions+on+cybernetics&rft.au=Jiang%2C+Hao&rft.au=Chou%2C+Kang&rft.au=Tian%2C+Ye&rft.au=Zhang%2C+Xingyi&rft.date=2024-07-01&rft.issn=2168-2275&rft.eissn=2168-2275&rft.volume=54&rft.issue=7&rft.spage=4335&rft_id=info:doi/10.1109%2FTCYB.2023.3309598&rft.externalDBID=NO_FULL_TEXT
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=2168-2267&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=2168-2267&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=2168-2267&client=summon