Particle Swarm Optimization Based on Smoothing Approach for Solving a Class of Bi-Level Multiobjective Programming Problem

As a metaheuristic, Particle Swarm Optimization (PSO) has been used to solve the Bi-level Multiobjective Programming Problem (BMPP). However, in the existing solving approach based on PSO for the BMPP, the upper level and the lower level problem are solved interactively by PSO. In this paper, we pre...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Cybernetics and information technologies : CIT Jg. 17; H. 3; S. 59 - 74
Hauptverfasser: He, Qingping, Lv, Yibing
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Sofia Sciendo 01.09.2017
De Gruyter Brill Sp. z o.o., Paradigm Publishing Services
Schlagworte:
Bi-level multiobjective programming problem
optimality conditions
particle swarm optimization
scalarization method
smoothing method
ISSN:1314-4081, 1311-9702, 1314-4081
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Abstract As a metaheuristic, Particle Swarm Optimization (PSO) has been used to solve the Bi-level Multiobjective Programming Problem (BMPP). However, in the existing solving approach based on PSO for the BMPP, the upper level and the lower level problem are solved interactively by PSO. In this paper, we present a different solving approach based on PSO for the BMPP. Firstly, we replace the lower level problem of the BMPP with Kuhn-Tucker optimality conditions and adopt the perturbed Fischer-Burmeister function to smooth the complementary conditions. After that, we adopt PSO approach to solve the smoothed multiobjective programming problem. Numerical results show that our solving approach can obtain the Pareto optimal front of the BMPP efficiently.
AbstractList As a metaheuristic, Particle Swarm Optimization (PSO) has been used to solve the Bi-level Multiobjective Programming Problem (BMPP). However, in the existing solving approach based on PSO for the BMPP, the upper level and the lower level problem are solved interactively by PSO. In this paper, we present a different solving approach based on PSO for the BMPP. Firstly, we replace the lower level problem of the BMPP with Kuhn-Tucker optimality conditions and adopt the perturbed Fischer-Burmeister function to smooth the complementary conditions. After that, we adopt PSO approach to solve the smoothed multiobjective programming problem. Numerical results show that our solving approach can obtain the Pareto optimal front of the BMPP efficiently.
Author He, Qingping
Lv, Yibing
Author_xml – sequence: 1
  givenname: Qingping
  surname: He
  fullname: He, Qingping
  email: Heqp_2017@163.com
  organization: School of Information and Mathematics, Yangtze University, Jingzhou 434023, China
– sequence: 2
  givenname: Yibing
  surname: Lv
  fullname: Lv, Yibing
  email: lvyibing_2001@163.com
  organization: School of Information and Mathematics, Yangtze University, Jingzhou 434023, China
