A robust ant colony optimization for continuous functions
作者：
Highlights：
• The robust ant colony algorithm for continuous optimization is very simple to use.
• It doesn't make any major conceptual change to ant colony optimization's structure.
• It uses a broad-range search which enables ants to search in a new domain.
• It is robust to initial domain's properties such as length, symmetry and border.
• It can find the correct result in given domains without optimal solution.
摘要
•The robust ant colony algorithm for continuous optimization is very simple to use.•It doesn't make any major conceptual change to ant colony optimization's structure.•It uses a broad-range search which enables ants to search in a new domain.•It is robust to initial domain's properties such as length, symmetry and border.•It can find the correct result in given domains without optimal solution.
论文关键词：Broad-range search,Ant colony algorithm,Continuous optimization,Robustness
论文评审过程：Received 7 September 2016, Revised 15 March 2017, Accepted 16 March 2017, Available online 25 March 2017, Version of Record 5 April 2017.
论文官网地址：https://doi.org/10.1016/j.eswa.2017.03.036
