Hybrid charged system search and particle swarm optimization for engineering design problems

Purpose - Meta-heuristic methods are powerful in obtaining the solution of optimization problems. Hybridizing of the meta-heuristic algorithms provides a scope to improve the searching abilities of the resulting method. The purpose of this paper is to provide a new hybrid algorithm by adding positiv...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Engineering computations Ročník 28; číslo 4; s. 423 - 440
Hlavní autori: Kaveh, A., Talatahari, S.
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: Bradford Emerald Group Publishing Limited 01.01.2011
Predmet:
ISSN:0264-4401, 1758-7077
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Abstract Purpose - Meta-heuristic methods are powerful in obtaining the solution of optimization problems. Hybridizing of the meta-heuristic algorithms provides a scope to improve the searching abilities of the resulting method. The purpose of this paper is to provide a new hybrid algorithm by adding positive properties of the particle swarm optimization (PSO) algorithms to the charged system search (CSS) to solve constrained engineering optimization problems.Design methodology approach - The main advantages of the PSO consisting of directing the agents toward the global best (obtained by the swarm) and the local best (obtained by the agent itself) are added to the CSS algorithm to improve its performance. In the present approach, similar to the original CSS, each agent is affected by other agents considering the governing laws of electrical physics. However, the kind of the forces can be repulsive and attractive. In order to handle the constraints, the fly-to-boundary method is utilized as an improved feasible-based method.Findings - Four variants of hybrid methods are proposed. In these algorithms, the charged memory (CM) is changed to save the local best positions of agents. Utilizing this new CM to determine the direction and amount of movement of agents improve the power of the algorithms. When only this memory is utilized (method I), exploitation ability of the algorithm increases and when only two agents from CM in addition to other agents in the current iteration are used, then the exploration ability increases (method II). In order to have a good balance between exploration and exploitation of the algorithms, methods III and IV are proposed, where some agents of the memory and some other from the current agents are utilized. Method IV in which the numbers of used agents from the CM increase linearly, has a better search ability in addition to a powerful exploitation making this variant superior compared to the others.Originality value - In this paper, four hybrid methods are presented and applied to some benchmark engineering optimization problems. The new algorithms are compared to those of the other advanced meta-heuristic methods to illustrate the effectiveness of the proposed methods.
AbstractList Purpose - Meta-heuristic methods are powerful in obtaining the solution of optimization problems. Hybridizing of the meta-heuristic algorithms provides a scope to improve the searching abilities of the resulting method. The purpose of this paper is to provide a new hybrid algorithm by adding positive properties of the particle swarm optimization (PSO) algorithms to the charged system search (CSS) to solve constrained engineering optimization problems. Design/methodology/approach - The main advantages of the PSO consisting of directing the agents toward the global best (obtained by the swarm) and the local best (obtained by the agent itself) are added to the CSS algorithm to improve its performance. In the present approach, similar to the original CSS, each agent is affected by other agents considering the governing laws of electrical physics. However, the kind of the forces can be repulsive and attractive. In order to handle the constraints, the fly-to-boundary method is utilized as an improved feasible-based method. Findings - Four variants of hybrid methods are proposed. In these algorithms, the charged memory (CM) is changed to save the local best positions of agents. Utilizing this new CM to determine the direction and amount of movement of agents improve the power of the algorithms. When only this memory is utilized (method I), exploitation ability of the algorithm increases and when only two agents from CM in addition to other agents in the current iteration are used, then the exploration ability increases (method II). In order to have a good balance between exploration and exploitation of the algorithms, methods III and IV are proposed, where some agents of the memory and some other from the current agents are utilized. Method IV in which the numbers of used agents from the CM increase linearly, has a better search ability in addition to a powerful exploitation making this variant superior compared to the others. Originality/value - In this paper, four hybrid methods are presented and applied to some benchmark engineering optimization problems. The new algorithms are compared to those of the other advanced meta-heuristic methods to illustrate the effectiveness of the proposed methods.
Purpose - Meta-heuristic methods are powerful in obtaining the solution of optimization problems. Hybridizing of the meta-heuristic algorithms provides a scope to improve the searching abilities of the resulting method. The purpose of this paper is to provide a new hybrid algorithm by adding positive properties of the particle swarm optimization (PSO) algorithms to the charged system search (CSS) to solve constrained engineering optimization problems. Design/methodology/approach - The main advantages of the PSO consisting of directing the agents toward the global best (obtained by the swarm) and the local best (obtained by the agent itself) are added to the CSS algorithm to improve its performance. In the present approach, similar to the original CSS, each agent is affected by other agents considering the governing laws of electrical physics. However, the kind of the forces can be repulsive and attractive. In order to handle the constraints, the fly-to-boundary method is utilized as an improved feasible-based method. Findings - Four variants of hybrid methods are proposed. In these algorithms, the charged memory (CM) is changed to save the local best positions of agents. Utilizing this new CM to determine the direction and amount of movement of agents improve the power of the algorithms. When only this memory is utilized (method I), exploitation ability of the algorithm increases and when only two agents from CM in addition to other agents in the current iteration are used, then the exploration ability increases (method II). In order to have a good balance between exploration and exploitation of the algorithms, methods III and IV are proposed, where some agents of the memory and some other from the current agents are utilized. Method IV in which the numbers of used agents from the CM increase linearly, has a better search ability in addition to a powerful exploitation making this variant superior compared to the others. Originality/value - In this paper, four hybrid methods are presented and applied to some benchmark engineering optimization problems. The new algorithms are compared to those of the other advanced meta-heuristic methods to illustrate the effectiveness of the proposed methods. [PUBLICATION ABSTRACT]
Author Kaveh, A.
Talatahari, S.
Author_xml – sequence: 1
  givenname: A.
  surname: Kaveh
  fullname: Kaveh, A.
  organization: Centre of Excellence for Fundamental Studies in Structural Engineering, Iran University of Science and Technology, Tehran, Iran
