Skip to main content

Advertisement

SpringerLink
Log in

An integer programming approach for the Chinese postman problem with time-dependent travel time

  • Published:
Journal of Combinatorial Optimization Aims and scope Submit manuscript

Abstract

The Chinese postman problem with time-dependent travel time (CPPTDT) is a generalization of the classical Chinese postman problem (CPP), where the travel time on an arc depends on the time of beginning of travel along it. While CPP and its almost static variants can be solved by integer program successfully, there are very challenging time varying CPP variants, such as CPPTDT, which are difficult to be formulated directly. The first and the only integer programming formulation modeling the time varying CPP directly was presented in the pioneering work of Wang and Wen (Comput Math Appl 44:375–387, 2002), which was unfortunately based on a strong assumption that each basic cycle in the graph must visit the depot. In this work, we propose a new integer programming formulation for the CPPTDT without any unrealistic assumptions, namely, the arc-cycle formulation, which can be viewed as an extended version of the formulation given by Wang and Wen. The constraint set of this formulation can be divided into two parts. The first part has a strong combinatorial structure, which is linear and used to define the polytope of cycle-path alternation sequence (CPAS). We determine the dimension of the CPAS polytope and identify the facet defining inequalities which may be helpful to tighten the integer programming formulation. The second part is closely related to time-dependent travel time and is nonlinear. The linearization is provided to the case when all the travel times are piecewise functions of beginning time, and several strong, valid inequalities are also proposed. The computation results with a cutting plane algorithm using the new cuts are reported on several randomly generated instances.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8

Similar content being viewed by others

