Abstract
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.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
