Arc Routing Problems, Part I: The Chinese Postman Problem

Abstract

Please scroll down for article-it is on subsequent pages With 12,500 members from nearly 90 countries, INFORMS is the largest international association of operations research (O.R.) and analytics professionals and students. INFORMS provides unique networking and learning opportunities for individual professionals, and organizations of all types and sizes, to better understand and use O.R. and analytics tools and methods to transform strategic visions and achieve better outcomes. For more information on INFORMS, its publications, membership, or meetings visit http://www.informs.org

Waste Collection Vehicle Routing Problem: Literature Review

“…These areas of application problem solved by arc routing techniques are provided in this book. In the same year, Eiselt et al [45,46] write two papers (part I and part II) to review the algorithmic methods which are used to solve arc routing application problem -the postman problem. In the first half of part II of the paper on arc routing problem, the algorithmic results for the Chinese postman problem (CPP) are described; in the second half, the rural postman problem is considered and its relevant contents are stated.…”

Industrial aspects and literature survey: Fleet composition and routing

“…Arc routing problems (ARPs) described in [51,52] is a well-established area of research related to the vehicle routing problem. The aim of an ARP is to determine a least-cost traversal of a specific arc subset of a graph.…”

Efficient Algorithms for Eulerian Extension

“…EE is closely related to the well-known Chinese Postman problem [6] and the more general Rural Postman problem [7,12]. More specifically, Rural Postman and WMEE are "equivalent" (see Section 2 for details).…”