• 検索結果がありません。

by Real-Coded Probabilistic Model-Building GA Tomoyuki Hiroyasu,

N/A
N/A
Protected

Academic year: 2021

シェア "by Real-Coded Probabilistic Model-Building GA Tomoyuki Hiroyasu,"

Copied!
5
0
0

読み込み中.... (全文を見る)

全文

(1)

†† ! " # †† $ % & '

(*)*+-,/.1032*4*576981:*;=<*>1?A@AB*C-D/E1F*GAHAI*J=K9GML/NPO*QMR1SM<903T*UAVAWAX/Y-Z9[

\^]^_*`*,ba*>dcAe^f*[*\^]*_^`/Rdgihkj*l/Rdm*n^o/>dp-?^@*B^C*DbE9F^GAH*I^J/KdG/LbNqO^QM.90

C^DbE9F*G^c*rbZ1sbt9u*v^w*w^x/RdSM<d0Ay^z*{bZ9|^}Az^@*~/Zd*€^*‚bR1ƒ*„^o/>^…/†k‡*,bYA>9p

ˆ*‰ T-U*VAW*X=Y9[A\A]*_A`/RŠg‹h ‰AŒ t903*Ž*G-/1-@*lA‘/’-“9HAIAJMK9G/L=NqOAQMZ1g*”-•/–

t9?*—-˜*™Aš*›=R9œA: ‰ g*-ž/R90 Ÿ*…1¡‹¢P[/£12M<1?*—-˜*™Aš*›=¤*t*¥-Y9¦Ao*§-¨/R1mAnAo/>-K9G

L/NqO-Q/t1\*S-o/>9pª©q«1¬AcAe*f-[*\*]A_A`MR9­-®‹†A¯q;-?*°‹¯ ‰9±A² 03³*´-J/µ9¶A·AlMZ9¸-¹*,

a*>9º*»

2»*}*¼*l/’M½9£1¾/<1g/R9¿*À*,MY*>*…/†ŠR9Á‹¢q¡/tM¯ ‰ p

Truss Structural Optimization

by Real-Coded Probabilistic Model-Building GA Tomoyuki Hiroyasu,

††

Mitsunori Miki

††

and Hisashi Shimosaka

In this paper, real-coded probabilistic model-building genetic algorithm (PMBGA) is ap- plied to structural optimization problems. In order to find an optimum in the problem which has a strong correlation among the parameters, principal component analysis (PCA) is ap- plied to the construction of the probabilistic model. To deal with the constraints, penalty function and pulling back methods are also applied to PMBGA. Using the proposed methods, a truss structure is designed to minimize its volume as a numerical example. Through the numerical example, the comparison between PMBGA and sequential quadratic programming method (SQP) shows the effectiveness of PMBGA and the handling methods of constraints.

1. ÂÄÃÆÅÈÇ

ÉbʋË/Ì*͋ÎÐÏ^Ñ/Ò

(Genetic Algorithms:GA)1) 2)

Ó*ÔbÕ/Ö/׋Ø*ÙbÚÜÛAÝ*Þ ß/à‹Ý*á/âb×/ã/ä‹å*æÐç/è/é

êìë

GA Óìíïîðåìñïòôó

(õïö ) ÷ðø êìùôúïûôü Øìý

þ

ábâ/×/ã/ä‹èbéÜÿ Þ

û/ü

÷

ß/à ê

þ

ØÐç ë

Þ

ÍïÉ/ÊÐËïÌ*ÍÐÎÐÏ^ÑbÒ

(Probabilis- tic Model-Building GA:PMBGA)3) à ê Þ

Û/å

GA !#"%$

à&

êAë'

å Ì*Íi΋ÏAÑ

Ò

Ó^Þ â()‹å*+

õbö

å,-./ 0

õ/ö Ø1/Ô

$

2 ê Ý3/å

Í

Ø45 Û9Þ76bå

Í

./

Ë ÷ 0

õôö

Ø Ô598 êìë

PMBGAèïÓ:+ õïö å

Ø;<=>0

õ/ö

Ø*Ô5‹è?

