摘要
最短路径问题是图论中的典型问题,在生产和生活中具有广泛的实例。它介绍了最短路径的遗传算法的表示与实现、适应函数、交叉和变异操作等问题,对遗传算法求解最短路径问题作了有益的尝试,详细分析了求解最佳路径的遗传算法的构成要素,着重探讨遗传算法求解最短路径问题的可行性,最后通过两个实例求出了两幅图的最短路径。
The shortest path problem is a typical problem in graph theory, it has a wide range of examples in production and daily life. The paper describes the realization of shortest path problem and the genetic algorithm, fitness function, crossover and mutation operation etc.It makes meaningful attempts on the shortest path problem genetic algorithm, and analyse the elements that solve the optimal path of genetic algorithm in detail, focuses on the feasibility that using genetic algorithms to solve the shortest path problem, the shortest path of two images are obtained by two examples at last.
作者
陈宇翔
许德武
CHEN Yu-xiang1, XU De-wu2 (1.Zhejiang Tobacco Company JinHua Branch, Jinhua 321004, China; 2.College of Mathematics Physics & Information Engineering, Zhejiang Normal University, Jinhua 321004, China)
出处
《电脑知识与技术（过刊）》
2010年第14期3733-3735,共3页
Computer Knowledge and Technology
基金
国家自然科学基金资助项目(WEB服务的容错编制研究60873234)
关键词
遗传算法
最短路径
适应函数
选择
交叉
变异
genetic algorithm
shortest path
fitness function
choice
crossover
mutation