– sequence: 2
  givenname: S.
  surname: Talatahari
  fullname: Talatahari, S.
  organization: Department of Civil Engineering, University of Tabriz, Tabriz, Iran
BookMark eNqNkD1PwzAQhi0EEm3hB7BZLCwE_BU7HVEFFKkSC2xI0cW5tq4SJ9ipUPn1pJSpRYhbPNzz3J3fITn2jUdCLji74Zxlt0xopRTj25I8M_qIDLhJs8QwY47JYNtPtsApGca4YowZKdmAvE03RXAltUsICyxp3MQOaxoRgl1S8CVtIXTOVkjjB4SaNm3navcJnWs8nTeBol84jxicX9ASo1t42oamqLCOZ-RkDlXE8593RF4f7l8m02T2_Pg0uZslVmaiSzhLQRQskyI1qQQ0oHQ21sALYccFSC0kiFRobrQpLDclBzCWK8ut7j8CckSudnP7xe9rjF1eu2ixqsBjs455P6x3lVE9eblHrpp18P1xeWaY0kqYcQ_xHWRDE2PAed4GV0PY5Jzl27Tzg7R7x-w51nXfIXUBXPWnyXYm1higKv-17Pp35QDN23IuvwDw45-V
CitedBy_id crossref_primary_10_3390_math10193466
crossref_primary_10_1016_j_ymssp_2015_03_020
crossref_primary_10_1007_s10586_017_1155_2
crossref_primary_10_1016_j_dajour_2022_100147
crossref_primary_10_1108_EC_11_2014_0232
crossref_primary_10_1002_qua_25672
crossref_primary_10_1007_s40996_023_01074_1
crossref_primary_10_1016_j_ijhydene_2023_09_093
crossref_primary_10_1016_j_crme_2015_07_015
crossref_primary_10_1016_j_compstruc_2013_09_002
crossref_primary_10_1108_EC_11_2014_0235
crossref_primary_10_1007_s00521_022_08057_9
crossref_primary_10_1080_00051144_2019_1570632
crossref_primary_10_1007_s42107_023_00964_z
crossref_primary_10_1007_s42107_025_01514_5
crossref_primary_10_1016_j_apacoust_2014_09_007
crossref_primary_10_1021_ie403123b
crossref_primary_10_1007_s42107_025_01263_5
crossref_primary_10_1108_EC_07_2014_0159
crossref_primary_10_1007_s11047_016_9569_y
crossref_primary_10_1016_j_ins_2018_04_024
crossref_primary_10_1016_j_apm_2020_12_007
crossref_primary_10_1007_s00707_018_2234_z
crossref_primary_10_1016_j_energy_2012_08_008
crossref_primary_10_1108_EC_01_2013_0013
crossref_primary_10_1007_s40996_024_01662_9
crossref_primary_10_1108_EC_10_2011_0118
crossref_primary_10_1016_j_ins_2015_11_032
crossref_primary_10_1007_s12652_019_01607_5
crossref_primary_10_1007_s42107_025_01282_2
crossref_primary_10_1155_2013_480954
crossref_primary_10_1007_s42107_025_01306_x
crossref_primary_10_1016_j_renene_2024_120131
crossref_primary_10_1007_s10489_013_0459_z
crossref_primary_10_1016_j_knosys_2016_08_005
crossref_primary_10_1007_s42107_025_01526_1
crossref_primary_10_1016_j_asoc_2015_05_010
crossref_primary_10_1016_j_istruc_2023_01_071
crossref_primary_10_1007_s40996_020_00354_4
crossref_primary_10_1007_s40996_022_00868_z
crossref_primary_10_1155_2022_5692427
crossref_primary_10_1007_s42107_025_01370_3
crossref_primary_10_1108_EC_10_2012_0232
Cites_doi 10.1016/j.compstruc.2009.01.003
10.3826/jhr.2009.3468
10.1016/j.jcsr.2010.01.007
10.1016/S1474-0346(02)00011-3
10.1016/S0045-7825(99)00389-8
10.1016/j.biosystems.2004.08.003
10.1016/j.eswa.2009.06.044
10.1016/S0166-3615(99)00046-9
10.1007/s00707-009-0270-4
10.1007/978-3-662-03423-1_27
10.1115/1.2919393
10.1115/DETC1988-0012
10.1016/j.engappai.2006.03.003
10.1115/1.3438995
10.1080/03081070701303470
10.2514/3.10834
10.1007/s00158-009-0462-5
10.1016/j.jcsr.2009.04.021
ContentType Journal Article
Copyright Emerald Group Publishing Limited
Copyright Emerald Group Publishing Limited 2011
Copyright_xml – notice: Emerald Group Publishing Limited
– notice: Copyright Emerald Group Publishing Limited 2011
DBID AAYXX
CITATION
7SC
7TB
7WY
7WZ
7XB
8AO
8FD
8FE
8FG
ABJCF
AFKRA
ARAPS
AZQEC
BENPR
BEZIV
BGLVJ
CCPQU
DWQXO
FR3
F~G
GNUQQ
HCIFZ
JQ2
K6~
K7-
KR7
L.-
L.0
L6V
L7M
L~C
L~D
M0C
M0N
M2P
M7S
P5Z
P62
PHGZM
PHGZT
PKEHL
PQBIZ
PQEST
PQGLB
PQQKQ
PQUKI
PRINS
PTHSS
Q9U
DOI 10.1108/02644401111131876
DatabaseName CrossRef
Computer and Information Systems Abstracts
Mechanical & Transportation Engineering Abstracts
ABI/INFORM Collection
ABI/INFORM Global (PDF only)
ProQuest Central (purchase pre-March 2016)
ProQuest Pharma Collection
Technology Research Database
ProQuest SciTech Collection
ProQuest Technology Collection
Materials Science & Engineering Database
ProQuest Central UK/Ireland
Advanced Technologies & Aerospace Database
ProQuest Central Essentials
ProQuest Central
Business Premium Collection
ProQuest Technology Collection
ProQuest One
ProQuest Central Korea
Engineering Research Database
ABI/INFORM Global (Corporate)
ProQuest Central Student
SciTech Premium Collection
ProQuest Computer Science Collection
ProQuest Business Collection
Computer Science Database
Civil Engineering Abstracts
ABI/INFORM Professional Advanced
ABI/INFORM Professional Standard
ProQuest Engineering Collection
Advanced Technologies Database with Aerospace
Computer and Information Systems Abstracts – Academic
Computer and Information Systems Abstracts Professional
ABI/INFORM Global
Computing Database
Science Database (via ProQuest SciTech Premium Collection)
Engineering Database
Advanced Technologies & Aerospace Database
ProQuest Advanced Technologies & Aerospace Collection
ProQuest Central Premium
ProQuest One Academic (New)
ProQuest One Academic Middle East (New)
ProQuest One Business
ProQuest One Academic Eastern Edition (DO NOT USE)
ProQuest One Applied & Life Sciences
ProQuest One Academic (retired)
ProQuest One Academic UKI Edition
ProQuest Central China
Engineering Collection
ProQuest Central Basic
DatabaseTitle CrossRef
ABI/INFORM Global (Corporate)
ProQuest One Business
Computer Science Database
ProQuest Central Student
Technology Collection
Technology Research Database
Computer and Information Systems Abstracts – Academic
ProQuest One Academic Middle East (New)
Mechanical & Transportation Engineering Abstracts
ProQuest Advanced Technologies & Aerospace Collection
ProQuest Central Essentials
ProQuest Computer Science Collection
Computer and Information Systems Abstracts
SciTech Premium Collection
ProQuest One Community College
ProQuest Pharma Collection
ProQuest Central China
ABI/INFORM Complete
ProQuest Central
ABI/INFORM Professional Advanced
ProQuest One Applied & Life Sciences
ProQuest Engineering Collection
ABI/INFORM Professional Standard
ProQuest Central Korea
ProQuest Central (New)
Advanced Technologies Database with Aerospace
Engineering Collection
Advanced Technologies & Aerospace Collection
Business Premium Collection
Civil Engineering Abstracts
ABI/INFORM Global
ProQuest Computing
Engineering Database
ProQuest Central Basic
ProQuest Science Journals
ProQuest One Academic Eastern Edition
ProQuest Technology Collection
ProQuest SciTech Collection
ProQuest Business Collection
Computer and Information Systems Abstracts Professional
Advanced Technologies & Aerospace Database
ProQuest One Academic UKI Edition
Materials Science & Engineering Collection
Engineering Research Database
ProQuest One Academic
ProQuest One Academic (New)
DatabaseTitleList Civil Engineering Abstracts
ABI/INFORM Global (Corporate)

