Continuous K-Selection Capacity Constrained Assignment in Road-Networks

Chenghua Gong, Xiaoyu Sun, Bin Zhao

Abstract: Given a point set of servers and a point set of users, where each server has a capacity (i.e., a maximum number of users it can serve), the capacity constrained assignment (CCA) is to assign every user to one server subject to the capacity constraints. To offer the highest quality service, we expect to minimize the average distance between users and their assigned server, which is termed optimal assignment. Since users are mobile, it is necessary to carry out real-time reassignment to ensure the high-quality services. Meanwhile, the distribution of users in road-networks is non-uniform. To improve the efficiency of resource utilization, our task is to continuously select k servers from all servers to provide services for all users, which is termed continuous k-selection capacity constrained assignment (C-ACCA) problem. We propose an incremental algorithm Ä-RAIA that checks the server set based on a Voronoi diagram and uses a heuristic method to solve this problem. The experiments on real datasets demonstrate the efficiency and effectiveness of the proposed algorithm.