4OR

, Volume 12, Issue 4, pp 359–372

Approximating the length of Chinese postman tours

  • Nathalie Bostel
  • Philippe Castagliola
  • Pierre Dejax
  • André Langevin
Research paper

DOI: 10.1007/s10288-014-0260-9

Cite this article as:
Bostel, N., Castagliola, P., Dejax, P. et al. 4OR-Q J Oper Res (2014) 12: 359. doi:10.1007/s10288-014-0260-9

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.

Keywords

Vehicle routing Logistics Statistics Transport 

Mathematics Subject Classification

90B06 Logistics and transportation 62J02 General nonlinear regression 

Copyright information

© Springer-Verlag Berlin Heidelberg 2014

Authors and Affiliations

  • Nathalie Bostel
    • 1
  • Philippe Castagliola
    • 1
  • Pierre Dejax
    • 2
  • André Langevin
    • 3
  1. 1.LUNAM UniversitéUniversité de Nantes, IRCCyN UMR CNRS 6597NantesFrance
  2. 2.LUNAM UniversitéÉcole des Mines de Nantes, IRCCyN UMR CNRS 6597NantesFrance
  3. 3.Department of Mathematics and Industrial Engineering, CIRRELTÉcole Polytechnique de MontréalMontrealCanada

Personalised recommendations