Competitive Facility Location Problem with Foresight in Discrete Space based on Tabu Search
- https://doi.org/10.2991/csic-15.2015.108How to use a DOI?
- Competitive facility location problem, Discrete space, Gravity-base model, Tabu search
This paper presents the competitive facility location problem with foresight in the discrete space which considers probabilistic customer behavior. A practical bilevel nonlinear integer programming model is formulated to maximize the leader’s market share while predicting the follower’s response. For solving the model, a two-stage hybrid tabu search algorithm is designed. To illustrate the effectiveness of the proposed algorithm, a set of randomly generated instances are presented and analyzed statistically. The results indicate that the proposed algorithm provides an effective means to solve the problems.
- © 2015, the Authors. Published by Atlantis Press.
- Open Access
- This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).
Cite this article
TY - CONF AU - Mingyao Qi AU - Mingfei Xia AU - Lixin Miao AU - Ying Zhang PY - 2015/07 DA - 2015/07 TI - Competitive Facility Location Problem with Foresight in Discrete Space based on Tabu Search BT - Proceedings of the 2015 International Conference on Computer Science and Intelligent Communication PB - Atlantis Press SP - 444 EP - 448 SN - 2352-538X UR - https://doi.org/10.2991/csic-15.2015.108 DO - https://doi.org/10.2991/csic-15.2015.108 ID - Qi2015/07 ER -