BookMark eNp1UU1rGzEUXEoKTdNcexb0vKmeJe1q6Skx_Qi4JOD2LN5KWkdGu3Il2SH59dXGKS2l1UXD480wb-Z1dTKFyVbVW6AXIEC81-hyvaDQ1pQy-qI6BQa85lTCyR_4VXWe0paWxzsGUpxWj7cYs9PekvU9xpHc7LIb3SNmFyZyhckaUsB6DCHfuWlDLne7GFDfkSFEsg7-MA-RLD2mRMJArly9sgfryde9Lxr91ursDpbcxrCJOI7zesG9t-Ob6uWAPtnz5_-s-v7p47fll3p18_l6ebmqNeO0qwVrDEdjFwZaoMI0A9KO6raVnTQacegaYSiyAZpypwYju4XuBylg0fG-b9lZdX3UNQG3ahfdiPFBBXTqaRDiRj1noFBIzcEwKwbgwkqU1FLgfdtIA2h10Xp31Cop_NjblNU27ONU7CsGQrS0Y5KWLX7c0jGkFO2gtMtPkeaIziugai5NzaWpuTQ1l1ZoF3_Rfpn9L-HDkXCPPtto7CbuHwr4berfRGiZ6NhP98-vfQ
CitedBy_id crossref_primary_10_1080_09540091_2022_2077312
crossref_primary_10_1109_TEVC_2023_3296536
crossref_primary_10_1080_00207543_2021_2011464
crossref_primary_10_2478_cait_2018_0039
Cites_doi 10.1515/cait-2017-0019
10.1007/s00521-015-2073-y
10.1016/S0191-2615(00)00025-4
10.1016/j.aml.2009.09.007
10.1016/j.eswa.2011.02.069
10.1155/2012/626717
10.1515/cait-2015-0068
10.1007/s10479-007-0176-2
10.1016/j.ejor.2008.06.026
10.1023/A:1021729618112
10.1016/j.cam.2008.12.010
10.1007/s10107-011-0508-5
10.1515/cait-2015-0026
10.1007/978-3-642-02298-2_3
10.1007/s10661-016-5689-1
10.2478/cait-2014-0037
10.1007/s10107-008-0259-0
10.2298/FIL1504773L
10.1007/s40305-014-0059-6
ContentType Journal Article
Copyright 2017. This work is published under http://creativecommons.org/licenses/by-nc-nd/3.0 (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.
Copyright_xml – notice: 2017. This work is published under http://creativecommons.org/licenses/by-nc-nd/3.0 (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.
DBID AAYXX
CITATION
ABUWG
AFKRA
AZQEC
BENPR
CCPQU
DWQXO
PHGZM
PHGZT
PIMPY
PKEHL
PQEST
PQQKQ
PQUKI
PRINS
DOA
DOI 10.1515/cait-2017-0030
DatabaseName CrossRef
ProQuest Central (Alumni)
ProQuest Central UK/Ireland
ProQuest Central Essentials - QC
ProQuest Central
ProQuest One
ProQuest Central Korea
ProQuest Central Premium
ProQuest One Academic (New)
Publicly Available Content Database
ProQuest One Academic Middle East (New)
ProQuest One Academic Eastern Edition (DO NOT USE)
ProQuest One Academic (retired)
ProQuest One Academic UKI Edition
ProQuest Central China
DOAJ Directory of Open Access Journals
DatabaseTitle CrossRef
Publicly Available Content Database
ProQuest One Academic Middle East (New)
ProQuest Central Essentials
ProQuest One Academic Eastern Edition
ProQuest Central (Alumni Edition)
ProQuest One Community College
ProQuest Central China
ProQuest Central
ProQuest One Academic UKI Edition
ProQuest Central Korea
ProQuest Central (New)
ProQuest One Academic
ProQuest One Academic (New)
DatabaseTitleList CrossRef
Publicly Available Content Database
Database_xml – sequence: 1
  dbid: DOA
  name: DOAJ Directory of Open Access Journals
  url: https://www.doaj.org/
  sourceTypes: Open Website
– sequence: 2
  dbid: PIMPY
  name: Publicly Available Content Database
  url: http://search.proquest.com/publiccontent
  sourceTypes: Aggregation Database
DeliveryMethod fulltext_linktorsrc
Discipline Sciences (General)
EISSN 1314-4081
EndPage 74
ExternalDocumentID oai_doaj_org_article_a58c41d3e5f145e8a80e014b768d1aec
10_1515_cait_2017_0030
10_1515_cait_2017_003017359
GroupedDBID 0R~
4.4
5VS
9WM
AATOW
ABFKT
ACGFS
ADBBV
ADBLJ
AFFHD
AFKRA
AHGSO
AIKXB
ALMA_UNASSIGNED_HOLDINGS
BCNDV
BENPR
CCPQU
E0C
EBS
EJD
GROUPED_DOAJ
HZ~
J9A
KQ8
O9-
OK1
P2P
PHGZM
PHGZT
PIMPY
QD8
RNS
SA.
SLJYH
AAYXX
CITATION
ABUWG
AZQEC
DWQXO
PKEHL
PQEST
PQQKQ
PQUKI
PRINS
ID FETCH-LOGICAL-c3409-536d4ade2d17105d6fa090c77898dcaaf965d0a3f16131c1d892cbf851294bb73
IEDL.DBID DOA
ISSN 1314-4081
1311-9702
IngestDate Mon Nov 10 04:30:29 EST 2025
Sun Oct 19 01:38:07 EDT 2025
Tue Nov 18 21:45:06 EST 2025
Sat Nov 29 06:39:39 EST 2025
Sat Nov 29 01:31:33 EST 2025
IsDoiOpenAccess true
IsOpenAccess true
IsPeerReviewed true
IsScholarly true
Issue 3
Language English
License This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 3.0 License.
http://creativecommons.org/licenses/by-nc-nd/3.0
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c3409-536d4ade2d17105d6fa090c77898dcaaf965d0a3f16131c1d892cbf851294bb73
Notes ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
OpenAccessLink https://doaj.org/article/a58c41d3e5f145e8a80e014b768d1aec
PQID 3155709380
PQPubID 6783493
PageCount 16
ParticipantIDs doaj_primary_oai_doaj_org_article_a58c41d3e5f145e8a80e014b768d1aec
proquest_journals_3155709380
crossref_citationtrail_10_1515_cait_2017_0030
crossref_primary_10_1515_cait_2017_0030
walterdegruyter_journals_10_1515_cait_2017_003017359
PublicationCentury 2000
PublicationDate 2017-9-1
PublicationDateYYYYMMDD 2017-09-01
PublicationDate_xml – month: 09
  year: 2017
  text: 2017-9-1
  day: 01
