Improvement Procedures for the Undirected Rural Postman Problem
- 1 February 1999
- journal article
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in INFORMS Journal on Computing
- Vol. 11 (1) , 53-62
- https://doi.org/10.1287/ijoc.11.1.53
Abstract
This article describes new construction and postoptimization heuristics for the Undirected Rural Postman Problem. Extensive computational tests indicate that some combinations of these heuristics consistently produce optimal or high-quality solutions.Keywords
This publication has 9 references indexed in Scilit:
- Arc Routing Problems, Part II: The Rural Postman ProblemOperations Research, 1995
- Chapter 5 Arc routing methods and applicationsPublished by Elsevier ,1995
- A polyhedral approach to the rural postman problemEuropean Journal of Operational Research, 1994
- New Insertion and Postoptimization Procedures for the Traveling Salesman ProblemOperations Research, 1992
- Approximation Algorithms for Some Routing ProblemsSIAM Journal on Computing, 1978
- On general routing problemsNetworks, 1976
- Matching, Euler tours and the Chinese postmanMathematical Programming, 1973
- Computer Solutions of the Traveling Salesman ProblemBell System Technical Journal, 1965
- A Method for Solving Traveling-Salesman ProblemsOperations Research, 1958