Models and algorithms for competitive facility location problems with different customer behavior
From MaRDI portal
Publication:276530
DOI10.1007/S10472-014-9448-0zbMath1335.90052OpenAlexW2068400614MaRDI QIDQ276530
Günther R. Raidl, Benjamin Biesinger, Bin Hu
Publication date: 4 May 2016
Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10472-014-9448-0
Approximation methods and heuristics in mathematical programming (90C59) Discrete location and assignment (90B80) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items (8)
New heuristic algorithms for discrete competitive location problems with binary and partially binary customer behavior ⋮ Competitive facility location problem with foresight considering discrete-nature attractiveness for facilities: model and solution ⋮ Metaheuristics for bilevel optimization: a comprehensive review ⋮ Competitive network restructuring with spatially loyal customers. A bilevel facility delocation problem ⋮ A kernel search matheuristic to solve the discrete leader-follower location problem ⋮ Robust model for discrete competitive facility location problem with the uncertainty of customer behaviors ⋮ Branch-and-cut approach based on generalized Benders decomposition for facility location with limited choice rule ⋮ Store location with multipurpose shopping trips and a new random utility customers' choice model
Cites Work
- \((r|p)\)-centroid problems on networks with vertex and edge demand
- Competitive facility location and design with reactions of competitors already in the market
- A hybrid genetic algorithm with solution archive for the discrete \((r|p)\)-centroid problem
- On Nash equilibria of a competitive location-design problem
- Competitive facility location problem with attractiveness adjustment of the follower: a bilevel programming model and its solution
- The \(p\)-median problem: a survey of metaheuristic approaches
- Multiple voting location and single voting location on trees
- On locating new facilities in a competitive environment
- An alternating heuristic for medianoid and centroid problems in the plane
- A branch-and-cut algorithm for the discrete \((r| p)\)-centroid problem
- Recent insights in Huff-like competitive facility location and design
- Algorithms on Strings, Trees and Sequences
- Unnamed Item
- Unnamed Item
This page was built for publication: Models and algorithms for competitive facility location problems with different customer behavior