PublicationDecade 2010
PublicationPlace Sofia
PublicationPlace_xml – name: Sofia
PublicationTitle Cybernetics and information technologies : CIT
PublicationYear 2017
Publisher Sciendo
De Gruyter Brill Sp. z o.o., Paradigm Publishing Services
Publisher_xml – name: Sciendo
– name: De Gruyter Brill Sp. z o.o., Paradigm Publishing Services
References 2021040813134634847_j_cait-2017-0030_ref_002_w2aab3b7b3b1b6b1ab1ab2Aa
2021040813134634847_j_cait-2017-0030_ref_013_w2aab3b7b3b1b6b1ab1ac13Aa
2021040813134634847_j_cait-2017-0030_ref_026_w2aab3b7b3b1b6b1ab1ac26Aa
2021040813134634847_j_cait-2017-0030_ref_001_w2aab3b7b3b1b6b1ab1ab1Aa
2021040813134634847_j_cait-2017-0030_ref_017_w2aab3b7b3b1b6b1ab1ac17Aa
2021040813134634847_j_cait-2017-0030_ref_023_w2aab3b7b3b1b6b1ab1ac23Aa
2021040813134634847_j_cait-2017-0030_ref_021_w2aab3b7b3b1b6b1ab1ac21Aa
2021040813134634847_j_cait-2017-0030_ref_014_w2aab3b7b3b1b6b1ab1ac14Aa
2021040813134634847_j_cait-2017-0030_ref_004_w2aab3b7b3b1b6b1ab1ab4Aa
2021040813134634847_j_cait-2017-0030_ref_030_w2aab3b7b3b1b6b1ab1ac30Aa
2021040813134634847_j_cait-2017-0030_ref_018_w2aab3b7b3b1b6b1ab1ac18Aa
2021040813134634847_j_cait-2017-0030_ref_003_w2aab3b7b3b1b6b1ab1ab3Aa
2021040813134634847_j_cait-2017-0030_ref_027_w2aab3b7b3b1b6b1ab1ac27Aa
2021040813134634847_j_cait-2017-0030_ref_011_w2aab3b7b3b1b6b1ab1ac11Aa
2021040813134634847_j_cait-2017-0030_ref_024_w2aab3b7b3b1b6b1ab1ac24Aa
2021040813134634847_j_cait-2017-0030_ref_007_w2aab3b7b3b1b6b1ab1ab7Aa
2021040813134634847_j_cait-2017-0030_ref_006_w2aab3b7b3b1b6b1ab1ab6Aa
2021040813134634847_j_cait-2017-0030_ref_015_w2aab3b7b3b1b6b1ab1ac15Aa
2021040813134634847_j_cait-2017-0030_ref_020_w2aab3b7b3b1b6b1ab1ac20Aa
2021040813134634847_j_cait-2017-0030_ref_019_w2aab3b7b3b1b6b1ab1ac19Aa
2021040813134634847_j_cait-2017-0030_ref_005_w2aab3b7b3b1b6b1ab1ab5Aa
2021040813134634847_j_cait-2017-0030_ref_028_w2aab3b7b3b1b6b1ab1ac28Aa
2021040813134634847_j_cait-2017-0030_ref_012_w2aab3b7b3b1b6b1ab1ac12Aa
2021040813134634847_j_cait-2017-0030_ref_010_w2aab3b7b3b1b6b1ab1ac10Aa
2021040813134634847_j_cait-2017-0030_ref_009_w2aab3b7b3b1b6b1ab1ab9Aa
2021040813134634847_j_cait-2017-0030_ref_029_w2aab3b7b3b1b6b1ab1ac29Aa
2021040813134634847_j_cait-2017-0030_ref_025_w2aab3b7b3b1b6b1ab1ac25Aa
2021040813134634847_j_cait-2017-0030_ref_008_w2aab3b7b3b1b6b1ab1ab8Aa
2021040813134634847_j_cait-2017-0030_ref_016_w2aab3b7b3b1b6b1ab1ac16Aa
2021040813134634847_j_cait-2017-0030_ref_022_w2aab3b7b3b1b6b1ab1ac22Aa
References_xml – ident: 2021040813134634847_j_cait-2017-0030_ref_002_w2aab3b7b3b1b6b1ab1ab2Aa
  doi: 10.1515/cait-2017-0019
