Particle swarm optimization for nonlinear 0-1 programming problems

In this research, focusing on nonlinear 0-1 programming problems, we propose an approximate solution method based on particle swarm optimization proposed by Kennedy et al. To be more specific, we develop a new particle swarm optimization method which is applicable to discrete optimization problems by incorporating new methods for generating initial search points and move schemes. Furthermore, we show the efficiency of the proposed particle swarm optimization method by comparing it with existing methods through the application of them into the numerical examples.