References

  • Aho AV, Dahbura AT, Lee D, Uyar MU (1991) An Optimisation technique for protocol conformance test generation based on UIO sequences and rural Chinese postman tours. IEEE Trans Commun 39:1604–1615

    Article  Google Scholar 

  • Aminu UF, Eglese RW (2006) A constraint programming approach to the Chinese postman problem with time windows. Comput Oper Res 33(12):3423–3431

    Article  MATH  MathSciNet  Google Scholar 

  • Bang J, Gutin G (2001) Digraphs: theory. Algorithms and applications. Springer, London

    Google Scholar 

  • Chi C, Hao R (2007) Test generation for interaction detection in feature-rich communication systems. Comput Netw 51:426–438

    Article  MATH  Google Scholar 

  • Corberan A, Romero A, Sanchis JM (2003) The mixed general routing polyhedron. Math Program 96:103–137

    Article  MATH  MathSciNet  Google Scholar 

  • Corberan A, Mejia G, Sanchis JM (2005) New results on the mixed general routing problem. Oper Res 52:363–376

    Article  MathSciNet  Google Scholar 

  • Dror M (2000) Arc routing: Theory, solutions and applications. Kluwer Academic Publishers, Boston

    Book  Google Scholar 

  • Edmonds J, Johnson EL (1973) Matching, Euler tours and the Chinese postman. Math Program 5:88–124

    Article  MATH  MathSciNet  Google Scholar 

  • Eglese RW (1994) Routing winter gritting vehicles. Discr Appl Math 48:231–244

    Article  MATH  Google Scholar 

  • Eiselt HA, Gendreau M, Laporte G (1995a) Arc routing problems, Part 1: The Chinese postman problem. Oper Res 43:231–242

    Article  MATH  MathSciNet  Google Scholar 

  • Eiselt HA, Gendreau M, Laporte G (1995b) Arc routing problems, Part 2: The Chinese postman problem. Oper Res 43:399–414

    Article  MATH  MathSciNet  Google Scholar 

  • Ghiani G, Laporte G (2000) A branch-and-cut algorithm for the undirected rural postman problem. Math Program 87:467–481

    Article  MATH  MathSciNet  Google Scholar 

  • Goldberg AV, Tarjan RE (1989) Finding minimum-cost circulations by canceling negative cycles. J ACM 36(4):873–886

    Article  MATH  MathSciNet  Google Scholar 

  • Grótschel M, Win Z (1992) A cutting plane algorithm for the windy postman problem. Math Program 55:339–358

    Article  Google Scholar 

  • Guan MK (1962) Graphic programming using odd or even points. Chin Math 1:273–277

    Google Scholar 

  • Hessel A, Larsen KG, Nielsen B, Pettersson P, Skou A(2003) Time-optimal test cases for real-time systems. In: 3rd international workshop on formal approaches to testing of software, Montreal, Quebec, Canada

  • Lai R (2002) A survey of communication protocol testing. J Syst Softw 62:21–46

    Article  Google Scholar 

  • Laporte G (1997) Modeling and solving several classes of arc routing problems as traveling salesman problems. Comput Oper Res 24:1057–1061

    Article  MATH  MathSciNet  Google Scholar 

  • Longo H, Aragao MP, Uchoa E (2006) Solving capacitated arc routing problems using a transformation to the CVRP. Comput Oper Res 33:1823–1837

    Article  MATH  Google Scholar 

  • Malandraki C, Daskin MS (1992) Time dependent vehicle routing problems: formulations. Properties and Heuristic algorithms. Transp Sci 26:185–200

    Article  MATH  Google Scholar 

  • Mullaseril PA (1996) Capacitated rural postman problem with time windows and split delivery. Ph.D Thesis. University of Arizona

  • Nober Y, Picard JC (1996) An optimal algorithm for the mixed Chinese postman problem. Networks 27:95–108

    MathSciNet  Google Scholar 

  • Orda A, Rom R (1990) Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length. J ACM 37:607–625

    Article  MATH  MathSciNet  Google Scholar 

  • Pearn WL, Assad A, Golden BL (1987) Transforming arc routing into node routing problems. Comput Oper Res 14:285–288

    Article  MATH  Google Scholar 

  • Springintveld PR, Vaandrager F (2001) Testing timed automata. Theor Comput Sci 254:225–257

    Article  MATH  MathSciNet  Google Scholar 

  • Tagmouti M, Gendreau M, Potvin JY (2007) Arc routing problems with time-dependent service costs. Eur J Oper Res 181:30–39

    Article  MATH  MathSciNet  Google Scholar 

  • Tan GZ, Sun JH (2011) An integer programming approach for the rural postman problem with time dependent travel time, In: 17th Annual international computing and combinatorics conference (COCOON 2011), LNCS. 6842, pp 414–431

  • Tan GZ, Sun JH, Hou GJ (2012) Time dependent rural postman problem: polyhedral results. Optim Methods Softw. doi:10.1080/10556788.2012.666240

  • Wang HF, Wen XP (2002) Time-constrained Chinese postman problems. Comput Math Appl 44:375–387

    Article  MATH  MathSciNet  Google Scholar 

  • Yannakakis M (2004) Testing, optimization, and games. In: Proceedings of the Nineteenth Annual IEEE Symposium on Logic In Computer Science. LICS. pp 78–88

Download references

Acknowledgments

The authors are grateful to the anonymous referees for their constructive comments that helped to improve the paper in several ways. This research was performed at Northeastern University and was supported by the Natural Science Foundation of China (No. 61300194), the Fundamental Research Funds for the Central Universities (No. N130423007) and the Natural Science Foundation of Hebei Province of China (No. F2013501048). The supports are gratefully acknowledged.

Author information

Authors and Affiliations

  1. School of Computer and Communication Engineering, Northeastern University, NO.143. Taishan Road, Economic-Technological Development Area, Qinhuangdao,  066004, China

    Jinghao Sun & Yakun Meng

  2. School of Computer Science and Technology, Dalian University of Technology, Dalian, China

    Guozhen Tan

Authors
  1. Jinghao Sun
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Yakun Meng
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Guozhen Tan
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Jinghao Sun.

Additional information

The earlier version has been presented in the 7th Frontiers in Algorithmics and Algorithmic Aspects in Information and Management (AAIM2013).

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Sun, J., Meng, Y. & Tan, G. An integer programming approach for the Chinese postman problem with time-dependent travel time. J Comb Optim 29, 565–588 (2015). https://doi.org/10.1007/s10878-014-9755-8

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10878-014-9755-8

Keywords

Search

Navigation