We do a general study over the Chinese Postman Problem (CCP), in the symmetric, oriented and mixed cases, in consideration to the modeling and exact algorithms published most recently. To find exact solutions "for/to" these versions of the problem we show and use exact implementations reported by Sherafat (to the Oriented and the Mixed cases) with adaptations, Edmonds and Johnson (symmetric case) adapted from Burkard & Derigs approach. The work also presents a set of evaluation instances to the methods, and peculiarities behind them to the performance and solution quality analysis. In this work we show the software XNÊS, which was created to generate graph instances (pure symmetric, mixed and pure oriented) for the Chinese Postman Problem (CPP). We show an implementation of a graph generator in a Visual Interactive Modeling (MVI) mode, which builds graphs with attributes and bindings on nodes and links. This software can be used to demonstrate the effective importance of this problem and its application to academia, as its potential to solve other arc routing problems, or to verify difficult and/or high scale CPP instances.
Chinese postman problem; graphs; visual interactive modeling
