A robust and efficient algorithm for planar competitive location problems
From MaRDI portal
Publication:1026588
DOI10.1007/s10479-007-0233-xzbMath1163.90011OpenAlexW2047512859MaRDI QIDQ1026588
José-Jesús Fernández, Juana L. Redondo, Pilar M. Ortigosa, Inmaculada F. García
Publication date: 25 June 2009
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-007-0233-x
competitioncontinuous locationheuristicevolutionary algorithmcomputational studyWeiszfeld-like algorithm
Continuous location (90B85) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (8)
The probabilistic customer's choice rule with a threshold attraction value: effect on the location of competitive facilities in the plane ⋮ 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 ⋮ Unnamed Item ⋮ Heuristics for the facility location and design \((1|1)\)-centroid problem on the plane ⋮ Conditional Location Problems on Networks and in the Plane ⋮ Two- and three-dimensional modeling and optimization applied to the design of a fast hydrodynamic focusing microfluidic mixer for protein folding ⋮ An efficient approach for solving the HP protein folding problem based on UEGO
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optimization by Simulated Annealing
- Solving a huff-like competitive location and design model for profit maximization in the plane
- Analytical models for locating undesirable facilities
- GBSSS: The generalized big square small square method for planar single- facility location
- PROFIL/BIAS - A fast interval library
- Using interval analysis for solving planar single-facility location problems: New discarding tests
- Solving the multiple competitive facilities location problem
- A d.c. optimization method for single facility location problems
- 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
- The p-Centre Problem-Heuristic and Optimal Algorithms
- The Big Triangle Small Triangle Method for the Solution of Nonconvex Facility Location Problems
- The Minisum and Minimax Location Problems Revisited
- Minimization by Random Search Techniques
- Variable neighborhood search: Principles and applications
- Reliability and performance of UEGO, a clustering-based global optimizer
- 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
- On the use of genetic algorithms to solve location problems
This page was built for publication: A robust and efficient algorithm for planar competitive location problems
