Stopping criteria for MAPLS-AW, a hybrid multi-objective evolutionary algorithm

Evolutionary algorithms are widely used to solve multi-objective optimization problems effectively by performing global search over the solution space to find better solutions. Hybrid evolutionary algorithms have been introduced to enhance the quality of solutions obtained. One such hybrid algorithm...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Soft computing (Berlin, Germany) Ročník 20; číslo 6; s. 2409 - 2432
Hlavní autoři: Bhuvana, J., Aravindan, Chandrabose
Médium: Journal Article
Jazyk:angličtina
Vydáno: Berlin/Heidelberg Springer Berlin Heidelberg 01.06.2016
Springer Nature B.V
Témata:
ISSN:1432-7643, 1433-7479
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Abstract Evolutionary algorithms are widely used to solve multi-objective optimization problems effectively by performing global search over the solution space to find better solutions. Hybrid evolutionary algorithms have been introduced to enhance the quality of solutions obtained. One such hybrid algorithm is memetic algorithm with preferential local search using adaptive weights (MAPLS-AW) (Bhuvana and Aravindan in Soft Comput, doi: 10.1007/s00500-015-1593-9 , 2015 ). MAPLS-AW, a variant of NSGA-II algorithm, recognizes the elite solutions of the population and preferences are given to them for local search during the evolution. This paper proposes a termination scheme derived from the features of MAPLS-AW. The objective of the proposed scheme is to detect convergence of population without compromising quality of solutions generated by MAPLS-AW. The proposed termination scheme consists of five stopping measures, among which two are newly proposed in this paper to predict the convergence of the population. Experimental study has been carried out to analyze the performance of the proposed termination scheme and to compare with existing termination schemes. Several constrained and unconstrained multi-objective benchmark test problems are used for this comparison. Additionally, a real-time application economic emission and load dispatch has also been used to check the performance of the proposed scheme. The results show that the proposed scheme identifies convergence of population much earlier than the existing stopping schemes without compromising the quality of solutions.
AbstractList Evolutionary algorithms are widely used to solve multi-objective optimization problems effectively by performing global search over the solution space to find better solutions. Hybrid evolutionary algorithms have been introduced to enhance the quality of solutions obtained. One such hybrid algorithm is memetic algorithm with preferential local search using adaptive weights (MAPLS-AW) (Bhuvana and Aravindan in Soft Comput, doi: 10.1007/s00500-015-1593-9 , 2015 ). MAPLS-AW, a variant of NSGA-II algorithm, recognizes the elite solutions of the population and preferences are given to them for local search during the evolution. This paper proposes a termination scheme derived from the features of MAPLS-AW. The objective of the proposed scheme is to detect convergence of population without compromising quality of solutions generated by MAPLS-AW. The proposed termination scheme consists of five stopping measures, among which two are newly proposed in this paper to predict the convergence of the population. Experimental study has been carried out to analyze the performance of the proposed termination scheme and to compare with existing termination schemes. Several constrained and unconstrained multi-objective benchmark test problems are used for this comparison. Additionally, a real-time application economic emission and load dispatch has also been used to check the performance of the proposed scheme. The results show that the proposed scheme identifies convergence of population much earlier than the existing stopping schemes without compromising the quality of solutions.
Evolutionary algorithms are widely used to solve multi-objective optimization problems effectively by performing global search over the solution space to find better solutions. Hybrid evolutionary algorithms have been introduced to enhance the quality of solutions obtained. One such hybrid algorithm is memetic algorithm with preferential local search using adaptive weights (MAPLS-AW) (Bhuvana and Aravindan in Soft Comput, doi:10.1007/s00500-015-1593-9, 2015). MAPLS-AW, a variant of NSGA-II algorithm, recognizes the elite solutions of the population and preferences are given to them for local search during the evolution. This paper proposes a termination scheme derived from the features of MAPLS-AW. The objective of the proposed scheme is to detect convergence of population without compromising quality of solutions generated by MAPLS-AW. The proposed termination scheme consists of five stopping measures, among which two are newly proposed in this paper to predict the convergence of the population. Experimental study has been carried out to analyze the performance of the proposed termination scheme and to compare with existing termination schemes. Several constrained and unconstrained multi-objective benchmark test problems are used for this comparison. Additionally, a real-time application economic emission and load dispatch has also been used to check the performance of the proposed scheme. The results show that the proposed scheme identifies convergence of population much earlier than the existing stopping schemes without compromising the quality of solutions.
Author Aravindan, Chandrabose
Bhuvana, J.
Author_xml – sequence: 1
  givenname: J.
  surname: Bhuvana
  fullname: Bhuvana, J.
  email: bhuvanaj@ssn.edu.in
  organization: Department of Computer Science and Engineering, SSN College of Engineering
– sequence: 2
  givenname: Chandrabose
  surname: Aravindan
  fullname: Aravindan, Chandrabose
  organization: Department of Computer Science and Engineering, SSN College of Engineering
