摘要
邮递员问题是目前一个尚未完全解决的图论问题,而遗传算法则是一个比较好的全局搜索算法,本文提出了一种变换方法,以此为基础,用遗传算法实现了对有向图邮递员问题的求解,较传统方法更加容易实现,在求解大规模复杂网络时,其效率更高。
The Directed Postman Problem is so far a problem which hasn't been solved completely,but Genetic Algorithms is an excellent global searching algorithms. In this article, we proposed an algorithm based on the transformation of graph. It makes the programming and solving massive complicated network problems easier than by traditional algorithms.
出处
《计算机与数字工程》
2000年第3期28-30,共3页
Computer & Digital Engineering
关键词
有向图
邮递员问题
遗传算法
适应度函数
图论
Directed Postman Problem, Genetic Algorithms, Transition, Adaptive Function