Models and algorithms for competitive facility location problems with different customer behavior
- 242 Downloads
Competitive facility location problems arise in the context of two non-cooperating companies, a leader and a follower, competing for market share from a given set of customers. We assume that the firms place a given number of facilities on locations taken from a discrete set of possible points. For this bi-level optimization problem we consider six different customer behavior scenarios from the literature: binary, proportional and partially binary, each combined with essential and unessential demand. The decision making for the leader and the follower depends on these scenarios. In this work we present mixed integer linear programming models for the follower problem of each scenario and use them in combination with an evolutionary algorithm to optimize the location selection for the leader. A complete solution archive is used to detect already visited candidate solutions and convert them efficiently into similar, not yet considered ones. We present numerical results of our algorithm and compare them to so far state-of-the-art approaches from the literature. Our method shows good performance in all customer behavior scenarios and is able to outperform previous solution procedures on many occasions.
KeywordsCompetitive facility location Evolutionary algorithm Solution archive Bi-level optimization
Mathematics Subject Classification (2010)68T20 90C27 90B80
Unable to display preview. Download preview PDF.
- 1.Alekseeva, E., Kochetov, Y.: Matheuristics and Exact Methods for the Discrete (r|p)-Centroid Problem. In: Talbi, E.G. (ed.) Metaheuristics for Bi-level Optimization, Studies in Computational Intelligence, vol. 482, pp 189–219. Springer Berlin Heidelberg (2013)Google Scholar
- 2.Alekseeva, E., Kochetova, N., Kochetov, Y.: Plyasunov, A.: A Hybrid Memetic Algorithm for the Competitive P-Median Problem. In: Bakhtadze, N., Dolgui, A. (eds.) Information Control Problems in Manufacturing, Vol. 13, pp 1533–1537. International Federation of Automatic Control (2009)Google Scholar
- 3.Alekseeva, E., Kochetova, N., Kochetov, Y.: Plyasunov, A.: 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, pp 11–22. Springer Berlin Heidelberg (2010)Google Scholar
- 5.Biesinger, B., Hu, B., Raidl, G.: An evolutionary algorithm for the leader-follower facility location problem with proportional customer behavior. In: Pardalos, P.M., Resende, M.G., Vogiatzis, C., Walteros, J.L. (eds.) Learning and Intelligent Optimization, Lecture Notes in Computer Science, pp 203–217. Springer International Publishing (2014)Google Scholar
- 6.Biesinger, B., Hu, B., Raidl, G.: A hybrid genetic algorithm with solution archive for the discrete (r|p)-centroid problem. Technical Report TR 186–1–14–03, Vienna University of Technology, Vienna. Submitted to Journal of Heuristic, Austria (2014)Google Scholar
- 10.Hakimi, S.: 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)Google Scholar
- 12.Hu, B., Raidl, G.: An evolutionary algorithm with solution archives and bounding extension for the generalized minimum spanning tree problem. In: Soule, T. (ed.) Proceedings of the 14th Annual Conference on Genetic and Evolutionary Computation (GECCO 2012), pp 393–400. ACM Press, Philadelphia, PA, USA (2012)Google Scholar
- 13.Kochetov, Y., Kochetova, N.: Plyasunov, A.: A matheuristic 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), pp 32/1–32/3, Singapore (2013)Google Scholar
- 19.Raidl, G., Hu, B.: Enhancing genetic algorithms by a trie-based complete solution archive. In: Cowling, P., Merz, P. (eds.) Evolutionary Computation in Combinatorial Optimization, Lecture Notes in Computer Science, Vol. 6022, pp 239–251. Springer Berlin Heidelberg (2010)Google Scholar