Solving the multiple competitive facilities location and design problem on the plane

Evolutionary Computation

Volumn 17, Issue 1, 2009, Pages 21-53

  Redondo, Juana López ^a   Fernández, José ^b   García, Inmaculada ^a   Ortigosa, Pilar M ^a  

^a UNIVERSITY OF ALMERÍA   (Spain)

^b UNIVERSITY OF MURCIA   (Spain)

Author keywords

Computational study; Continuous location; Evolutionary algorithm; Multimodal optimization; Multistart; Simulated annealing

Indexed keywords

ALGORITHM; ARTICLE; COMPUTER SIMULATION; ECONOMIC ASPECT; METHODOLOGY; MOLECULAR COMPUTER; PROBLEM SOLVING; REPRODUCIBILITY; SCIENCE; THEORETICAL MODEL;

ALGORITHMS; COMPUTER SIMULATION; COMPUTERS, MOLECULAR; ECONOMIC COMPETITION; MODELS, THEORETICAL; PROBLEM SOLVING; REPRODUCIBILITY OF RESULTS; RESEARCH DESIGN; SCIENCE;

EID: 62249123980     PISSN: 10636560     EISSN: 15309304     Source Type: Journal    
DOI: 10.1162/evco.2009.17.1.21     Document Type: Article

References (57)