ê

Ý3*Þ í@A^á/â/×

BC

ØD Ë ÷ ñFE

'

HGI$

à

ê^ë

J9K9L

èôÓ Þ

PMBGAØHMNôÕ áïâô× BC ÷ â9O

8 ê' ØPQ ê*ë MNbÕ/á/â/× BC Ó*í/î‹åRST

UWVYXYZ\[YZY[Y]_^Y[\`YaYb

Graduate School of Engineering, Doshisha University

†† UWVYXYZ\[Y^Y[Yc

Department of Engineering, Doshisha University

d

Øe8 ê á/â/× BC èbé ê' ù ë

GAÓ*æf

÷

RST

d

Øg

÷hi

A/Ý3*Þkj/ýlmn

Øobà

Ý*ñ/òMó

÷

ÓRST

d Ø h þ Ý3/åpq/./å%rs

t

u A ê

4)ë

6/å/Ý3 JKL

èbÓ*Þwvx Íyz%{

îbä|

ø}

ñ û

ü~

÷

jbýlmn

Øo/à‹Ý*ñ/òbó‹Ø*Þ6 ' ./9áq€

jMýlmkn

÷ƒ

?%„…8rs

(ƒ ?„ Û\rs )Ø

6^à†^à

PMBGA÷ âO Û Ý ë vx

Íyz{

îbä Ø

‡ˆ

Û*݉Š/ãMä‹è/Ó^ÞwRST

Ø { î ‹ ÷ vx

Í

yz

ی8

ê

Ý3^ÞkRST d o‹å

û/ü/ú

Ž

 ÷

Ô?‘ ÿ ÷

EE A ê*ë

ƒ

?„ÜÛ rsÐØ

‡ˆ

Û*݉

Š/ã/ä‹èbÓj/ýlmn

Øo/à‹Ý^ñ/ò/ó‹Ø*Þ6 ' ./

á#€

j/ýlmn

’

ƒ

?„8ÐÝ3*Þk“/å*ñ/òbó

jïýlmn ‚

÷”•

è?

ê*ë

‰Š/ãb䋨AޅMN/Õ/á/â/×

BC

å*æ‹çbè/é

ê#– —˜

M7NôÕ å

ö7™

ášô× B7C

÷

â9O Û Þïî

‹

j7› Øwœ Û

ž‹Ø^ý&ŸMÝ ë¡  Ý

¢ Ë

A£¤/ä‹å^æ‹ç/è/é ê¥

Ž 2Ž9¦§ ä (Sequential Quadratic Programming Method:SQP) åH¨©ÐØ*ý*މŠïã/äÐåªmÐØ«

¬ Û Ý ë

1

(2)

1 PMBGA

2.

J…K…L

èMÓ-Þ

PCA Ø O¡…&…

Í

؁M…8

ê jMî&

ÍMÉ/ÊiËMÌAÍiÎiÏAÑMÒ

(Real-Coded Probabilistic Model-Building GA) Ø:‰9Š78 ê ëq'

åÐèbÓ Þ  

PMBGAå ! u | ø} ‰Š8 ê jbî

Í/ÉbʋËMÌ*͋΋Ï^Ñ/Ò

÷

ç#"%$

ê*ë

6

å#&bÞw‰Š

Ì*͋΋Ï*ÑMҒ

å%'

Í

å*âO

÷

ç

"($ ê^ë

2.1 PMBGA) *(+

Þ

ÍïÉ/ÊÐËïÌ*ÍÐÎÐÏ^ÑbÒ

(Probabilis- tic Model-Building GA:PMBGA) à ê ޅÜÛ

ïå

GA H!#"$

à

ê 3)ë PMBGA

èïÓ^Þ

â()‹å%*+

õbö

å,-./0

õ/ö Ø1/Ô

$ 2 ê Ý

3 ÷

Í

Ø45ÜÛ9Þ6/å

Í

./

Ë ÷ 0

õôö

ØìÔ958 ê ë ' åôÝ93^Þ

PMBGAÓ:+ õôö å,

- Ø;<H=>0

õbö

Ø^Ô5 è? Þ

PMBGA÷Ðø ÿ Þ

í@A*áMâ/× BC Ø%D Ë ÷

ñFE ' è? ê' Ø

GI$

à ê ë

.

1ÓìÞ PMBGAå:rs å! u Ø/ Ûì݀ìåôèbé

êìë

PMBGA èïÓìÞ   á0 ÷12(3 . /H EH/:.

å

õbö

Ø#4658 ê*ë ' å#7%465

$ à ê õ/ö

Ó*Þ=â()

å*

õ/ö

Ø#8:98 ê#; ( ù ë 6‹Û^Þ<4=5‹Û*Ý

õ/ö:>

.&/ D Ë ÷

û/ü Ø*ýQ ê ,-‹å Í Ø

M%8 ê*ë

Ži÷

' å

Í

Ø#?OÜÛ9ޅ Û

õbö%>

Ø

Ô5 Û9Þ

12%3

å

õbö Ø ˆ

à%@Q ê*ëAB å ø þ A#C

4‹Ø D ÿFEÜÛ1ý*áMâb׋ØAý þ å

PMBGAè/é ê*ë 2.2 PCAG(HI JK(LM(N(O(PQ=RS TUV:W

X

T6Y=Z\[=]

JKL

è/Ó*Þkj/î

Í/ÉbʋË/Ì*͋ÎÐÏ*Ñ/Ò

ØO ê*ë¡  Ý*ޅ,-Ðå

Í

M%‹å#^

÷

Þ_5

,7,a`

(Principal Component Analysis:PCA) ØwO

õ/ö%>

åH,-‹Ø

%

8

ê^ë ' à

÷Ðø ÿ Þ ù

:b

å

c

¦ îdiåfe

”

{g

Ø%Ph ÛAÝ%k&

Í

Ø%M ۊÞ

Û

õïö

Ø^Ô58 ê' è? ê^ë

PCA: ØHOôÝ

Í

M(

õïö

å^Ô5ðå

i ö Ë A Ì*ÍÐÎ Ï^ÑïÒ Ø Ž ÷ /8

ë

( 1 ) 



t

å

12%3 P(t)ø

ÿ Þkj%l&A

õMö (m

Ïfn

–

)Ø A%4o5ðÛ Þ E(t) 8 ê ë#' åk7ôޓ

Eqp=r

¦%

îÐØ‹ç

õ/ö

Ó#465‹ÛA ë7  Ý

E(t)å#s

c

¦%

î‹å#t%u

‹ Ø

E(t)å#s

c

¦:

î ‹ ./

ƒ ? Þ6bå ‹ Ø^ý(v

E÷ w(x 8 ê ë

( 2 ) E(t)å õ/ö%>‹÷Ðø

Ÿ*Þ

 

t−1  è/å*á:j

õMö%>

å

Ìn:y

z

T(t−1)Øf{8 êAë {

Ó

E(t)÷f|   à ê s õ/ö åAâ() Þ T(t−1)

÷#|

  à ê æiç A:B å

õ/ö

å*â()

ø ÿ * ;

( ÷ Þ

T(t−1)å*áq€q}*â()Ðå õ/ö

q~ ?

Q ê' è ý þ ë {:&ðå

T(t−1)Ø T(t)

8 ê^ë

( 3 ) T(t)å#s

c

¦:

î å#t:u

‹ Ø

T(t)ås

c

¦:

î ‹ ./

ƒ ? Þ6bå

‹

Ø^ý(v

X÷ w:x 8 ê^ë

( 4 ) ý(v X

å,(€bý%v Ø

S

8 ê^ë

S={sij}Ó sij= 1

m−1Σmk=1xikxjk

è ¢ 2 ê ë

( 5 ) ý(v S

å:He

‹ e(‚=ƒ – Í

Ø „3 ê ë

( 6 ) e

‹ å

? …

÷

ކe%‚6ƒ – Í Ø#s%v

÷ ‡

$ Ý^ý:v Ø

PCA( ý:v V

8

ê*ë

( 7 ) E

Ø

PCA:

ý:v

V÷ ø

Ÿ Þ:ˆ(‰ { × Û^Ý

ý(vÐØ

Y 8 ê^ë

Y=EV ( 8 ) Y÷

|*Þs c

¦%



÷#Œ%Ð÷#Ž%:

î

Ø%1MÔ

$ 2 Aýv

Y‘

Ø%458 ê*ë' åf7MÞ

Ž

 î å:,€ ÓìÞ

c

¦(

î å:,€

÷ é ê ‹

B Ø

.<b݀*å 8 ê*ë ' å 7/Þk458 ê n

ÛE Ô5

$ à ê õ/ö

å

õbö

î A ê^ë

( 9 ) Y‘ ÷ V

å’bý%v Ø.<ï݀ åbØ

E‘ 8 ê^ë

E‘ =Y‘V1 ( 10 ) E‘÷ 2.è ƒ ôÝ s

c

¦(

îðå tuÐØ“98 ë '

à Ø^Þ Û

õbö:> O(t) 8 ê^ë

‰Š8 ê

Ì*͋΋ÏAÑ/Ò

è/Ó#”•‹å



%–

Í Ø

8%9‹è? ê Þ<—™˜/Ó

Í

./

1:2%3

å

õ/ö:>

pšrdî><båH0

õbö

Ø^Ô5 ÛdÞ

õbö(> O(t)å“

å

õïö

Ø

P(t)÷ ~

? Q

ê^ë

2.3 ›%œ:P(Q=R(S T:U(V:W

X

T=YšZ[=]

,:€

ÉbʋËïÌ*ÍÐÎ‹Ï Ñ/Ò

(Distributed Genetic Al- gorithm:DGA)5)èbÓ*Þ 1(2:3 (poplation) ,:ž $

à/ޟ=z

1%2%3 (subpopulation)Ø#,5ÜÛdޟ6z 1:2

3 Š ÷

É/Ê‹Ë C4ÐØ#D ÿFE8

ë¡ 

Ý*æ% 

  Š ÷

Ÿ=z

1%2:3 dÐè

õïö

å – Ø ý þ ë

DGAÓ:'

Í

(island model) € à/ޟ6z 1%2%3 Ó%' (island)

€ à ê ë

DGA÷ Ó ù%¡ ªÐå#¢

þ

éÜÿ Þ<£bæ

1%2%3

Í

¨© Û*Þ

ø ÿ **â()

å^ñ Ø1%¤8

ê'

¥:¦$

à

ê^ë5)

PMBGA å§ ú åìæðç Û: B9C ÷ðø ŸbÓ Þ 1

(3)

2a3

ñ

÷

ê lmª é ê*ë 6*à‹Ø< ê Ý3

÷ Ó 1

2a3

å ù¡ ª Øk¢798 ê A /:. å

:t u

A

ê^ë

JKL èbӋèH‰ŠÜÛ Ý

PCA% ØO/Ý PMBGA ÷ DGAØ â7O Û Þš'oŠ ÷ PMBGA Ø

âO8 ê*ë ' å

Í

Ø*Þk,%€

Í/ÉbÊÐË/Ì*Í

΋Ï^Ñ/Ò

(Distributed PMBGA:DPMBGA) DPMBGAèMÓAÞ – Û%!‹åMÝ }M÷ —

"#

Ò ÷

£/æ‹å Ï

"!$

–% Øf,58 ê Í Ø*â

O8 ê^ë

3. &('()+*(,+-/.(0+1(.2(3(4+5(687+9;:+<

=?>A@

:CB8DEAF

G;H+IJKL;MNO+PQSRUTVWXYZR%[\;T]^

_a`bc8deaYgf]g^a_g`ah(iaTKgLaM;NaOjakafl

mn Xop;q+jrsZtu(fvwxK;LMNOZyU]^_

`h(iTKLM;NO+jkfl{zT+|}JN;O+jPX~

I€;+TKLM(‚ƒjJZR„X…+TG†;‡ˆ‰/yUŠ‹Zd

JƒŒ+;J+ŽJYld\+dJ+Ž%X

GAP!;‘+I;’]

^_;`+b“+’”;•+JYl{zT G;†‡ˆ—˜(b™Œ

n …;š›œ’P]^;_`+b”Z} n;– TZŽ\T!ž;Ÿ+ 

¡

tJ;fl

op¢q£jP¤Xvw¢xKLMT

n¢–

’¦¥§¢¨£©!ªU€¢«

¬ |!­

GAT!…®¯+°’!G†‡ˆ—˜(b!™Œ n …š›

b!Ky±£Y!G†¢‡ˆ—˜£²’³i!´¢užŸ£b

PMBGA

’L;µ;ufl

3.1 ¶·¸(¹gº»;¼g½

¥;§¨+©ª!€«+P¾

n¿

Œ+J;Y]^_`+bÀÁM

d bœ~I€/tÃ+ÄW•Å n €+bKLM;u+f+t

Y}UÆ;«jk;fl

Ç(È X¢ÉÊ+T+|}J]^_`h(iTKLM;NO+

kgf(tUufl

minimize f(x)

such that gj(x)≤0 j= 1..m

zTËX¢¥§¨+©ª!€g«+jPÌ(T+|}J€;+bÍ

Î dUXKLM(b†Z}Ïl n ‚(d%X

ρ>0

j;kfl

ρ

PX¥

§g¨(©;ªÐ+Ñ;ÒgÓ;ÔtUÕ(Œ(fl

minimize Fρ(x) =f(x) +ρ(Σmi=1max{0, gj(x)})

¥;§¨+©ª!€«(jPX]^_`;Ö+b€Ö(’¥§

¨+©ªœt;deh×u(f X]^_;`™+T®¯;Ø+Ì

ÙgÚ(’ÛiÜÞÝߒ/RgRUJ;fl

3.2 àgáâ/ãß½

o;pqœjPG†;‡ˆ—˜+b™;Œ

n

…š›+T³;i´Zd

äå(bæç+IK;LMè«+bµ(Ye†/}élG†;‡;ˆ—˜

b™;Œ n …;š›Têëb

xout

t;dßXì;í/tîï(TK

LgM;N;OTV;WgX;ÌT(|;}’NgO+bÍgð;M;ufl

minimize f(x) =p

(x−xout)2

such that∇gj(xout)(x−xout) +gj(xout)≤0 j= 1, ...., m

~I€;+P!X]^_`+b™;Œ n …š›/t%ñòó;ô

õö

T÷;ø+TØùtTú;û+jkfl¢üý+’±þZd n ];^

_`+b¾

n

u—˜ZtTXKÿúû+b

–

f+ztjX]

^_a`b™Œ

n

\ަK?y¦±YG†a‡ˆ—˜TØ

xopt

b – f(zgtgj;i;fl

zTœ|}’!ÍðM ¿ Œ n N;OœP

2

ÌòNO+jk;f

X¢L Jæ;ç+IKLM;è«+’+|e…SRzt;j

if!l

mn

zT³i!´Zdäå+b

GA

T¥ÓÔ

Tì+’†Z}zt’(|+Ý XG†;‡ˆ—˜+b™Œ

n

…;š

›+bX+z\+ŽUKZyU±+YG†‡ˆ—;˜+’³i´/d%X

…;šg›(]g^;_;`b¾ n d n j† È fl

4. 3 2

opq(jP!X Ñ!vwx

"

K#M;NO+brs;N

O/tgdUX $&%'¨bLgµ/d n()

PMBGA’ì*j

+ , d n ¥;§¨+©ª!€« ¬ |­…š›(T³i´ZdUä

å+bLµ/d n è«(bµ+YeKgLM+b†/}él mn X ()

è«T¤‰ˆ£b¤òf

’¤X.-¢Ì

2

Ìò«

(Sequential Quadratic Programming Method:SQP)

tT/&0b

†/} l

4.1 1325456

opq+j7SÝ ”Z}vw;xKLM+Tr;s+P8Ñ!v;w

x+jkfl9%Ñ!v;wx(TKLñò;NOZtPX£kfí

Ø+’:+b×

È

eX;+T]^_`+b<

È n

tiX¢K#

" T8UÑ!vwx+bñòu+f+z;tjkfl¢]^_;`

T ¡= ’;PX>íØ(Tó?X@>AB+TC:DêE(JGF

Š È Ž%Œfl

opqœjP8Ñ!!vwxœT!K;LñòNOœb

GA

j!…

R VaWaX>HA&BATIHJ

"

bñgòaóa/t ufl/|;eX

UÑ&!vwgx(TA&B;ñ;ògó(T/tLK/d(RßJ;fl

ras/tad n NgOPX

6

íaØ

10

AHBATM Ñ!v;wax

K;LgM;NaO(jak;f

(N 2).

zTM Ñ!vgwgx(TO([;T

íØ

(0.4,0.3)

X

(0.4,0.6)

’PQ×R

5000N

b!h×/dX

KÊS+TO+[TíØ

(0.0,0.0)

t

(0.4,0.0)

bTÍZde

Y;flU;µ&BV(PWX(T n;–Y&Z ‰[g

10GPa

ý Z ‰BZtßu(fl

4.2 \] 2]^_;½ -aÌ

2

ÌgòHg«

(Sequential Quadratic Program- ming Method:SQP)

P!X Ú`£IJbac«T!£[j!X¤]

^_`h(iKLMNO(’rZdedefXgdhi+jk;f

t ¿ Œ+e;Yfl{|eop;q(’ ¬ ƒf () è«+T/0

r;s8t;d n l

3

(4)

5000N 5000N

[m]

[m]

2 2 Stages Truss

1 Parameter of PMBGA Penalty Pulling function Back

Population Size 512 64

Number of Islands 32 4

PMBGA (A) 25%

PMBGA (B) 2

PMBGA (Archine Size) 100

Mutation Rate 0.01

Number of Elite

Individuals 1

Migration Rate 0.0625 Migration Interval 5 Generation Terminal Criterion 1 106Evaluations

Maximum Value

of Design Variables 1 103 Minimum Value

of Design Variables 1 1015

ogG+’µ(Ygf

SQPj;PX;֒ 1 10−6m2

1 10−3m2

T

õ

\+ŽÑ’!ÛZd n Ö+bµ

YX;®a¯aP®a¯gØATaúgûA

1 109m2

É

Ê8tJ;fztj;Í8d n l

4.3

Gœjµ+Yf

PMBGATÐ(ÑÒÓÔb` 1’"!u¢l

rs;NO+PX

N 2

’"!u Ñ!vwxKLM;NO+jk

fl¢]g^;_`PXAB+’ ¬ YgeC:(

40MPa

É;Ê

¬

|­ê&E(

¬

z;ŽJgYTO[j;k8Ý

6

í;Ø

10

AB

20

];^(TMUÑ!v;wgx;K;LgM(jkgfl

ßÑ!v;w;x;K;L;MgN;Ob

() u(f

PMBGA

’¥

§a¨©gª«aX+³ai´?dßäaåAb&Œ$#ŒaLgµ?d n èg«aX

¬

SQP

j…Y n%& b/0ufl %& Pu'(e

20(

†(T

%&

jgk;fl

`

2

’KL…)*+X@`

3

’KL…+,ùŽ%Œ

n Ë

TQ-ò./++b"!u¢lKL…+PM%Ñ!v;wx+T

&" 

5.9 10−4m3

É;Ê/tgd n l

zόŽ!T %0& \ŽÏX (g) u£f

PMBGA

’ ¥§¨£©¢ª

« ¬ |­g³gi´?dbÃAÄ12g‚èg«APX

SQP

’/3'

4Í/d

n

…®¯(b†ù}zt;jif+zt•+\fl

m

n X¢KL…)*;Ë+’ ¬ ƒfQ-ò.5++jPX¥

§g¨(©;ª«+bLgµ/d n

PMBGA

K/y76(JgY&;ò

.+j…+b – f(zt!jiX³i´/d%è«+bL;µZd n

2 Comparison of PMBGA with penalty function method, PMBGA with pulling back method and SQP (Success Rate)

Success Rate

SQP 2/20

Penalty Function 20/20 Pulling Back 20/20

3 Comparison of PMBGA with penalty function method, PMBGA with pulling back method and SQP (Number of Function Calls)

Number of Function Calls

SQP 67,370

Penalty Function 41,608

Pulling Back 169,726

PMBGA P¥g§a¨A©;ª«AbLgµ?d n yT|AÝ QCR T gò.+  ¡ jgk;fz;t•+\;fl

5. 8 9

opq(jP!XvwxKLM;NO+b…SR G:;fG%

'¨<=(I>¨?5@"Ab () d n lzT>¨5?5@A

jPX¢]^_;`h(iTKLMNO(’rZdeX¥§;¨

©ª « ¬

GA

T…®¯+°’G†‡ˆ—˜œb!™;Œ n

…š›œbK/y%±+YG†‡;ˆ—˜œ’³i´uZt!Y+}%ä;å

b

(&) u+f

PMBGA

’h;×gu(fl

() >¨5?@"APX9%Ñ!vwxK;LMNO+b…

Rzgt;jgiXÚ&`+I;Jac«T([;j;k;f

SQP

|

ÝyCB;Œ n …;®;¯g‰;ˆbD([ztb , Ž\;’(d n l

EF opq+PHGIJ+\+Ž!T›K(bHL+ƒ n îHMNO

P T

PQ/RS

©ªT>p;q5U

SVTWTX

¬

ƒfp;q

TY/tde†G n l8z;z’ZZde[;øb`;u¢l

\ ] ^ _

1) Goldberg,D.E. Genetic Algorithms in Search Optimization and Machine Learnig, Addison- Wesley, 1989.

2) Holland,J.H. Adaptation In Natural and Artificial Systems, University of Michigan Press,1975.

3) Pelikan,M. and Goldberg,D.E. and Fernando Lobo, A Servey of Optimization by Building and Using Probabilistic Models, illiGAL Report No.99018, 1999.

4) Michalewicz,Z. and Janikow,C.Z. Handling Constraints in Genetic Algorithms, Proc. of the International conference on Genetic Algo- rithms 4,pp.151-157

5) Tanese,R. Distributed Genetic Algorithms, Proc. of the 3rd International Conference on Genetic Algorithms,1989.

(5)

:

4

, ,

Ê

;fG%'!¨<=+I>!¨5?5@"A;’œ|f8%Ñ!!v;w…

;ž;Ÿ P V @ÓA

IPSJ Symposium Series Vol.2003, No2 ISSN 1334-0640, pp. 193–196

(2003 1 9

+

MPS

V

)

4 !"#$ :

îMNO P%P A

/

îMNO P O P&%P pqI

I !g©''($Up;q)

(http://mikilab.doshisha.ac.jp)

5

参照

関連したドキュメント

Keywords: Convex order ; Fréchet distribution ; Median ; Mittag-Leffler distribution ; Mittag- Leffler function ; Stable distribution ; Stochastic order.. AMS MSC 2010: Primary 60E05

It is suggested by our method that most of the quadratic algebras for all St¨ ackel equivalence classes of 3D second order quantum superintegrable systems on conformally flat

In particular, we consider a reverse Lee decomposition for the deformation gra- dient and we choose an appropriate state space in which one of the variables, characterizing the

Using right instead of left singular vectors for these examples leads to the same number of blocks in the first example, although of different size and, hence, with a different

In Section 3, we show that the clique- width is unbounded in any superfactorial class of graphs, and in Section 4, we prove that the clique-width is bounded in any hereditary

Inside this class, we identify a new subclass of Liouvillian integrable systems, under suitable conditions such Liouvillian integrable systems can have at most one limit cycle, and

Splitting homotopies : Another View of the Lyubeznik Resolution There are systematic ways to find smaller resolutions of a given resolution which are actually subresolutions.. This is

To derive a weak formulation of (1.1)–(1.8), we first assume that the functions v, p, θ and c are a classical solution of our problem. 33]) and substitute the Neumann boundary