A Novel Ant Colony Algorithm with Grouping Strategy Based on Time Model

Although basic ant colony algorithm has been successfully used in many fields, it is inconvenient for rookies because many parameters need to be adjusted in its application. A novel ant colony algorithm based on time model is put forward. It is supposed that each ant´s velocity is the same and all ants are crawling in full time. Ants communicate with others by the pheromone that is left on the road. When an ant finishes its journey, the known optimal route is saved. After some time the ants trail will be on the optimal route between the food and the nest. Later the primitive ants are grouped into several groups. The algorithm mentioned above is used in each group independently. It is testified by the experiment that the novel algorithm is as well as other ant colony algorithm and simpler to justify the parameters than before