Abstract
Aiming at solving the drawbacks of the original binary ant colony algorithm on multi-objective optimization problems: easy to fall into the local optimization and difficult to get the Pareto optimal solutions, we proposed Multi-population Binary ant Colony Algorithm with Concrete Behaviors (MPBACB). The algorithm introduced multi-population method to ensure the globe optimization ability, and use environmental evaluation/reward model to improve the searching efficiency. Furthermore, concrete ant behaviors are defined to stabilize the performance of algorithm. The experimental results on several constrained multi-objective functions prove that the algorithm ensure the good global search ability, and has better effect to the multi-objective problems.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
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.