Solving the constrained p-center problem using heuristic algorithms

Applied Soft Computing Journal

Volumn 11, Issue 4, 2011, Pages 3321-3328

  Davoodi, Mansoor ^a   Mohades, Ali ^a   Rezaei, Jafar ^b  

^a AMIRKABIR UNIVERSITY OF TECHNOLOGY   (Iran)

^b DELFT UNIVERSITY OF TECHNOLOGY   (Netherlands)

Author keywords

Heuristic algorithms; Optimization; p Center problem; Voronoi diagram

Indexed keywords

DISCRETE SPACES; GLOBAL OPTIMUM; HIGH PROBABILITY; LOCAL OPTIMUM; LOCATION PROBLEMS; P-CENTER; P-CENTER PROBLEM; REAL-WORLD PROBLEM; TEST PROBLEM; VORONOI DIAGRAMS;

COMPUTATIONAL GEOMETRY; GRAPHIC METHODS; OPTIMIZATION;

HEURISTIC ALGORITHMS;

EID: 79954603827     PISSN: 15684946     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.asoc.2011.01.001     Document Type: Article

References (37)

1. R.J. Fowler, M.D. Paterson, and D.L. Tanimoto Optimal packing and covering in the plane are NP-complete Information Processing Letters 12 1987 133 137
2. M.S. Daskin Network and Discrete Location: Models, Algorithms and Applications 1995 John Wiley New York
3. Z. Drezner The p-center problem - heuristics and optimal algorithms Journal of the Operational Research Society 35 1984 741 748 (Pubitemid 14624121)
4. A. Suzuki, and Z. Drezner The p-center location problem in an area Location Science 4 1/2 1996 69 82 (Pubitemid 27325101)
5. A. Suzuki, and Z. Drezner The minimum equitable radius location problem with continuous demand European Journal of Operation Research 195 1 2009 17 30
6. P.K. Agarwal, and M. Sharir Efficient algorithms for geometric optimization ACM Computing Surveys 30 4 1998 412 458
7. S. Elloumi, M. Labbe, and Y. Pochet A new formulation and resolution method for the p-center problem INFORMS Journal on Computing 16 1 2004 84 94 (Pubitemid 39043211)
8. D. Hochbaum, and D.B. Shmoys A best possible heuristic for the k-center problem Mathematics and Operation Research 10 1985 180 184 (Pubitemid 15547836)
9. D.S. Hochbaum, and A. Pathria Generalized p-center problems: complexity results and approximation algorithms European Journal of Operation Research 100 1997 594 607 (Pubitemid 127392381)
10. C. Caruso, A. Colorni, and L. Aloi Dominant, an algorithm for the p-center problem European Journal of Operational Research 149 2003 53 64
11. T.C.E. Cheng, L. Kang, and C.T. Ng An improved algorithm for the p-center problem on interval graphs with unit lengths Computers and Operations Research 34 2007 2215 2222 (Pubitemid 46073418)
12. M.E. Dyer, and A.M. Frieze A simple heuristic for the p-center problem Operations Research Letters 3 1985 285 288
13. H. Wei, A.T. Murray, and N. Xiao Solving the continuous space p-centre problem: planning application issues IMA Journal of Management Mathematics 17 4 2006 413 425 (Pubitemid 44574115)
14. R.Z. Hwang, R.C.T. Lee, and R.C. Chang The slab dividing approach to solve the Euclidean P-center problem Algorithmica 9 1993 1 22 (Pubitemid 23600222)
15. J. Elizinga, and D.W. Hearn Geometrical solution to some minimax location problems Transportation Science 6 1972 379 394
16. M.I. Shomos, and D. Hoey Closest-point problems Proc. 16th Annu. IEEE Sympos. Found. Comput. Sci. 1975 151 162
17. 3 and related problems SIAM Journal on Computing 12 1983 759 776
18. M. Sharir A near-linear algorithm for the planar 2-center problem Discrete Computational Geometry 18 1997 125 134
19. D. Eppastein Faster construction of planar two-centers Proc. of the 8th ACM-SIAM Symposium on Discrete Algorithms 1997 131 138
20. P.H. Huang, Y.T. Tsai, and C.Y. Tang A fast algorithm for the alpha-connected two-center decision problem Information Processing Letters 85 2003 205 210
21. P.H. Huang, Y.T. Tsai, and C.Y. Tang A near-quadratic algorithm for the alpha-connected two-center problem Journal of Information Science and Engineering 22 2006 1317 1324
22. A.T. Murray, M.E. O'Kelly, and R.L. Church Regional service coverage modeling Computer and operation research 35 2008 339 355 (Pubitemid 47031458)
23. M. Davoodi, and A. Mohades Solving the constrained coverage problem Applied Soft Computing 11 2011 963 969
24. T. Daoqin, A. Murray, and N. Xiao Heuristics in spatial analysis: a genetic algorithm for coverage maximization Annals of the Association of American Geographers 99 4 2009 698 711
25. M.L. Brandeau, and D.S. Chiu An overview of representative problems in location research Management Science 35 1989 645 674
26. J.M. Cadenas, M.J. Canos, M.C. Garrido, C. Ivorra, and V. Liern Soft-computing based heuristics for location on networks: The p-median problem Applied Soft Computing 2 11 2011 1540 1547
27. A. Suzuki, and A. Okabe Z. Drezner, Using Voronoi Diagrams. Facility Location: A Survey of Applications and Methods 1995 Springer New York 103 118
28. A.G.N. Novaes, J.E. Souza de Cursi, A.C.L. da Silva, and J.C. Souza Solving continuous location - districting problems with Voronoi diagrams Computers and Operations Research 36 2009 40 59
29. F. Plastria Z. Drezner, Continuous Covering Location Problem. Facility Location: Application and Theory 2002 Springer New York 37 79
30. J. O'Rourke Computational Geometry in C 2nd ed 1998 Cambridge University Press New York
31. M. de Berg, M. van Kreveld, M. Overmans, and O. Schwarzkopf Computational Geometry: Algorithms and Applications 2nd rev. ed. 2000 Springer-Verlag Berlin
32. S.J. Fortune A sweepline algorithm for Voronoi diagrams Algorithmica 2 1987 153 174
33. B. Pelegrin, and L. Canovas A new assignment rule to improve seed points algorithms for the continuous k-center problem European Journal of Operational Research 104 1998 366 374 (Pubitemid 128389084)
34. S.X. Wu, and W. Banzhaf The use of computational intelligence in intrusion detection systems: a review Applied Soft Computing 10 1 2010 1 35
35. K. Deb Multi-Objective Optimization using Evolutionary Algorithms 2001 Wiley
36. S.J. Russell, and P. Norvig Artificial Intelligence A Modern Approach 1995 Prentice Hall Englewood Cliffs, New Jersey
37. Z. Xinchao Simulated annealing algorithm with adaptive neighborhood Applied Soft Computing 2 11 2011 1827 1836