Integer Programming Modeling For The Chinese Postman Problems

2014 ◽  
Vol 03 (02) ◽  
pp. 1-7 ◽  
Author(s):  
Feng Junwen
Keyword(s):  
Integer Programming ◽  
Chinese Postman ◽  
Postman Problems

Genetic Algorithm for the Capacitated Chinese Postman Problem on Mixed Networks

2014 ◽  
Vol 701-702 ◽  
pp. 44-49
Author(s):  
Yu Hong Ma ◽  
Gui Long Tian ◽  
Xian Li
Keyword(s):  
Genetic Algorithm ◽  
Load Capacity ◽  
Arc Routing ◽  
Chinese Postman Problem ◽  
Simulation Experiments ◽  
Routing Problem ◽  
Chinese Postman ◽  
Postman Problems ◽  
Mixed Networks ◽  
Node Routing

The genetic algorithm is used to investigate the Chinese postman problem with the constraints of working time span and load capacity for postman on mixed networks. In course of chromosome encoding, the priority-based encoding for serving edges set is used, and the priority and the strategy of “serve while going” in the shortest path is integrated to use in course of decoding. A genetic scheme is designed to solve the capacitated Chinese postman problem without translating arc routing problem into node routing problem. The simulation experiments show that the methods is feasible and efficient, it can easily solve the capacitated Chinese postman problems on all kinds of complex networks.

Genetic algorithm for Chinese postman problems

2003 ◽  
Vol 8 (1) ◽  
pp. 316-318 ◽  
Author(s):  
Jiang Hua ◽  
Kang Li-shan
Keyword(s):  
Genetic Algorithm ◽  
Chinese Postman ◽  
Postman Problems

scholarly journals On games arising from multi-depot Chinese postman problems

2015 ◽  
Vol 235 (1) ◽  
pp. 675-692 ◽  
Author(s):  
Trine Tornøe Platz ◽  
Herbert Hamers
Keyword(s):  
Chinese Postman ◽  
Postman Problems
Sign in / Sign up

Export Citation Format

Share Document