The Mixed Chinese Postman Problem
Смешанная задача китайского почтальона

M.K. Gordenko, S.M. Avdoshin
2017 Proceedings of the Institute for System Programming of RAS  
The routing problems are important for logistic and transport sphere. Basically, the routing problems related to determining the optimal set of routes in the multigraph. The Chinese postman problem (CPP) is a special case of the routing problem, which has many potential applications. We propose to solve the MCPP (special NP-hard case of CPP, which defined on mixed multigraph) using the reduction of the original problem into General Travelling Salesman Problem (GTSP). The variants of CPP are
more » ... ants of CPP are pointed out. The mathematical formulations of some problems are presented. The algorithm for reduction the MCPP in multigraph into GTSP is shown. The experimental results of solving MCPP in multigraph through the reduction into GTSP are presented.
doi:10.15514/ispras-2017-29(4)-7 fatcat:il7lpcaahretlficgsgozkaqn4