Then applying Ant colony algorithm to two-layer structure for generating clusters rout plan and nodes rout plan. At last, get the optimal rout table.
然后在簇结构和簇内两个层次上分别运用蚁群算法,生成以簇为基本需求点的行车路线和簇内点集的行车路线,最后获得最佳路径表。
Facing a numerically superior Union force of 130,000 men to 60,000 of their own, Lee and Jackson devised and executed a plan to rout the army of Union General Joseph Hooker (1814-79).
在人数上,他们以60,000对抗联邦军130,000人,李和杰克逊设计并实施了一个击溃约瑟夫·胡克(1814 - 79)的计划。
应用推荐