Database_xml – sequence: 1
  dbid: BENPR
  name: ProQuest Central
  url: https://www.proquest.com/central
  sourceTypes: Aggregation Database
DeliveryMethod fulltext_linktorsrc
Discipline Applied Sciences
Engineering
EISSN 1758-7077
EndPage 440
ExternalDocumentID 2368029901
10_1108_02644401111131876
10.1108/02644401111131876
Genre Feature
GroupedDBID 0R~
1WG
29G
4.4
5GY
5VS
70U
7WY
8AO
8FE
8FG
8FW
8R4
8R5
9E0
AAGBP
AAMCF
AATHL
AAUDR
ABIJV
ABJCF
ABJNI
ABKQV
ABSDC
ACBEA
ACGFS
ACGOD
ACIWK
ACZLT
ADFRT
ADOMW
AEBZA
AENEX
AFKRA
AFNTC
AFQLH
AFYHH
AFZLO
AHMHQ
AJEBP
ALMA_UNASSIGNED_HOLDINGS
AODMV
ARAPS
ASMFL
AUCOK
AZQEC
BENPR
BEZIV
BGLVJ
BPHCQ
CAG
CCPQU
COF
CS3
DU5
DWQXO
EBS
ECCUG
EJD
EOXHF
FNNZZ
GEI
GEL
GNUQQ
GQ.
H13
HCIFZ
HZ~
IJT
IPNFZ
J1Y
JI-
JL0
K6V
K6~
K7-
KBGRL
L6V
M0C
M2P
M42
M7S
O9-
P2P
P62
PHGZM
PHGZT
PQBIZ
PQQKQ
PROAC
PTHSS
Q2X
RIG
ROL
RWL
SBBZN
TAE
TN5
U5U
UNMZH
~02
AAYXX
ABYQI
AFFHD
CITATION
PQGLB
7SC
7TB
7XB
8FD
FR3
JQ2
KR7
L.-
L.0
L7M
L~C
L~D
M0N
PKEHL
PQEST
PQUKI
PRINS
Q9U
ID FETCH-LOGICAL-c382t-105a2b08325753ae7a46896a1b2c9ba3623a25261767bc17d1aa7c14c1c6000a3
IEDL.DBID K7-
ISICitedReferencesCount 49
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000292713100009&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 0264-4401
IngestDate Sun Nov 09 10:02:18 EST 2025
Mon Nov 10 02:57:24 EST 2025
Tue Nov 18 20:15:45 EST 2025
Sat Nov 29 07:39:37 EST 2025
Fri Jul 04 02:58:07 EDT 2025
Wed Jul 31 14:17:22 EDT 2019
IsPeerReviewed true
IsScholarly true
Issue 4
Keywords Electrical engineering
Programming and algorithm theory
Design and development
Language English
License https://www.emerald.com/insight/site-policies
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c382t-105a2b08325753ae7a46896a1b2c9ba3623a25261767bc17d1aa7c14c1c6000a3
Notes SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Article-2
content type line 23
PQID 870464279
PQPubID 26043
PageCount 18
ParticipantIDs crossref_primary_10_1108_02644401111131876
emerald_primary_10_1108_02644401111131876
proquest_miscellaneous_896176474
proquest_journals_870464279
crossref_citationtrail_10_1108_02644401111131876
PublicationCentury 2000
PublicationDate 2011-01-01
PublicationDateYYYYMMDD 2011-01-01
PublicationDate_xml – month: 01
  year: 2011
  text: 2011-01-01
  day: 01