BookMark eNp9kF9LwzAUxYNMcJt-AN8CvhpNmrZJH8fwH0wmTPExpE26ZXRNTdLBvr2ZFQRBX-69D-d377lnAkatbTUAlwTfEIzZrcc4wxhhkiGSZwTREzAmKaWIpawYfc0JYnlKz8DE-y3GCWEZHYPlKtiuM-0aVs4E7YyEtXXwefayWKHZ-zWUcHMonVFw1zfBIFtudRXMXkO9t00fjG2lO0DZrG3kN7tzcFrLxuuL7z4Fb_d3r_NHtFg-PM1nC1RRkodYOdOSqyTnjCmuylQXqpC8lInCFaeFpnWa1UVJOMNU8ixXSa3KXFcsV1pqOgVXw97O2Y9e-yC2tndtPCmSgrACpxlPo4oNqspZ752uRWWCPJoOTppGECyO6YkhPRHTE8f0BI0k-UV2zuziq_8yycD4qG3X2v14-hv6BIAFg_Q
CitedBy_id crossref_primary_10_1007_s10696_021_09410_1
Cites_doi 10.1162/evco.2009.17.4.17403
10.1016/S1568-4946(02)00062-5
10.1162/106365600568103
10.1109/4235.797969
10.1016/j.jss.2014.05.032
10.1007/s00500-008-0351-7
10.1162/106365600568202
10.1109/TSMCB.2005.856143
10.1016/j.asoc.2011.08.047
10.1115/1.3662552
10.1016/j.ins.2012.05.009
10.1162/evco.2010.18.1.18102
10.1109/TEVC.2011.2132725
10.1016/j.swevo.2011.11.003
10.1109/TEVC.2003.810758
10.1016/j.asoc.2014.02.009
10.1007/s00500-008-0347-3
10.1109/TEVC.2005.861417
10.1016/j.asoc.2010.11.014
10.1109/TEVC.2003.810752
10.1109/34.825752
10.1016/S0952-1976(98)00009-8
10.1016/j.ins.2014.11.051
10.1016/j.ins.2014.02.154
10.1162/evco.1999.7.3.205
10.1109/CEC.2010.5586265
10.1145/298151.298382
10.3233/FI-2012-754
10.1145/1274000.1274053
10.1007/978-1-4613-8997-2_15
10.1007/BFb0056872
10.1145/2463372.2463548
10.1109/CEC.2009.4983090
10.1109/SoCPaR.2011.6089270
10.1145/1569901.1569983
10.2514/6.2010-9233
10.1007/978-3-642-20573-6_53
10.1007/s00500-015-1593-9
10.1007/978-3-642-01020-0_19
10.1007/978-3-540-87700-4_82
10.1109/CEC.2010.5586474
10.1109/CEC.2002.1007032
10.1109/CEC.2009.4983020
10.1007/978-3-642-19893-9_2
ContentType Journal Article
Copyright Springer-Verlag Berlin Heidelberg 2015
Springer-Verlag Berlin Heidelberg 2015.
Copyright_xml – notice: Springer-Verlag Berlin Heidelberg 2015
– notice: Springer-Verlag Berlin Heidelberg 2015.
DBID AAYXX
CITATION
8FE
8FG
AFKRA
ARAPS
AZQEC
BENPR
BGLVJ
CCPQU
DWQXO
GNUQQ
HCIFZ
JQ2
K7-
P5Z
P62
PHGZM
PHGZT
PKEHL
PQEST
PQGLB
PQQKQ
PQUKI
DOI 10.1007/s00500-015-1651-3
DatabaseName CrossRef
ProQuest SciTech Collection
ProQuest Technology Collection
ProQuest Central
Advanced Technologies & Computer Science Collection
ProQuest Central Essentials - QC
ProQuest Central
Technology collection
ProQuest One
ProQuest Central
ProQuest Central Student
SciTech Premium Collection
ProQuest Computer Science Collection
Computer Science Database
Advanced Technologies & Aerospace Database
ProQuest Advanced Technologies & Aerospace Collection
ProQuest Central Premium
ProQuest One Academic
ProQuest One Academic Middle East (New)
ProQuest One Academic Eastern Edition (DO NOT USE)
ProQuest One Applied & Life Sciences
ProQuest One Academic (retired)
ProQuest One Academic UKI Edition
DatabaseTitle CrossRef
Advanced Technologies & Aerospace Collection
Computer Science Database
ProQuest Central Student
Technology Collection
ProQuest One Academic Middle East (New)
ProQuest Advanced Technologies & Aerospace Collection
ProQuest Central Essentials
ProQuest Computer Science Collection
ProQuest One Academic Eastern Edition
SciTech Premium Collection
ProQuest One Community College
ProQuest Technology Collection
ProQuest SciTech Collection
ProQuest Central
Advanced Technologies & Aerospace Database
ProQuest One Applied & Life Sciences
ProQuest One Academic UKI Edition
ProQuest Central Korea
ProQuest Central (New)
ProQuest One Academic
ProQuest One Academic (New)
DatabaseTitleList
Advanced Technologies & Aerospace Collection
Database_xml – sequence: 1
  dbid: P5Z
  name: Advanced Technologies & Aerospace Database
  url: https://search.proquest.com/hightechjournals
  sourceTypes: Aggregation Database
