Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userDynamic Game-based Maintenance Scheduling of Integrated Electric and Natural Gas Grids with a Bilevel Approach
145
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
This paper proposes a dynamic game-based maintenance scheduling mechanism for the asset owners of the natural gas grid and the power grid by using a bilevel approach. In the upper level, the asset owners of the natural gas grid and the power grid schedule maintenance to maximize their own revenues. This level is modeled as a dynamic game problem, which is solved by the backward induction algorithm. In the lower level, the independent system operator (ISO) dispatches the system to minimize the loss of power load and natural gas load in consideration of the system operating conditions under maintenance plans from the asset owners in the upper level. This is modeled as a mixed integer linear programming problem. For the model of the natural gas grid, a piecewise linear approximation associated with the big-M approach is used to transform the original nonlinear model into the mixed integer linear model. Numerical tests on a 6-bus system with a 4-node gas grid show the effectiveness of the proposed model.
rate research
Read More
We consider the scheduling of multiple tasks with pre-determined deadlines under random processing cost. This problem is motivated by the potential of large scale adoption of plug-in (hybrid) electric vehicles (PHEVs) in the near future. The charging requests of PHEVs usually have deadline constraints, and the electricity cost associated with PHEV charging is usually random due to the uncertainty in both system load and renewable generation. We seek to properly schedule the battery charging of multiple PHEVs so as to minimize the overall cost, which is derived from the total charging cost and the penalty for not completing charging before requested deadlines. Through a dynamic programming formulation, we establish the Less Laxity and Longer remaining Processing time (LLLP) principle that improves any charging policy on a sample-path basis, when the non-completion penalty is a convex function of the additional time needed to fulfill the uncompleted request. Specifically, the LLLP principle states that priority should be given to vehicles that have less laxity and longer remaining processing times. Numerical results demonstrate that heuristic policies that violate the LLLP principle, for example, the earliest deadline first (EDF) policy, can result in significant performance loss.
Distributed operation of integrated electricity and gas systems (IEGS) receives much attention since it respects data security and privacy between different agencies. This paper proposes an extended convex hull (ECH) based method to address the distributed optimal energy flow (OEF) problem in the IEGS. First, a multi-block IEGS model is obtained by dividing it into N blocks according to physical and regional differences. This multi-block model is then convexified by replacing the nonconvex gas transmission equation with its ECH-based constraints. The Jacobi-Proximal alternating direction method of multipliers (J-ADMM) algorithm is adopted to solve the convexified model and minimize its operation cost. Finally, the feasibility of the optimal solution for the convexified problem is checked, and a sufficient condition is developed. The optimal solution for the original nonconvex problem is recovered from that for the convexified problem if the sufficient condition is satisfied. Test results reveal that this method is tractable and effective in obtaining the feasible optimal solution for radial gas networks.
In order to balance the interests of integrated energy operator (IEO) and users, a novel Stackelberg game-based optimization framework is proposed for the optimal scheduling of integrated demand response (IDR)-enabled integrated energy systems with uncertain renewable generations, where the IEO acts as the leader who pursues the maximization of his profits by setting energy prices, while the users are the follower who adjusts energy consumption plans to minimize their energy costs. Taking into account the inherent uncertainty of renewable generations, the probabilistic spinning reserve is written in the form of a chance constraint; in addition, a district heating network model is built considering the characteristics of time delay and thermal attenuation by fully exploiting its potential, and the flexible thermal comfort requirements of users in IDR are considered by introducing a predicted mean vote (PMV) index. To solve the raised model, sequence operation theory is introduced to convert the chance constraint into its deterministic equivalent form, and thereby, the leader-follower Stackelberg game is tackled into a mixed-integer quadratic programming formulation through Karush-Kuhn-Tucker optimality conditions and is finally solved by the CPLEX optimizer. The results of two case studies demonstrate that the proposed Stackelberg game-based approach manages to achieve the Stackelberg equilibrium between IEO and users by the coordination of renewable generations and IDR. Furthermore, the study on a real integrated energy system in China verifies the applicability of the proposed approach for real-world applications.
This paper aims to answer the research question as to optimal design of decision-making processes for autonomous vehicles (AVs), including dynamical selection of driving velocity and route choices on a transportation network. Dynamic traffic assignment (DTA) has been widely used to model travelerss route choice or/and departure-time choice and predict dynamic traffic flow evolution in the short term. However, the existing DTA models do not explicitly describe ones selection of driving velocity on a road link. Driving velocity choice may not be crucial for modeling the movement of human drivers but it is a must-have control to maneuver AVs. In this paper, we aim to develop a game-theoretic model to solve for AVss optimal driving strategies of velocity control in the interior of a road link and route choice at a junction node. To this end, we will first reinterpret the DTA problem as an N-car differential game and show that this game can be tackled with a general mean field game-theoretic framework. The developed mean field game is challenging to solve because of the forward and backward structure for velocity control and the complementarity conditions for route choice. An efficient algorithm is developed to address these challenges. The model and the algorithm are illustrated on the Braess network and the OW network with a single destination. On the Braess network, we first compare the LWR based DTA model with the proposed game and find that the driving and routing control navigates AVs with overall lower costs. We then compare the total travel cost without and with the middle link and find that the Braess paradox may still arise under certain conditions. We also test our proposed model and solution algorithm on the OW network.
We suggest a mathematical model for computing and regularly updating the next preventive maintenance plan for a wind farm. Our optimization criterium takes into account the current ages of the key components, the major maintenance costs including eventual energy production losses as well as the available data monitoring the condition of the wind turbines. We illustrate our approach with a case study based on data collected from several wind farms located in Sweden. Our results show that preventive maintenance planning gives some effect, if the wind turbine components in question live significantly shorter than the turbine itself.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
