Genetic algorithm for mixed Chinese postman problem

  • Authors:

  • Hua Jiang;Lishan Kang;Shuqi Zhang;Fei Zhu

  • Affiliations:

  • Computer School, Wuhan University, Wuhan, Hubei, China;Computer School, Wuhan University, Wuhan, Hubei, China;Computer School, Donghu College, Wuhan University, Wuhan, Hubei, China;China Construction Bank Wuhan Audition Branch, Wuhan, China

  • Venue:
  • ISICA'10 Proceedings of the 5th international conference on Advances in computation and intelligence
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

Mixed Chinese Postman Problem (Mixed CPP) is a NP-Complete problem. This problem has many applications, including route optimization, analyzing interactive system and flow design. This paper presents a genetic algorithm to solve this problem, which has got a good result. Problem-specific genetic operators were designed to keep every individual in population is reasonable and to improve the exploration efficiency. Data experiments show the algorithm is efficient and is better than the existing approximation algorithms.