DeliveryMethod fulltext_linktorsrc
Discipline Engineering
Computer Science
EISSN 1433-7479
EndPage 2432
ExternalDocumentID 10_1007_s00500_015_1651_3
GroupedDBID -5B
-5G
-BR
-EM
-Y2
-~C
.86
.VR
06D
0R~
0VY
1N0
1SB
203
29~
2J2
2JN
2JY
2KG
2LR
2P1
2VQ
2~H
30V
4.4
406
408
409
40D
40E
5VS
67Z
6NX
8TC
8UJ
95-
95.
95~
96X
AAAVM
AABHQ
AACDK
AAHNG
AAIAL
AAJBT
AAJKR
AANZL
AARHV
AARTL
AASML
AATNV
AATVU
AAUYE
AAWCG
AAYIU
AAYQN
AAYTO
AAYZH
ABAKF
ABBBX
ABBXA
ABDZT
ABECU
ABFTD
ABFTV
ABHLI
ABHQN
ABJNI
ABJOX
ABKCH
ABKTR
ABMNI
ABMQK
ABNWP
ABQBU
ABQSL
ABSXP
ABTEG
ABTHY
ABTKH
ABTMW
ABULA
ABWNU
ABXPI
ACAOD
ACBXY
ACDTI
ACGFS
ACHSB
ACHXU
ACKNC
ACMDZ
ACMLO
ACOKC
ACOMO
ACPIV
ACSNA
ACZOJ
ADHHG
ADHIR
ADINQ
ADKNI
ADKPE
ADRFC
ADTPH
ADURQ
ADYFF
ADZKW
AEBTG
AEFQL
AEGAL
AEGNC
AEJHL
AEJRE
AEKMD
AEMSY
AENEX
AEOHA
AEPYU
AESKC
AETLH
AEVLU
AEXYK
AFBBN
AFGCZ
AFKRA
AFLOW
AFQWF
AFWTZ
AFZKB
AGAYW
AGDGC
AGGDS
AGJBK
AGMZJ
AGQEE
AGQMX
AGRTI
AGWIL
AGWZB
AGYKE
AHAVH
AHBYD
AHSBF
AHYZX
AIAKS
AIGIU
AIIXL
AILAN
AITGF
AJBLW
AJRNO
AJZVZ
ALMA_UNASSIGNED_HOLDINGS
ALWAN
AMKLP
AMXSW
AMYLF
AMYQR
AOCGG
ARAPS
ARMRJ
ASPBG
AVWKF
AXYYD
AYJHY
AZFZN
B-.
BA0
BDATZ
BENPR
BGLVJ
BGNMA
BSONS
CAG
CCPQU
COF
CS3
CSCUP
DDRTE
DL5
DNIVK
DPUIP
DU5
EBLON
EBS
EIOEI
EJD
ESBYG
FEDTE
FERAY
FFXSO
FIGPU
FINBP
FNLPD
FRRFC
FSGXE
FWDCC
GGCAI
GGRSB
GJIRD
GNWQR
GQ6
GQ7
GQ8
GXS
H13
HCIFZ
HF~
HG5
HG6
HMJXF
HQYDN
HRMNR
HVGLF
HZ~
I09
IHE
IJ-
IKXTQ
IWAJR
IXC
IXD
IXE
IZIGR
IZQ
I~X
I~Z
J-C
J0Z
JBSCW
JCJTX
JZLTJ
K7-
KDC
KOV
LAS
LLZTM
M4Y
MA-
N2Q
NB0
NPVJJ
NQJWS
NU0
O9-
O93
O9J
OAM
P2P
P9P
PF0
PT4
PT5
QOS
R89
R9I
RIG
RNI
ROL
RPX
RSV
RZK
S16
S1Z
S27
S3B
SAP
SDH
SEG
SHX
SISQX
SJYHP
SNE
SNPRN
SNX
SOHCF
SOJ
SPISZ
SRMVM
SSLCW
STPWE
SZN
T13
TSG
TSK
TSV
TUC
U2A
UG4
UOJIU
UTJUX
UZXMN
VC2
VFIZW
W23
W48
WK8
YLTOR
Z45
Z5O
Z7R
Z7X
Z7Y
Z7Z
Z81
Z83
Z88
ZMTXR
AAPKM
AAYXX
ABBRH
ABDBE
ABFSG
ABRTQ
ACSTC
ADHKG
ADKFA
AEZWR
AFDZB
AFFHD
AFHIU
AFOHR
AGQPQ
AHPBZ
AHWEU
AIXLP
ATHPR
AYFIA
CITATION
PHGZM
PHGZT
PQGLB
8FE
8FG
AZQEC
DWQXO
GNUQQ
JQ2
P62
PKEHL
PQEST
PQQKQ
PQUKI
ID FETCH-LOGICAL-c316t-c387ea8d26877d8db4e9d9a8ba2d0c839e3f45f9b18703a856d2fdb6ec76deae3
IEDL.DBID P5Z
ISICitedReferencesCount 3
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000376103900020&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 1432-7643
IngestDate Wed Nov 05 06:47:46 EST 2025
Sat Nov 29 03:19:51 EST 2025
Tue Nov 18 21:25:46 EST 2025
Fri Feb 21 02:40:11 EST 2025
IsPeerReviewed true
IsScholarly true
Issue 6
Keywords EELD
Hybrid multi-objective evolutionary algorithms
Stopping criteria
Convergence
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c316t-c387ea8d26877d8db4e9d9a8ba2d0c839e3f45f9b18703a856d2fdb6ec76deae3
Notes ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
PQID 2917904584
PQPubID 2043697
PageCount 24
ParticipantIDs proquest_journals_2917904584
crossref_citationtrail_10_1007_s00500_015_1651_3
crossref_primary_10_1007_s00500_015_1651_3
springer_journals_10_1007_s00500_015_1651_3
PublicationCentury 2000
PublicationDate 20160600
2016-6-00
20160601
PublicationDateYYYYMMDD 2016-06-01
PublicationDate_xml – month: 6
  year: 2016
  text: 20160600
