Discrete Location Problems
Benchmarks Library
Competitive facility location
and design problem
Two players, a leader and a follower, open facilities and compete to attract clients from a given market. Each player has a budget and maximizes own market share. Each client splits own demand probabilistically over all opened facilities by the gravity rule. The goal is to find the location and design of the leader facilities to maximize his market share.
References:
1. Aboolian R., Berman O., Krass D. Competitive facility location and design problem. European J. Oper. Res. 2007. Vol. 182. P. 40-62.
2. E. Alekseeva, Yu. Kochetov, N. Kochetova, and A. Plyasunov. Heuristic and exact methods for the discrete (r|p)–centroid problem. LNCS. 2010. Vol. 6022. P. 11–22. (pdf.file)
3. Yu. Kochetov, N. Kochetova, and A. Plyasunov. A matheuristic for the leader-follower facility location and design problem.
10th international Metaheuristics Conference(MIC 2013). Singapure 5-8 August, 2013. (pdf-file)
|
I | = | J | = 50. | R | = 3. BL , BF = 10,20,..., 100. The matrix dij is the Euclidean distance matrix.The instance data are in different formats: (111.xls, 111.xlsx, 111.txt, 111.zip)
