Demand-side management (DSM) plays a key role in the future of smart grids. Recently, DSM researchers have developed various mathematical models to optimize demand response. Most these works ignore channel impairments' impact on optimization process. In this paper, we propose new noncooperative game theoretic model for grid's considering packet error rate our formulation. We set Nash equilibrium conditions proposed model. Under an assumption form utility functions, develop 0-1 mixed linear...

Unmanned Aerial Vehicles (UAVs) are considered an important element in wireless communication networks due to their agility, mobility, and ability be deployed as mobile base stations (BSs) the network improve quality coverage area. UAVs can used provide services for ground users different scenarios, such transportation systems, disaster situations, emergency cases, surveillance. However, covering a specific area under dynamic environment long time using UAV technology is quite challenging...

Demand response management (DRM) plays a crucial role in the prospective development of smart grids. The precise estimation electricity demand for individual houses is vital optimizing operation and planning power system. Accurate forecasting required components holds significance as it can substantially impact final cost, mitigate risks, support informed decision-making. In this paper, approach employing neural networks grid demand-side proposed. study explores various enhanced artificial...

This paper presents a new framework for the optimization of real-life multiple-objective vehicle routing problems with multiple time windows. uses hybrid variable neighborhood tabu search heuristic that chooses Pareto nondominated solutions from space satisfy set Nash equilibrium conditions multiple-agent game theory model. Even though is general and can tackle different classes problems, it herein tested on three objectives: minimizing total travel cost (expressed in units), maximizing...

The Vehicle Routing Problem (VRP) is a known optimization problems falling under the category of NP-Hard set problems. VRP, along with its variations, continue to be extensively explored by research community due their large domain application (environment, agriculture, industry, etc.) and economic impact on improving overall performance, Quality Services reducing operational cost. In this paper, we focus VRPMTW; variant VRP Multiple Time Windows constraints. We introduce novel Hybrid...

Today's smart grid faces many challenges due to the rapid evolution of generation, distribution, and storage means which enable users produce, store, sell energy back providers. Demand response management plays a key role in achieving objective balancing electricity supply demand efficiently. It also helps leveling consumption during peak hours. To do so, this paper proposes game theoretic model for multiperiodic side problem with shifted demand. The proposed has two major sets players:...

The transportation of elderly and impaired people is commonly solved as a Dial-A-Ride Problem (DARP). DARP aims to design pick-up delivery vehicle routing schedules. Its main objective accommodate many users possible with minimum operation cost. It adds realistic precedence transit time constraints on the pairing vehicles customers. This paper tackles windows (DARPTW) from new innovative angle it combines hybridization techniques an adaptive large neighborhood search heuristic algorithm....

Demand response management (DRM) significantly influences the prospective advancement of electricity smart grids. This paper introduces three distinct game-theoretic duopoly models for grid demand problem. It delineates several rational assumptions regarding model variables, functions, and parameters. The first adopts a Cournot form, offering unique closed-form equilibrium solution. second Stackelberg structure, also providing Following comparison economic viability two equilibria an...

This paper presents two new results on the enumeration of all extreme equilibria sequence form a person extensive game. The an game is expressed, for first time to our knowledge, as parametric linear 0 - 1 program. Considering Ext(P) set Nash and Ext(Q) program points, we show that ⊆ Ext(Q). Using exact arithmetics classes, algorithm EχMIP Belhaiza (2002); Audet et al. (2006) extended enumerate elements A small procedure then applied in order obtain Ext(P).

This paper presents a hybrid tabu search variable neighborhood (HVNTS) heuristic that chooses Pareto non-dominated solutions from the space of satisfy set Nash equilibrium conditions for multiple-agent game theory model. The framework is general and can tackle different classes Vehicle Routing Problems (VRP). It herein applied to VRP with Multiple Time Windows (VRPMTW) tested on three objectives: minimizing total travel cost (expressed in time units), maximizing minimal customers' utility,...

The Dial-A-Ride Problem (DARP) consists of designing pick-up and delivery vehicle routing schedules for a set customers. Commonly, it arises in door-to-door transportation impaired or elderly people. main objective is to accommodate as many users possible with minimum operation cost. It adds realistic precedence transit time constraints on the pairing vehicles This paper proposes hybrid evolutionary heuristic dial-a-ride problem windows (DARPTW). combines crossover operators hybridized VNS...

When confronted with multiple Nash equilibria, decision makers have to refine their choices. Among all known equilibrium refinements, the perfectness concept is probably most famous one. It that weakly dominated strategies of two-player games cannot be part a perfect equilibrium. In general, this undominance property however does not extend <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M1"><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:math>-player (E. E. C. van Damme, 1983)....

In this paper, we implement automatic procedures to enumerate all Nash maximal subsets of a bimatrix game and compute their dimensions. We propose linear programming approach identify extreme perfect equilibria, Selten present the Eχ-MIPerfect EEE-Perfect algorithms which equilibria. finally report comment computational experiments on randomly generated games with different size density.