HYBRID CODING PSO-ACO CO-EVOLUTIONARY ALGORITHM FOR SOLVING MIXED-INTEGER PROGRAMMING PROBLEMS

A co-evolutionary algorithm based on particle swarm optimization (PSO) and ant colony optimization (ACO) is given to solve the bound constrained mixed-integer programming problem (BCMIP). For the specificity of the problem, the hybrid coding includes the real coding and the integer coding. The real coding part is evolved by PSO while the integer coding part is evolved by ACO. The entire population is co-evolved by PSO and ACO. Numerical experiments show that the proposed algorithm is feasible and effective to solve BCMIP. We also obtain satisfactory result to solve MIP when the proposed algorithm is combined with penalty function method.