This paper presents an alternative heuristic methodology to be used in the design of balanced partitions associated with the servicing of arcs in a rural region. The
construction of partitions is partially based on the sweep algorithm, where the relative geographic position of nodes is determined by their polar coordinate angles. A penalty
function is used to quantify if a solution is well balanced. Furthermore a cluster penalty promotes the connectivity of the arcs within their vehicle cone. The algorithm is applied to the municipality of Glabbeek in order to produce street clusters for waste collection that
are balanced with regard to service time and collected quantity.