{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,18]],"date-time":"2025-04-18T04:15:44Z","timestamp":1744949744662,"version":"3.40.4"},"reference-count":13,"publisher":"SAGE Publications","issue":"3","license":[{"start":{"date-parts":[[2019,7,3]],"date-time":"2019-07-03T00:00:00Z","timestamp":1562112000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/journals.sagepub.com\/page\/policies\/text-and-data-mining-license"}],"content-domain":{"domain":["journals.sagepub.com"],"crossmark-restriction":true},"short-container-title":["Journal of Intelligent & Fuzzy Systems"],"published-print":{"date-parts":[[2020,3,4]]},"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.<\/jats:p>","DOI":"10.3233\/jifs-190035","type":"journal-article","created":{"date-parts":[[2019,7,5]],"date-time":"2019-07-05T14:55:20Z","timestamp":1562338520000},"page":"3301-3305","update-policy":"https:\/\/doi.org\/10.1177\/sage-journals-update-policy","source":"Crossref","is-referenced-by-count":7,"title":["An implementation of chinese postman problem with priorities"],"prefix":"10.1177","volume":"38","author":[{"given":"Ms.","family":"Nilofer","sequence":"first","affiliation":[{"name":"Department of Mathematics and Statistics, Manipal University Jaipur, Rajasthan, India"}]},{"given":"Mohd.","family":"Rizwanullah","sequence":"additional","affiliation":[{"name":"Department of Mathematics and Statistics, Manipal University Jaipur, Rajasthan, India"}]}],"member":"179","published-online":{"date-parts":[[2019,7,3]]},"reference":[{"key":"e_1_3_1_2_2","doi-asserted-by":"publisher","DOI":"10.24200\/sci.2016.2127"},{"issue":"6","key":"e_1_3_1_3_2","first-page":"178","article-title":"Combinatorial optimization, algorithms and complexity","volume":"16","author":"Papadimitrou H.","year":"1998","unstructured":"PapadimitrouH. and SteiglitzK., Combinatorial optimization, algorithms and complexity, Dover Publications Inc 16(6) (1998), 178\u2013186.","journal-title":"Dover Publications Inc"},{"key":"e_1_3_1_4_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF01386390"},{"key":"e_1_3_1_5_2","unstructured":"ZhangB. and PengJ. Chinese Postman Problem in Uncertain Network (2015). https:\/\/www.researchgate.net\/publication\/264882600."},{"key":"e_1_3_1_6_2","unstructured":"ZhangB. and PengJ. Chinese Postman Problem With Priorities (2015). https:\/\/www.researchgate.net\/publication\/264882600."},{"key":"e_1_3_1_7_2","article-title":"Integer programming modeling for the chinese postman problems","author":"Junwen F.","year":"2014","unstructured":"JunwenF., Integer programming modeling for the chinese postman problems, School of Economics and Management (2014).","journal-title":"School of Economics and Management"},{"key":"e_1_3_1_8_2","unstructured":"ShengB. LiR. and GutinG. The Euler and Chinese Postman Problems on 2-Arc-Colored Digraphs (2017). https:\/\/arxiv.org\/pdf\/1707.06503."},{"key":"e_1_3_1_9_2","unstructured":"YilmazM. \u00c7odurM.K. and YilmazH. Chinese Postman Problem Approach for a Large-scale Conventional Rail Network in Turkey (2017) https:\/\/hrcak.srce.hr\/file\/277474."},{"key":"e_1_3_1_10_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.trc.2015.01.017"},{"key":"e_1_3_1_11_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.trc.2015.08.022"},{"key":"e_1_3_1_12_2","doi-asserted-by":"publisher","DOI":"10.1002\/net.21605"},{"key":"e_1_3_1_13_2","article-title":"Arc routing problems, methods, and applications","author":"Corberan A.","year":"2014","unstructured":"CorberanA. and LaporteG., Arc routing problems, methods, and applications, Society for Industrial and Applied Mathematics, USA (2014).","journal-title":"Society for Industrial and Applied Mathematics, USA"},{"key":"e_1_3_1_14_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.trpro.2015.09.011"}],"container-title":["Journal of Intelligent & Fuzzy Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.3233\/JIFS-190035","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/full-xml\/10.3233\/JIFS-190035","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.3233\/JIFS-190035","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,17]],"date-time":"2025-04-17T14:52:13Z","timestamp":1744901533000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/10.3233\/JIFS-190035"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,7,3]]},"references-count":13,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2020,3,4]]}},"alternative-id":["10.3233\/JIFS-190035"],"URL":"https:\/\/doi.org\/10.3233\/jifs-190035","relation":{},"ISSN":["1064-1246","1875-8967"],"issn-type":[{"type":"print","value":"1064-1246"},{"type":"electronic","value":"1875-8967"}],"subject":[],"published":{"date-parts":[[2019,7,3]]}}}