Exact approaches for competitive facility location with discrete attractiveness
From MaRDI portal
Publication:828655
DOI10.1007/S11590-020-01596-XzbMATH Open1466.90056arXiv2002.09844OpenAlexW3027317917MaRDI QIDQ828655FDOQ828655
Publication date: 5 May 2021
Published in: Optimization Letters (Search for Journal in Brave)
Abstract: We study a variant of the competitive facility location problem, in which a company is to locate new facilities in a market where competitor's facilities already exist. We consider the scenario where only a limited number of possible attractiveness levels is available, and the company has to select exactly one level for each open facility. The goal is to decide the facilities' locations and attractiveness levels that maximize the profit. We apply the gravity-based rule to model the behavior of the customers and formulate a multi-ratio linear fractional 0-1 program. Our main contributions are the exact solution approaches for the problem. These approaches allow for easy implementations without the need for designing complicated algorithms and are "friendly" to the users without a solid mathematical background. We conduct computational experiments on the randomly generated datasets to assess their computational performance. The results suggest that the mixed-integer quadratic conic approach outperforms the others in terms of computational time. Besides that, it is also the most straightforward one that only requires the users to be familiar with the general form of a conic quadratic inequality. Therefore, we recommend it as the primary choice for such a problem.
Full work available at URL: https://arxiv.org/abs/2002.09844
outer approximationgravity modelcompetitive facility locationconic programmingmixed-integer linear programming
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- CVXPY: a Python-embedded modeling language for convex optimization
- Extended formulations in mixed integer conic quadratic programming
- Lectures on modern convex optimization. Analysis, algorithms, and engineering applications
- Graph Implementations for Nonsmooth Convex Programs
- A conic integer programming approach to stochastic joint location-inventory problems
- Competitive facility location problem with attractiveness adjustment of the follower: a bilevel programming model and its solution
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- Solving the multiple competitive facilities location problem
- A comparison of linear reformulations for multinomial logit choice probabilities in facility location models
- A lifted linear programming branch-and-bound algorithm for mixed-integer conic quadratic programs
- Solving a huff-like competitive location and design model for profit maximization in the plane
- Exact solution of a class of nonlinear knapsack problems
- The maximum capture problem with random utilities: problem formulation and algorithms
- A leader-follower game in competitive facility location
- Cuts for mixed 0-1 conic programming
- On a branch-and-bound approach for a Huff-like Stackelberg location problem
- A leader-follower model for discrete competitive facility location
- A branch-and-cut algorithm for the latent-class logit assortment problem
- Improving solution of discrete competitive facility location problems
- Lifting for conic mixed-integer programming
- Fractional 0-1 programming: applications and algorithms
- Outer approximation and submodular cuts for maximum capture facility location problems with random utilities
- Competitive facility location with random attractiveness
- Technical Note—A Conic Integer Optimization Approach to the Constrained Assortment Problem Under the Mixed Multinomial Logit Model
Cited In (7)
- Modeling Discrete Competitive Facility Location
- Service expansion for chained business facilities under congestion and market competition
- The discrete facility location problem with balanced allocation of customers
- Static competitive facility location: an overview of optimisation approaches.
- Title not available (Why is that?)
- Fractional 0-1 programming and submodularity
- Competitive facility location problem with foresight considering discrete-nature attractiveness for facilities: model and solution
Uses Software
This page was built for publication: Exact approaches for competitive facility location with discrete attractiveness
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q828655)
