Unconstrained model and merge sorted serpentine arrangement method for dynamic reconfiguration of large PV arrays
The problem of finding the optimal interconnection between photovoltaic modules in a dynamic photovoltaic array to minimize partial shading losses is a Non-deterministic Polynomial time-hard (i.e., NP-hard) problem. Therefore, no known deterministic method can solve the problem in polynomial time. H...
Main Author: | M. Shamseldein |
---|---|
Format: | Article |
Language: | English |
Published: |
Elsevier
2022-12-01
|
Series: | Energy Conversion and Management: X |
Subjects: | |
Online Access: | http://www.sciencedirect.com/science/article/pii/S259017452200143X |
Similar Items
-
Power enhancement in PV arrays under partial shaded conditions with different array configuration
by: Sakthivel Ganesan, et al.
Published: (2024-01-01) -
Performance of PV array configurations under dynamic partial shadings
by: Shao Chuanyong, et al.
Published: (2023-01-01) -
Photovoltaic Array Dynamic Reconfiguration Based on an Improved Pelican Optimization Algorithm
by: Sheng Li, et al.
Published: (2023-08-01) -
Optimizing Solar Power Using Array Topology Reconfiguration With Regularized Deep Neural Networks
by: Vivek Narayanaswamy, et al.
Published: (2023-01-01) -
A Scalable Hierarchical Dynamic PV Array Reconfiguration under Partial Shading
by: Fatimah Ameen, et al.
Published: (2023-12-01)