On a branch-and-bound approach for a Huff-like Stackelberg location problem
Modelling the location decision of two competing firms that intend to build a new facility in a planar market can be done by a Huff-like Stackelberg location problem. In a Huff-like model, the market share captured by a firm is given by a gravity model determined by distance calculations to facilities. In a Stackelberg model, the leader is the firm that locates first and takes into account the actions of the competing chain (follower) locating a new facility after the leader. The follower problem is known to be a hard global optimisation problem. The leader problem is even harder, since the leader has to decide on location given the optimal action of the follower. So far, in literature only heuristic approaches have been tested to solve the leader problem. Our research question is to solve the leader problem rigorously in the sense of having a guarantee on the reached accuracy. To answer this question, we develop a branch-and-bound approach. Essentially, the bounding is based on the zero sum concept: what is gain for one chain is loss for the other. We also discuss several ways of creating bounds for the underlying (follower) sub-problems, and show their performance for numerical cases.
| Main Authors: | , , , |
|---|---|
| Format: | Article/Letter to editor biblioteca |
| Language: | English |
| Subjects: | competitive location, design, model, plane, single-facility location, strategies, |
| Online Access: | https://research.wur.nl/en/publications/on-a-branch-and-bound-approach-for-a-huff-like-stackelberg-locati |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|