Ant colony multilevel path optimize tactic based on information consistence optimize
The problem of node path attempters which is needed solve the important problem in grid all along. Aim at basic ant colony arithmetic appears halt easiness, through improving basic ant colony arithmetic, bring forward ant colony multilevel path optimize tactic based on information consistence optimize, this tactic use optimize average information element distributed degree, strengthens the whole (the local) information element consistence in path of the best result and better result, consequently resolve the problem of the local best result in basic ant colony arithmetic. Experiment show ant colony multilevel path optimize tactic based on information consistence optimize have better search result in whole than basic ant colony arithmetic, especially for the problem of path searching, this tactic use computing time is much shorter than basic ant colony arithmetic.
component ant colony multilevel path optimize
Chenhan Wu
Wuhan Digital Engineering Graduate School Wuhan, China
国际会议
太原
英文
533-536
2010-10-22（万方平台首次上网日期，不代表论文的发表时间）