Planar location and design of a new facility with inner and outer competition: an interval lexicographical-like solution procedure
From MaRDI portal
Publication:883194
DOI10.1007/s11067-006-9005-4zbMath1137.90580OpenAlexW2075936238MaRDI QIDQ883194
Blas Pelegrín, José Fernández, Boglárka G.-Tóth, Frank Plastria
Publication date: 31 May 2007
Published in: Networks and Spatial Economics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11067-006-9005-4
CompetitionGlobal optimizationInterval analysisEfficient setBiobjective optimizationCannibalizationContinuous locationFacility designLexicographic methodProfit optimization
Related Items (17)
Competitive location and pricing on networks with random utilities ⋮ Approximating the Pareto-front of a planar bi-objective competitive facility location and design problem ⋮ A triobjective model for locating a public semiobnoxious facility in the plane ⋮ Competitive facility location with random attractiveness ⋮ Competitive facility location problem with attractiveness adjustment of the follower: a bilevel programming model and its solution ⋮ Estimating the Pareto Front of a Hard Bi-criterion Competitive Facility Location Problem ⋮ A global optimization procedure for the location of a median line in the three-dimensional space ⋮ Obtaining the efficient set of nonlinear biobjective optimization problems via interval branch-and-bound methods ⋮ Obtaining an outer approximation of the efficient set of nonlinear biobjective problems ⋮ Profit maximization and reduction of the cannibalization effect in chain expansion ⋮ Sequential versus simultaneous approach in the location and design of two new facilities using planar Huff-like models ⋮ A solution algorithm for non-convex mixed integer optimization problems with only few continuous variables ⋮ Multiple criteria facility location problems: a survey ⋮ Multi-objective competitive location problem with distance-based attractiveness and its best non-dominated solution ⋮ Conditional Location Problems on Networks and in the Plane ⋮ Unnamed Item ⋮ PARALLEL OPTIMIZATION ALGORITHM FOR COMPETITIVE FACILITY LOCATION
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Discretization and resolution of the \((r| X_ p)\)-medianoid problem involving quality criteria.
- Empirical convergence speed of inclusion functions for facility location problems
- Solving a huff-like competitive location and design model for profit maximization in the plane
- New perspectives in competitive location theory
- GBSSS: The generalized big square small square method for planar single- facility location
- Discretization results for the Huff and Pareto-Huff competitive location models on networks
- PROFIL/BIAS - A fast interval library
- Rigorous global search: continuous problems
- Using interval analysis for solving planar single-facility location problems: New discarding tests
- Economics of location: A selective survey
- Solving the multiple competitive facilities location problem
- A continuous location model for siting a non-noxious undesirable facility within a geographical region
- Finding the optimal solution to the Huff based competitive location model
- New interval methods for constrained global optimization
- Empirical investigation of the convergence speed of inclusion functions in a global otimization context
- Exceptional Paper—Lexicographic Orders, Utilities and Decision Rules: A Survey
- A Multiobjective Approach to Design Franchise Outlet Networks
- Competitive Location Models: A Framework and Bibliography
- Multicriteria Optimization
- AVOIDING CANNIBALISATION AND/OR COMPETITOR REACTION IN PLANAR SINGLE FACILITY LOCATION
- Static competitive facility location: an overview of optimisation approaches.
- 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: Planar location and design of a new facility with inner and outer competition: an interval lexicographical-like solution procedure