PublicationDecade 2010
PublicationPlace Berlin/Heidelberg
PublicationPlace_xml – name: Berlin/Heidelberg
– name: Heidelberg
PublicationSubtitle A Fusion of Foundations, Methodologies and Applications
PublicationTitle Soft computing (Berlin, Germany)
PublicationTitleAbbrev Soft Comput
PublicationYear 2016
Publisher Springer Berlin Heidelberg
Springer Nature B.V
Publisher_xml – name: Springer Berlin Heidelberg
– name: Springer Nature B.V
References CR38
Abedian, Ghiasi, Dehghan-Manshadi (CR1) 2006; 3
Wood, Wollenberg (CR48) 2011
CR31
CR30
Wang, Wang, Yang (CR47) 2009; 13
Ishibuchi, Yoshida, Murata (CR26) 2003; 7
Molina, Lozano, García-Martínez, Herrera (CR34) 2010; 18
Arab, Alfi (CR2) 2015; 299
Chen, Ong, Lim, Tan (CR13) 2011; 15
El-Mihoub, Hopgood, Nolle, Battersby (CR19) 2006; 13
Veček, Mernik, Črepinšek (CR43) 2014; 277
Basu (CR4) 2011; 11
CR6
Črepinšek, Liu, Mernik (CR15) 2014; 19
CR8
CR7
CR49
Balakrishnan, Kannan, Aravindan, Subathra (CR3) 2003; 2
CR46
Fraser, Arcuri, McMinn (CR21) 2015; 103
CR45
CR44
Zitzler, Deb, Thiele (CR52) 2000; 8
Mignotte, Collet, Perez, Bouthemy (CR33) 2000; 22
CR42
CR40
Deb (CR16) 1998; 7
CR18
Zitzler, Thiele (CR51) 1999; 3
CR17
CR12
CR11
Mongus, Repnik, Mernik, Žalik (CR35) 2012; 12
CR50
Zitzler, Thiele, Laumanns, Fonseca, Da Fonseca (CR53) 2003; 7
Bishop, Welch (CR9) 2001; 8
Neri, Cotta (CR36) 2012; 2
Črepinšek, Liu, Mernik (CR14) 2012; 212
Merz, Freisleben (CR32) 2000; 8
Santamaría, Cordøn, Damas, García-Torres, Quirin (CR39) 2009; 13
Trautmann, Wagner, Naujoks, Preuss, Mehnen (CR41) 2009; 17
Bhandari, Murthy, Pal (CR5) 2012; 120
CR29
CR28
Ong, Lim, Zhu, Wong (CR37) 2006; 36
CR24
CR23
CR22
Huband, Hingston, Barone, While (CR25) 2006; 10
Kalman (CR27) 1960; 82
CR20
Bos (CR10) 1998; 11
RE Kalman (1651_CR27) 1960; 82
1651_CR49
M Basu (1651_CR4) 2011; 11
1651_CR6
G Fraser (1651_CR21) 2015; 103
M Mignotte (1651_CR33) 2000; 22
1651_CR42
1651_CR8
1651_CR7
1651_CR40
1651_CR45
1651_CR46
1651_CR44
YS Ong (1651_CR37) 2006; 36
A Arab (1651_CR2) 2015; 299
1651_CR38
AJ Wood (1651_CR48) 2011
E Zitzler (1651_CR51) 1999; 3
D Molina (1651_CR34) 2010; 18
A Abedian (1651_CR1) 2006; 3
H Wang (1651_CR47) 2009; 13
1651_CR30
P Merz (1651_CR32) 2000; 8
S Balakrishnan (1651_CR3) 2003; 2
1651_CR31
X Chen (1651_CR13) 2011; 15
D Bhandari (1651_CR5) 2012; 120
M Črepinšek (1651_CR14) 2012; 212
1651_CR28
E Zitzler (1651_CR52) 2000; 8
1651_CR29
1651_CR20
1651_CR23
1651_CR24
1651_CR22
H Trautmann (1651_CR41) 2009; 17
G Bishop (1651_CR9) 2001; 8
E Zitzler (1651_CR53) 2003; 7
D Mongus (1651_CR35) 2012; 12
F Neri (1651_CR36) 2012; 2
J Santamaría (1651_CR39) 2009; 13
S Huband (1651_CR25) 2006; 10
K Deb (1651_CR16) 1998; 7
N Veček (1651_CR43) 2014; 277
A Bos (1651_CR10) 1998; 11
1651_CR17
M Črepinšek (1651_CR15) 2014; 19
1651_CR18
H Ishibuchi (1651_CR26) 2003; 7
1651_CR50
TA El-Mihoub (1651_CR19) 2006; 13
1651_CR12
1651_CR11
References_xml – ident: CR45
– ident: CR22
– volume: 17
  start-page: 493
  issue: 4
  year: 2009
  end-page: 509
  ident: CR41
  article-title: Statistical methods for convergence detection of multi-objective evolutionary algorithms
  publication-title: Evol comput
  doi: 10.1162/evco.2009.17.4.17403
– ident: CR49
– volume: 2
  start-page: 297
  issue: 4
  year: 2003
  end-page: 305
  ident: CR3
  article-title: On-line emission and economic load dispatch using adaptive Hopfield neural network
  publication-title: Appl Soft Comput
  doi: 10.1016/S1568-4946(02)00062-5
– ident: CR12
– volume: 8
  start-page: 61
  issue: 1
  year: 2000
  end-page: 91
  ident: CR32
  article-title: Fitness landscapes, memetic algorithms, and greedy operators for graph bipartitioning
  publication-title: Evol Comput
  doi: 10.1162/106365600568103
– ident: CR29
– volume: 3
  start-page: 257
  issue: 4
  year: 1999
  end-page: 271
  ident: CR51
  article-title: Multiobjective evolutionary algorithms: a comparative case study and the strength Pareto approach
  publication-title: IEEE Trans Evol Comput
  doi: 10.1109/4235.797969
– ident: CR8
– volume: 103
  start-page: 311
  year: 2015
  end-page: 327
  ident: CR21
  article-title: A memetic algorithm for whole test suite generation
  publication-title: J Syst Softw
  doi: 10.1016/j.jss.2014.05.032
– volume: 13
  start-page: 883
  issue: 8–9
  year: 2009
  end-page: 904
  ident: CR39
  article-title: Performance evaluation of memetic approaches in 3d reconstruction of forensic objects
  publication-title: Soft Comput
  doi: 10.1007/s00500-008-0351-7
