A node sequence-based ant colony optimisation algorithm for die scheduling problem with twin-crane transportation

Author(s):  
Liping Zhang ◽  
Zhenwei Zhu ◽  
Xionghui Zhou
2020 ◽  
pp. 0309524X2091731
Author(s):  
Yi-wen Wu ◽  
Yong Wang

Collection line optimisation plays an important role in reducing the wind farm construction cost and improving the reliability of collector system. First, the optimisation model of collection lines in wind farms is given. Based on the four-vertex-three-line inequality and Prim algorithm, an improved ant colony optimisation algorithm is introduced to minimise the total length of collection lines to reduce their cost. In addition, the K-means clustering algorithm is adopted to partition the total wind turbines into several groups for the improved ant colony optimisation algorithm to search the shortest collection lines. The improved ant colony optimisation algorithm is tested with a wind farm example and compared with the classic ant colony optimisation algorithm. Under the same preconditions, the experimental results show that compared to the classic ant colony optimisation algorithm, the improved ant colony optimisation algorithm finds shorter collection lines in radial configuration for the wind farm. In addition, the improved ant colony optimisation algorithm requires less computation cycles to find better collection lines.


Sign in / Sign up

Export Citation Format

Share Document