A robust and efficient algorithm for planar competitive location problems

Annals of Operations Research

Volumn 167, Issue 1, 2009, Pages 87-105

  Redondo, J L ^a   Fernandez J ^b   Garcia I ^b   Ortigosa, P M ^a  

^a UNIVERSITY OF ALMERÍA   (Spain)

^b UNIVERSITY OF MURCIA   (Spain)

Author keywords

Competition; Computational study; Continuous location; Evolutionary algorithm; Heuristic; Weiszfeld like algorithm

Indexed keywords

EID: 65349153890     PISSN: 02545330     EISSN: 15729338     Source Type: Journal    
DOI: 10.1007/s10479-007-0233-x     Document Type: Article

References (34)

1. p )-medianoid and (r|p)-centroid problems Location Science 2 193 204
2. Z. Drezner 1984 The p-center problem: heuristic and optimal algorithms Journal of the Operational Research Society 35 741 748 (Pubitemid 14624121)
3. T. Drezner 1994 Optimal continuous location of a retail facility, facility attractiveness, and market share: an interactive model Journal of Retailing 70 49 64
4. Drezner, T. (1995). Competitive location in the plane. In Facility location: a survey of applications and methods (pp. 285-300). Berlin: Springer.
5. T. Drezner 1998 Location of multiple retail facilities with a limited budget - in continuous space Journal of Retailing and Consumer Services 5 173 184 (Pubitemid 28358901)
6. T. Drezner Z. Drezner 2004 Finding the optimal solution to the Huff based competitive location model Computational Management Science 1 193 208
7. Z. Drezner A. Suzuki 2004 The big triangle small triangle method for the solution of non-convex facility location problems Operations Research 52 128 135
8. T. Drezner Z. Drezner S. Salhi 2002 Solving the multiple competitive facilities location problem European Journal of Operational Research 142 138 151 (Pubitemid 35171683)
9. E. Erkut S. Neuman 1989 Analytical models for locating undesirable facilities European Journal of Operational Research 40 275 291
10. J. Fernández B. Pelegrín 2001 Using interval analysis for solving planar single-facility location problems: new discarding tests Journal of Global Optimization 19 61 81 (Pubitemid 33672329)
11. J. Fernández P. Fernández B. Pelegrín 2000 A continuous location model for siting a non-noxious undesirable facility within a geographical region European Journal of Operational Research 121 259 274 (Pubitemid 30531545)
12. k,p,θ -norm and the l b 1,b 2 θ-norm and a study about the selection of the data set Computers and Operations Research 29 609 623
13. J. Fernández B. Pelegrín F. Plastria B. Tóth 2007 Solving a Huff-like competitive location and design model for profit maximization in the plane European Journal of Operational Research 179 1274 1287 (Pubitemid 46043520)
14. Glover, F., & Laguna, M. (1997). Tabu search. Dordrecht: Kluwer Academic.
15. Goldberg, D. E. (1989). Genetic algorithms in search, optimization and machine learning. Reading: Addison-Wesley.
16. González-Linares, J. M., Guil, N., Zapata, E. L., Ortigosa, P. M., & García, I. (2000). Deformable shapes detection by stochastic optimization. In 2000 IEEE international conference on image processing (ICIP'2000), Vancouver, Canada, 10-13 September 2000.
17. Hakimi, S. L. (1990). Locations with spatial interactions: competitive locations and games. In R. L. Francis & P. B. Mirchandani (Eds.), Discrete location theory (pp. 439-478). New York: Wiley/Interscience.
18. Hammer, R., Hocks, M., Kulisch, U., & Ratz, D. (1995). C++ Toolbox for verified computing, I: basic numerical problems: theory, algorithms, and programs. Berlin: Springer.
19. P. Hansen N. Mladenović 2001 Variable neighborhood search: principles and applications European Journal of Operational Research 130 449 467
20. P. Hansen D. Peeters D. Richard J. F. Thisse 1985 The minisum and minimax location problems revisited Operations Research 33 1251 1265 (Pubitemid 16457303)
21. Hansen, P., Jaumard, B., & Tuy, H. (1995). Global optimization in location. In Facility location: a survey of applications and methods (pp. 43-68). Berlin: Springer.
22. D. L. Huff 1964 Defining and estimating a trading area Journal of Marketing 28 34 38
23. J. H. Jamarillo J. Bhadury R. Batta 2002 On the use of genetic algorithms to solve location problems Computers and Operations Research 29 761 779 (Pubitemid 34099416)
24. S. Kirkpatrick C. D. Gelatt M. P. Vecchi 1983 Optimization by simulated annealing Science 220 671 680
25. O. Knüppel 1993 PROFIL/BIAS-a fast interval library Computing 53 277 287
26. P. M. Ortigosa I. García M. Jelasity 2001 Reliability and performance of uego, a clustering-based global optimizer Journal of Global Optimization 9 265 289 (Pubitemid 33672340)
27. B. Pelegrín L. Cánovas 1998 A new assignment rule to improve seed points algorithms for the continuous k-center problem European Journal of Operational Research 104 266 374 (Pubitemid 128389084)
28. Pérez-Brito, D., Moreno-Pérez, J. A., & García-González, C. G. (2004). Búsqueda por entornos variables: desarrollo y aplicaciones en localización. In B. Pelegrín (Ed.), Avances en localización de servicios y aplicaciones (pp. 349-381). Murcia: Servicio de Publicaciones Universidad de Murcia.
29. F. Plastria 1992 GBSSS: The generalized big square small square method for planar single-facility location European Journal or Operational Research 62 163 174
30. Redondo, J. L., Ortigosa, P. M., García, I., & Fernández, J. J. (2004). Image registration in electron microscopy. A stochastic optimization approach. In Lecture notes in computer science : Vol. 3212. Proceedings of the international conference on image analysis and recognition, ICIAR 2004 II (pp. 141-149). Berlin: Springer. (Pubitemid 39749708)
31. F. J. Solis R. J. B. Wets 1981 Minimization by random search techniques Mathematics of Operations Research 6 19 30 (Pubitemid 12437569)
32. H. Tuy F. Al-Khayyal F. Zhou 1995 A D.C. optimization method for single facility location problems Journal of Global Optimization 7 209 227
33. Weber, A. (1909). Über den Standort der Industrien. 1. Teil: Reine Theorie des Standordes. Germany: Tübingen.
34. E. Weiszfeld 1937 Sur le point pour lequel la somme des distances de n points donnés est minimum Tohoku Mathematical Journal 43 355 386