Nash equilibrium sorting genetic algorithm for simultaneous competitive maximal covering location with multiple players

DOI10.1080/0305215x.2021.1957861zbMath1523.90257OpenAlexW3194538737MaRDI QIDQ6048218

Sadan Kulturel-Konak, Lawrence V. Snyder, Abdullah Konak

Publication date: 10 October 2023

Published in: Engineering Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/0305215x.2021.1957861

zbMATH Keywords

game theorymetaheuristicsgenetic algorithmsfacility locationcompetitive location

Mathematics Subject Classification ID

Mixed integer programming (90C11) Approximation methods and heuristics in mathematical programming (90C59) Discrete location and assignment (90B80)

Cites Work

• Unnamed Item
• A local search heuristic for the \((r| p)\)-centroid problem in the plane
• Approximating the Pareto-front of a planar bi-objective competitive facility location and design problem
• Sequential competitive location on networks
• Fast metaheuristics for the discrete \((r|p)\)-centroid problem
• A two-player competitive discrete location model with simultaneous decisions
• Competitive facility location problem with attractiveness adjustment of the follower: a bilevel programming model and its solution
• Cooperative games in facility location situations with regional fixed costs
• Obtaining the efficient set of nonlinear biobjective optimization problems via interval branch-and-bound methods
• Equity models in planar location
• Multiple voting location and single voting location on trees
• An exact method for the discrete \((r|p)\)-centroid problem
• Non-cooperative facility location and covering games
• Facility location and supply chain management. A review
• A new approach to cooperative competition in facility location problems: mathematical formulations and an approximation algorithm
• Competitive location, production, and market selection
• A branch-and-cut algorithm for the discrete \((r| p)\)-centroid problem
• Finding all pure strategy Nash equilibria in a planar location game
• Finding the optimal solution to the Huff based competitive location model
• Discrete models for competitive location with foresight
• Market and Locational Equilibrium for Two Competitors
• Genetic Algorithms and Random Keys for Sequencing and Optimization
• Static competitive facility location: an overview of optimisation approaches.

This page was built for publication: Nash equilibrium sorting genetic algorithm for simultaneous competitive maximal covering location with multiple players