Discrete Particle Swarm Optimization with Scout Particles for Library Materials Acquisition

Algorithm 1

Greedy solution method.

Algorithm Greedy:

Sort all materials in nonincreasing order of the ratio (∑^𝑚_𝑗=1𝑝_𝑖𝑗)/𝑐_𝑖;

for  𝑖∶=1 to 𝑛  do

 while (the upper bound on the number of materials in language 𝐿𝑈_𝑙 is not exceeded, 1≤𝑙≤𝑟)

  while (the upper bound on the number of materials in category 𝐶𝑈_𝑘 is not exceeded, 1≤𝑘≤𝑞)

    Sort the departments that propose material 𝑖 in nonincreasing order of 𝑝_𝑖𝑗

    Let (𝑗₁,𝑗₂,…,𝑗_𝑚) be the sorted sequence;

    for  𝑗∶=1 to 𝑚  do

     if (budget 𝐵_𝑗 is not exhausted)

       Set 𝑥_𝑖𝑗=1

    endfor

    Calculate the residual budget of all departments 𝑗 with 𝑥_𝑖𝑗=1 by

    deducing the apportioned cost of material 𝑖.

  endwhile

 endwhile

endfor