Abstract
This article develops simple and easy-to-use approximation formulae for the length of a Chinese Postman Problem (CPP) optimal tour on directed and undirected strongly connected planar graphs as a function of the number of nodes and the number of arcs for graphs whose nodes are randomly distributed on a unit square area. These approximations, obtained from a multi-linear regression analysis, allow to easily forecast the length of a CPP optimal tour for various practical combinations of number of arcs and nodes ranging, from 10 to 300 nodes and 15 to 900 arcs.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Beardwood J, Halton J, Hammersley J (1959) The shortest path through many points. Math Proc Cambr Philos Soc 55(4):299–327
Box G, Cox D (1964) An analysis of transformations. J R Stat Soc Ser B 26(2):211–252
Butsch A, Kalcsics J, Laporte G (2013) Districting for arc routing. Tech. rep, Karlsruhe Institute of Technology
Christofides N, Eilon S (1969) Expected distances in distribution problems. Oper Res Q 20(4):437–443
Daganzo C (1984a) The distance travelled to visit \(n\) points with a maximum of \(c\) stops per vehicle: an analytic model and an application. Transp Sci 18(4):331–350
Daganzo C (1984b) The length of tours in zones of different shapes. Transp Res B Methodol 18(2):135–145
Daganzo C (2005) Logistics systems analysis. Lecture notes in economics and mathematical systems, vol 36, 4th edn. Springer, Berlin
Edmonds J (1965) Paths, trees, and flowers. Can J Math 17:449–467
Eilon S, Watson-Gandy C, Christofides N (1971) Distribution management: mathematical modelling and practical analysis, vol 36. Hafner, New York
Geoffrion A (1976) The purpose of mathematical programming is insight not numbers. Interfaces 7(1):81–92
Guan M (1962) Graphic programming using odd and even points. Chin Math 1:273–277
Hall R (1986) Discrete models/continuous models. Omega Int J Manag Sci 14(3):213–220
Langevin A, Mbaraga P, Campbell J (1996) Continuous approximation models in freight distribution: an overview. Transp Res Part B Methodol 30(3):163–188
Muyldermans L (2013) District and sector design for arc routing applications. In: Worshop on arc mouting problems 1 (WARP 1), Copenhagen
Nelder J, Mead R (1965) A simplex method for function minimization. Comput J 7(4):308–313
Newell G (1973) Scheduling, location, transportation and continuum mechanics: some simple approximations to optimization problems. SIAM J Appl Math 25(3):346–360
Acknowledgments
The authors wish to thank Mr. Thomas Pleyber for his contribution to develop the graph generator.
Author information
Authors and Affiliations
Corresponding author
Additional information
The authors wish to acknowledge the support of CPCFQ (Commission Permanente de Coopération Franco-Québécoise) and of the Natural Sciences and Engineering Research Council of Canada.
An erratum to this article is available at http://dx.doi.org/10.1007/s10288-017-0346-2.
Rights and permissions
About this article
Cite this article
Bostel, N., Castagliola, P., Dejax, P. et al. Approximating the length of Chinese postman tours. 4OR-Q J Oper Res 12, 359–372 (2014). https://doi.org/10.1007/s10288-014-0260-9
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10288-014-0260-9