Competitive facility location problem is a typical facility locating optimization problem but in a competitive environment. The main characteristic of this problem is the competitive nature of the market. In essence, the problem involves two competitors, i.e., a leader and a follower, who seek to attract customers by establishing new facilities to maximize their own profit. In this research, the capacitated competitive facility location problem is considered in which customers may be rejected by a facility because of capacity limitation. A branch-and-bound algorithm is proposed to solve this problem. An extensive computational study is provided to show the performance of the algorithm.
University of South Florida, May/2019
View A bi-level branch-and-bound algorithm for the capacitated competitive facility location problem