Alternating heuristic and exact method for the leader-follower facility location and design problem

Yury Kochetov, Irina Sokolova, Saltanat N. Amirgaliyeva, Zhazira Amirgaliyeva

2015

Closed access Metadata (CSL-JSON)
DOI 10.1109/icecco.2015.7416870
Data confidence 70 medium
How this score is calculated

It is built from checkable properties of the record itself: whether the article has a DOI, how many independent sources confirmed its data, whether the required fields are filled in, and how recent the latest confirmation is. Disagreement between sources and a missing identifier lower it. A value of 80 or above means the record was published without further checking; 60 to 79 means it is published at reduced confidence, with a manual check advisable. A record verified by an editor by hand is never pushed below 90 by a recalculation. This scores our data about the article, not the article itself.

Abstract

We study the following discrete facility location game. 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. We present an alternating heuristic and exact method for this game. We rewrite the problem as mixed integer linear program with exponential number of constraints. In our method, we start with small subset of constraints and iteratively enlarge it until upper and lower bounds not coincide. Computational results are discussed.