– volume: 8
  start-page: 173
  issue: 2
  year: 2000
  end-page: 195
  ident: CR52
  article-title: Comparison of multiobjective evolutionary algorithms: empirical results
  publication-title: Evol Comput
  doi: 10.1162/106365600568202
– ident: CR42
– ident: CR46
– volume: 36
  start-page: 141
  issue: 1
  year: 2006
  end-page: 152
  ident: CR37
  article-title: Classification of adaptive memetic algorithms: a comparative study
  publication-title: IEEE Trans Syst Man Cybern Part B Cybern
  doi: 10.1109/TSMCB.2005.856143
– ident: CR50
– ident: CR11
– volume: 12
  start-page: 266
  issue: 1
  year: 2012
  end-page: 273
  ident: CR35
  article-title: A hybrid evolutionary algorithm for tuning a cloth-simulation model
  publication-title: Appl Soft Comput
  doi: 10.1016/j.asoc.2011.08.047
– volume: 82
  start-page: 35
  issue: 1
  year: 1960
  end-page: 45
  ident: CR27
  article-title: A new approach to linear filtering and prediction problems
  publication-title: J Basic Eng
  doi: 10.1115/1.3662552
– volume: 212
  start-page: 79
  year: 2012
  end-page: 93
  ident: CR14
  article-title: A note on teaching-learning-based optimization algorithm
  publication-title: Inf Sci
  doi: 10.1016/j.ins.2012.05.009
– volume: 18
  start-page: 27
  issue: 1
  year: 2010
  end-page: 63
  ident: CR34
  article-title: Memetic algorithms for continuous optimisation based on local search chains
  publication-title: Evol Comput
  doi: 10.1162/evco.2010.18.1.18102
– ident: CR18
– volume: 15
  start-page: 591
  issue: 5
  year: 2011
  end-page: 607
  ident: CR13
  article-title: A multi-facet survey on memetic computation
  publication-title: IEEE Trans Evol Comput
  doi: 10.1109/TEVC.2011.2132725
– volume: 2
  start-page: 1
  year: 2012
  end-page: 14
  ident: CR36
  article-title: Memetic algorithms and memetic computing optimization: a literature review
  publication-title: Swarm Evol Comput
  doi: 10.1016/j.swevo.2011.11.003
– ident: CR30
– volume: 7
  start-page: 117
  issue: 2
  year: 2003
  end-page: 132
  ident: CR53
  article-title: Performance assessment of multiobjective optimizers: an analysis and review
  publication-title: IEEE Trans Evol Comput
  doi: 10.1109/TEVC.2003.810758
– volume: 19
  start-page: 161
  year: 2014
  end-page: 170
  ident: CR15
  article-title: Replication and comparison of computational experiments in applied evolutionary computing: common pitfalls and guidelines to avoid them
  publication-title: Appl Soft Comput
  doi: 10.1016/j.asoc.2014.02.009
– volume: 13
  start-page: 763
  issue: 8–9
  year: 2009
  end-page: 780
  ident: CR47
  article-title: A memetic algorithm with adaptive hill climbing strategy for dynamic optimization problems
  publication-title: Soft Comput
  doi: 10.1007/s00500-008-0347-3
– ident: CR6
– volume: 10
  start-page: 477
  issue: 5
  year: 2006
  end-page: 506
  ident: CR25
  article-title: A review of multiobjective test problems and a scalable test problem toolkit
  publication-title: IEEE Trans Evol Comput
  doi: 10.1109/TEVC.2005.861417
– ident: CR40
– volume: 11
  start-page: 2845
  issue: 2
  year: 2011
  end-page: 2853
  ident: CR4
  article-title: Economic environmental dispatch using multi-objective differential evolution
  publication-title: Appl Soft Comput
  doi: 10.1016/j.asoc.2010.11.014
– ident: CR23
– volume: 8
  start-page: 599
  issue: 27
  year: 2001
  end-page: 3175
  ident: CR9
  article-title: An introduction to the Kalman filter
  publication-title: Proc SIGGRAPH Course
– ident: CR44
– volume: 7
  start-page: 204
  issue: 2
  year: 2003
  end-page: 223
  ident: CR26
  article-title: Balance between genetic search and local search in memetic algorithms for multiobjective permutation flowshop scheduling
  publication-title: IEEE Trans Evol Comput
  doi: 10.1109/TEVC.2003.810752
– volume: 22
  start-page: 129
  issue: 2
  year: 2000
  end-page: 141
  ident: CR33
  article-title: Hybrid genetic optimization and statistical model based approach for the classification of shadow shapes in sonar imagery
  publication-title: IEEE Trans Pattern Anal Mach Intell
  doi: 10.1109/34.825752
– ident: CR38
– ident: CR17
– volume: 13
  start-page: 124
  issue: 2
  year: 2006
  end-page: 137
  ident: CR19
  article-title: Hybrid genetic algorithms: a review
  publication-title: Eng Lett
– volume: 120
  start-page: 145
  issue: 2
  year: 2012
  end-page: 164
  ident: CR5
  article-title: Variance as a stopping criterion for genetic algorithms with elitist model
  publication-title: Fundam Inform
– volume: 11
  start-page: 377
  issue: 3
  year: 1998
  end-page: 382
  ident: CR10
  article-title: Aircraft conceptual design by genetic/gradient-guided optimization
  publication-title: Eng Appl Artif Intell
  doi: 10.1016/S0952-1976(98)00009-8
– ident: CR31
– year: 2011
  ident: CR48
  publication-title: Power generation, operation, and control
– volume: 3
  start-page: 167
  issue: 4
  year: 2006
  ident: CR1
  article-title: An introduction to a new criterion proposed for stopping GA optimization process of a laminated composite plate
  publication-title: JAST-TEHRAN
