Abstract
We study a memetic algorithm to solve diverse variants of competitive facility location problems. Two non-cooperating companies enter a market sequentially and compete for market share. The first decision maker, the leader, aims to choose a set of locations which maximize his market share knowing that a follower will enter the same market, lowering the leader’s market share. For this bi-level combinatorial optimization problem several customer behaviour scenarios and demand models are studied. A memetic algorithm is applied to find a good set of locations for the leader and the solution evaluation consisting of finding near optimal locations for the follower is performed by greedy algorithms and the use of mixed integer linear programming models. We conclude this chapter with a case study for two hypermarket chains who both want to open stores in Vienna using real world demographic data. In this study we consider six different customer behaviour scenarios and present numerical and graphical results which show the effectiveness of the presented approach.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
Alekseeva E, Kochetov Y (2013) Metaheuristics and Exact Methods for the Discrete (r|p)-Centroid Problem. In: Talbi EG (ed) Metaheuristics for Bi-level Optimization, Studies in Computational Intelligence, vol 482, Springer Berlin Heidelberg, pp 189–219
Alekseeva E, Kochetova N, Kochetov Y, Plyasunov A (2009) A Hybrid Memetic Algorithm for the Competitive p-Median Problem. In: Bakhtadze N, Dolgui A (eds) Information Control Problems in Manufacturing, vol 13, International Federation of Automatic Control, pp 1533–1537
Alekseeva E, Kochetova N, Kochetov Y, Plyasunov A (2010) Heuristic and Exact Methods for the Discrete (r|p)-Centroid Problem. In: Cowling P, Merz P (eds) Evolutionary Computation in Combinatorial Optimization, Lecture Notes in Computer Science, vol 6022, Springer Berlin Heidelberg, pp 11–22
Arabani AB, Farahani RZ (2012) Facility location dynamics: An overview of classifications and applications. Computers & Industrial Engineering 62(1):408–420
Ashtiani MG (2016) Competitive location: a state-of-art review. International Journal of Industrial Engineering Computations 7(1):1–18
Bhadury J, Eiselt H, Jaramillo J (2003) An alternating heuristic for medianoid and centroid problems in the plane. Computers & Operations Research 30(4):553–565
Biesinger B, Hu B, Raidl GR (2014) An evolutionary algorithm for the leader-follower facility location problem with proportional customer behavior. In: Conference Proceedings of Learning and Intelligent Optimization Conference (LION 8), Springer, LNCS, vol 8426, pp 203–217
Biesinger B, Hu B, Raidl G (2015a) A hybrid genetic algorithm with solution archive for the discrete (r|p)-centroid problem. Journal of Heuristics 21(3):391–431
Biesinger B, Hu B, Raidl G (2015b) Models and algorithms for competitive facility location problems with different customer behavior. Annals of Mathematics and Artificial Intelligence pp 1–27
Campos-Rodríguez C, Moreno-Pérez J, Noltemeier H, Santos-Peñate D (2009) Two-Swarm PSO for Competitive Location Problems. In: Krasnogor N, Melián-Batista M, Pérez J, Moreno-Vega J, Pelta D (eds) Nature Inspired Cooperative Strategies for Optimization (NICSO 2008), Studies in Computational Intelligence, vol 236, Springer Berlin Heidelberg, pp 115–126
Davydov I (2012) Tabu search for the discrete (r|p)-centroid problem. Diskretn Anal Issled Oper 19(2):19–40
Davydov I, Kochetov Y, Mladenovic N, Urosevic D (2014a) Fast metaheuristics for the discrete (r|p)-centroid problem. Automation and Remote Control 75(4):677–687
Davydov I, Kochetov Y, Plyasunov A (2014b) On the complexity of the (r|p)-centroid problem in the plane. Top 22(2):614–623
Drezner T (1994) Optimal continuous location of a retail facility, facility attractiveness, and market share: An interactive model. Journal of Retailing 70(1):49–64
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
Drezner T, Drezner Z, Salhi S (2002) Solving the multiple competitive facilities location problem. European Journal of Operational Research 142(1):138–151
Drezner Z (1981) On a modified one-center model. Management Science 27(7):848–851
Eiselt HA (2011) Foundations of Location Analysis, Springer US, Boston, MA, chap Equilibria in Competitive Location Models, pp 139–162
Eiselt HA, Laporte G (1997) Sequential location problems. European Journal of Operational Research 96(2):217–231
Eiselt HA, Marianov V, Drezner T (2015) Location Science, Springer International Publishing, chap Competitive Location Models, pp 365–398
Farahani RZ, Hekmatfar M, Arabani AB, Nikbakhsh E (2013) Hub location problems: A review of models, classification, solution techniques, and applications. Computers & Industrial Engineering 64(4):1096–1109
Fernández J, Pelegrı B, Plastria F, Tóth B, et al. (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
Hakimi S (1983) On locating new facilities in a competitive environment. European Journal of Operational Research 12(1):29–35
Hotelling H (1929) Stability in competition. The Economic Journal 39(153):41–57
Huff DL (1964) Defining and estimating a trading area. The Journal of Marketing pp 34–38
Kochetov Y, Kochetova N, Plyasunov A (2013) A metaheuristic for the leader-follower facility location and design problem. In: Lau H, Van Hentenryck P, Raidl G (eds) Proceedings of the 10th Metaheuristics International Conference (MIC 2013), Singapore, pp 32/1–32/3
Kress D, Pesch E (2012) Sequential competitive location on networks. European Journal of Operational Research 217(3):483–499
Küçükaydin H, Aras N, Altınel IK (2011) Competitive facility location problem with attractiveness adjustment of the follower: A bilevel programming model and its solution. European Journal of Operational Research 208(3):206–220
Laporte G, Benati S (1994) Tabu Search Algorithms for the (r|X p)-medianoid and (r|p)-centroid Problems. Location Science 2:193–204
Laporte G, Nickel S, da Gama FS (2015) Location science, vol 145. Springer
Noltemeier H, Spoerhase J, Wirth HC (2007) Multiple voting location and single voting location on trees. European Journal of Operational Research 181(2):654–667
Peeters PH, Plastria F (1998) Discretization results for the Huff and Pareto-Huff competitive location models on networks. Top 6(2):247–260
Plastria F (2001) Static competitive facility location: An overview of optimisation approaches. European Journal of Operational Research 129(3):461–470
Roboredo M, Pessoa A (2013) A branch-and-cut algorithm for the discrete (r|p)-centroid problem. European Journal of Operational Research 224(1):101–109
Saidani N, Chu F, Chen H (2012) Competitive facility location and design with reactions of competitors already in the market. European journal of operational research 219(1):9–17
Sáiz ME, Hendrix EM, Pelegrín B (2011) On Nash equilibria of a competitive location-design problem. European Journal of Operational Research 210(3):588–593
Serra D, Revelle C (1994) Competitive location in discrete space. Economics Working Papers 96, Dep. of Economics and Business, Univ. Pompeu Fabra, Spain, Technical Report
Suárez-Vega R, Santos-Peñate D, Pablo DG (2004) Competitive Multifacility Location on Networks: the (r|X p)-Medianoid Problem. Journal of Regional Science 44(3):569–588
Acknowledgement
This work is supported by the Austrian Science Fund (FWF) under grant P24660-N23.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Switzerland AG
About this chapter
Cite this chapter
Biesinger, B., Hu, B., Raidl, G.R. (2019). A Memetic Algorithm for Competitive Facility Location Problems. In: Moscato, P., de Vries, N. (eds) Business and Consumer Analytics: New Ideas. Springer, Cham. https://doi.org/10.1007/978-3-030-06222-4_15
Download citation
DOI: https://doi.org/10.1007/978-3-030-06222-4_15
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-06221-7
Online ISBN: 978-3-030-06222-4
eBook Packages: Computer ScienceComputer Science (R0)