Search Region Reduction and Ant Colony Optimization, a Short Survey
DOI:
https://doi.org/10.15520/jro.v8i10.128Keywords:
Max-min ant system, Ant Colony Optimization, Travelling Salesman Problem, Knapsack Problem, Combinatorial OptimizationAbstract
Different attempts have been made to minimize the search region if large-scale optimization problems. Reducing the search region size would deffintely improve the performance of optimization algorithms, specially ant colony optimization (ACO) algorithm. In this short survey paper, we list the most important attempts to reduce the search region.
Downloads
Download data is not yet available.
Published
2021-10-13
Issue
Section
Research Articles | Open access
How to Cite
1.
Search Region Reduction and Ant Colony Optimization, a Short Survey. Journal of Research and Opinion [Internet]. 2021 Oct. 13 [cited 2026 Oct. 24];8(10):3036-8. Available from: http://researchopinion.in/index.php/jro/article/view/128
