A single-facility competitive location problem in the plane based on customer choice rules

Arostegui Jr, MA, Kadipasaoglu SN, Khumawala BM (2006) An empirical comparison of tabu search, simulated annealing, and genetic algorithms for facilities location problems. Int J Prod Econ 103 (2):742–754

Biesinger B, Hu B, Raidl G (2016) Models and algorithms for competitive facility location problems with different customer behavior. Ann Math Artif Intell 76(1-2):93–119

Blanquero R, Carrizosa E, Boglárka G., Nogales-Gómez A. (2016) p-facility huff location problem on networks. Eur J Oper Res 255(1):34–42

Blanquero R, Carrizosa E, Nogales-Gómez A., Plastria F (2014) Single-facility huff location problems on networks. Ann Oper Res 222(1):175–195

da Gama FS, Captivo ME (1998) A heuristic approach for the discrete dynamic location problem. Location Science 6(1-4):211–223

Dan T, Marcotte P (2019) Competitive facility location with selfish users and queues. Oper Res 67(2):479–497

Drezner T (1994a) Locating a single new facility among existing, unequally attractive facilities. J Reg Sci 34(2):237–252

Drezner T (1994b) Optimal continuous location of a retail facility, facility attractiveness, and market share: an interactive model. J Retail 70(1):49–64

Drezner T (1998) Location of multiple retail facilities with limited budget constraintsin continuous space. J Retail Consum Serv 5(3):173–184

Drezner T (2009) Location of retail facilities under conditions of uncertainty. Ann Oper Res 167 (1):107–120

Drezner T (2014) A review of competitive facility location in the plane. Logist Res 7(1):114

Drezner T, Drezner Z (2004) Finding the optimal solution to the huff based competitive location model. Comput Manag Sci 1(2):193–208

Drezner T, Drezner Z, Kalczynski P (2011) A cover-based competitive location model. J Oper Res Soc 62(1):100–113

Eberhart R, Kennedy J (1995) Particle swarm optimization. In: Proceedings of the IEEE international conference on neural networks, vol 4. Citeseer, pp 1942–1948

Eiselt HA, Laporte G (1997) Sequential location problems. Eur J Oper Res 96(2):217–231

Fernández J, Boglárka G, Redondo JL, Ortigosa PM (2019) The probabilistic customers choice rule with a threshold attraction value: Effect on the location of competitive facilities in the plane. Comput Oper Res 101:234–249

Fernández J, Boglárka G, Redondo JL, Ortigosa PM, Arrondo AG (2017) A planar single-facility competitive location and design problem under the multi-deterministic choice rule. Comput Oper Res 78:305–315

Fernández J, Pelegrín B, Plastria F, Tóth B (2007) Solving a huff-like competitive location and design model for profit maximization in the plane. Eur J Oper Res 179(3):1274–1287

Fernández P., Pelegrín B, Lančinskas A, žilinskas J (2017) New heuristic algorithms for discrete competitive location problems with binary and partially binary customer behavior. Comput Oper Res 79:12–18

Glover F (1989) Tabu search part i. ORSA Journal on Computing 1(3):190–206

Hakimi SL (1983) On locating new facilities in a competitive environment. Eur J Oper Res 12 (1):29–35

Hakimi SL (1990) Locations with spatial interactions: competitive locations and games. Discrete location theory

Holland JH (1992) Adaptation in natural and artificial systems. MIT Press, Cambridge

Hotelling H (1990) Stability in competition. In: The collected economics articles of Harold Hotelling. Springer, pp 50–63

Huff DL (1964) Defining and estimating a trade area. J Mark 28:34–38

Jordehi AR, Jasni J (2013) Parameter selection in particle swarm optimisation: a survey. J Exp Theor Artif Intell 25(4):527– 542

Kirkpatrick S, Gelatt CD, Vecchi MP (1983) Optimization by simulated annealing. Science 220(4598):671–680

Lančinskas A., Fernández P., Pelegín B, žilinskas J (2017) Improving solution of discrete competitive facility location problems. Optim Lett 11(2):259–270

Nakanishi M, Cooper LG (1974) Parameter estimation for a multiplicative competitive interaction modelleast squares approach. J Mark Res 11(3):303–311

Özgün-Kibiroğlu Ç, Serarslan MN, Topcu Yİ (2019) Particle swarm optimization for uncapacitated multiple allocation hub location problem under congestion. Expert Syst Appl 119:1–19

Plastria F (2001) Static competitive facility location: an overview of optimisation approaches. Eur J Oper Res 129(3):461–470

Redondo JL, Fernández J, Arrondo AG, García I, Ortigosa PM (2012) Fixed or variable demand? does it matter when locating a facility? Omega 40(1):9–20

Redondo JL, Fernández J, García I, Ortigosa PM (2009) A robust and efficient algorithm for planar competitive location problems. Ann Oper Res 167(1):87–105

Serra D, Colomé R (2001) Consumer choice and optimal locations models: formulations and heuristics. Pap Reg Sci 80(4):439– 464

Shan W, Yan Q, Chen C, Zhang M, Yao B, Fu X (2019) Optimization of competitive facility location for chain stores. Ann Oper Res 273(1-2):187–205

Suárez-Vega R, Santos-Peñate DR, Dorta-González P (2004) Competitive multifacility location on networks: the (ro xp)-medianoid problem. J Reg Sci 44(3):569–588

Zarandi MHF, Davari S, Sisakht SAH (2013) The large-scale dynamic maximal covering location problem. Math Comput Model 57(3-4):710–719