Apply Ant Colony Algorithm to Search All Extreme Points of Function
Chao-Yang Pang, Hui Liu, Xia Li, Yun-Fei Wang, Ben-Qiong Hu

TL;DR
This paper explores the novel application of ant colony optimization (ACO) to find all extreme points of multimodal functions, demonstrating high accuracy with solution errors below 10^-8.
Contribution
It introduces a new approach using ACO for extremum problems, which is rarely reported in existing literature.
Findings
Solution error less than 10^-8
Effective in locating all extreme points of multimodal functions
Demonstrates the potential of ACO in complex optimization tasks
Abstract
To find all extreme points of multimodal functions is called extremum problem, which is a well known difficult issue in optimization fields. Applying ant colony optimization (ACO) to solve this problem is rarely reported. The method of applying ACO to solve extremum problem is explored in this paper. Experiment shows that the solution error of the method presented in this paper is less than 10^-8. keywords: Extremum Problem; Ant Colony Optimization (ACO)
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMetaheuristic Optimization Algorithms Research · Robotic Path Planning Algorithms · Advanced Multi-Objective Optimization Algorithms
