The Directed Rural Postman Problem with Turn Penalties
- 1 November 1999
- journal article
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Transportation Science
- Vol. 33 (4), 408-418
- https://doi.org/10.1287/trsc.33.4.408
Abstract
In this paper, we introduce a generalization of the directed rural postman problem including new features that can be encountered in practice when routes have to be operated on a street network: some turns are forbidden and other turns are allowed but with some penalties. This new problem is called the directed rural postman problem with turn penalties (DRPP-TP); we present some complexity results and three heuristics for the DRPP-TP: two of them are constructive, whereas the third one is an improvement heuristic. We also present a transformation of the DRPP-TP into an asymmetric traveling salesman problem (ATSP) that allows us to solve the problem exactly using an existing ATSP code. Computational results on a set of instances with up to 180 nodes and 666 arcs, are given.Keywords
This publication has 12 references indexed in Scilit:
- Arc Routing Problems, Part II: The Rural Postman ProblemOperations Research, 1995
- Arc Routing Problems, Part I: The Chinese Postman ProblemOperations Research, 1995
- A computational study of several heuristics for the DRPPComputational Optimization and Applications, 1995
- An additive bounding procedure for the asymmetric travelling salesman problemMathematical Programming, 1992
- The design of a computerized sanitation vehicle routing and scheduling system for the town of oyster bay, new yorkComputers & Operations Research, 1989
- Sequencing of Insertions in Printed Circuit Board AssemblyOperations Research, 1988
- An algorithm for the Rural Postman problem on a directed graphPublished by Springer Science and Business Media LLC ,1986
- A detailed description of a computer system for the routing and scheduling of street sweepersComputers & Operations Research, 1979
- A Computer-Assisted System for the Routing and Scheduling of Street SweepersOperations Research, 1978
- The minimum route problem for networks with turn penalties and prohibitionsTransportation Research, 1969