Demand response (DR) is a vital part in smart grid to restore the balance between electricity demand and supply. In this paper, a real-time charging scheme is proposed to coordinate the electric vehicle (EV) charging and accommodate DR programs in the parking station. The charging scheduling is formulated as a binary optimization problem because the on-off strategy is leveraged to achieve faster charging speed of EV. Given the computationally expensive nature of exhaustive search in solving the optimal solution of binary optimization problem, a convex relaxation method is developed as an alternative to compute the near-optimal charging schedules. Extensive simulation results show that the proposed work is able to satisfy EV charging demand while accommodating both types of DR programs in the parking station. The proposed work is also able to simultaneously maximize the number of EVs for charging and minimize the monetary expenses.

The economic and environmental benefits brought by electric vehicles (EVs) cannot be fully delivered unless these vehicles are fully or partially charged by renewable energy sources (RES) such as photovoltaic system (PVS). Nevertheless, the EV charging management problem of a parking station integrated with RES is challenging due to the uncertain nature of local RES generation. This paper aims to address these difficulties by deploying an energy storage system (ESS) in parking stations and exploiting the charging and discharging scheduling of EVs to achieve better utilization of intermittent PVS for EV charging. A real-time charging optimization scheme is also formulated, using mixed-integer linear programming (MILP) to coordinate the charging or discharging power of EVs along with the power dispatches of power grid and ESS based on the vehicles’ charging or discharging priorities and electricity price preferences. Extensive simulations show that the proposed approach not only maximizes the satisfaction of EV owners in terms of fulfilling all charging and discharging requests, but also minimizes the overall operational cost of the parking station by prioritizing the utilization of energy from PVS, ESS, and scheduling of every EV’s charging and discharging.

Human skin diseases have become increasingly prevalent in recent decades, with millions of individuals in developed countries experiencing monkeypox. Such conditions often carry less obvious but no less devastating risks, including increased vulnerability to monkeypox, cancer, and low self-esteem. Due to the low visual resolution of monkeypox disease images, medical specialists with high-level tools are typically required for a proper diagnosis. The manual diagnosis of monkeypox disease is subjective, time-consuming, and labor-intensive. Therefore, it is necessary to create a computer-aided approach for the automated diagnosis of monkeypox disease. Most research articles on monkeypox disease relied on convolutional neural networks (CNNs) and using classical loss functions, allowing them to pick up discriminative elements in monkeypox images. To enhance this, a novel framework using Al-Biruni Earth radius (BER) optimization-based stochastic fractal search (BERSFS) is proposed to fine-tune the deep CNN layers for classifying monkeypox disease from images. As a first step in the proposed approach, we use deep CNN-based models to learn the embedding of input images in Euclidean space. In the second step, we use an optimized classification model based on the triplet loss function to calculate the distance between pairs of images in Euclidean space and learn features that may be used to distinguish between different cases, including monkeypox cases. The proposed approach uses images of human skin diseases obtained from an African hospital. The experimental results of the study demonstrate the proposed framework’s efficacy, as it outperforms numerous examples of prior research on skin disease problems. On the other hand, statistical experiments with Wilcoxon and analysis of variance (ANOVA) tests are conducted to evaluate the proposed approach in terms of effectiveness and stability. The recorded results confirm the superiority of the proposed method when compared with other optimization algorithms and machine learning models.

Particle swarm optimization (PSO) is envisioned as potential solution to overcome maximum power point tracking (MPPT) problems. Nevertheless, conventional PSO suffers from large transient oscillation, slow convergence and tedious parameter tuning when tracking global MPP (GMPP) under partial shading conditions (PSC), leading to poor efficiency and significant power loss. Therefore, a modified PSO hybridized with adaptive local search (MPSO-HALS) is designed as a robust, real-time MPPT algorithm. A modified initialization scheme that leverages grid partitioning and oppositional-based learning is incorporated to produce an evenly distributed initial population across P-V curve. Additionally, a rank-based selection scheme is adopted to choose best half of population for subsequent global and local search modes. A modified global search method with fewer parameters is devised to rapidly identify approximated location of GMPP. Finally, a modified local search method using Perturb and Observe with adaptive step size method (P&O-ASM) is proposed to refine the near-optimal duty cycle and track GMPP with negligible oscillations. MPSO-HALS is implemented into low-cost microcontroller for real-time application. Extensive studies prove the proposed algorithm outperforms bat algorithm (BA), improved grey wolf optimizer (IGWO), conventional PSO and P&O, with convergence time shorter than 0.3 s and tracking accuracy above 99% under different complex PSCs.