A New Type of Ant Colony Algorithm for Reducing Searching Time

摘要

Ant colony algorithm is a novel simulated evolutionary algorithm. It provides so possible a way for complicated combinatorial optimization problems such as traveling salesman problem (TSP), assignment problem, job-shop etc as GA, SA, TS, and so on. It is simulated for ants to search the sources of food in artificial ant colony algorithm. Its main characteristics are positive feedback, distributed computing and certain heuristics involved. Positive feedback and combination with certain heuristics make it easier to find better solution. In this paper, a new type of ant colony algorithm is proposed for reducing searching time, and its validity has been proofed by us.