کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
496482 862861 2011 8 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
Solving the constrained p-center problem using heuristic algorithms
موضوعات مرتبط
مهندسی و علوم پایه مهندسی کامپیوتر نرم افزارهای علوم کامپیوتر
پیش نمایش صفحه اول مقاله
Solving the constrained p-center problem using heuristic algorithms
چکیده انگلیسی

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.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Applied Soft Computing - Volume 11, Issue 4, June 2011, Pages 3321–3328
نویسندگان
, , ,