– volume: 299
  start-page: 117
  year: 2015
  end-page: 142
  ident: CR2
  article-title: An adaptive gradient descent-based local search in memetic algorithm applied to optimal controller design
  publication-title: Inf Sci
  doi: 10.1016/j.ins.2014.11.051
– ident: CR7
– ident: CR28
– volume: 277
  start-page: 656
  year: 2014
  end-page: 679
  ident: CR43
  article-title: A chess rating system for evolutionary algorithms: a new method for the comparison and ranking of evolutionary algorithms
  publication-title: Inf Sci
  doi: 10.1016/j.ins.2014.02.154
– ident: CR24
– volume: 7
  start-page: 205
  year: 1998
  end-page: 230
  ident: CR16
  article-title: Multi-objective genetic algorithms: problem difficulties and construction of test problems
  publication-title: Evol Comput
  doi: 10.1162/evco.1999.7.3.205
– ident: CR20
– ident: 1651_CR24
  doi: 10.1109/CEC.2010.5586265
– ident: 1651_CR42
  doi: 10.1145/298151.298382
– volume: 8
  start-page: 173
  issue: 2
  year: 2000
  ident: 1651_CR52
  publication-title: Evol Comput
  doi: 10.1162/106365600568202
– volume: 120
  start-page: 145
  issue: 2
  year: 2012
  ident: 1651_CR5
  publication-title: Fundam Inform
  doi: 10.3233/FI-2012-754
– volume: 10
  start-page: 477
  issue: 5
  year: 2006
  ident: 1651_CR25
  publication-title: IEEE Trans Evol Comput
  doi: 10.1109/TEVC.2005.861417
– volume: 15
  start-page: 591
  issue: 5
  year: 2011
  ident: 1651_CR13
  publication-title: IEEE Trans Evol Comput
  doi: 10.1109/TEVC.2011.2132725
– volume: 8
  start-page: 599
  issue: 27
  year: 2001
  ident: 1651_CR9
  publication-title: Proc SIGGRAPH Course
– volume: 13
  start-page: 124
  issue: 2
  year: 2006
  ident: 1651_CR19
  publication-title: Eng Lett
– ident: 1651_CR28
  doi: 10.1145/1274000.1274053
– ident: 1651_CR31
  doi: 10.1007/978-1-4613-8997-2_15
– volume: 17
  start-page: 493
  issue: 4
  year: 2009
  ident: 1651_CR41
  publication-title: Evol comput
  doi: 10.1162/evco.2009.17.4.17403
– volume: 13
  start-page: 763
  issue: 8–9
  year: 2009
  ident: 1651_CR47
  publication-title: Soft Comput
  doi: 10.1007/s00500-008-0347-3
– volume: 7
  start-page: 204
  issue: 2
  year: 2003
  ident: 1651_CR26
  publication-title: IEEE Trans Evol Comput
  doi: 10.1109/TEVC.2003.810752
– ident: 1651_CR50
  doi: 10.1007/BFb0056872
– ident: 1651_CR20
  doi: 10.1145/2463372.2463548
– volume: 82
  start-page: 35
  issue: 1
  year: 1960
  ident: 1651_CR27
  publication-title: J Basic Eng
  doi: 10.1115/1.3662552
– ident: 1651_CR38
– volume: 11
  start-page: 377
  issue: 3
  year: 1998
  ident: 1651_CR10
  publication-title: Eng Appl Artif Intell
  doi: 10.1016/S0952-1976(98)00009-8
– ident: 1651_CR30
– ident: 1651_CR29
  doi: 10.1109/CEC.2009.4983090
– volume: 22
  start-page: 129
  issue: 2
  year: 2000
  ident: 1651_CR33
  publication-title: IEEE Trans Pattern Anal Mach Intell
  doi: 10.1109/34.825752
– volume: 13
  start-page: 883
  issue: 8–9
  year: 2009
  ident: 1651_CR39
  publication-title: Soft Comput
  doi: 10.1007/s00500-008-0351-7
– volume: 18
  start-page: 27
  issue: 1
  year: 2010
  ident: 1651_CR34
  publication-title: Evol Comput
  doi: 10.1162/evco.2010.18.1.18102
– volume: 19
  start-page: 161
  year: 2014
  ident: 1651_CR15
  publication-title: Appl Soft Comput
  doi: 10.1016/j.asoc.2014.02.009
– ident: 1651_CR7
  doi: 10.1109/SoCPaR.2011.6089270
– ident: 1651_CR23
  doi: 10.1145/1569901.1569983
– volume: 2
  start-page: 297
  issue: 4
  year: 2003
  ident: 1651_CR3
  publication-title: Appl Soft Comput
  doi: 10.1016/S1568-4946(02)00062-5
– ident: 1651_CR49
– ident: 1651_CR22
  doi: 10.2514/6.2010-9233
– ident: 1651_CR6
  doi: 10.1007/978-3-642-20573-6_53
– volume: 103
  start-page: 311
  year: 2015
  ident: 1651_CR21
  publication-title: J Syst Softw
  doi: 10.1016/j.jss.2014.05.032
– volume: 36
  start-page: 141
  issue: 1
  year: 2006
  ident: 1651_CR37
  publication-title: IEEE Trans Syst Man Cybern Part B Cybern
  doi: 10.1109/TSMCB.2005.856143
– volume: 2
  start-page: 1
  year: 2012
  ident: 1651_CR36
  publication-title: Swarm Evol Comput
  doi: 10.1016/j.swevo.2011.11.003
– ident: 1651_CR8
  doi: 10.1007/s00500-015-1593-9
