Photovoltaic power station current collection system topology optimization method and system based on three-section optimization genetic algorithm
By using a three-stage optimization genetic algorithm, combined with hybrid initialization, dual repair mechanism and dynamic penalty evaluation, the shortcomings of existing methods in the topology optimization of photovoltaic power plant collection systems are solved, achieving efficient and reliable topology optimization and generating economical and feasible optimization schemes.
Patent Information
- Application Number
- CN202610431153.4
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- Filing Date
- 2026-04-02
- Publication Date
- 2026-07-03
- Estimated Expiration
- 2046-04-02
AI Technical Summary
Existing methods for optimizing the topology of photovoltaic power plant collection systems suffer from problems such as reliance on human experience and high subjectivity, lack of consideration for practical engineering constraints in computer-aided design tools, and chaotic and inefficient initial schemes in general optimization algorithms, making it difficult to achieve efficient and reliable topology optimization.
A three-stage optimization genetic algorithm is adopted, including a hybrid initialization strategy, a dual repair mechanism, and dynamic penalty evaluation. The initial population is generated through K-Means clustering, nearest neighbor heuristic, and minimum spanning tree heuristic strategy. Through conventional repair and intelligent repair collaborative optimization, combined with dynamic penalty evaluation, the topology scheme is ensured to meet engineering constraints and minimize costs.
It significantly improves the efficiency and quality of topology optimization for photovoltaic power plant collection systems, shortens convergence time, generates high-quality topology schemes that meet actual engineering needs, reduces investment costs, and improves the robustness and economy of the algorithm.