Approximating the Pareto-front of a planar bi-objective competitive facility location and design problem

DOI10.1016/J.COR.2014.02.013MaRDI QIDQ337679zbMATH OpenOpenAlexFDO

Authors Juana L. Redondo, José Domingo Álvarez Hervás, Aránzazu Gila Arrondo, Pilar M. Ortigosa, José 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

zbMATH Keywords

competitive locationevolutionary computationfranchise systemnonlinear bi-objective optimization problemPareto-front

Mathematics Subject Classification ID

Discrete location and assignment (90B80)

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

Cites work

• scientific article; zbMATH DE number 761488 (Why is no real title available?)
• A robust and efficient algorithm for planar competitive location problems
• Competitive Location Models: A Framework and Bibliography
• Economics of location: A selective survey
• Heuristics for the facility location and design \((1|1)\)-centroid problem on the plane
• Introduction to nonlinear and global optimization
• Minimization by Random Search Techniques
• Obtaining an outer approximation of the efficient set of nonlinear biobjective problems
• Obtaining the efficient set of nonlinear biobjective optimization problems via interval branch-and-bound methods
• PROFIL/BIAS - A fast interval library
• Planar location and design of a new facility with inner and outer competition: an interval lexicographical-like solution procedure
• Reliability and performance of UEGO, a clustering-based global optimizer
• Solving a huff-like competitive location and design model for profit maximization in the plane
• Static competitive facility location: an overview of optimisation approaches.

Cited in

(15)

• A Huff-like location model with quality adjustment and/or closing of existing facilities
• Optimizing facility location and design
• A multi-objective genetic algorithm for a bi-objective facility location problem with partial coverage
• 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
• Estimating the Pareto front of a hard bi-criterion competitive facility location problem
• 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

Describes a project that uses

Uses Software

• SPEA2
• PROFIL/BIAS

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)