ترغب بنشر مسار تعليمي؟ اضغط هنا

Evacuation Problem Under the Nuclear Leakage Accident

64   0   0.0 ( 0 )
 نشر من قبل Canqi Yao
 تاريخ النشر 2021
  مجال البحث الهندسة المعلوماتية
والبحث باللغة English




اسأل ChatGPT حول البحث

To handle the detrimental effects brought by leakage of radioactive gases at nuclear power station, we propose a bus based evacuation optimization problem. The proposed model incorporates the following four constraints, 1) the maximum dose of radiation per evacuee, 2) the limitation of bus capacity, 3) the number of evacuees at demand node (bus pickup stop), 4) evacuees balance at demand and shelter nodes, which is formulated as a mixed integer nonlinear programming (MINLP) problem. Then, to eliminate the difficulties of choosing a proper M value in Big-M method, a Big-M free method is employed to linearize the nonlinear terms of the MINLP problem. Finally, the resultant mixed integer linear program (MILP) problem is solvable with efficient commercial solvers such as CPLEX or Gurobi, which guarantees the optimal evacuation plan obtained. To evaluate the effectiveness of proposed evacuation model, we test our model on two different scenarios (a random one and a practical scenario). For both scenarios, our model attains executable evacuation plan within given 3600 seconds computation time.



قيم البحث

اقرأ أيضاً

We consider a scenario in which an autonomous agent carries out a mission in a stochastic environment while passively observed by an adversary. For the agent, minimizing the information leaked to the adversary regarding its high-level specification i s critical in creating an informational advantage. We express the specification of the agent as a parametric linear temporal logic formula, measure the information leakage by the adversarys confidence in the agents mission specification, and propose algorithms to synthesize a policy for the agent which minimizes the information leakage to the adversary. In the scenario considered, the adversary aims to infer the specification of the agent from a set of candidate specifications, each of which has an associated likelihood probability. The agents objective is to synthesize a policy that maximizes the entropy of the adversarys likelihood distribution while satisfying its specification. We propose two approaches to solve the resulting synthesis problem. The first approach computes the exact satisfaction probabilities for each candidate specification, whereas the second approach utilizes the Frechet inequalities to approximate them. For each approach, we formulate a mixed-integer program with a quasiconcave objective function. We solve the problem using a bisection algorithm. Finally, we compare the performance of both approaches on numerical simulations.
Optimized Pulse Patterns (OPPs) are gaining increasing popularity in the power electronics community over the well-studied pulse width modulation due to their inherent ability to provide the switching instances that optimize current harmonic distorti ons. In particular, the OPP problem minimizes current harmonic distortions under a cardinality constraint on the number of switching instances per fundamental wave period. The OPP problem is, however, non-convex involving both polynomials and trigonometric functions. In the existing literature, the OPP problem is solved using off-the-shelf solvers with local convergence guarantees. To obtain guarantees of global optimality, we employ and extend techniques from polynomial optimization literature and provide a solution with a global convergence guarantee. Specifically, we propose a polynomial approximation to the OPP problem to then utilize well-studied globally convergent convex relaxation hierarchies, namely, semi-definite programming and relative entropy relaxations. The resulting hierarchy is proven to converge to the global optimal solution. Our method exhibits a strong performance for OPP problems up to 50 switching instances per quarter wave.
We investigate the probabilistic feasibility of randomized solutions to two distinct classes of uncertain multi-agent optimization programs. We first assume that only the constraints of the program are affected by uncertainty, while the cost function is arbitrary. Leveraging recent a posteriori developments of the scenario approach, we provide probabilistic guarantees for all feasible solutions of the program under study. This result is particularly useful in cases where numerical difficulties related to the convergence of the solution-seeking algorithm hinder the exact quantification of the optimal solution. Furthermore, it can be applied to cases where the agents incentives lead to a suboptimal solution, e.g., under a non-cooperative setting. We then focus on optimization programs where the cost function admits an aggregate representation and depends on uncertainty while constraints are deterministic. By exploiting the structure of the program under study and leveraging the so called support rank notion, we provide agent-independent robustness certificates for the optimal solution, i.e., the constructed bound on the probability of constraint violation does not depend on the number of agents, but only on the dimension of the agents decision. This substantially reduces the number of samples required to achieve a certain level of probabilistic robustness as the number of agents increases. All robustness certificates provided in this paper are distribution-free and can be used alongside any optimization algorithm. Our theoretical results are accompanied by a numerical case study involving a charging control problem of a fleet of electric vehicles.
This paper deals with linear algebraic equations where the global coefficient matrix and constant vector are given respectively, by the summation of the coefficient matrices and constant vectors of the individual agents. Our approach is based on refo rmulating the original problem as an unconstrained optimization. Based on this exact reformulation, we first provide a gradient-based, centralized algorithm which serves as a reference for the ensuing design of distributed algorithms. We propose two sets of exponentially stable continuous-time distributed algorithms that do not require the individual agent matrices to be invertible, and are based on estimating non-distributed terms in the centralized algorithm using dynamic average consensus. The first algorithm works for time-varying weight-balanced directed networks, and the second algorithm works for general directed networks for which the communication graphs might not be balanced. Numerical simulations illustrate our results.
75 - Yiwei Qiu 2020
Continuous-time random disturbances from the renewable generation pose a significant impact on power system dynamic behavior. In evaluating this impact, the disturbances must be considered as continuous-time random processes instead of random variabl es that do not vary with time to ensure accuracy. Monte Carlo simulation (MCs) is a nonintrusive method to evaluate such impact that can be performed on commercial power system simulation software and is easy for power utilities to use, but is computationally cumbersome. Fast samplings methods such as Latin hypercube sampling (LHS) have been introduced to speed up sampling random variables, but yet cannot be applied to sample continuous disturbances. To overcome this limitation, this paper proposes a fast MCs method that enables the LHS to speed up sampling continuous disturbances, which is based on the It^{o} process model of the disturbances and the approximation of the It^{o} process by functions of independent normal random variables. A case study of the IEEE 39-Bus System shows that the proposed method is 47.6 and 6.7 times faster to converge compared to the traditional MCs in evaluating the expectation and variance of the system dynamic response.
التعليقات
جاري جلب التعليقات جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
mircosoft-partner

هل ترغب بارسال اشعارات عن اخر التحديثات في شمرا-اكاديميا