Sürdürülebilir Kalkınma Amaçları

Yazarlar

  • MakaleAçık Erişim2021
    A Secured Social-Economic Framework Based on PEM-Blockchain for Optimal Scheduling of Reconfigurable Interconnected Microgrids

    Yin, Fengyuan; Hajjiah, Ali; Jermsittiparsert, Kittisak; Al-Sumaiti, Ameena Saad; Elsayed, Salah K.; Ghoneim, Sherif S. M.; Mohamed, Mohamed A.

    Optimal scheduling of reconfigurable interconnected microgrids is a precious and critical task for the residential consumers especially with the integration of renewable energy sources, dispatchable units and energy storage systems. In this regard, not only the optimal scheduling of the microgrids in a realistic and correlated environment is a necessity, but also the guarantied security and the prevention of cyber-attacks are mandatory tasks for the operators. This article first addresses these issues by developing a novel framework based on blockchain for secured data transaction from the individual microgrids' components to the central control unit and then tries to find the optimal scheduling plan using stochastic programming based on point estimate method (PEM). Through such a hybrid PEM-blockchain based framework, the interconnected microgrids can supply the residential loads in a fully reliable, economic and secured structure. We also consider a social-economic framework to not only minimize the total operating cost of the microgrids, but also benefit the customers by enhancing the social factors through the optimal switching. Considering the complex and nonlinear nature of the problem, an effective corrected crow search (CCS) algorithm is deployed to find the most optimal operating point for the microgrids. The quality and capabilities of the proposed model are investigated using a practical residential interconnected microgrid. The results show that the optimal switching could reduce the total operation cost from $22,716 to $21,935 (3.56% reduction). Also, the average energy not supplied (AENS) has reduced from 1.4115 to 1.352 kWh/customer.yr (4.40% reduction), which are notable values. The results advocate the quality and functionality of the proposed framework.

    • SDG 7 · Erişilebilir ve Temiz Enerji
    • SDG 9 · Sanayi, Yenilikçilik ve Altyapı
  • MakaleAçık Erişim2020
    HCAB-SMOTE: A Hybrid Clustered Affinitive Borderline SMOTE Approach for Imbalanced Data Binary Classification

    Al Majzoub, Hisham; Elgedawy, Islam; Akaydin, Oyku; Ulukok, Mehtap Kose

    Binary datasets are considered imbalanced when one of their two classes has less than 40% of the total number of the data instances (i.e., minority class). Existing classification algorithms are biased when applied on imbalanced binary datasets, as they misclassify instances of minority class. Many techniques are proposed to minimize the bias and to increase the classification accuracy. Synthetic Minority Oversampling Technique (SMOTE) is a well-known approach proposed to address this problem. It generates new synthetic data instances to balance the dataset. Unfortunately, it generates these instances randomly, leading to the generation of useless new instances, which is time and memory consuming. Different SMOTE derivatives were proposed to overcome this problem (such as Borderline SMOTE), yet the number of generated instances slightly changed. To overcome such problem, this paper proposes a novel approach for generating synthesized data instances known as Hybrid Clustered Affinitive Borderline SMOTE (HCAB-SMOTE). It managed to minimize the number of generated instances while increasing the classification accuracy. It combines undersampling for removing majority noise instances and oversampling approaches to enhance the density of the borderline. It uses k-means clustering on the borderline area and identify which clusters to oversample to achieve better results. Experimental results show that HCAB-SMOTE outperformed SMOTE, Borderline SMOTE, AB-SMOTE and CAB-SMOTE approaches which were developed before reaching HCAB-SMOTE, as it provided the highest classification accuracy with the least number of generated instances.