A memory binary particle swarm optimization

This paper proposes a memory binary particle swarm optimization algorithm (MBPSO) based on a new updating strategy. Unlike the traditional binary PSO, which updates the binary bits of a particle ignoring their previous status, MBPSO memorizes the bit status and updates them according to a new defined velocity. As such, precious historical information could be retained to guide the search. The velocity vector of MBPSO is designed as a probability for deciding whether the particle bits change or not. The proposed algorithm is tested on four discrete benchmark functions. The experimental results reported over 100 runs show that MBPSO is capable of obtaining encouraging performance in discrete optimization problems.