Solving the constrained p-center problem using heuristic algorithms

Mansoor Davoodi

doi:10.1016/j.asoc.2011.01.001

Solving the constrained p-center problem using heuristic algorithms

2011-06-01

20

PRE

AI

DOI：10.1016/j.asoc.2011.01.001

原文链接

原文求助

摘要

En 中文

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. (C) 2011 Elsevier B.V. All rights reserved.

Keyword:

p-Center problem

Voronoi diagram

Heuristic algorithms

Optimization

Solving the constrained p-center problem using heuristic algorithms

摘要

AI总结

期刊

机构