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

In this article, a new genetic algorithm (GA), called the Nash equilibrium sorting genetic algorithm (NESGA,) is introduced to identify Nash equilibria for the competitive maximal covering location...

[1]  Lawrence V. Snyder,et al.  Facility location under uncertainty: a review , 2006 .

[2]  Martin Hoefer,et al.  Non-cooperative facility location and covering games , 2006, Theor. Comput. Sci..

[3]  Artur Alves Pessoa,et al.  A branch-and-cut algorithm for the discrete (r∣p)-centroid problem , 2013, Eur. J. Oper. Res..

[4]  I. K. Altinel,et al.  Competitive facility location problem with attractiveness adjustment of the follower: A bilevel programming model and its solution , 2011, Eur. J. Oper. Res..

[5]  Julius Zilinskas,et al.  Solution of Multi-Objective Competitive Facility Location Problems Using Parallel NSGA-II on Large Scale Computing Systems , 2012, PARA.

[6]  Peter Smith,et al.  An automated negotiation mechanism based on co-evolution and game theory , 2002, SAC '02.

[7]  Abdullah Konak,et al.  A Game-Theoretic Genetic Algorithm for the reliable server assignment problem under attacks , 2015, Comput. Ind. Eng..

[8]  Yury Kochetov,et al.  An exact method for the discrete $$(r|p)$$(r|p)-centroid problem , 2015, J. Glob. Optim..

[9]  Ying Zhang,et al.  A New Heuristic Formulation for a Competitive Maximal Covering Location Problem , 2018, Transp. Sci..

[10]  Emilio Carrizosa,et al.  A local search heuristic for the (r|p)-centroid problem in the plane , 2014, Comput. Oper. Res..

[11]  Mohammad Mahdi Nasiri,et al.  A modified genetic algorithm for the capacitated competitive facility location problem with the partial demand satisfaction , 2018, Comput. Ind. Eng..

[12]  Mark Goh,et al.  Covering problems in facility location: A review , 2012, Comput. Ind. Eng..

[13]  Fu-Chuan Lai,et al.  Prices, Locations and Welfare When an Online Retailer Competes with Heterogeneous Brick‐And‐Mortar Retailers , 2017 .

[14]  Arend Hintze,et al.  Evolutionary game theory using agent-based methods. , 2014, Physics of life reviews.

[15]  Nenad Mladenovic,et al.  Fast metaheuristics for the discrete (r|p)-centroid problem , 2014, Autom. Remote. Control..

[16]  Hamidreza Navidi,et al.  A new approach to cooperative competition in facility location problems: Mathematical formulations and an approximation algorithm , 2017, Comput. Oper. Res..

[17]  José Fernández,et al.  Approximating the Pareto-front of a planar bi-objective competitive facility location and design problem , 2015, Comput. Oper. Res..

[18]  Vladimir Marianov,et al.  Competitive Location Models , 2019, Location Science.

[19]  Lina Mallozzi.  Cooperative games in facility location situations with regional fixed costs , 2011, Optim. Lett..

[20]  Boglárka G.-Tóth,et al.  Obtaining the efficient set of nonlinear biobjective optimization problems via interval branch-and-bound methods , 2009, Comput. Optim. Appl..

[21]  H. Hotelling.  Stability in Competition , 1929 .

[22]  D. Huff.  A Programmed Solution for Approximating an Optimum Retail Location , 1966 .

[23]  Blas Pelegrín,et al.  Finding all pure strategy Nash equilibria in a planar location game , 2011, Eur. J. Oper. Res..

[24]  Hans-Christoph Wirth,et al.  Multiple voting location and single voting location on trees , 2007, Eur. J. Oper. Res..

[25]  Abdullah Konak,et al.  A Multi-Objective Approach to the Competitive Facility Location Problem , 2017, ICCS.

[26]  Charles ReVelle,et al.  THE MAXIMUM CAPTURE OR “SPHERE OF INFLUENCE” LOCATION PROBLEM: HOTELLING REVISITED ON A NETWORK* , 1986 .

[27]  Alfred A. Kuehn,et al.  A Heuristic Program for Locating Warehouses , 1963 .

[28]  James C. Bean,et al.  Genetic Algorithms and Random Keys for Sequencing and Optimization , 1994, INFORMS J. Comput..

[29]  Francisco Saldanha-da-Gama,et al.  Facility location and supply chain management - A review , 2009, Eur. J. Oper. Res..

[30]  Frank Plastria,et al.  Discrete models for competitive location with foresight , 2008, Comput. Oper. Res..

[31]  S. Louis Hakimi,et al.  Market and Locational Equilibrium for Two Competitors , 1991, Oper. Res..

[32]  Zvi Drezner,et al.  Finding the optimal solution to the Huff based competitive location model , 2004, Comput. Manag. Sci..

[33]  Kalyanmoy Deb,et al.  A fast and elitist multiobjective genetic algorithm: NSGA-II , 2002, IEEE Trans. Evol. Comput..

[34]  Dominik Kress,et al.  Sequential competitive location on networks , 2013, Eur. J. Oper. Res..

[35]  D. Serra,et al.  Market capture by two competitors: The pre-emptive location problem , 1994 .

[36]  Pedro Godinho,et al.  A two-player competitive discrete location model with simultaneous decisions , 2010, Eur. J. Oper. Res..