Estimating Service Regions for Battery Exchange Stations

Problems addressing the generation of random polygons have important applications for evaluating the performance of algorithms on polygonal domains. The standard Voronoi diagram can be applied effectively to determine the service regions of battery exchange stations when all service exchange stations have identical capacity. In real world situations however, battery exchange stations possess several levels of capacity. The standard Voronoi diagram does not properly model this situation and we explore the use of the weighted Voronoi diagram structure to determine service regions when capacity levels are not identical. Based on this approach we develop a technique for computing service regions when capacities are not identical and propose an approximation algorithm for estimating the service regions by adding virtual sites near high-capacity stations.