Genetic Algorithm for Chinese Postman Problems

作     者：Jiang Hua, Kang Li-shanState Key Laboratory of Software Engineering, Wuhan University,Wuhan 430072,Hubei, China Jiang Hua, Kang Li-shanState Key Laboratory of Software Engineering, Wuhan University,Wuhan 430072,Hubei, China

作者机构：State Key Laboratory of Software Engineering Wuhan University Wuhan Hubei China 

出 版 物：《Wuhan University Journal of Natural Sciences》 (武汉大学学报（自然科学英文版）)

年 卷 期：2003年第8卷第S1期

页      面：316-318页

核心收录：

学科分类：12[管理学] 1201[管理学-管理科学与工程(可授管理学、工学学位)] 07[理学] 070105[理学-运筹学与控制论] 0701[理学-数学] 

基　　金：Supported by the National Natural Science Foundation of China(60133010 70071042) 

主　　题：Chinese postman problem Eularian graph genetic algorithm evolutionary computation 

摘      要：Chinese Postman Problem is an unsettled graphic problem. It was approached seldom by evolutionary computation. Now we use genetic algorithm to solve Chinese Postman Problem in undirected graph and get good results. It could be extended to solve Chinese postman problem in directed graph. We make these efforts for exploring in optimizing the mixed Chinese postman problem.