Afterwards, Wang et al. [27] proposed a novel probability binary
particle swarm optimization (PBPSO) algorithm to solve knapsack
problems. Lee et al. [28] proposed a modified version of BPSO using
the concepts of the genotype–phenotype and the mutation of genetic
algorithm. Simulation results demonstrated that it has a high
possibility of providing an excellent performance for binary space
problems.