Solving the constrained p-center problem using heuristic algorithms

Authors:
Mansoor Davoodi;Ali Mohades;Jafar Rezaei
Affiliations:
Laboratory of Algorithms and Computational Geometry, Department of Mathematics and Computer Science, Amirkabir University of Technology, P.O. Box 15875-4413, Tehran, Iran;Laboratory of Algorithms and Computational Geometry, Department of Mathematics and Computer Science, Amirkabir University of Technology, P.O. Box 15875-4413, Tehran, Iran;Department of Technology, Strategy and Entrepreneurship, Faculty of Technology, Policy and Management, Delft University of Technology, P.O. Box 5015, 2600 GA Delft, The Netherlands
Venue:
Applied Soft Computing
Year:
2011

Citing 16
Cited 0

An overview of representative problems in location research

Management Science
Artificial intelligence: a modern approach

Artificial intelligence: a modern approach
Computational geometry in C (2nd ed.)

Computational geometry in C (2nd ed.)
Efficient algorithms for geometric optimization

ACM Computing Surveys (CSUR)
Faster construction of planar two-centers

SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Multi-Objective Optimization Using Evolutionary Algorithms

Multi-Objective Optimization Using Evolutionary Algorithms
A fast algorithm for the alpha-connected two-center decision problem

Information Processing Letters
A New Formulation and Resolution Method for the p-Center Problem

INFORMS Journal on Computing
An improved algorithm for the p-center problem on interval graphs with unit lengths

Computers and Operations Research
Regional service coverage modeling

Computers and Operations Research
Solving continuous location-districting problems with Voronoi diagrams

Computers and Operations Research
Closest-point problems

SFCS '75 Proceedings of the 16th Annual Symposium on Foundations of Computer Science
Review: The use of computational intelligence in intrusion detection systems: A review

Applied Soft Computing
Simulated annealing algorithm with adaptive neighborhood

Applied Soft Computing
Soft-computing based heuristics for location on networks: The p-median problem

Applied Soft Computing
A simple heuristic for the p-centre problem

Operations Research Letters

Quantified Score

Hi-index	0.00

Visualization

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.