RSA-Grid: A grid computing based framework for power system reliability and security analysis

Grid computing is an emerging technology for providing the high performance computing capability and collaboration mechanism for solving the collaborated and complex problems while using the existing resources. In this paper, a grid computing based framework is proposed for the probabilistic based power system reliability and security analysis. The suggested name of this computing grid is Reliability and Security Grid (RSA-Grid). Then the architecture of this grid is presented. A prototype system has been built for further development of grid-based services for power systems reliability and security assessment based on probabilistic techniques, which require high performance computing and large amount of memory. Preliminary results based on prototype of this grid show that RSA-Grid can provide the comprehensive assessment results for real power systems efficiently and economically.

Power generation investment opportunities evaluation: A comparison between net present value and real options approach

To evaluate an investment project in the competitive electricity market, there are several key factors that affects the project's value: the present value that the project could bring to investor, the possible future course of actions that investor has and the project's management flexibility. The traditional net present value (NPV) criteria has the ability to capture the present value of the project's future cash flow, but it fails to assess the value brought by market uncertainty and management flexibility. By contrast with NPV, the real options approach (ROA) method has the advantage to combining the uncertainty and flexibility in evaluation process. In this paper, a framework for using ROA to evaluate the generation investment opportunity has been proposed. By given a detailed case study, the proposed framework is compared with NPV and showing a different results

A mathematical modelling technique for the analysis of the dynamics of a simple continuous EDA

This paper presents some initial attempts to mathematically model the dynamics of a continuous estimation of distribution algorithm (EDA) based on a Gaussian distribution and truncation selection. Case studies are conducted on both unimodal and multimodal problems to highlight the effectiveness of the proposed technique and explore some important properties of the EDA. With some general assumptions, we show that, for ID unimodal problems and with the (mu, lambda) scheme: (1). The behaviour of the EDA is dependent only on the general shape of the test function, rather than its specific form; (2). When initialized far from the global optimum, the EDA has a tendency to converge prematurely; (3). Given a certain selection pressure, there is a unique value for the proposed amplification parameter that could help the EDA achieve desirable performance; for ID multimodal problems: (1). The EDA could get stuck with the (mu, lambda) scheme; (2). The EDA will never get stuck with the (mu, lambda) scheme.