Fast upper and lower bounds for a large‐scale real‐world arc routing problem

Abstract

Arc Routing Problems (ARPs) are a special kind of Vehicle Routing Problem (VRP), in which the demands are located on edges or arcs, instead of nodes. There is a huge literature on ARPs, and a variety of exact and heuristic algorithms are available. Recently, however, we encountered some real-life ARPs with over ten thousand roads, which is much larger than those usually considered in the literature. For these problems, we develop fast upper-and lower-bounding procedures. We also present extensive computational results.

Optimized Planning and Management of Domiciliary and Selective Solid Waste: Results of Application in Brazilian Cities (SisRot®Lix)

“…With CARP solutions, the coverage of the area is not coordinated in a specific region, that is, shift contiguities are not guaranteed, or the same vehicle may collect in opposite places in a city, making managing the execution and measurement of daily processes complex [12]. Most recently, advanced methods have been developed by Boyaci et al [13], considering fast lower bounds for CARP with intermediate facilities, and Janela et al [14], considering balanced routes heuristics for MCARP.…”

“…CARP heuristic method modifications have also been used by Corberán et al [18]; they have been used by Ghiani et al [19,20] in zoning. Wølk and Laporte [21] used CARP with districting for waste collection in Denmark, and Boyaci et al [13] applied fast upper and lower bounds for CARP with intermediate facilities and deadline methodology to large-scale world city instances. SARP was investigated by Mourão et al [2], Rodrigues [15], and Cartinhal et al [22].…”