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

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.

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

scholarly journals Using Genetic Algorithm For Winter Maintenance Operations: Multi Depot K-Chinese Postman Problem

2015 ◽  
Vol 5 (1) ◽  
pp. 50-59 ◽  
Author(s):  
İbrahim Zeki Akyurt ◽  
Timur Keskinturk ◽  
Çağatay Kalkancı
Keyword(s):  
Genetic Algorithm ◽  
Arc Routing ◽  
Chinese Postman Problem ◽  
Routing Problem ◽  
Winter Maintenance ◽  
Starting Point ◽  
Sweep Algorithm ◽  
Chinese Postman ◽  
Maintenance Work ◽  
Maintenance Activities

In this study, the assignment and routing problem of one of Istanbul’s winter maintenance activities, salt pouring, was scrutinized. The starting point of the study considers the high cost of winter maintenance work, a shrinking assigned budget, high numbers of vehicles and streets to service that the increase in difficulty to solve the problem due to their high numbers. In this respect, the problem was modeled as multi depot k-Chinese postman problem, a type of arc routing problem. This mathematical model was solved by genetic algorithm. For comparison, the current solution, Clarke and Wright Algorithm and Sweep Algorithm were used.

Sign in / Sign up

Export Citation Format

Share Document