In this paper, we consider the Directed Rural Postman Problem with Turn Penalties (DRPP-TP). A solution is a tour that traverses all required arcs of the graph. The total cost of the tour is the sum of the lengths of the traversed arcs plus the penalties associated with the turns. One solution approach involves transforming the arc routing problem into an equivalent node routing problem. An alternative direct approach (without graph transformation) that involves two stages has been proposed in the literature. In the first part of this paper, we investigate the applicability of the direct approach. We identify several characteristics of the input instance that make this approach effective and present several limitations of this approach. In the second part of this paper, we describe an integer linear program that is combined with a local search algorithm. This combination produces high-quality solutions to the DRPP-TP in a reasonable amount of computing time.
|Digital Object Identifier (DOI):||http://dx.doi.org/10.1016/j.ejor.2018.07.004|
|Codice identificativo ISI:||WOS:000447578500027|
|Titolo:||A Two-Stage Solution Approach for the Directed Rural Postman Problem with Turn Penalties|
|Appare nelle tipologie:||1.1 Articolo in rivista|