Research Article

Investigation on Evolutionary Computation Techniques of a Nonlinear System

Pseudocode 2

Pseudocode of DE.
1. Input: 𝐷 , 𝐺 m a x , 𝑁 𝑃 4 , 𝐹 ( 0 , 1 + ) , 𝐶 𝑅 [ 0 , 1 ] , and initial bounds: 𝑥 ( 𝑙 𝑜 ) , 𝑥 ( 𝑖 ) .
2. Initialize: 𝑖 𝑁 𝑃 𝑗 𝐷 𝑥 𝑖 , 𝑗 , 𝐺 = 0 = 𝑥 𝑗 ( 𝑙 𝑜 ) + 𝑟 𝑎 𝑛 𝑑 𝑗 [ 0 , 1 ] ( 𝑥 𝑗 ( 𝑖 ) 𝑥 𝑗 ( 𝑙 𝑜 ) ) 𝑖 = { 1 , 2 , , 𝑁 𝑃 } , 𝑗 = { 1 , 2 , , 𝐷 } , 𝐺 = 0 , 𝑟 𝑎 𝑛 𝑑 𝑗 [ 0 , 1 ] [ 0 , 1 ]
3 . W h i l e 𝐺 < 𝐺 m a x 𝑖 𝑁 𝑃 4 . M u t a t e a n d r e c o m b i n e 4 . 1 𝑟 1 , 𝑟 2 , 𝑟 3 { 1 , 2 , . . . . , 𝑁 𝑃 } , r a n d o m l y s e l e c t e d , e x c e p t 𝑟 1 𝑟 2 𝑟 3 𝑖 4 . 2 𝑗 𝑟 𝑎 𝑛 𝑑 { 1 , 2 , , 𝐷 } , r a n d o m l y s e l e c t e d o n c e e a c h 𝑖 4 . 3 𝑗 𝐷 , 𝑢 𝑗 , 𝑖 , 𝐺 + 1 = 𝑥 𝑗 , 𝑟 3 , 𝐺 + 𝐹 ( 𝑥 𝑗 , 𝑟 1 , 𝐺 𝑥 𝑗 , 𝑟 2 , 𝐺 ) i f ( 𝑟 𝑎 𝑛 𝑑 𝑗 [ 0 , 1 ] < 𝐶 𝑅 𝑗 = 𝑗 𝑟 𝑎 𝑛 𝑑 ) 𝑥 𝑗 , 𝑖 , 𝐺 o t h e r w i s e 5 . S e l e c t 𝑥 𝑖 , 𝐺 + 1 = 𝑢 𝑖 , 𝐺 + 1 i f 𝑓 ( 𝑢 𝑖 , 𝐺 + 1 ) 𝑓 ( 𝑥 𝑖 , 𝐺 ) 𝑥 𝑖 , 𝐺 o t h e r w i s e 𝐺 = 𝐺 + 1