Abstract
Due to the lack of dynamic adjustments between global searches and local optimization, it is difficult to maintain high diversity and overcome local optimum problems for Ant Colony Algorithms (ACA). Therefore, this paper proposes an improved ACA, Dynamic Ant Colony Algorithm (DACA). DACA applies dynamic adjustments on heuristic factor changes to balance global searches and local optimization in ACA, which decreases cosines. At the same time, by utilizing the randomness and ergodicity of the chaotic search, DACA implements the chaos disturbance on the path found in each ACA iteration to improve the algorithm's ability to jump out of the local optimum and avoid premature convergence. We conducted a case study with DACA for optimal joint operation of the Dadu River cascade reservoirs. The simulation results were compared with the results of the gradual optimization method and the standard ACA, which demonstrated the advantages of DACA in speed and precision.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
More From: IOP Conference Series: Earth and Environmental Science
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.