Based on these graphic models an efficient routing algorithm , called ieacs ( intensified evolutionary ant colony system ) algorithm is suggested . ieacs merges the acs ( ant colony system ) and ga ( genetic algorithm ) , thus features both the mechanism of cooperative learning of acs and the information - exchange capability of ga , is presented in this thesis . in case of asymmetric grid graph and grid - off graph 然后,介紹了一種兼具生物仿生特性的蟻群和遺傳算法特點(diǎn)的進(jìn)化蟻群算法,并對(duì)該算法模仿蟻群的協(xié)同學(xué)習(xí)機(jī)制,以及遺傳算法的優(yōu)秀群體中的個(gè)體之間信息交換的策略進(jìn)行了闡述,接著探討了該算法在總體布線和斯坦納樹(shù)問(wèn)題中的應(yīng)用。