An integer programming approach for the rural postman problem with time dependent travel times

Authors:
Guozhen Tan;Jinghao Sun
Affiliations:
School of Computer Science and Technology, Dalian University of Technology, Dalian, China;School of Computer Science and Technology, Dalian University of Technology, Dalian, China
Venue:
COCOON'11 Proceedings of the 17th annual international conference on Computing and combinatorics
Year:
2011

Citing 3
Cited 0

Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length

Journal of the ACM (JACM)
New Results on the Mixed General Routing Problem

Operations Research
Solving capacitated arc routing problems using a transformation to the CVRP

Computers and Operations Research

Quantified Score

Hi-index	0.00

Visualization

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.