Towards the Novel Reasoning among Particles in PSO by the Use of RDF and SPARQL

Algorithm 1

Pseudocode of the classic PSO algorithm.

Input: PSO population of particles 𝐱_𝐢=(𝑥_𝑖1,…,𝑥_𝑖𝐷)^𝑇 for 𝑖=1,…,𝑁.

Output: The best solution 𝐱_best and its corresponding value 𝑓_min=min(𝑓(𝐱)).

(1)  init_particles;

(2)  eval=0;

(3)  while termination_condition_not_meet do

(4)  for  𝑖=1 to 𝑁  do

(5)   𝑓_𝑖 = evaluate_the_new_solution(𝐱_𝑖);

(6)   eval=eval+1;

(7)   if  𝑓_𝑖≤𝑝Best_𝑖  then

(8)    𝐩_𝑖=𝐱_𝑖;𝑝Best_𝑖=𝑓_𝑖; // save the local best solution

(9)   end if

(10)   if  𝑓_𝑖≤𝑓_min  then

(11)    𝐱_best=𝐱_𝑖;𝑓_min=𝑓_𝑖; // save the global best solution

(12)   end if

(13)   𝐱_𝑖 = generate_new_solution(𝐱_𝑖);

(14)  end for

(15)  end while