Abstract

AbstractThe 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.KeywordsTime DependentRural Postman ProblemPolyhedral CombinatoricsValid InequalitiesArc-Path Formulation

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.