Research on The Layout Optimization Problem of Computational Power Network (CPN) Based on Greedy Algorithm and QUBO Model

To address the problem, we need to deploy two edge servers in a specific area to maximize the computational demand of the coverage. The problem can be transformed into a maximum coverage problem where the goal is to select a set of locations to deploy edge servers such that the total computational demand being covered is maximized. To solve this problem, we use a greedy algorithm. For quantum computing, the problem can be modeled as a quadratic unconstrained binary optimization (QUBO) problem. The solution process involves calculating the coverage area and computational requirements of possible server locations, constructing a QUBO model, solving the model using a solver and simulator, and parsing the results to obtain the optimal server deployment locations. The final result is the coordinate locations of the edge servers with optimized coverage of computational demands and the corresponding amount of coverage computational demands.