Approximating the Pareto-front of a planar bi-objective competitive facility location and design problem
From MaRDI portal
Publication:337679
DOI10.1016/j.cor.2014.02.013zbMath1348.90413OpenAlexW2092340783MaRDI QIDQ337679
José Domingo Álvarez Hervás, Pilar M. Ortigosa, Aránzazu Gila Arrondo, Juana L. Redondo, José-Jesús Fernández
Publication date: 10 November 2016
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2014.02.013
evolutionary computationPareto-frontcompetitive locationfranchise systemnonlinear bi-objective optimization problem
Related Items (11)
Parallelization of a non-linear multi-objective optimization algorithm: application to a location problem ⋮ A variational inequality formulation for designing a multi-echelon, multi-product supply chain network in a competitive environment ⋮ A triobjective model for locating a public semiobnoxious facility in the plane ⋮ Nash equilibrium sorting genetic algorithm for simultaneous competitive maximal covering location with multiple players ⋮ A reference point-based evolutionary algorithm for approximating regions of interest in multiobjective problems ⋮ A multi-objective approach to identify parameters of compartmental epidemiological models -- application to Ebola virus disease epidemics ⋮ Robust model for discrete competitive facility location problem with the uncertainty of customer behaviors ⋮ FEMOEA: a fast and efficient multi-objective evolutionary algorithm ⋮ Optimizing facility location and design ⋮ \(\varepsilon\)-Constraint method for bi-objective competitive facility location problem with uncertain demand scenario ⋮ On heuristic bi-criterion methods for semi-obnoxious facility location
Uses Software
Cites Work
- Unnamed Item
- Obtaining the efficient set of nonlinear biobjective optimization problems via interval branch-and-bound methods
- Solving a huff-like competitive location and design model for profit maximization in the plane
- Planar location and design of a new facility with inner and outer competition: an interval lexicographical-like solution procedure
- A robust and efficient algorithm for planar competitive location problems
- PROFIL/BIAS - A fast interval library
- Economics of location: A selective survey
- Heuristics for the facility location and design \((1|1)\)-centroid problem on the plane
- Obtaining an outer approximation of the efficient set of nonlinear biobjective problems
- Introduction to nonlinear and global optimization
- Minimization by Random Search Techniques
- Competitive Location Models: A Framework and Bibliography
- Static competitive facility location: an overview of optimisation approaches.
- Reliability and performance of UEGO, a clustering-based global optimizer
This page was built for publication: Approximating the Pareto-front of a planar bi-objective competitive facility location and design problem
