Abstract: A computer system for allocating and routing a plurality of servicing objects within a map of a region such that work load is balanced across the plurality of servicing objects is provided. The system formulates a model for allocating and routing the plurality of servicing objects in the region. The model comprises a distance matrix based upon a first plurality of segments or a second plurality of intersections in the map. The memory stores instructions for partitioning the map into a plurality of disjoint contiguous sub-regions in view of the distance matrix using an equitable convex region partition algorithm. The memory further stores instructions for calculating a corresponding tour graph for each sub-region in the plurality of sub-regions, where, for each respective sub-region in the plurality of sub-regions, a servicing object in the plurality of servicing objects is assigned to the tour graph that corresponds to the respective sub-region.

Abstract: A computer system for allocating and routing a plurality of servicing objects within a map of a region such that work load is balanced across the plurality of servicing objects is provided. The system formulates a model for allocating and routing the plurality of servicing objects in the region. The model comprises a distance matrix based upon a first plurality of segments or a second plurality of intersections in the map. The memory stores instructions for partitioning the map into a plurality of disjoint contiguous sub-regions in view of the distance matrix using an equitable convex region partition algorithm. The memory further stores instructions for calculating a corresponding tour graph for each sub-region in the plurality of sub-regions, where, for each respective sub-region in the plurality of sub-regions, a servicing object in the plurality of servicing objects is assigned to the tour graph that corresponds to the respective sub-region.