Akademska digitalna zbirka SLovenije - logo
E-viri
Celotno besedilo
Recenzirano
  • Adaptive evolutionary jelly...
    Yang, Bo; Zhang, Mengting; Guo, Zhengxun; Cao, Pulin; Yang, Jin; He, Guobin; Yang, Jinxin; Su, Rui; Huang, Xuyong; Zhu, Mengmeng; Lu, Hai; Zhu, Dongdong

    Expert systems with applications, 04/2023, Letnik: 215
    Journal Article

    •A novel algorithm is proposed to extract maximum power of photovoltaic system.•Discretization for proposed algorithm is designed to solve discrete problems.•An adaptive threshold is used to balance local exploration and global exploitation.•Consider various movement of clouds to evaluate proposed algorithm effectiveness.•Perform an electrical switching design to implement real-time embedded application. This paper proposes an adaptive evolutionary jellyfish search algorithm (AEJSA) to optimally reconfigure photovoltaic (PV) array under partial shading condition (PSC) for real-time maximum power extraction. Jellyfish search algorithm (JSA) is selected owing to its effectiveness for real-time optimization. Besides, a series of discrete operations are performed on JSA to solve the discrete optimization problem of PV array reconfiguration. Due to the inherent drawback of JSA that it is easy to trap at the local optimal solution, an adaptive threshold for changing search mechanism is adopted to balance the local exploration and global exploitation. If the number of times that the value of objective function keeps unchanged exceeds this threshold, three operations (exchange, moving, and inver-over) will be implemented on the whole population for a wide global exploitation. In addition, to verify the feasibility of the hardware implementation of AEJSA, a hardware-in-the-loop test on a RTLAB platform is employed. Eleven meta-heuristic algorithms are applied and compared to AEJSA under objective PSC and subjective PSC to evaluate the optimized performance of AEJSA under various shadow conditions. The simulation results show that the mismatched power loss obtained by AEJSA is smallest, which reduced by 7.26% against gravitational search algorithm.