logo资料库

改进微粒群算法在“工期固定—资源均衡”优化中的研究.pdf

第1页 / 共9页
第2页 / 共9页
第3页 / 共9页
第4页 / 共9页
第5页 / 共9页
第6页 / 共9页
第7页 / 共9页
第8页 / 共9页
资料共9页,剩余部分请下载后查看
http://www.paper.edu.cn 1 2 1. 211100 2.技术 123000 An Improved Version of PSO for "fixed time limit - resource leveling" Optimization Chen na1, Chen huan2 (1.School of business, Hohai University, Nanjing211100; 2. College of Science, Liaoning Technical University, Fuxin123000) Abstract: Particle Swarm Optimization particles through inter-group cooperation and competition can only be created by groups to optimize the search; the algorithm has strong versatility, with the characteristics of global optimization. In this paper, particle swarm optimization (PSO) is combined with the "fixed time limit - resource leveling" optimization problem. The PSO inertia weight and the velocity update formula are improved and adaptive penalty function method is used to deal with the constraints, so particle swarm optimization makes use better in the problem of optimizing engineering resources. Key words: Particle Swarm Optimization; network optimization; Fixed time limit - resource leveling 1
http://www.paper.edu.cn [1]ESLS EFLF CPM [2][3] [4] [5] BP 1 Kennedy Eberhart 1995 [6] 1.1 x X i , x i 2, i 1, ,..., x Di , D i Di v ,..., v i 2. , t V i v i 1, , 2
(pbest) P i p i 1, , p i 2, ,..., p Di , (gbest) gP http://www.paper.edu.cn [7] v ji , t ( )1 v t )( ji , c 1 r 1 [ p ji , x ji , t )]( c 2 r 2 [ p jg , x ji , t )]( (1) x ji , t ( )1 x ji , t )( v ji , t ( ),1 j ,..,2,1 D (2) w 1c 2c 1r 2r [0,1] [ v min , v max ] x min , x max 1.2 PSO ,(1) ; v ji , t ( )1 i v ji , t )( rc [ p ji , p jg , 2 x ji , t )]( 3 w w (pbest) iP (gbest) Pg w [8]. w i 1.1[ gbest ( pbest i ) average ] 4 c [0,2] r [0,1] 1 2 3 3
pbest, pbest gbest http://www.paper.edu.cn 4 4 5 32 6 pbest pbest 7 pbest gbest gbest 8 5 2 2.1 2 1 T T 1 t tR )( R m 2 1 T T 1 t 2 tR )( R 2 m 5 2 T tR t mR 5 T mR 2 2.2 min E 1 T T 0 2 tR )( dt 2 R m (6) 4
tR s.t. n i tR 1 i http://www.paper.edu.cn (7) R i R t ( ) i AS i t AS 0 t AS D i i t AS +D i i i (8) AS i ES i TF i (9) ES i AS i LS i 10 max{ AS D i } i AS j 11 AS i ,0 i ,...,2,1 n (12) E )(tRi i t iAS i jAS i j iD i 2.3 M X i ( x i 1, , x i 2, ,..., x Di , ) ix V i v i , v i 1, 2, ,..., v i 3, ijv pbest gbest 2.4 [ES,LS] 5
http://www.paper.edu.cn ASP 1 { , AS ,..., nAS } 2 V min ,V max 2.5 [9], min E [ 1 T T 1 t 2 R t R 2 m ] d {)( n 1 i ,0max[ xg ( i 2 )] p 1 j xh })( j (13 )(xgi ; )(xh j )(d ( d 1 t ( ) / 1) t ( ) t ( ) 2 1 2 14 1 2 1 1 d 2 d 131. 2. 3. 3 9 14 6
http://www.paper.edu.cn 3 8 1 4 7 9 B 5 2 6 1 ES LS TF FF 1 2 3 4 5 6 7 8 9 2 4 5 4 3 7 6 4 2 - - - 1 1 2 43 34 57 6 3 5 4 7 4 5 3 5 1 1 1 3 3 5 7 7 13 1 4 2 3 10 8 7 11 13 0 3 1 0 7 3 0 4 0 0 0 1 0 7 3 0 4 0 m=10, c=2, G=100 20 18 16 14 12 10 8 6 4 2 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 2 2 =24.35 7
http://www.paper.edu.cn 18 16 14 12 10 8 4 2 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 3 2 =2.86 88.2% 4 pbest gbest [1]. .[J] ,2008 39(11),64-66. [2]Easa.S. Resource Leveling in Construction by Optimization. Journal of Construction Engineering and Management, 1998, 115 (2), 302-316. [3]. [J]. 1995,7 8
分享到:
收藏