– ident: 2021040813134634847_j_cait-2017-0030_ref_030_w2aab3b7b3b1b6b1ab1ac30Aa
  doi: 10.1007/s00521-015-2073-y
– ident: 2021040813134634847_j_cait-2017-0030_ref_004_w2aab3b7b3b1b6b1ab1ab4Aa
  doi: 10.1016/S0191-2615(00)00025-4
– ident: 2021040813134634847_j_cait-2017-0030_ref_003_w2aab3b7b3b1b6b1ab1ab3Aa
  doi: 10.1016/j.aml.2009.09.007
– ident: 2021040813134634847_j_cait-2017-0030_ref_006_w2aab3b7b3b1b6b1ab1ab6Aa
– ident: 2021040813134634847_j_cait-2017-0030_ref_023_w2aab3b7b3b1b6b1ab1ac23Aa
  doi: 10.1016/j.eswa.2011.02.069
– ident: 2021040813134634847_j_cait-2017-0030_ref_016_w2aab3b7b3b1b6b1ab1ac16Aa
– ident: 2021040813134634847_j_cait-2017-0030_ref_020_w2aab3b7b3b1b6b1ab1ac20Aa
  doi: 10.1155/2012/626717
– ident: 2021040813134634847_j_cait-2017-0030_ref_029_w2aab3b7b3b1b6b1ab1ac29Aa
  doi: 10.1515/cait-2015-0068
– ident: 2021040813134634847_j_cait-2017-0030_ref_007_w2aab3b7b3b1b6b1ab1ab7Aa
  doi: 10.1007/s10479-007-0176-2
– ident: 2021040813134634847_j_cait-2017-0030_ref_001_w2aab3b7b3b1b6b1ab1ab1Aa
– ident: 2021040813134634847_j_cait-2017-0030_ref_019_w2aab3b7b3b1b6b1ab1ac19Aa
– ident: 2021040813134634847_j_cait-2017-0030_ref_018_w2aab3b7b3b1b6b1ab1ac18Aa
– ident: 2021040813134634847_j_cait-2017-0030_ref_011_w2aab3b7b3b1b6b1ab1ac11Aa
  doi: 10.1016/j.ejor.2008.06.026
– ident: 2021040813134634847_j_cait-2017-0030_ref_024_w2aab3b7b3b1b6b1ab1ac24Aa
– ident: 2021040813134634847_j_cait-2017-0030_ref_010_w2aab3b7b3b1b6b1ab1ac10Aa
– ident: 2021040813134634847_j_cait-2017-0030_ref_008_w2aab3b7b3b1b6b1ab1ab8Aa
  doi: 10.1023/A:1021729618112
– ident: 2021040813134634847_j_cait-2017-0030_ref_022_w2aab3b7b3b1b6b1ab1ac22Aa
– ident: 2021040813134634847_j_cait-2017-0030_ref_012_w2aab3b7b3b1b6b1ab1ac12Aa
  doi: 10.1016/j.cam.2008.12.010
– ident: 2021040813134634847_j_cait-2017-0030_ref_005_w2aab3b7b3b1b6b1ab1ab5Aa
  doi: 10.1007/s10107-011-0508-5
– ident: 2021040813134634847_j_cait-2017-0030_ref_021_w2aab3b7b3b1b6b1ab1ac21Aa
– ident: 2021040813134634847_j_cait-2017-0030_ref_026_w2aab3b7b3b1b6b1ab1ac26Aa
  doi: 10.1515/cait-2015-0026
– ident: 2021040813134634847_j_cait-2017-0030_ref_015_w2aab3b7b3b1b6b1ab1ac15Aa
– ident: 2021040813134634847_j_cait-2017-0030_ref_017_w2aab3b7b3b1b6b1ab1ac17Aa
  doi: 10.1007/978-3-642-02298-2_3
– ident: 2021040813134634847_j_cait-2017-0030_ref_028_w2aab3b7b3b1b6b1ab1ac28Aa
  doi: 10.1007/s10661-016-5689-1
