An implementation of chinese postman problem with priorities

Article type: Research Article

Authors: Nilofer, Ms.^{; *} | Rizwanullah, Mohd.

Affiliations: Department of Mathematics and Statistics, Manipal University Jaipur, Rajasthan, India

Correspondence: [*] Corresponding author. Ms. Nilofer, Department of Mathematics and Statistics, Manipal University Jaipur, Rajasthan, India. E-mail: [email protected].

Abstract: 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.

Keywords: Graph, Eulerian tour, road network, higher priority node

DOI: 10.3233/JIFS-190035

Journal: Journal of Intelligent & Fuzzy Systems, vol. 38, no. 3, pp. 3301-3305, 2020