Abstract
The Chinese Postman Problem is a famous and classical problem in graph theory. This paper introduces a new variant of this problem, namely Rural Postman Problem with Time Dependent Travel Times, which is motivated from scheduling with time dependent processing times. An arc-path formulation of the problem is given and strong valid inequalities are derived. A subset of constraints in this formulation has a strong combinatorial structure, which is used to define the polytope of arc-path alternation sequence. The facial structure of this polytope is investigated and facet defining inequalities are presented which may be helpful to tighten the integer programming formulation. Computational results that verifies the effect of facet defining and strong valid inequalities are presented.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Sundararaghavan, P.S., Kunnathur, A.S.: Single machine scheduling with start time dependent processing times: Some solvable cases. European Journal of Operational Research 78, 394–403 (1994)
Tagmouti, M., Gendreau, M., Potvin, J.Y.: Arc routing problems with time-dependent service costs. European Journal of Operational Research 181, 30–39 (2007)
Mullaseril, P.A.: Capacitated rural postman problem with time windows and split delivery, Ph.D Thesis. University of Arizona (1996)
Ghiani, G., Laporte, G.: A branch-and-cut algorithm for the Undirected Rural Postman Problem. Mathematical Programming 87, 467–481 (2000)
Corberan, A., Romero, A., Sanchis, J.M.: The mixed general routing polyhedron. Mathematical Programming 96, 103–137 (2003)
Corberan, A., Mejia, G., Sanchis, J.M.: New Results on the Mixed General Routing Problem. Operations Research 52, 363–376 (2005)
Longo, H., Aragäo, M.P., Uchoa, E.: Solving capacitated arc routing problems using a transformation to the CVRP. Computers and Operations Research 33, 1823–1837 (2006)
Orda, A., Rom, R.: Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length. Journal of ACM 37, 607–625 (1990)
Malandraki, C., Daskin, M.S.: Time Dependent Vehicle Routing Problems: Formulations, Properties and Heuristic Algorithms. Transportation Science 26, 185–200 (1992)
Bang, J., Gutin, G.: Digraphs: Theory, Algorithms and Applications. Springer, London (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Tan, G., Sun, J. (2011). An Integer Programming Approach for the Rural Postman Problem with Time Dependent Travel Times. In: Fu, B., Du, DZ. (eds) Computing and Combinatorics. COCOON 2011. Lecture Notes in Computer Science, vol 6842. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-22685-4_37
Download citation
DOI: https://doi.org/10.1007/978-3-642-22685-4_37
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-22684-7
Online ISBN: 978-3-642-22685-4
eBook Packages: Computer ScienceComputer Science (R0)