– ident: 1651_CR17
– volume: 277
  start-page: 656
  year: 2014
  ident: 1651_CR43
  publication-title: Inf Sci
  doi: 10.1016/j.ins.2014.02.154
– ident: 1651_CR45
  doi: 10.1007/978-3-642-01020-0_19
– volume: 212
  start-page: 79
  year: 2012
  ident: 1651_CR14
  publication-title: Inf Sci
  doi: 10.1016/j.ins.2012.05.009
– ident: 1651_CR40
  doi: 10.1007/978-3-540-87700-4_82
– ident: 1651_CR44
  doi: 10.1109/CEC.2010.5586474
– volume: 7
  start-page: 205
  year: 1998
  ident: 1651_CR16
  publication-title: Evol Comput
  doi: 10.1162/evco.1999.7.3.205
– volume: 12
  start-page: 266
  issue: 1
  year: 2012
  ident: 1651_CR35
  publication-title: Appl Soft Comput
  doi: 10.1016/j.asoc.2011.08.047
– volume: 3
  start-page: 167
  issue: 4
  year: 2006
  ident: 1651_CR1
  publication-title: JAST-TEHRAN
– volume: 11
  start-page: 2845
  issue: 2
  year: 2011
  ident: 1651_CR4
  publication-title: Appl Soft Comput
  doi: 10.1016/j.asoc.2010.11.014
– volume-title: Power generation, operation, and control
  year: 2011
  ident: 1651_CR48
– volume: 299
  start-page: 117
  year: 2015
  ident: 1651_CR2
  publication-title: Inf Sci
  doi: 10.1016/j.ins.2014.11.051
– ident: 1651_CR18
  doi: 10.1109/CEC.2002.1007032
– volume: 3
  start-page: 257
  issue: 4
  year: 1999
  ident: 1651_CR51
  publication-title: IEEE Trans Evol Comput
  doi: 10.1109/4235.797969
– volume: 7
  start-page: 117
  issue: 2
  year: 2003
  ident: 1651_CR53
  publication-title: IEEE Trans Evol Comput
  doi: 10.1109/TEVC.2003.810758
– ident: 1651_CR11
  doi: 10.1109/CEC.2009.4983020
– ident: 1651_CR12
– volume: 8
  start-page: 61
  issue: 1
  year: 2000
  ident: 1651_CR32
  publication-title: Evol Comput
  doi: 10.1162/106365600568103
– ident: 1651_CR46
  doi: 10.1007/978-3-642-19893-9_2
SSID ssj0021753
Score 2.104209
Snippet Evolutionary algorithms are widely used to solve multi-objective optimization problems effectively by performing global search over the solution space to find...
SourceID proquest
crossref
springer
SourceType Aggregation Database
Enrichment Source
Index Database
Publisher
StartPage 2409
SubjectTerms Artificial Intelligence
Computational Intelligence
Control
Convergence
Design
Engineering
Evolutionary algorithms
Genetic algorithms
Mathematical Logic and Foundations
Mechatronics
Methodologies and Application
Multiple objective analysis
Mutation
Optimization
Robotics
Searching
Solution space
SummonAdditionalLinks – databaseName: SpringerLINK Contemporary 1997-Present
  dbid: RSV
  link: http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV1LT8JAEJ4oetCDKGpE0ezBk7oJfW23R2IkHhSJ-ODW7KugQTCAJPx7Z0sLatREL710d9PM7Mx8zcx8A3CcKJVIU9XUIJqnviPQD3Lp08RV2peRrApXpMMmwkaDt9tRM-vjHuXV7nlKMvXU82Y3S1Vii6gC6rDAod4yrGC043Zew23rYf6XlVFPIg5A6IjxNk9lfnfE52C0QJhfkqJprKkX__WVm7CRQUtSm92FLVgy_RIU87ENJLPiEqx_4CDchpvWeGA5GjoE_YclbhYEcSy5rjWvWrT2eEYE6U5tWxdJaw_pQD7PfCQxk-zaiuGUiF5ngPu7LztwX7-4O7-k2ZQFqjyHjfHJQyO4dhkPQ8219E2kI8GlcHVVIX4yXuIHSSQdNG1P8IBpN9GSGRUybYTxdqHQH_TNHhDjcNQ9MyxyIt93Fe4RCPDQJzAdJJ5fhmou7lhlFOR2EkYvnpMnp-KLUXyxFV_sleFkvuV1xr_x2-JKrsM4M8VR7EaWhMymg8twmuts8frHw_b_tPoA1hBKsVkRWQUK4-GbOYRVNRk_jYZH6Q19B28C37M
  priority: 102
  providerName: Springer Nature
Title Stopping criteria for MAPLS-AW, a hybrid multi-objective evolutionary algorithm
URI https://link.springer.com/article/10.1007/s00500-015-1651-3
https://www.proquest.com/docview/2917904584
Volume 20
WOSCitedRecordID wos000376103900020&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: Advanced Technologies & Aerospace Database
  customDbUrl:
  eissn: 1433-7479
  dateEnd: 20241209
  omitProxy: false
  ssIdentifier: ssj0021753
  issn: 1432-7643
  databaseCode: P5Z
  dateStart: 20090101
  isFulltext: true
  titleUrlDefault: https://search.proquest.com/hightechjournals
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: Computer Science Database
  customDbUrl:
  eissn: 1433-7479
  dateEnd: 20241209
  omitProxy: false
  ssIdentifier: ssj0021753
  issn: 1432-7643
  databaseCode: K7-
  dateStart: 20090101
  isFulltext: true
  titleUrlDefault: http://search.proquest.com/compscijour
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: ProQuest Central
  customDbUrl:
  eissn: 1433-7479
  dateEnd: 20241209
  omitProxy: false
  ssIdentifier: ssj0021753
  issn: 1432-7643
  databaseCode: BENPR
  dateStart: 20090101
  isFulltext: true
  titleUrlDefault: https://www.proquest.com/central
  providerName: ProQuest
