Particle Swarm Optimization for Nonlinear Integer Programming Problems
Takeshi Matsui, Kosuke Kato, Masatoshi Sakawa, Takeshi Uno, Koichi Matsumoto · 2008
In this research, focusing on nonlinear integer programming problems, we propose an ap- proximate solution method based on particle swarm optimization proposed by Kennedy et al. To be more specific, we develop a new particle swarm optimiza- tion method which is applicable to discrete optimiza- tion problems by incoporating a new method for gen- erating initial search points, the rounding of values obtained by the move scheme and the revision of move methods. Furthermore, we show the eciency of the proposed particle swarm optimization method by comparing it with an existing method through the application of them into the numerical examples.