Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
496482 | Applied Soft Computing | 2011 | 8 Pages |
Abstract
The p-center problem is one of the location problems that have been studied in operations research and computational geometry. This paper describes a compatible discrete space version of the heuristic Voronoi diagram algorithm. Since the algorithm gets stuck in local optimums in some cases, we apply a number of changes in the body of the algorithm with regard to the geometry of the problem, in a way that it can reach the global optimum with a high probability. Finally, a comparison between the results of these two algorithms on several test problems and a real-world problem are presented.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science Applications
Authors
Mansoor Davoodi, Ali Mohades, Jafar Rezaei,