– ident: 2021040813134634847_j_cait-2017-0030_ref_027_w2aab3b7b3b1b6b1ab1ac27Aa
  doi: 10.2478/cait-2014-0037
– ident: 2021040813134634847_j_cait-2017-0030_ref_025_w2aab3b7b3b1b6b1ab1ac25Aa
– ident: 2021040813134634847_j_cait-2017-0030_ref_014_w2aab3b7b3b1b6b1ab1ac14Aa
  doi: 10.1007/s10107-008-0259-0
– ident: 2021040813134634847_j_cait-2017-0030_ref_009_w2aab3b7b3b1b6b1ab1ab9Aa
  doi: 10.2298/FIL1504773L
– ident: 2021040813134634847_j_cait-2017-0030_ref_013_w2aab3b7b3b1b6b1ab1ac13Aa
  doi: 10.1007/s40305-014-0059-6
SSID ssj0000493185
Score 2.084661
Snippet As a metaheuristic, Particle Swarm Optimization (PSO) has been used to solve the Bi-level Multiobjective Programming Problem (BMPP). However, in the existing...
SourceID doaj
proquest
crossref
walterdegruyter
SourceType Open Website
Aggregation Database
Enrichment Source
Index Database
Publisher
StartPage 59
SubjectTerms Bi-level multiobjective programming problem
optimality conditions
particle swarm optimization
scalarization method
smoothing method
SummonAdditionalLinks – databaseName: ProQuest Central
  dbid: BENPR
  link: http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1Lb9QwELag5cClUB5ioSAfkICDVXsdx_YJdVErDmiJWJB6i_xIqkXdTcluqeDXM-N4t4CAC7coGllOvvE87PE3hDyXThdRlwEQCJwVYx6Z8XrMrAnBGFWCGpnUbEJPp-b01FZ5w22Vyyo3NjEZ6tgF3CM_lALJoqw0_PXFF4Zdo_B0NbfQuEl2kakM9Hx3cjytPmx3WSD-xevBKesSglmN5TyJuRH8-GFw8zVMEuw0T2XQP3mmROD_S9S5d5XOr2Nz1l9-W2_OS5MbOrnzvx9wl-zlAJQeDRqzT240y3tkPy_xFX2Zeahf3Sffq6xWdHbl-gV9D9Zlka9t0gl4v0jhYbboAGxwgPQo05NTiIPprDvHrQrqaGq7SbuWTubsHZYo0XTpt_OfB1tLq6FEbIHi1dDf5gH5dHL88c1blls1sCAhQ2RKlrFwsRlHASGLimXruOVBa2NNDM61tlSRO9lCgClFENHYcfCtwXCj8F7Lh2Rn2S2bR4SWPmivfNv6wAsY1FkVo2yM9R5iQyNHhG1gqkPmMcd2Guc15jMAa42w1ggrEp_yEXmxlb8YGDz-KjlB1LdSyLydXnT9WZ3_eO2UCYWACalWFKoxzvAG0kwPaVsUrgkjcrCBv87mYFVfYz8ixW96dC3151kJLZV9_O9Rn5Dbgxpj7dsB2Vn3l81Tcit8Xc9X_bO8KH4AU64VfA
  priority: 102
  providerName: ProQuest
Title Particle Swarm Optimization Based on Smoothing Approach for Solving a Class of Bi-Level Multiobjective Programming Problem
URI https://reference-global.com/article/10.1515/cait-2017-0030
https://www.proquest.com/docview/3155709380
https://doaj.org/article/a58c41d3e5f145e8a80e014b768d1aec
Volume 17
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVAON
  databaseName: DOAJ Directory of Open Access Journals
  customDbUrl:
  eissn: 1314-4081
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0000493185
  issn: 1314-4081
  databaseCode: DOA
  dateStart: 20120101
  isFulltext: true
  titleUrlDefault: https://www.doaj.org/
  providerName: Directory of Open Access Journals
