Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
14
0

Year Published

2016
2016
2018
2018

Publication Types

Select...
3

Relationship

0
3

Authors

Journals

citations
Cited by 16 publications
(14 citation statements)
references
References 12 publications
0
14
0
Order By: Relevance
“…A generalized discrete variables handling method that was proposed and implemented by Liao [13], is incorporated in all the algorithms in this research. Deb [3] parameter-less penalty methods are consistently used in all metaheuristics for handling the constraints.…”
Section: Methodsmentioning
confidence: 99%
See 1 more Smart Citation
“…A generalized discrete variables handling method that was proposed and implemented by Liao [13], is incorporated in all the algorithms in this research. Deb [3] parameter-less penalty methods are consistently used in all metaheuristics for handling the constraints.…”
Section: Methodsmentioning
confidence: 99%
“…The original metaheuristics (ABC, qABC, ACOr, MDE and SA) are developed for handling only continuous variables. So for discrete variable (machining parameters, in our case) handling the same strategy as used by Liao [13], is used in this research as well. A randomly generated solution point for tool diameter is rounded to its nearest integer and that integer value indicates the position of candidate solution point in the dimension of tool diameter.…”
Section: Discrete Machining Parameter Handlingmentioning
confidence: 99%
“…A self-adaptive penalty function was proposed by Tessema [26]. Multi-objective constraint handling method [3,6,7,11,19,21,22,23,24,26,27,30] is that handles all the constraints as an objective function, with the original objective function form the bio-objective unconstrained optimization problems. The individual selected into the new population based on the fitness and smaller constraint violation.…”
Section: Constraints Handling Methodsmentioning
confidence: 99%
“…Liao [11] studied the ant colony algorithm, proposed three mixed thoughts. local search algorithm and differential evolutionary algorithm were introduced in the ant colony algorithm framework respectively.…”
Section: Introductionmentioning
confidence: 99%
“…}mQD '|@}mQD |xDi=}Ow@y@ sD} Qwor= %|O}rm u=oS=w "xR=U |R=Uxv}y@ '|WQ@ |xtQ;uD@ Q=w}O 'C= QP s=LOR= xtOkt "1 pt=mD R=xDiQos=yr=|=ysU}v=mtT=U= Q@ 'CU=xOW|iQat|=ysD}Qwor=u}QD|t}Ok sD} Qwor= u}vJty "CU= xDiQo pmW ?=NDv= w VyH 'pFt O}rwD %Ovv=t '|m}Swrw}@ w |atH Q=DiQ R= s=yr= =@ [3] 'u=oJQwt |vwrm sD} Qwor= =} w [2] ' 2 PSO C= QP s=LOR= |=ysD}Qwor= u} QDOQ@ Q=mQB R= Qo}O |NQ@ "Ov=xOW O=H}= C=v=w}L u}@ OwHwt OvtWwy |vwrm [4] ' 3 HS|vwtQ=y|wHwCUHsD}Qwor=pt=WQ}N=|=yp=UQOxOW|iQat w [7] ' 4 SA xOW|R=Ux}@W O} Q@D sD} Qwor= [6] '|Q=taDU= C@=kQ sD} Qwor= [5] 'Qw@vR "CU= [8] ' 5 FA ?=D?W sQm sD} Qwor= |=yxN=W QO Q}N= |=yp=U QO xS}wx@ |Q=mD@== Qi |=ysD}Qwor= R= xO=iDU= pL QO |v=w=Qi |=yQ=DWwv w xDW=O |Q}osWJ OWQ u= Qta |UOvyt R= sa= hrDNt u=wvax@ "CU= xOW x=Q= QwmPt |=ysD}Qwor= R= xO=iDU= =@ |UOvyt uwo=vwo p=Ut sQm sD} Qwor= \UwD |}=B QN |=yxR=U |SwrwBwD w pmW 'xR=Ov= |R=Uxv}y@ 'xvwtv sD} Qwor= \UwD xDUUo w xDUw}B |=yQ}eDt =@ |UOvyt p=Ut pL [9] '?=D?W p=Ut pL |= Q@ u=oJQwt |vwrm |xDi=}Ow@y@ sD} Qwor= R= xO=iDU= [10] '?=D?W sQm w [12] 'CN=U |=yxSwQB QO lU} Q X}YND |@=}xv}y@ R}v w [11] '|R=Uxv}y@ s=LOR= sD} Qwor= xr}Uwx@ xtUD =@ xOWKrUt |m =N |=yQ=w}O |L=Q] |R=Uxv}y@ "CU= |Q=mD@== Qi |=ysD}Qwor= R= xO=iDU= OQ=wt xrtH R= [13] 'C= QP [16] 'pkv w ptL R}v w [15] '|tD= C= QP s=LOR= w xe=@ Qwk VyH sD} Qwor= ? }mQD [17] '|SQv=`@=vt |R=Uxv}y@ Qw_vtx@ |= Q@ l}DvS w ?=D?W sQm sD} Qwor= ?…”
mentioning
confidence: 99%