Solving a huff-like competitive location and design model for profit maximization in the plane

DOI10.1016/j.ejor.2006.02.005zbMath1163.90604OpenAlexW1975385518MaRDI QIDQ864047

Blas Pelegrín, Frank Plastria, Boglárka G.-Tóth, José Fernández

Publication date: 12 February 2007

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2006.02.005

zbMATH Keywords

global optimizationcompetitioninterval analysiscontinuous locationfacility design

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Discrete location and assignment (90B80)

Related Items (50)

Exact approaches for competitive facility location with discrete attractiveness ⋮ The probabilistic customer's choice rule with a threshold attraction value: effect on the location of competitive facilities in the plane ⋮ Parallelization of a non-linear multi-objective optimization algorithm: application to a location problem ⋮ Sensitivity analysis of a continuous multifacility competitive location and design problem ⋮ \(p\)-facility Huff location problem on networks ⋮ Location equilibria for a continuous competitive facility location problem under delivered pricing ⋮ Approximating the Pareto-front of a planar bi-objective competitive facility location and design problem ⋮ A planar single-facility competitive location and design problem under the multi-deterministic choice rule ⋮ A leader-follower model for discrete competitive facility location ⋮ A two-level evolutionary algorithm for solving the facility location and design \((1|1)\)-centroid problem on the plane with variable demand ⋮ Empirical convergence speed of inclusion functions for facility location problems ⋮ Generalized Benders decomposition for competitive facility location with concave demand and zone-specialized variable attractiveness ⋮ Planar location and design of a new facility with inner and outer competition: an interval lexicographical-like solution procedure ⋮ The theoretical and empirical rate of convergence for geometric branch-and-bound methods ⋮ A multi-objective facility location problem in the presence of variable gradual coverage performance and cooperative cover ⋮ Location and design decisions of facilities in a distribution system with elastic customer demand ⋮ Competitive facility location under attrition ⋮ Competitive facility location problem with attractiveness adjustment of the follower: a bilevel programming model and its solution ⋮ A Mathematical Programming Model with Equilibrium Constraints for Competitive Closed-Loop Supply Chain Network Design ⋮ Analyses of location-price game on networks with stochastic customer behavior and its heuristic algorithm ⋮ The obnoxious competitive facility location model ⋮ A refinement of the gravity model for competitive facility location ⋮ Obtaining the efficient set of nonlinear biobjective optimization problems via interval branch-and-bound methods ⋮ Competitive facility location and design with reactions of competitors already in the market ⋮ An approach for solving competitive location problems with variable demand using multicore systems ⋮ Obtaining an outer approximation of the efficient set of nonlinear biobjective problems ⋮ Single-facility huff location problems on networks ⋮ On competition in a Stackelberg location-design model with deterministic supplier choice ⋮ On agglomeration in competitive location models ⋮ Sequential versus simultaneous approach in the location and design of two new facilities using planar Huff-like models ⋮ Strategic design of competing supply chain networks with foresight ⋮ Strategic design of competing centralized supply chain networks for markets with deterministic demands ⋮ Theoretical rate of convergence for interval inclusion functions ⋮ The follower competitive location problem with comparison-shopping ⋮ On Nash equilibria of a competitive location-design problem ⋮ On minimax-regret Huff location models ⋮ Heuristics for the facility location and design \((1|1)\)-centroid problem on the plane ⋮ Branch-and-cut approach based on generalized Benders decomposition for facility location with limited choice rule ⋮ Facility dependent distance decay in competitive location ⋮ The big cube small cube solution method for multidimensional facility location problems ⋮ Multi-objective competitive location problem with distance-based attractiveness and its best non-dominated solution ⋮ Competitive facility location problem with attractiveness adjustment of the follower on the closed supply chain ⋮ A robust and efficient algorithm for planar competitive location problems ⋮ The variable radius covering problem ⋮ On a branch-and-bound approach for a Huff-like Stackelberg location problem ⋮ On the impact of spatial pattern, aggregation, and model parameters in planar Huff-type competitive location and design problems ⋮ The use of interval arithmetic in solving a non-linear rational expectation based multiperiod output-inflation process model: the case of the IN/GB method ⋮ Equilibria in Competitive Location Models ⋮ Conditional Location Problems on Networks and in the Plane ⋮ The Weiszfeld Algorithm: Proof, Amendments, and Extensions

Uses Software

• C-XSC
• PROFIL/BIAS
• AMIGO
• INTOPT_90

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• GBSSS: The generalized big square small square method for planar single- facility location
• Global optimization using interval analysis: The one-dimensional case
• Sequential location problems
• PROFIL/BIAS - A fast interval library
• Rigorous global search: continuous problems
• Computation and application of Taylor polynomials with interval remainder bounds
• New interval analysis support functions using gradient information in a global minimization algorithm
• Finding all solutions of nonlinear equations using linear combinations of functions
• Using interval analysis for solving planar single-facility location problems: New discarding tests
• A new multisection technique in interval methods for global optimization
• Validating the gravity-based competitive location model using inferred attractiveness
• A new exclusion test.
• Finding all solutions of nonlinear equations using the dual simplex method
• Optimal location and design of a competitive facility
• On the selection of subdivision directions in interval branch-and-bound methods for global optimization
• A continuous location model for siting a non-noxious undesirable facility within a geographical region
• New interval methods for constrained global optimization
• New results on verified global optimization
• Empirical investigation of the convergence speed of inclusion functions in a global otimization context
• The Big Triangle Small Triangle Method for the Solution of Nonconvex Facility Location Problems
• The Minisum and Minimax Location Problems Revisited
• Subdivision Direction Selection in Interval Methods for Global Optimization
• Competitive Location Models: A Framework and Bibliography
• Static competitive facility location: an overview of optimisation approaches.
• Experiments with a new selection criterion in a fast interval optimization algorithm
• New subinterval selection criteria for interval global optimization
• Estimating actual distances by norm functions: A comparison between the \(l_{k,p,\theta}\)-norm and the \(l_{b_1,b_2,\theta}\)-norm and a study about the selection of the data set

This page was built for publication: Solving a huff-like competitive location and design model for profit maximization in the plane