Modelling and Simulation in Engineering

Research Article

Investigation on Evolutionary Computation Techniques of a Nonlinear System

Pseudocode 3

Pseudocode of SOMA.
Input: N, Migrations, PopSize ≥ 2 , 𝑃 𝑅 𝑇 ∈ [ 0 , 1 ] , 𝑆 𝑡 𝑒 𝑝 ∈ ( 0 , 1 ] , M i n D i v ∈ ( 0 , 1 ] ,
   Path Length ∈ (0,5], Specimen with upper and lower bound 𝑥 𝑗 ( ℎ 𝑖 ) , 𝑥 𝑗 ( 𝑙 𝑜 )
Inicialization: ∀ 𝑖 ≤ 𝑃 𝑜 𝑝 𝑆 𝑖 𝑧 𝑒 ∧ ∀ 𝑗 ≤ 𝑁 ∶ 𝑥 𝑖 , 𝑗 , 𝑀 𝑖 𝑔 𝑟 𝑎 𝑡 𝑖 𝑜 𝑛 𝑠 = 0 = 𝑥 𝑗 ( 𝑙 𝑜 ) + 𝑟 𝑎 𝑛 𝑑 𝑗 [ 0 , 1 ] • ( 𝑥 𝑗 ( ℎ 𝑖 ) − 𝑥 𝑗 ( 𝑙 𝑜 ) ) 𝑖 = { 1 , 2 , . . . , 𝑀 𝑖 𝑔 𝑟 𝑎 𝑡 𝑖 𝑜 𝑛 𝑠 } , 𝑗 = { 1 , 2 , . . . , 𝑁 } , 𝑀 𝑖 𝑔 𝑟 𝑎 𝑡 𝑖 𝑜 𝑛 𝑠 = 0 , 𝑟 𝑎 𝑛 𝑑 𝑗 [ 0 , 1 ] ∈ [ 0 , 1 ]
⎧ ⎪ ⎪ ⎪ ⎪ ⎨ ⎪ ⎪ ⎪ ⎪ ⎩ W h i l e 𝑀 i g r a t i o n s < 𝑀 𝑖 𝑔 𝑟 𝑎 𝑡 𝑖 𝑜 𝑛 𝑠 m a x ⎧ ⎪ ⎪ ⎨ ⎪ ⎪ ⎩ ∀ i ≤ 𝑃 𝑜 𝑝 𝑆 𝑖 𝑧 𝑒 𝑊 ℎ 𝑖 𝑙 𝑒 𝑡 ≤ 𝑃 𝑎 𝑡 ℎ 𝐿 𝑒 𝑛 𝑔 𝑡 ℎ 𝑖 𝑓 𝑟 𝑛 𝑑 𝑗 < 𝑃 𝑅 𝑇 𝑝 𝑎 𝑘 𝑃 𝑅 𝑇 𝑉 𝑒 𝑐 𝑡 𝑜 𝑟 𝑗 𝑥 = 1 𝑒 𝑙 𝑠 𝑒 0 , 𝑗 = 1 , … , 𝑁 𝑀 𝐿 + 1 𝑖 , 𝑗 = 𝑥 𝑀 𝐿 𝑖 , 𝑗 , 𝑠 𝑡 𝑎 𝑟 𝑡 + ( 𝑥 𝑀 𝐿 𝐿 , 𝑗 − 𝑥 𝑀 𝐿 𝑖 , 𝑗 , 𝑠 𝑡 𝑎 𝑟 𝑡 ) 𝑡 𝑃 𝑅 𝑇 𝑉 𝑒 𝑐 𝑡 𝑜 𝑟 𝑗 𝑓 ( 𝑥 𝑀 𝐿 + 1 𝑖 , 𝑗 ) = i f 𝑓 ( 𝑥 𝑀 𝐿 𝑖 , 𝑗 ) ≤ 𝑓 ( 𝑥 𝑀 𝐿 𝑖 , 𝑗 , 𝑠 𝑡 𝑎 𝑟 𝑡 ) e l s e 𝑓 ( 𝑥 𝑀 𝐿 𝑖 , 𝑗 , 𝑠 𝑡 𝑎 𝑟 𝑡 ) 𝑡 = 𝑡 + 𝑆 𝑡 𝑒 𝑝 𝑀 i g r a t i o n s = 𝑀 i g r a t i o n s + 1