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

2021 ◽  
pp. 1-15
Author(s):  
Abdullah Konak ◽  
Sadan Kulturel-Konak ◽  
Lawrence V. Snyder
Author(s):  
Ehsan Jafari

Abstract Increasing the fossil fuels consumption, pollution and rising prices of these fuels have led to the expansion of renewable resources and their replacement with conventional sources. In this paper, a robust algorithm for a micro-grid (MG) planning with the goal of maximizing profits is presented in day-ahead market. The energy resources in MG are wind farms (WFs), photovoltaic (PV), fuel cell (FC), combined heat and power(CHP) units, tidal steam turbine (TST) and energy storage devices (ESDs). This algorithm is divided into two main parts: (1) Optimal planning of each energy resource; (2) Using the Nash equilibrium –genetic algorithm (NE-GA) hybrid method to determine the optimal MG strategy. In energy resources optimal planning, using a stochastic formulation, the generation bids of each energy resource is determined in such a way that the profit of each one is maximized. Also, the constraints of renewable and load demands and selection the best method of demand response (DR) program are investigated. Then the Nash equilibrium point is determined using the primary population produced in the previous step using the NE-GA hybrid method to determine the optimal MG strategy. Thus, using the ability of the genetic algorithm method, the Nash equilibrium point of the generation units is obtained at an acceptable time, and This means that none of the units are willing to change their strategy and that the optimal strategy is extracted. Comparison of results with previous studies shows that the expected profit in the proposed method is more than other method.


2015 ◽  
Vol 13 (3) ◽  
pp. 1-14 ◽  
Author(s):  
M'hamed Outanoute ◽  
Mohamed Baslam ◽  
Belaid Bouikhalene

To select or change a service provider, customers use the best compromise between price and quality of service (QoS). In this work, the authors formulate a game theoretic framework for the dynamical behaviors of Service Providers (SPs). They share the same market and are competing to attract more customers to gain more profit. Due to the divergence of SPs interests, it is believed that this situation is a non-cooperative game of price and QoS. The game converges to an equilibrium position known Nash Equilibrium. Using Genetic Algorithms (GAs), the authors find strategies that produce the most favorable profile for players. GAs are from optimization methods that have shown their great power in the learning area. Using these meta-heuristics, the authors find the price and QoS that maximize the profit for each SP and illustrate the corresponding strategy in Nash Equilibrium (NE). They also show the influence of some parameters of the problem on this equilibrium.


2017 ◽  
Vol 22 (12) ◽  
pp. 3891-3906 ◽  
Author(s):  
Soumen Atta ◽  
Priya Ranjan Sinha Mahapatra ◽  
Anirban Mukhopadhyay

2013 ◽  
Vol 734-737 ◽  
pp. 3098-3101
Author(s):  
Chang Bing Li ◽  
Hui Ying Cao

The problem of detecting the Nash equilibrium of a non cooperative n-person game is solved by introducing a non-linear optimization model that enables evolutionary search operators to converge towards Nash Equilibrium of a game.


2018 ◽  
Vol 28 (2) ◽  
pp. 201-218
Author(s):  
Olivera Jankovic

This paper deals with the Uncapacitated r-allocation p-hub Maximal Covering Problem (UrApHMCP) with a binary coverage criterion. This problem consists of choosing p hub locations from a set of nodes so as to maximize the total demand covered under the r-allocation strategy. The general assumption is that the transportation between the nonhub nodes is possible only via hub nodes, while each non-hub node is assigned to at most r hubs. An integer linear programming formulation of the UrApHMCP is presented and tested within the framework of a commercial CPLEX solver. In order to solve the problem on large scale hub instances that cannot be handled by the CPLEX, a Genetic Algorithm (GA) is proposed. The results of computational experiments on standard p-hub benchmark instances with up to 200 nodes demonstrate efficiency and effectiveness of the proposed GA method.


Sign in / Sign up

Export Citation Format

Share Document