Integer Programming via Chaotic Ant Swarm

This PAPER uses chaotic ant swarm (CAS) to solve the problem of integer programming by embedding the search space Zl into Rl and truncating the real values to the nearest integers. Two novel methods based on the CAS, rounding the real solutions after every step (CAS-F) and after the final step (CAS-S), are given and numerical experiences show that in most cases the CAS-F outperforms the CAS-S. Finally the CAS-F is compared with the particle swarm optimization (PSO) on seven widely used integer programming test problems. Results not only indicate that the CAS-F can efficiently deal with this problem, but also the CAS-F is better than the PSO in low dimension.