PublicationDecade 2010
PublicationPlace Bradford
PublicationPlace_xml – name: Bradford
PublicationTitle Engineering computations
PublicationYear 2011
Publisher Emerald Group Publishing Limited
Publisher_xml – name: Emerald Group Publishing Limited
References key2022012120143547600_b8
key2022012120143547600_b9
key2022012120143547600_b6
key2022012120143547600_b7
key2022012120143547600_b11
key2022012120143547600_b22
key2022012120143547600_b12
key2022012120143547600_b23
key2022012120143547600_b20
key2022012120143547600_b10
key2022012120143547600_b21
key2022012120143547600_b19
key2022012120143547600_b1
key2022012120143547600_b17
key2022012120143547600_b18
key2022012120143547600_b4
key2022012120143547600_b15
key2022012120143547600_b5
key2022012120143547600_b16
key2022012120143547600_b2
key2022012120143547600_b13
key2022012120143547600_b3
key2022012120143547600_b14
References_xml – ident: key2022012120143547600_b13
  doi: 10.1016/j.compstruc.2009.01.003
– ident: key2022012120143547600_b18
– ident: key2022012120143547600_b9
– ident: key2022012120143547600_b20
  doi: 10.3826/jhr.2009.3468
– ident: key2022012120143547600_b17
  doi: 10.1016/j.jcsr.2010.01.007
