Optimal covering tours with turn costs
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
The Rural Postman Problem on mixed graphs with turn penalties
Computers and Operations Research
Lower and upper bounds for the mixed capacitated arc routing problem
Computers and Operations Research
The mixed capacitated general routing problem with turn penalties
Expert Systems with Applications: An International Journal
Experimental evaluation of algorithms for the orthogonal milling problem with turn costs
SEA'11 Proceedings of the 10th international conference on Experimental algorithms
The capacitated general windy routing problem with turn penalties
Operations Research Letters
| Hi-index | 0.00 |
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.