Arc Routing Problems, Part I: The Chinese Postman Problem

H. A. Eiselt, Michel Gendreau and Gilbert Laporte
Additional contact information
H. A. Eiselt: University of New Brunswick, Fredericton, New Brunswick, Canada
Michel Gendreau: Centre de recherche sur les transports, Université de Montréal, Montréal, Québec, Canada
Gilbert Laporte: Centre de recherche sur les transports, Université de Montréal, Montréal, Québec, Canada

Operations Research, 1995, vol. 43, issue 2, 231-242

Abstract: Arc routing problems arise in several areas of distribution management and have long been the object of study by mathematicians and operations researchers. In the first of a two-part survey, the Chinese postman problem ( CPP ) is considered. The main algorithmic results for the CPP are reviewed in five main sections: the undirected CPP , the directed CPP , the windy postman problem, the mixed CPP , and the hierarchical CPP .

Keywords: transportation; vehicle routing; Chinese postman problem (search for similar items in EconPapers)
Date: 1995
References: Add references at CitEc
Citations: View citations in EconPapers (51)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.43.2.231 (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:oropre:v:43:y:1995:i:2:p:231-242

Access Statistics for this article

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