– ident: key2022012120143547600_b1
– ident: key2022012120143547600_b5
  doi: 10.1016/S1474-0346(02)00011-3
– ident: key2022012120143547600_b7
  doi: 10.1016/S0045-7825(99)00389-8
– ident: key2022012120143547600_b10
  doi: 10.1016/j.biosystems.2004.08.003
– ident: key2022012120143547600_b3
  doi: 10.1016/j.eswa.2009.06.044
– ident: key2022012120143547600_b2
– ident: key2022012120143547600_b4
  doi: 10.1016/S0166-3615(99)00046-9
– ident: key2022012120143547600_b15
  doi: 10.1007/s00707-009-0270-4
– ident: key2022012120143547600_b8
  doi: 10.1007/978-3-662-03423-1_27
– ident: key2022012120143547600_b12
  doi: 10.1115/1.2919393
– ident: key2022012120143547600_b22
  doi: 10.1115/DETC1988-0012
– ident: key2022012120143547600_b11
  doi: 10.1016/j.engappai.2006.03.003
– ident: key2022012120143547600_b21
  doi: 10.1115/1.3438995
– ident: key2022012120143547600_b19
  doi: 10.1080/03081070701303470
– ident: key2022012120143547600_b23
– ident: key2022012120143547600_b6
  doi: 10.2514/3.10834
