Back

G-2002-51

Recent Trends in Arc Routing

BibTeX reference

Arc routing problems (ARPs) arise naturally in several applications where streets require maintenance, or customers located along road must be serviced. The undirected rural postman problem (URPP) is to determine a least cost tour traversing at least once each edge that requires a service. When demands are put on the edges and this total demand must be covered by a fleet of identical vehicles of capacity Q based at a depot, one gets the undirected capacitated arc routing problem (UCARP). The URPP and UCARP are known to be NP-hard. This chapter reports on recent exact and heuristic algorithms for the URPP and UCARP.

, 22 pages

Research Axis

Research application

Publication

Recent trends in arc routing
Eds I. Hartman and M. Golumbic, Graph Theory, Combinatorics and Algorithmics : Interdisciplinary Applications, (9), Kluwer, 2005 BibTeX reference