摘要
本文在遗传算法的基础上,对TSP问题进行了讨论,并对传统求解方法进行了改进,加入了贪婪算法,仿真结果说明了算法的有效性。并就同样是基于遗传算法的避障路径问题进行了探索。TSP系统广泛用于公交车交通线路安排、旅游景点行程安排等,具有较高的实用价值。
Based on the genetic ,this paper discusses TSP question and improves the tradition algorithm by joining the greedy algorithm, the algorithm ＇s efficiency is proved by the simulation results. The paper gives detailed study to the question of avoiding obstacle in the route which is also based on genetic algorithm, TSP system can be used extensively in the arrangement of bus traffic route and the scenic spot journey route etc. It has higher practical value.
出处
《微计算机信息》
北大核心
2006年第02Z期251-253,共3页
Control & Automation
基金
863子课题资助项目
编号为(KL0202200201)
关键词
遗传算法
贪婪算法
货郎担问题
路径规划
genetic algorithm
greedy method
traveling salesman problems
paths programming
