Research On The Algorithm For Solving The P-center Problems In The Plane

The planar p-center problem is an important issue in computational geometry and operations research.This problem has great application value in actual production and life,such as the construction of logistics sites,urban planning and communication base station construction.At the same time,the planar p-center problem is a classic NP-hard problem.It is of great theoretical value to explore an efficient algorithm for solving this problem.The main work of this paper is to design two algorithms for solving the planar p-center problem.This paper first introduces the research value and application value of the planar p-center problem,and reviews the various work and achievements around the plane p-center problem,and clarifies the research goals and directions.Secondly,this paper studies and introduces the classical computational geometry algorithm,geometric concept and heuristic algorithm related to the planar p-center problem.Then,based on summarizing and analyzing the related literatures,two algorithms are designed,the 3-location solution algorithm and the bee-gen algorithm are used to solve the continuous and discrete planar p-center problems.The convexity point set 3-center solving algorithm is an exact solution,and the bee-gen algorithm is a heuristic algorithm using a hybrid strategy.After giving the algorithm related design details and pseudo code description,the actual coding and implementation of the bee-gen algorithm is performed using the Scala programmimg language.In order to verify the validity and correctness of the bee-gen algorithm,this paper constructs multiple sets of test data for the bee-gen algorithm to calculate.Through the actual calculation,the algorithm operation results and visualization results are obtained,and the experimental results are analyzed in detail.The validity and correctness of the proposed algorithm are verified by analyzing and comparing the experimental results.