1. Alba, E., and Tomassini, M. (2002). Parallelism and evolutionary algorithms. IEEE Transactions on Evolutionary Computation, 6(5):443-462.
2. Aytug, H., and Saydam, C. (2002). Solving large-scale maximum expected covering location problems by genetic algorithms: A comparative study. European Journal of Operational Ressearch, 141(3):480-494.
3. Beasley, D., Bull, D., and Martin, R. (1993). A sequential niche technique for multimodal function optimization. Evolutionary Computation, 1(2):101-125.
4. p)- centroid problems. Location Science, 2(4):193-204.
5. Bhandarkar, S., and Zhang, H. (1999). Image segmentation using evolutionary computation. IEEE Transactions on Evolutionary Computation, 3(1):1-21.
6. Brimberg, J., Hansen, P., Mlandinović, N., and Taillard, E. (2000). Improvement and comparison of heuristics for solving the uncapacitated multisource Weber problem. Operations Research, 48(3):444-460.
7. Davidor, Y. (1991). A naturally occurring niche and species phenomenon: The model and first results. In R. K. Belew and L. B. Booker (Eds.), Proceedings of the 4th International Conference on Genetic Algorithms, pp. 257-263. San Mateo, CA: Morgan Kaufmann.
8. Deb, K. (1989). Genetic algorithms in multimodal function optimization. TCGA report no. 89002, The University of Alabama, Department of Engineering Mechanics.
9. Dorigo, M., and Di Caro, G. (1999). The ant colony optimization meta-heuristic. In D. Corne, M. Dorigo, and F. Glover (Eds.), New ideas in optimization, pp. 11-32. London: McGraw-Hill.
10. Drezner, Z. (1984). The p-center problem: Heuristic and optimal algorithms. Journal of the Operational Research Society, 35(8):741-748.
11. Drezner, T. (1995a). Competitive location in the plane. In Z. Drezner (Ed.), Facility location: A survey of applications and methods, Springer Series in Operations Research and Financial Engineering, pp. 285-300. Berlin: Springer.
12. Drezner, Z. (1995b). Facility location: A survey of applications and methods. Berlin: Springer.
13. Drezner, T. (1998). Location of multiple retail facilities with limited budget constraints in continuous space. Journal of Retailing and Consumer Services, 5(3):173-184.
14. Drezner, T., Drezner, Z., and Salhi, S. (2002). Solving the multiple competitive facilities location problem. European journal of Operational Research, 142(1):138-151.
15. Drezner, Z., and Hamacher, H. (2002). Facility location. Applications and theory. Berlin: Springer.
16. Drezner, Z., and Suzuki, A. (2004). The big triangle small triangle method for the solution of non-convex facility location problems. Operations Research, 52(1):128-135.
17. Eiselt, H., Laporte, G., and Thisse, J. (1993). Competitive location models: A framework and bibliography. Transportation Science, 27(1):44-54.
18. Erkut, E., and Neuman, S. (1989). Analytical models for locating undesirable facilities. European Journal of Operational Research, 40(3):275-291.
19. Fernandez, J., Fernández, P., and Pelegrín, B. (2000). A continuous location model for siting a non-noxious undesirable facility within a geographical region. European Journal of Operational Research, 121(2) :259-274.
20. b1,b2,θ-norm and a study about the selection of the data set. Computers and Operations Research, 29(6):609-623.
21. Fernández, J., and Pelegrín, B. (2001). Using interval analysis for solving planar single-facility location problems: New discarding tests. Journal of Global Optimization, 19(1):61-81.
22. Fernández, J., Pelegrín, B., Plastria, F., and Tóth, B. (2007). Solving a Huff-like competitive location and design model for profit maximization in the plane. European Journal of Operational Research, 179(3):1274-1287.
23. Francis, R., McGinnis, L., and White, J. (1992). Facility layout and location: An analytical approach. Englewood Cliffs, NJ: Prentice Hall.
24. Glover, F., and Laguna, M. (1997). Tabu search. Dordrecht, The Netherlands: Kluwer.
25. Goldberg, D. (1989). Genetic algorithms in search, optimization and machine learning. Reading, MA: Addison-Wesley.
26. González-Linares, J., Guil, N., Zapata, E., Ortigosa, P., and García, I. (2000). Deformable shapes detection by stochastic optimization. 2000 IEEE International Conference on Image Processing (ICIP 2000).
27. Hakimi, S. (1990). Locations with spatial interactions: Competitive locations and games. In R. Francis and P. Mirchandani (Eds.), Discrete location theory. New York: Wiley/Interscience.
28. Hansen, P., and Mladenović, N. (2001). Variable neighborhood search: Principles and applications. European journal of Operational Research, 130(3):449-467.
29. Hansen, P., Peeters, D., Richard, D., and Thisse, J. (1985). The minisum and minimax location problems revisited. Operations Research, 33(6):1251-1265.
30. He, J., Xu, J., and Yao, X. (2000). Solving equations by hybrid evolutionary computation techniques. IEEE Transactions on Evolutionary Computation, 4(3):295-304.
31. Holland, J. (1975). Adaptation in natural and artificial systems. Ann Arbor: University of Michigan Press.
32. Homayounfar, H., Areibi, S., and Wang, F. (2003). An advanced island based GA for optimization problems. Proceedings of the International DCDIS Conference on Engineering Applications and Computations, pp. 46-51.
33. Houck, C., Joines, J., and Kay, M. (1996). Comparison of genetic algorithms, random restart and two-opt switching for solving large location-allocation problems. Computers and Operations Research, 23(6):587-596.
34. Huff, D. (1964). Defining and estimating a trading area. Journal of Marketing, 28(3):34-38.
35. Jamarillo, J., Bhadury, J., and Batta, R. (2002). On the use of genetic algorithms to solve location problems. Computers and Operations Research, 29(6):761-779.
36. Jelasity, M. (2001). The shape of evolutionary search: Discovering and representing search space structure. PhD thesis, Leiden University, The Netherlands.
37. Jelasity, M., and Dombi, J. (1998). GAS, A concept on modeling species in genetic algorithms. Artificial Intelligence, 99(1):1-19.
38. Kilkenny, M., and Thisse, J. (1999). Economics of location: A selective survey. Computers and Operations Research, 26(14):1369-1394.
39. Kirkpatrick, S., Gelatt, C., and Vecchi, M. (1983). Optimization by simulated annealing. Science, 220(4598):671-680.
40. Ma, P., Chan, K., Yao, X., and Chiu, D. (2006). An evolutionary clustering algorithm for gene expression microarray data analysis. IEEE Transactions on Evolutionary Computation, 10(3):296-314.
41. Mahfoud, S. W. (1992). Crowding and preselection revisited. In R. Männer and B. Manderick (Eds.), Parallel problem solving from nature 2, pp. 27-36. Amsterdam, The Netherlands: Elsevier.
42. Ortigosa, P., García, I., and Jelasity, M. (2001). Reliability and performance of UEGO, a clustering-based global optimizer. Journal of Global Optimization, 19(3):265-289.
43. Parmee, I., and Bonham, C. (2002). Improving cluster oriented genetic algorithms for high-performance region identification. Proceedings of the US United Engineering Foundation's "Optimization in Industry" Conference.
44. Petrowski, A. (1996). Clearing procedure as a niching method for genetic algorithms. Proceedings of the IEEE Conference on Evolutionary Computation, pp. 798-803.
45. Plastria, F. (1992). GBSSS: The generalized big square small square method for planar single-facility location. European Journal of Operational Research, 62(2):163-174.
46. Plastria, F. (2001). Static competitive facility location: An overview of optimisation approaches. European Journal of Operational Research, 129(3):461-470.
47. Redondo, J., Fernández, J., García, I., and Ortigosa, P. (2007). A robust and efficient global optimization algorithm for planar competitive location problems. Annals of Operations Research. DOI: 10.1007/sl0479-007-0233-x.
48. Redondo, J., Ortigosa, P., García, I., and Fernández, J. (2004). Image registration in electron microscopy. A stochastic optimization approach. Lecture Notes in Computer Science, Proceedings of the International Conference on Image Analysis and Recognition, ICIAR 2004, 3212(II):141-149.
49. Salhi, S., and Gamal, M. (2003). A genetic algorithm based approach for the uncapacitated continuous location-allocation problem. Annals of Operations Research, 123(l-4):203-222.
50. Solis, F., and Wets, R. (1981). Minimization by random search techniques. Mathematics of Operations Research, 6(l):19-30.
51. Speer, N., Spieth, C., and Zell, A. (2004). A memetic co-clustering algorithm for gene exression profiles and biological annotation. Proceedings of the IEEE 2004 Congress on Evolutionary Computation, CEC 2004, Vol. 2, pp. 1631-1638.
52. Toth, B., Fernández, J., Pelegrín, B., and Plastria, F. (2009). Sequential versus simultaneous approach in the location and design of two new facilities using planar Huff-like models. Computers and Operations Research, 36:1393-1405.
53. Toth, B., Plastria, F., Fernández, J., and Pelegrín, B. (2007). Sensitivity analysis of the optimal solutions to Huff-type competitive location and design problems. In A. Paias and F. S. da Gama (Eds.), Proceedings of the EURO Winter Institute on Locations and Logistic, pp. 419-443.
54. Weber, A. (1909). Uber den Standort der Industrien 1. Teil: Reine theorie des standordes, Tübingen, Germany.
55. Weiszfeld, E. (1937). Sur le point pour lequel la somme des distances de n points donnés est minimum. Tohoku Mathematical journal, 43:355-386.
56. Whitley D., Gordon, V. S., and Mathias, K. (1994). Lamarckian evolution, the Baldwin effect and function optimization. In Y. Davidor, H.-P. Schwefel, and R. Männer (Eds.), Parallel problem solving from nature, PPSN III, pp. 6-15. Berlin: Springer.
57. Yang, J., and Yang, C. (2005). The retail stores' competitive location problem with retail regional saturation. Services Systems and Services Management, 2005; Proceedings of ICSSSM'05, Vol. 2, pp. 1511-1516.