Approximating the Pareto-front of a planar bi-objective competitive facility location and design problem
DOI10.1016/J.COR.2014.02.013zbMATH Open1348.90413OpenAlexW2092340783MaRDI QIDQ337679FDOQ337679
José Fernández, José Domingo Álvarez Hervás, Pilar M. Ortigosa, Aránzazu Gila Arrondo, Juana L. Redondo
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
Recommendations
- Parallelization of a non-linear multi-objective optimization algorithm: application to a location problem
- Estimating the Pareto front of a hard bi-criterion competitive facility location problem
- PARALLEL OPTIMIZATION ALGORITHM FOR COMPETITIVE FACILITY LOCATION
- scientific article; zbMATH DE number 2159112
- FEMOEA: a fast and efficient multi-objective evolutionary algorithm
competitive locationevolutionary computationfranchise systemnonlinear bi-objective optimization problemPareto-front
Cites Work
- PROFIL/BIAS - A fast interval library
- Competitive Location Models: A Framework and Bibliography
- Introduction to nonlinear and global optimization
- Title not available (Why is that?)
- Obtaining an outer approximation of the efficient set of nonlinear biobjective problems
- Reliability and performance of UEGO, a clustering-based global optimizer
- 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
- Static competitive facility location: an overview of optimisation approaches.
- Minimization by Random Search Techniques
- A robust and efficient algorithm for planar competitive location problems
- Economics of location: A selective survey
- Heuristics for the facility location and design \((1|1)\)-centroid problem on the plane
- Planar location and design of a new facility with inner and outer competition: an interval lexicographical-like solution procedure
Cited In (13)
- A Huff-like location model with quality adjustment and/or closing of existing facilities
- Optimizing facility location and design
- Nash equilibrium sorting genetic algorithm for simultaneous competitive maximal covering location with multiple players
- A triobjective model for locating a public semiobnoxious facility in the plane
- 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
- Robust model for discrete competitive facility location problem with the uncertainty of customer behaviors
- On heuristic bi-criterion methods for semi-obnoxious facility location
- Fundamentals of Computation Theory
- FEMOEA: a fast and efficient multi-objective evolutionary algorithm
- 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
- \(\varepsilon\)-Constraint method for bi-objective competitive facility location problem with uncertain demand scenario
Uses Software
This page was built for publication: Approximating the Pareto-front of a planar bi-objective competitive facility location and design problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q337679)
