A generalized traveling salesman problem approach to the directed clustered rural postman problem

Moshe Dror, André Langevin

Research output: Contribution to journalArticle

14 Citations (Scopus)

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.

Original languageEnglish (US)
Pages (from-to)187-192
Number of pages6
JournalTransportation Science
Volume31
Issue number2
StatePublished - May 1997

Fingerprint

salesman
Traveling salesman problem

ASJC Scopus subject areas

  • Management Science and Operations Research
  • Transportation

Cite this

A generalized traveling salesman problem approach to the directed clustered rural postman problem. / Dror, Moshe; Langevin, André.

In: Transportation Science, Vol. 31, No. 2, 05.1997, p. 187-192.

Research output: Contribution to journalArticle

@article{12e0d9beade54059879404cb9a18ecfb,
title = "A generalized traveling salesman problem approach to the directed clustered rural postman problem",
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.",
author = "Moshe Dror and Andr{\'e} Langevin",
year = "1997",
month = "5",
language = "English (US)",
volume = "31",
pages = "187--192",
journal = "Transportation Science",
issn = "0041-1655",
publisher = "INFORMS Inst.for Operations Res.and the Management Sciences",
number = "2",

}

TY - JOUR

T1 - A generalized traveling salesman problem approach to the directed clustered rural postman problem

AU - Dror, Moshe

AU - Langevin, André

PY - 1997/5

Y1 - 1997/5

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0031146796&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0031146796&partnerID=8YFLogxK

M3 - Article

VL - 31

SP - 187

EP - 192

JO - Transportation Science

JF - Transportation Science

SN - 0041-1655

IS - 2

ER -