Search

This article proposes a new planning framework for optimal allocation of parking lot (PL)-based charging infrastructures to facilitate the efficient integration of plug-in electric vehicles (PEVs). Unlike existing works, the present article explicitly considers the uncertain implications of incentive policy on PEV owners’ charging behaviors and its effects in PL planning. For this aim, a regret-matching technique is introduced to model the bounded rationality of PEV owners in deciding the choice to use different charging options for recharging their vehicle, as a dependency with respect to the incentive value and the accessibility of the charging service in long-term horizon. Such endogenous uncertainties are considered simultaneously with the inherent exogenous randomness of PEV demand and captured by the proposed PL planning model using a proper scenario generation method. The resulting model turns out to be a two-stage stochastic programming with decision-dependent uncertainties and it is solved by using the genetic algorithm. Numerical studies based on an illustrative test system verify the effectiveness of the proposed model and the approach. [ABSTRACT FROM AUTHOR]

We investigate two closely related nonparametric hypothesis testing problems. In the first problem (i.e., the existence problem), we test whether a testing data stream is generated by one of a set of composite distributions. In the second problem (i.e., the association problem), we test which one of the multiple distributions generates a testing data stream. We assume that some distributions in the set are unknown, and instead, only training sequences generated by the corresponding distributions are available. For both problems, we construct the generalized likelihood tests and characterize the error exponents of the maximum error probabilities. For the existence problem, we show that the error exponent is mainly captured by the Chernoff information between the set of composite distributions and alternative distributions. For the association problem, we show that the error exponent is captured by the minimum Chernoff information between each pair of distributions as well as the Kullback-Leibler Divergences between the approximated distributions (via training sequences) and the true distributions. We also show that the ratio between the lengths of training and testing sequences plays an important role in determining the error decay rate. [ABSTRACT FROM AUTHOR]

Power system capacity-expansion models are typically intractable if every operating period is represented. This issue is normally overcome by using a subset of representative operating periods. For instance, representative operating hours can be selected by discretizing the load-duration curve, which captures the effect of load levels on system-operation costs. This approach is inappropriate if system-operating costs depend on parameters other than load (e.g., renewable-resource availability) or if there are important intertemporal operating constraints (e.g., generator-ramping limits). This paper proposes the use of representative operating days, which are selected using clustering, to surmount these issues. We propose two hierarchical clustering techniques, which are designed to capture the important statistical features of the parameters (e.g., load and renewable-resource availability), in selecting representative days. This includes temporal autocorrelations and correlations between different locations. A case study, which is based on the Texan power system, is used to demonstrate the techniques. We show that our proposed clustering techniques result in investment decisions that closely match those made using the full unclustered dataset. [ABSTRACT FROM PUBLISHER]

We propose a multistage multiscale linear stochastic model to optimize electricity generation, storage, and transmission investments over a long planning horizon. The multiscale structure captures “large-scale” uncertainties, such as investment and fuel-cost changes and long-run demand-growth rates, and “small-scale” uncertainties, such as hour-to-hour demand and renewable-availability uncertainty. The model also includes a detailed treatment of operating periods so that the effect of dispatch decisions on long-term investments are captured. The proposed model can be large in size. The progressive hedging algorithm is applied to decompose the model by scenario, greatly reducing computation times. We also derive bounds on the optimal objective-function value, to assess solution quality. We use a case study based on the state of Texas to demonstrate the model and show the benefits of its detailed representation of the operating periods in making investment decisions. [ABSTRACT FROM PUBLISHER]

Linear matrix precoding, also known as vectoring, is a well-known technique to mitigate multiuser interference in the downlink digital subscriber line (DSL) transmission. While effective in canceling interference, vectoring does incur major communication overhead and computational overhead in terms of the transmission of idle symbols and precoder-data multiplications at each data frame, resulting in significant energy consumption when the number of lines is large. To facilitate energy efficient transmission, it has been recently proposed (in the G.fast standard) that each data frame is divided into a normal operating interval (NOI) and a discontinuous operating interval (DOI). In the NOI, all lines (or users) are involved in a common vectoring group, which requires a large matrix precoder, whereas in the DOI, the lines are subdivided into multiple small nonoverlapping vectoring subgroups and are transmitted in a time division multiple access manner, requiring small matrix multiplications and, thus, improving the energy efficiency. In this paper, we consider the key dynamic resource allocation problems in downlink DSL: given the real-time demands, determine the optimal transmission scheme: The optimal NOI and DOI size in each data frame as well as the optimal grouping strategy in the DOI, and optimally adjust the transmission scheme. We formulate these optimal dynamic resource allocation problems and propose efficient real-time algorithms to solve them to global optimality. Simulation results are shown to demonstrate the efficiency and the effectiveness of the proposed algorithms. [ABSTRACT FROM PUBLISHER]