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

Moshe Dror and André Langevin
Additional contact information
Moshe Dror: MIS, College of Business, University of Arizona, Tucson, Arizona 85721
André Langevin: GERAD and École Polytechnique, Montréal, Canada

Transportation Science, 1997, vol. 31, issue 2, 187-192

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.

Date: 1997
References: Add references at CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://dx.doi.org/10.1287/trsc.31.2.187 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:ortrsc:v:31:y:1997:i:2:p:187-192

Access Statistics for this article

More articles in Transportation Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().