论文信息 - Differential evolution for integer programming problems

Differential evolution for integer programming problems

The performance of two recent variants of differential evolution (DE) when applied to integer programming problems is investigated. The two DE variants, namely, self-adaptive DE (SDE) and DE using the ring neighborhood topology (a.k.a. DE/lbest/1) are compared with the standard DE and particle swarm optimization (PSO) methods on several integer programming test problems. The results show that the SDE seems to be an efficient alternative for solving integer programming problems.

Andries Petrus Engelbrecht | Mahamed G. H. Omran

[1] Michael N. Vrahatis,et al. Particle swarm optimization for integer programming , 2002, Proceedings of the 2002 Congress on Evolutionary Computation. CEC'02 (Cat. No.02TH8600).

[2] Arthur C. Sanderson,et al. Pareto-based multi-objective differential evolution , 2003, The 2003 Congress on Evolutionary Computation, 2003. CEC '03..

[3] Maurice Clerc,et al. The particle swarm - explosion, stability, and convergence in a multidimensional complex space , 2002, IEEE Trans. Evol. Comput..

[4] Andries Petrus Engelbrecht,et al. Self-adaptive Differential Evolution , 2005, CIS.

[5] R. Kelahan,et al. Application of the adaptive random search to discrete and mixed integer optimization , 1978 .

[6] James Kennedy,et al. Particle swarm optimization , 2002, Proceedings of ICNN'95 - International Conference on Neural Networks.

[7] R. Storn,et al. Differential Evolution - A simple and efficient adaptive scheme for global optimization over continuous spaces , 2004 .

[8] Günter Rudolph,et al. An Evolutionary Algorithm for Integer Programming , 1994, PPSN.

[9] D. Karaboga,et al. A Simple and Global Optimization Algorithm for Engineering Problems: Differential Evolution Algorithm , 2004 .