Search

This paper proposed a panel data clustering model based on D-vine and C-vine and supported a semiparametric estimation for parameters. These models include a two-step inference function for margins, two-step semiparameter estimation, and stepwise semiparametric estimation. In similarity measurement, similarity coefficients are constructed by a multivariate Hierarchical Nested Archimedean Copula (HNAC) model and compound PCC models, which are HNAC and D-vine compound model and HNAC and C-vine compound model. Estimation solutions and models evaluation are given for these models. In the case study, the clustering results of HNAC and D-vine compound model and HNAC and C-vine compound model are given, and the effect of different copula families on clustering results is also discussed. The result shows the models are effective and useful. [ABSTRACT FROM AUTHOR]

With an ever‐increasing number of plug‐in electric vehicles (PEVs), there is a fast‐growing interest in PEVs' charging impact on the stability and the operating cost of power grid as well as the ecological environment. The centralized coordinated charging method is one of the promising solutions to mitigate such undesired impacts as elevating load peaks, increasing energy losses, and decreasing node voltage. However, the computational complexity is a critical issue to obtain the coordinated charging strategies especially for a large number of PEVs. In this context, it is very essential to analyze the computational performance of the centralized coordinated charging methods. In this paper, a paradigm for analyzing the computational performance is provided. Three centralized methods with different standpoint, viz., to minimize carbon emissions, to minimize load variance, and to minimize generation cost, are investigated to conduct a computational performance analysis from the grid operator perspective. First, the optimization theory is employed to transform the three engineering problems into the mathematical programming models. Then, whether the mathematical programming models are convex or nonconvex is analyzed. The results show that the first two mathematical programming models are convex, and the third mathematical programming model is nonconvex. And it demonstrates that the centralized scheduling model that is convex programming has a better computational performance theoretically. At last, simulations are carried out to verify the theoretical computational performance for different types of centralized coordinated charging methods. [ABSTRACT FROM AUTHOR]

This paper focuses on a multidemand multisource order quantity allocation problem with multiple transportation alternatives. To solve this problem, a bilevel multiobjective programming model under a mixed uncertain environment is proposed. Two levels of decision makers are considered in the model. On the upper level, the purchaser aims to allocate order quantity to multiple suppliers for each demand node with the consideration of three objectives: total purchase cost minimization, total delay risk minimization, and total defect risk minimization. On the lower level, each supplier attempts to optimize the transportation alternatives with total transportation and penalty costs minimization as the objective. In contrast to prior studies, considering the information asymmetry in the bilevel decision, random and fuzzy random variables are used to model uncertain parameters of the construction company and the suppliers. To solve the bilevel model, a solution method based on Kuhn-Tucker conditions, sectional genetic algorithm, and fuzzy random simulation is proposed. Finally, the applicability of the proposed model and algorithm is evaluated through a practical case from a large scale construction project. The results show that the proposed model and algorithm are efficient in dealing with practical order quantity allocation problems. [ABSTRACT FROM AUTHOR]

This paper presents an approach for weighting indices in the comprehensive evaluation. In accordance with the principle that the entire difference of various evaluation objects is to be maximally differentiated, an adjusted weighting coefficient is introduced. Based on the idea of maximizing the difference between the adjusted evaluation scores of each evaluation object and their mean, an objective programming model is established with more obvious differentiation between evaluation scores and the combined weight coefficient determined, thereby avoiding contradictory and less distinguishable evaluation results of single weighting methods. The proposed model is demonstrated using 2,044 observations. The empirical results show that the combined weighting method has the least misjudgment probability, as well as the least error probability, when compared with four single weighting methods, namely, G1, G2, variation coefficient, and deviation methods. [ABSTRACT FROM AUTHOR]

In Long Term Evolution Advanced networks with Type I in-band half-duplex decode-and-forward relay nodes, proportional fair (PF) resource allocation is aiming at guaranteeing two-hop match and optimising global proportional fairness. The two-hop match is defined as equal data rates in the access links and the corresponding backhaul links. The global proportional fairness is between all the user equipments served by the evolved nodes B and the relay nodes. Existing centralised schemes achieve these targets at the cost of enormous channel state information (CSI) exchange. Existing distributed schemes focus on resource partitioning and employ a traditional single-hop PF scheduling algorithm in access links, with less CSI exchange. The traditional PF scheduling algorithm maximises single-hop proportional fairness between the data rates in the access links rather than two-hop proportional fairness between the end-to-end data rates in the two hops. In order to reduce CSI exchange and at the same time to maximise the two-hop proportional fairness, a distributed two-hop PF resource allocation scheme is proposed. The proposed scheme includes two-hop PF resource scheduling algorithms and adaptive resource partitioning algorithms, applied in different two-hop transmission protocols. Simulation results demonstrate the proposed scheme is better than the existing distributed schemes in obtaining better proportional fairness and larger cell-edge user equipment throughputs. Copyright © 2014 John Wiley & Sons, Ltd. [ABSTRACT FROM AUTHOR]