A Memetic Algorithm for Competitive Facility Location Problems

• Published in: Business and Consumer Analytics: New Ideas pp. 637 - 660
• Main Authors: Biesinger, Benjamin, Hu, Bin, Raidl, Günther R.
• Format: Book Chapter
• Language: English
• Published: Cham Springer International Publishing
• Subjects: Competitive facility location; Facility location problem; Memetic algorithm
• ISBN: 9783030062217; 303006221X
• DOI: 10.1007/978-3-030-06222-4_15

We study a memetic algorithm to solve diverse variants of competitive Problemfacility locationfacility 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.