Optimization of stochastic chinese postman networks problem using priorities

Abstract

Abstract The postman problem is concern with the choice of root to follow in order that he or she pass each streets at least once and return at starting point with least traveling distance. The Chinese postman problem is transformed as network optimization problem under certain constraint. Stochastic networks are networks of non-binary vertices that differ over time, reflecting the probability of a connection of two nodes. This paper deals with theoretical and mathematical foundation of stochastic networks related to an additional feature of the Chinese postman Problem (CPP) is that postman visited with first priority node as soon as possible. Fleury’s and Dijkstra’s algorithm have been used with respect to Eulerian path. Finally, this paper also illustrates and justify the implementation of the methodology and algorithms. Consideration of cost factors in the ever network problems gives another scope of research.