Optimization of Cable Layout Design in a Wind Farm: A Hybrid Approach

摘要

In this paper, a hybrid algorithm based on modified Ants Colony Optimization (ACO) and Artificial Immune Algorithm (AIA) for solving the Steiner Minimal Tree Problem (SMTP) is introduced. Since the Steiner Tree Problem is NP-hard, we design an algorithm to construct high quality Steiner trees in a short time which is suitable for real time multicast routing in networks. After the breadth - first traversal of the minimal graph obtained by ACO, the terminal points are divided into different convex hull sets, and the full Steiner tree is structured from the convex hull sets partition. The Steiner points can be vaccinated by AIA to get an optimal graph. The average optimization effect of AIA is shorter than the minimal graph obtained using ACO, and the performance of the algorithm is shown. We give an example of application in wind farm network design.