IDEAS home Printed from https://ideas.repec.org/a/inm/ortrsc/v31y1997i2p187-192.html
   My bibliography  Save this article

A Generalized Traveling Salesman Problem Approach to the Directed Clustered Rural Postman Problem

Author

Listed:
  • Moshe Dror

    (MIS, College of Business, University of Arizona, Tucson, Arizona 85721)

  • André Langevin

    (GERAD and École Polytechnique, Montréal, Canada)

Abstract

In this paper, we examine the directed Clustered Rural Postman Problem (CRPP). The CRPP is a restricted version of the Rural Postman Problem in which each connected component of arcs to be serviced has to be completely serviced before servicing another component. We present an enumerative solution approach for the CRPP based on transforming the CRPP into a version of a Generalized Traveling Salesman Problem. This work also represents a simple yet elegant unifying view for some classes of arc and node routing problems.

Suggested Citation

  • Moshe Dror & André Langevin, 1997. "A Generalized Traveling Salesman Problem Approach to the Directed Clustered Rural Postman Problem," Transportation Science, INFORMS, vol. 31(2), pages 187-192, May.
    • Handle: RePEc:inm:ortrsc:v:31:y:1997:i:2:p:187-192
    DOI: 10.1287/trsc.31.2.187
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/trsc.31.2.187
    Download Restriction: no
    File URL: https://libkey.io/10.1287/trsc.31.2.187?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Colombi, Marco & Corberán, Ángel & Mansini, Renata & Plana, Isaac & Sanchis, José M., 2017. "The directed profitable rural postman problem with incompatibility constraints," European Journal of Operational Research, Elsevier, vol. 261(2), pages 549-562.
    2. Snyder, Lawrence V. & Daskin, Mark S., 2006. "A random-key genetic algorithm for the generalized traveling salesman problem," European Journal of Operational Research, Elsevier, vol. 174(1), pages 38-53, October.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:inm:ortrsc:v:31:y:1997:i:2:p:187-192. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.