In this paper a simplification of the CPP is measured, a set of important nodes is given in a linear order and the work is to path all edges at least once in such a technique that the advanced priority nodes are stayed as soon as possible. All roads in the networks are covered by postman tour.postman tour covering all the roads in the network. The solutions found here are valid for the case, where the cost of additional edges traversed is much bigger that the cost of delays and delay for the first priority node is much bigger than the cost of delay for the second node, and so on. More detailed study of various cost functions may be an interesting topic for future research.
Zarrinmehr and ShafahiY., Parallelization of the branch-and-bound algorithm in transportation discrete network design problem, Scientia Iranica23(2) (2016)407–441.
2.
PapadimitrouH. and SteiglitzK., Combinatorial optimization, algorithms and complexity, Dover Publications Inc16(6) (1998), 178–186.
3.
DijkstraE.W., A note on two problems in connection with graphs, Numerische Mathematik23(2) (1959), 269–271.
JunwenF., Integer programming modeling for the chinese postman problems, School of Economics and Management (2014).
7.
ShengB., LiR. and GutinG., The Euler and Chinese Postman Problems on 2-Arc-Colored Digraphs, (2017). https://arxiv.org/pdf/1707.06503.
8.
YilmazM., ÇodurM.K. and YilmazH., Chinese Postman Problem Approach for a Large-scale Conventional Rail Network in Turkey, (2017) https://hrcak.srce.hr/file/277474.
9.
ShafahiA. and HaghaniA., Generalized maximum benefit multiple chinese postman problem, Transportation Research Part C: Emerging Technologies55 (2015), 261–272. 10.1016/j.trc.2015.01.017.
10.
MuraliP., Ordó-ezF. and DessoukyM.M., Modelling strategies for effectively routing freight trains through complex networks, Transportation Research Part C: Emerging Technologies70 (2016), 197–213. 10.1016/j.trc.2015.08.022.
11.
LannezS., ArtiguesC., DamayJ. and GendreauM., A railroad maintenance Prw32wsx2 BCSolved with a cut and column generation matheuristic, Networks, Wiley66(1) (2015), 40–56. 10.1002/net.21605.
12.
CorberanA. and LaporteG., Arc routing problems, methods, and applications, Society for Industrial and Applied Mathematics, USA (2014).
13.
LidenT., Railway infrastructure maintenance – a survey of planning problems and conducted research, Transportation Research Procedia10 (2015), 574583. 10.1016/j.trpro.2015.09.011.