– providerCode: PRVAVX
  databaseName: SpringerLINK Contemporary 1997-Present
  customDbUrl:
  eissn: 1433-7479
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0021753
  issn: 1432-7643
  databaseCode: RSV
  dateStart: 19970401
  isFulltext: true
  titleUrlDefault: https://link.springer.com/search?facet-content-type=%22Journal%22
  providerName: Springer Nature
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV3JTsMwEB2xHbiwI8pS-cAJsMjqOCdUEAgJKBVlE5fIW1gELbQBib9nnDqtQIILF18SW1ZmPH7xjN8D2MyVyqXxNDWI5mnkC4yDXEY0D5SOZCo9EYhSbCJpNvntbdpyB259V1ZZxcQyUOuusmfku0FquaRsVm_v9Y1a1SibXXUSGuMwaVkSrHRDK74b_nA5FkqEBIgiceutsppeSSIa2zvVfkx9Fvs0_L4vjcDmj_xoue0czf53wnMw4wAnaQw8ZB7GTGcBZisxB-LW9iKct4uu5Wq4JxhHLIGzIIhnyVmjddqmjZsdIsjDp73eRcoaRNqVT4NYScyHc1_R-yTi-R4nUTy8LMHV0eHlwTF1agtUhT4rsOWJEVwHjCeJ5lpGJtWp4FIE2lOIo0yYR3GeSh-XeCh4zHSQa8mMSpg2woTLMNHpdswKEONz9AFmWOqnURQo7CMQ6GFsYDrOw6gGXvWtM-WoyK0ixnM2JFEuzZOheTJrniyswdawy-uAh-Ovl9crk2RuSfazkT1qsF0ZdfT418FW_x5sDaYRQ7FB9dg6TBS9d7MBU-qjeOz36jC5f9hsXdRh_CSh9dI7sb1oX38B2uHppA
linkProvider ProQuest
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V1NT9wwEB1RitReSoFW3QLFB7hArSaO4ziHCq3aItAuCxIguAV_BVrRXbobqPZP9Td2nI9dgQQ3DlxySTyS4zczLxn7DcB6bkyuXWCpQzZPeagwDkrNac6M5TrVgWKqbDaR9Hry7Cw9nIF_zVkYv62yiYlloLYD4_-Rf2Gp15LyVb3t6z_Ud43y1dWmhUYFi44b_8VPttHXve-4vhuM7fw4_rZL664C1EShKPAqE6ekZUImiZVWc5faVEmtmA0M8gUX5TzOUx0ilCMlY2FZbrVwJhHWKReh3RfwkqMZ71edhE4-8GrVS6QgyFox1TdV1KAULY39Ge4wpqGIQxrdzYNTcnuvHlumuZ355_aC3sKbmlCTduUBCzDj-osw3zSrIHXsWoKDo2LgtSguCMZJL1CtCPJ1st8-7B7R9ulnosjl2B9fI-UeSzrQv6pcQNxt7Z5qOCbq6gInXVz-fgcnTzKt9zDbH_TdByAulIhx4UQappwzg2MUElmMfcLGecRbEDRrm5laat13_LjKJiLRJRwyhEPm4ZBFLdicDLmudEYee3ilgUBWh5xRNl3_Fmw1IJreftDYx8eNrcGr3eP9btbd63WW4TXyRVHtlFuB2WJ441ZhztwWP0fDT6UvEDh_amz9BzW7Ra8
linkToPdf http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1JT-swEB6xCfEO7OiV1QdOgEWTOI5zrIAKBJRKZbtF3gI88VrUBiT-PeMsZREgIS65eFE0nuWzZvwNwGaqdaps3VCLaJ4yT6IfFIrR1NeGqVjVpS_zZhNRqyWur-N22ed0UFW7VynJ4k2DY2nqZrsPJt0dPnxztCWuoCqkHg89GozCOHN19O663rkc3rhKGkrEBAgjMfZWac3PtngfmF7R5ocEaR53mjO__uNZmC4hJ2kUOjIHI7Y7DzNVOwdSWvc8_HnDTbgAZ52s57gbbgj6FUfoLAniW3LaaJ90aONqh0hy--yee5G8JpH21L_CdxL7VKqz7D8TeX_Tw_W3_xfhonlwvndIy-4LVAcez_ArIiuF8bmIIiOMYjY2sRRK-qauEVfZIGVhGisPTT6QIuTGT43iVkfcWGmDJRjr9rr2LxDrCdQJbnnsxYz5GtdIBH7oK7gJ04DVoF6JPtElNbnrkHGfDEmVc_ElKL7EiS8JarA1XPJQ8HJ8N3m1Os-kNNFB4seOnMyliWuwXZ3f6_CXmy3_aPYGTLb3m8nJUet4BaYQbfGizmwVxrL-o12DCf2U3Q3667nivgCr6Ot7
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=Stopping+criteria+for+MAPLS-AW%2C+a+hybrid+multi-objective+evolutionary+algorithm&rft.jtitle=Soft+computing+%28Berlin%2C+Germany%29&rft.au=Bhuvana%2C+J&rft.au=Aravindan%2C+Chandrabose&rft.date=2016-06-01&rft.pub=Springer+Nature+B.V&rft.issn=1432-7643&rft.eissn=1433-7479&rft.volume=20&rft.issue=6&rft.spage=2409&rft.epage=2432&rft_id=info:doi/10.1007%2Fs00500-015-1651-3
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1432-7643&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1432-7643&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1432-7643&client=summon