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.


    Access

    Access via TIB

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    A New Branch-and-Cut Algorithm for the Generalized Directed Rural Postman Problem



    Published in:

    Transportation science ; 50 , 2 ; 750-761


    Publication date :

    2016




    Type of media :

    Article (Journal)


    Type of material :

    Print


    Language :

    English



    Classification :

    Local classification 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

    Ávila, Thais / Corberán, Ángel / Plana, Isaac et al. | British Library Online Contents | 2016


    A Branch-and-Cut Algorithm for the Multidepot Rural Postman Problem

    Fernández, Elena / Laporte, Gilbert / Rodríguez-Pereira, Jessica | British Library Online Contents | 2018


    The Directed Rural Postman Problem with Turn Penalties

    Benavent, E. / Soler, D. | British Library Online Contents | 1999


    The Directed Rural Postman Problem with Turn Penalties

    Benavent, Enrique | Online Contents | 1999