Ant Colony Optimization Algorithm（蚁群优化算法）.pdf

Ant Colony Optimization Algorithm Nada M. A. Al Salami dr_nada71@ ABSTRACT Hybrid algorithm is proposed to solve combinatorial optimization problem by using Ant Colony and Genetic programming algorithms. Evolutionary process of Ant Colony Optimization algorithm adapts genetic operations to enhance ant movement towards solution state. The algorithm converges to the optimal final solution, by accumulating the most effective sub-solutions. Keywords:, ACO, Genetic algorithm, System theory. 1. Background and Related Work process is probabilistically guided by heuristic information on the given problem instance as well as Genetic Algorithms (GA) have been used to by a shared memory containing experience gathered evolve computer programs for specific tasks, and to by the ants in previous iteration. ACO has been design other computational structures. The recent applied to a broad range of hard combinatorial resurgence of interest in AP with GA has been problems. Problems are defined in terms of spurred by the work on Genetic Programming (GP). components and states, which are sequences of GP paradigm provides a way to do program components. Ant Colony Optimization incrementally induction by searching the space of possible ge