– ident: key2022012120143547600_b16
  doi: 10.1007/s00158-009-0462-5
– ident: key2022012120143547600_b14
  doi: 10.1016/j.jcsr.2009.04.021
SSID ssj0007330
Score 2.1375442
Snippet Purpose - Meta-heuristic methods are powerful in obtaining the solution of optimization problems. Hybridizing of the meta-heuristic algorithms provides a scope...
SourceID proquest
crossref
emerald
SourceType Aggregation Database
Enrichment Source
Index Database
Publisher
StartPage 423
SubjectTerms Algorithms
Analysis
Charged particles
Computer programming
Design engineering
Electrical engineering
Exploitation
Heuristic
Heuristic methods
Optimization
Product development
Reagents
Searching
Studies
Violations
Title Hybrid charged system search and particle swarm optimization for engineering design problems
URI https://www.emerald.com/insight/content/doi/10.1108/02644401111131876/full/html
https://www.proquest.com/docview/870464279
https://www.proquest.com/docview/896176474
Volume 28
WOSCitedRecordID wos000292713100009&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVPQU
  databaseName: ABI/INFORM Collection
  customDbUrl:
  eissn: 1758-7077
  dateEnd: 20241207
  omitProxy: false
  ssIdentifier: ssj0007330
  issn: 0264-4401
  databaseCode: 7WY
  dateStart: 19960101
  isFulltext: true
  titleUrlDefault: https://www.proquest.com/abicomplete
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: ABI/INFORM Global
  customDbUrl:
  eissn: 1758-7077
  dateEnd: 20241207
  omitProxy: false
  ssIdentifier: ssj0007330
  issn: 0264-4401
  databaseCode: M0C
  dateStart: 19960101
  isFulltext: true
  titleUrlDefault: https://search.proquest.com/abiglobal
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: Advanced Technologies & Aerospace Database
  customDbUrl:
  eissn: 1758-7077
  dateEnd: 20241207
  omitProxy: false
  ssIdentifier: ssj0007330
  issn: 0264-4401
  databaseCode: P5Z
  dateStart: 19960101
  isFulltext: true
  titleUrlDefault: https://search.proquest.com/hightechjournals
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: Computer Science Database
  customDbUrl:
  eissn: 1758-7077
  dateEnd: 20241207
  omitProxy: false
  ssIdentifier: ssj0007330
  issn: 0264-4401
  databaseCode: K7-
  dateStart: 19960101
  isFulltext: true
  titleUrlDefault: http://search.proquest.com/compscijour
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: Engineering Database
  customDbUrl:
  eissn: 1758-7077
  dateEnd: 20241207
  omitProxy: false
  ssIdentifier: ssj0007330
  issn: 0264-4401
  databaseCode: M7S
  dateStart: 19960101
  isFulltext: true
  titleUrlDefault: http://search.proquest.com
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: ProQuest Central
  customDbUrl:
  eissn: 1758-7077
  dateEnd: 20241207
  omitProxy: false
  ssIdentifier: ssj0007330
  issn: 0264-4401
  databaseCode: BENPR
  dateStart: 19960101
  isFulltext: true
  titleUrlDefault: https://www.proquest.com/central
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: Science Database (via ProQuest SciTech Premium Collection)
  customDbUrl:
  eissn: 1758-7077
  dateEnd: 20241207
  omitProxy: false
  ssIdentifier: ssj0007330
  issn: 0264-4401
  databaseCode: M2P
  dateStart: 19960101
  isFulltext: true
  titleUrlDefault: https://search.proquest.com/sciencejournals
  providerName: ProQuest
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1La9tAEB4au4f00DROQl0nZg_poQURrXallU4lCTaGUmP6oG4IiNVKgkItu5bd0n_fGWktGxd8KYi5aDQs2nnuYz6Aa6Opp1EqnTzk0pHSk4520a50RJVYKFM_lxXYhBqPw-k0mtizOaU9VrnxiZWjTueG1shvUK8k5soqerf46RBoFG2uWgSNI2hzz-Ok5u-V0zhiJYRdYqFRuNxualbAN5QHSMJZ5xy1mjqO7ISlvbu5W_9cBZ3hyX8O9wU8t9kmu63V4xSeZEUHTmzmyaxdlx14ttOW8AweR3_oHheruighX93tmdVGwXSRsoVVOFb-1ssZm6PfmdkLnQyzYJZtxbG0OiPCLHJNeQ5fhoPP9yPHojA4RoTeCv20r70EMzU0bl_oTGkZhFGgeeKZKNEYAIX2fGrsHqjEcJVyrZXh0nCDyZSrxQW0inmRvQQWCYyFAbqNDOsgX4okcCORh4nAIjJHyV1wN5MQG9uinJAyfsRVqUJ4mfvz1oW3zSeLuj_HIebXdmYb3n944kWad-HNPt8Bmb2NAsTW_Mu4mf0usOYt2i1txugim6-RJaI_JpV8dVBAD47rVWx6LqG1Wq6zK3hqfq2-l8s-HKmv3_rQvhuMJx_7lfYj_eDeE_UmRNUnpBP_4S8pPgV6
linkProvider ProQuest
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V1LS-RAEC58ge7Bt-zoqn3Qg0Iwne68DossPhhRBw8KHoTY6SQgaGZ2MrODP8r_uFVJJ8oIc_Mg5DY1RR5ffV3Vj_oA9rSinkaJtLKAS0tKR1rKxrhSIVVigUzcTJZiE36nE9zfhzdT8FafhaFtlTUnlkSddDXNkR8hriTmyn543PtrkWgULa7WChoVKi7T1xFWbMXvi1P8vPuOc352e9K2jKiApUXgDJB2XOXEmHggVl2hUl9JLwg9xWNHh7FCPhfKcalPuefHmvsJV8rXXGquMTewlUC_0zArJUYD7RS0Txri94UwUzr01DY3i6il0A7lHZJ03TnHKKIOJx-GwbGzwO_jQTnInS99s9ezDIsmm2Z_KvivwFSar8KSyayZ4a1iFX58aLu4Bg_tVzqnxsouUWhXdbNm1f0zlSesZwKKFSPVf2Fd5NUXc2CVYZbP0nd3LCn3wDCjzFOsw92XPPEGzOTdPP0JLBQ41ntIiynWea4UsWeHIgtigUVyhp5bYNcfPdKmBTspgTxHZSlGeqDjOGnBYfOXXtV_ZJLxvkFSY_vJJuolWQsOxu0m-NyqARcZeiuiBm0tYM2vyEu02KTytDtEk5DemPTl5kQHuzDfvr2-iq4uOpdbsFDN2NP1C2YG_WG6DXP63-Cp6O-Uscbg8avR-x_cVlj9
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=Hybrid+charged+system+search+and+particle+swarm+optimization+for+engineering+design+problems&rft.jtitle=Engineering+computations&rft.au=Kaveh%2C+A.&rft.au=Talatahari%2C+S.&rft.date=2011-01-01&rft.pub=Emerald+Group+Publishing+Limited&rft.issn=0264-4401&rft.volume=28&rft.issue=4&rft.spage=423&rft.epage=440&rft_id=info:doi/10.1108%2F02644401111131876&rft.externalDBID=HAS_PDF&rft.externalDocID=10.1108%2F02644401111131876
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0264-4401&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0264-4401&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0264-4401&client=summon