The generalized directed rural postman problem, also known as the close-enough arc routing problem, is an arc routing problem with some interesting real-life applications, such as routing for meter reading. In this article we introduce two new formulations for this problem as well as various families of new valid inequalities that are used to design and implement a branch-and-cut algorithm. The computational results obtained on test bed instances from the literature show that this algorithm outperforms the existing exact methods.
A New Branch-and-Cut Algorithm for the Generalized Directed Rural Postman Problem
Transportation science ; 50 , 2 ; 750-761
2016
Aufsatz (Zeitschrift)
Englisch
Lokalklassifikation TIB: | 770/1935/7000 | |
BKL: | 55.80 / 55.80 Verkehrswesen, Transportwesen: Allgemeines |
A New Branch-and-Cut Algorithm for the Generalized Directed Rural Postman Problem
British Library Online Contents | 2016
|A Branch-and-Cut Algorithm for the Multidepot Rural Postman Problem
British Library Online Contents | 2018
|The Directed Rural Postman Problem with Turn Penalties
Online Contents | 1999
|A Generalized Traveling Salesman Problem Approach to the Directed Clustered Rural Postman Problem
Online Contents | 1997
|The Directed Rural Postman Problem with Turn Penalties
British Library Online Contents | 1999
|