4.7 Article

The follower competitive facility location problem under the nested logit choice rule

期刊

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
卷 310, 期 2, 页码 834-846

出版社

ELSEVIER
DOI: 10.1016/j.ejor.2023.03.008

关键词

Location; Customer behavior; Nested logit; Choice rules

向作者/读者索取更多资源

This study proposes a new customer choice rule based on Nested Logit and efficient solution methods based on Branch and Cut to address the follower competitive facility location problem. The Nested Logit rule captures the correlation among purchases made at different chains, and the proposed solution approach improves the accuracy and computational efficiency in solving similar problems in practice.
Recently, more realistic customer choice rules based on the Multinomial Logit have been proposed for the follower competitive facility location problem, together with efficient exact solution methods based on cut generation approaches. We address this problem in the case in which a new chain, the entrant, decides to locate some stores in a market where there are already incumbent chains offering substitute products, which differ from the entrant's product in secondary features. The entrant's stores are very similar to each other, and this is also the case for the incumbent chains. In this case, for a given cus-tomer, purchases made at the stores of one of the chains are correlated, given the similitude between these stores. The Multinomial Logit rule does not capture this correlation. We propose using a Nested Logit rule which does capture this correlation and, in addition, represents a sequential decision process by the customer, who first chooses the chain and then the store. We prove the concavity of the objec-tive function in the problem and find exact solutions using Branch and Cut over a generalized linear reformulation of the problem and four different types of cuts: submodular and an improvement of these, outer-approximation, and a set of new cuts. Our results show locations that fit better the intuition and practice. Furthermore, our computational times improve in many cases upon the known results for simi-lar problems. & COPY; 2023 Elsevier B.V. All rights reserved.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.7
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据