Hybrid Coding Collaborative DE-ACO Algorithm for Solving Mixed-Integer Programming Problems
چکیده
This paper presents a hybrid coding collaborative ant colony-differential evolution algorithm for solving bound constrained mixed integer programming problems. In this algorithm, a real number and integer hybrid coding strategy is used, and the population evolution is realized by colony optimization and differential evolution. It is shown by numerical experiments that the proposed algorithm is effective. The proposed algorithm is combined with penalty function method to solved the general mixed integer programming problems. Numerical experiments show that the proposed method achieves satisfactory results.