# zbMATH — the first resource for mathematics

Improving solution of discrete competitive facility location problems. (English) Zbl 1369.90096
Summary: We consider discrete competitive facility location problems in this paper. Such problems could be viewed as a search of nodes in a network, composed of candidate and customer demand nodes, which connections correspond to attractiveness between customers and facilities located at the candidate nodes. The number of customers is usually very large. For some models of customer behavior exact solution approaches could be used. However, for other models and/or when the size of problem is too high to solve exactly, heuristic algorithms may be used. The solution of discrete competitive facility location problems using genetic algorithms is considered in this paper. The new strategies for dynamic adjustment of some parameters of genetic algorithm, such as probabilities for the crossover and mutation operations are proposed and applied to improve the canonical genetic algorithm. The algorithm is also specially adopted to solve discrete competitive facility location problems by proposing a strategy for selection of the most promising values of the variables in the mutation procedure. The developed genetic algorithm is demonstrated by solving instances of competitive facility location problems for an entering firm.
##### MSC:
 90B80 Discrete location and assignment 90C59 Approximation methods and heuristics in mathematical programming
Full Text:
##### References:
 [1] Dorigo, M; Gambardella, LM, Ant colony system: a cooperative learning approach to the traveling salesman problem, IEEE Trans. Evol. Comput., 1, 53-66, (1997) [2] Eberhart, R., Kennedy, J.: A new optimizer using particle swarm theory. In: Proceedings of the Sixth International Symposium on Micro Machine and Human Science, MHS ’95, pp. 39-43 (1995). doi:10.1109/MHS.1995.494215 [3] Farahani, RZ; Rezapour, S; Drezner, T; Fallah, S, Competitive supply chain network design: an overview of classifications, models, solution techniques and applications, Omega, 45, 92-118, (2014) [4] Francis, RL; Lowe, TJ; Tamir, A; Drezner, Z (ed.); Hamacher, H (ed.), Demand point aggregation for location models, 207-232, (2002), Berlin · Zbl 1018.90023 [5] Friesz, TL; Miller, T; Tobin, RL, Competitive networks facility location models: a survey, Papers Reg. Sci., 65, 47-57, (1998) [6] Glover, F, Heuristics for integer programming using surrogate constraints, Decis. Sci., 8, 156-166, (1977) [7] Hakimi, L.: Locations with spatial interactions: competitive locations and games. In: Mirchandani, P.B., Francis, R.L. (eds.) Discrete Location Theory, pp. 439-478. Wiley, New York (1990) · Zbl 0747.90057 [8] Hakimi, L; Drezner, Z (ed.), Location with spatial interactions: competitive locations and games, 367-386, (1995), Berlin [9] Holland, J.H.: Adaptation in Natural and Artificial Systems. The University of Michigan Press, Ann Arbor (1975) [10] Huff, DL, Defining and estimating a trade area, J. Mark., 28, 34-38, (1964) [11] Pelegrín, B; Fernández, P; García, MD, On tie breaking in competitive location under binary customer behavior, OMEGA Int. J. Manag. Sci., 52, 156-167, (2015) [12] Plastria, F, Static competitive facility location: an overview of optimisation approaches, Eur. J. Oper. Res., 129, 461-470, (2001) · Zbl 1116.90372 [13] ReVelle, CS; Eiselt, HA; Daskin, MS, A bibliography for some fundamental problem categories in discrete location science, Eur. J. Oper. Res., 184, 248-259, (2008) · Zbl 1141.90025 [14] Serra, D; ReVelle, C; Drezner, Z (ed.), Competitive location in discrete space, 367-386, (1995), Berlin [15] Shaikh, A; Salhi, S; Ndiaye, M, New MAXCAP related problems: formulation and model resolution, Comput. Ind. Eng., 85, 817-848, (2015) [16] Suárez-Vega, R; Santos-Penate, DR; Dorta-Gonzalez, P, Discretization and resolution of the ($$r|{X}_p$$)-medianoid problem involving quality criteria, TOP, 12, 111-133, (2004) · Zbl 1148.90332 [17] Törn, A., Žilinskas, A.: Global Optimization. Springer, New York (1989) · Zbl 0752.90075
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.