– providerCode: PRVPQU
  databaseName: ProQuest Central Database Suite (ProQuest)
  customDbUrl:
  eissn: 1314-4081
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0000493185
  issn: 1314-4081
  databaseCode: BENPR
  dateStart: 20120101
  isFulltext: true
  titleUrlDefault: https://www.proquest.com/central
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: Publicly Available Content Database
  customDbUrl:
  eissn: 1314-4081
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0000493185
  issn: 1314-4081
  databaseCode: PIMPY
  dateStart: 20120101
  isFulltext: true
  titleUrlDefault: http://search.proquest.com/publiccontent
  providerName: ProQuest
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV3dT9swELcQ42EvCMamdXTID0hsDxFOHcf2I51AQ4ISrUOCp8hfmYpoM7WFiv31O3-UdYhpL7wl0Sm5-C53P8fn3yG0TxUvLC8NWMCQrOgRmwnNe5kUxgjBSnAjEZpN8MFAXF3JaqXVl68Ji_TAceAOFROmyC11rMkL5oQSxAGs1wCTba6c8dGXcLkymbqJuNdvC04sjZCzD40azUEhiMkklDyvZKFA1v8XwtxchLVq635M7x7my7XRkHJOttBmwor4KOq4jdbc5A3aTl_jDH9KlNGfd9CvKr0IHi7UdIwvIBCM0w5L3IdEZTEcDMct2AVyFT5KTOIYICsetrf-rwJWOHTIxG2D-6PszFcT4bA_t9U3MSziKlZzjb14FVvRvEWXJ8ffv3zNUleFzFCYzGWMlrZQ1vVsDuiC2bJRRBLDuZDCGqUaWTJLFG0AC9Lc5FbIntGN8Mig0JrTd2h90k7ce4RLbbhmumm0IQXcVElmwVJCag0wTtAOypajXJtEOe47X9zWfuoBVqm9VWpvFc9RSjro4FH-ZyTb-Kdk3xvtUcqTZIcL4Dp1GvH6f67TQd2lyev05c5qmntSMkkFPKN44gZ_pJ7XKueUyQ8vodoueh191RezddH6fHrnPqINcz8fzaZ76FX_eFB92ws-D2fV6Xl1_Rto7wgE
linkProvider Directory of Open Access Journals
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V3Nb9MwFH8aHRJcBuNDdAzwAQQcoiVxnNgHhFbYtGmlRHRIu2X-SKaitdnajmr8UfyNPDtOBwi47cAtip4s6_n3vuz3AfCcyiwxWarxBHQYJHFoAq6yOBBca85ZijDibthENhjwoyORr8D3thbGplW2OtEpalNre0e-RSPbLEpQHr49Ow_s1Cj7utqO0GhgcVBeLjBkm73Zf4_n-yKOd3cO3-0FfqpAoCkGMwGjqUmkKWMToXVlJq1kKEKdZVxwo6WsRMpMKGmFvhCNdGS4iLWquLWMiVIZxXVvwGpCk5R1YLW3M8g_LW910N-25cguyouiQGQ2fch1ikS_YUvL0RyZgnYhdGnXP1lCNzDgFy93beHey015Mr24nLfvs87s7d753xh2F9a8g022G4lYh5Vycg_WvQqbkVe-z_br-_At92JDhgs5HZOPqD3HviyV9NC6G4Ifw3GNYEYDT7Z9-3WCfj4Z1qf2KoZI4saKkroivVHQtylYxBU11-pLY0tI3qTAjS153szveQCfr4UHD6EzqSflIyCp0pliqqqUDhNcVApmDC25UAp9X067ELSwKLTv027HhZwWNl5DGBUWRoWFkW3sGnbh5ZL-rOlQ8lfKnkXZksp2Fnc_6ulJ4TleSMZ1EuGGWBUlrOSShyWG0QrDUhPJUndhs4Vb4dXdrLjCWheS33B7RfXnXUUZZWLj36s-g1t7hx_6RX9_cPAYbjciZPP8NqEzn16UT-Cm_jofzaZPvUASOL5uSP8AMYJxVQ
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=Particle+Swarm+Optimization+Based+on+Smoothing+Approach+for+Solving+a+Class+of+Bi-Level+Multiobjective+Programming+Problem&rft.jtitle=Cybernetics+and+information+technologies+%3A+CIT&rft.au=He+Qingping&rft.au=Lv+Yibing&rft.date=2017-09-01&rft.pub=Sciendo&rft.eissn=1314-4081&rft.volume=17&rft.issue=3&rft.spage=59&rft.epage=74&rft_id=info:doi/10.1515%2Fcait-2017-0030&rft.externalDBID=DOA&rft.externalDocID=oai_doaj_org_article_a58c41d3e5f145e8a80e014b768d1aec
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1314-4081&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1314-4081&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1314-4081&client=summon