Ant Colony Optimization Algorithm for Nonlinear Integer Programming

A new ant colony optimization algorithm for unconstrained nonlinear integer optimization problem is presented.The ants move around the set of integers space,and while walking the ants lays down pheromone on the ground.The pheromone is used to direct the search process.Experimental analyses are carried out on the reasonable selection on the parameters of this algorithm,and the basic principles for the parameter selection are provided.Results of numerical tests show the effectiveness and generality of the method.