scholarly journals Minimum cycle cover and Chinese postman problems on mixed graphs with bounded tree-width

2009 ◽  
Vol 157 (2) ◽  
pp. 272-279 ◽  
Author(s):  
Cristina G. Fernandes ◽  
Orlando Lee ◽  
Yoshiko Wakabayashi
Keyword(s):  
Cycle Cover ◽  
Chinese Postman ◽  
Postman Problems ◽  
Tree Width ◽  
Mixed Graphs

scholarly journals Roteirization of vehicles in the delivery/collection problems - Application of a modifed Ant Colony Algorithm

2020 ◽  
Vol 12 (1) ◽  
pp. 44-53
Author(s):  
Victor Hugo Resende Lima ◽  
Elias De Oliveira Lima ◽  
Hassan Sherafat
Keyword(s):  
Ant Colony Algorithm ◽  
Travelling Salesman Problem ◽  
Ant Colony ◽  
Waste Collection ◽  
Chinese Postman Problem ◽  
Travelling Salesman ◽  
Solid Waste Collection ◽  
Chinese Postman ◽  
Postal Services ◽  
Mixed Graphs

Delivering and collecting problems concern to situations where goods are delivered (or collected) in practical cases. For example, solid waste collection, postal services and snow removing. It can be modelled as the well-known Chinese Postman Problem on mixed graphs (MCPP). The MCPP is a fair model for the delivering and collecting problem because its goal is to cover all links of a mixed graph with minimal cost. The objective of this paper is to develop an algorithm based on Ant Colony Optimization and apply it to MCPP solution. The MCPP is initially converted into an equivalent Travelling Salesman Problem (TSP) and then tackled on this second instance. The results were promising and comparable to some other algorithms. It was found results near of optimal solutions in some cases.

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
Sign in / Sign up

Export Citation Format

Share Document