2017
DOI: 10.1016/j.eswa.2017.03.036
|View full text |Cite
|
Sign up to set email alerts
|

A robust ant colony optimization for continuous functions

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
29
0
9

Year Published

2017
2017
2021
2021

Publication Types

Select...
6
2
1

Relationship

0
9

Authors

Journals

citations
Cited by 46 publications
(38 citation statements)
references
References 20 publications
0
29
0
9
Order By: Relevance
“…However, the GWO algorithm also exhibits the problem of easily reaching a local optimal solution, as with any other swarm intelligence algorithm [35][36][37][38]. To address this problem, the GWO algorithm was improved in this study as follows:…”
Section: Improved Gwo Algorithmmentioning
confidence: 99%
See 1 more Smart Citation
“…However, the GWO algorithm also exhibits the problem of easily reaching a local optimal solution, as with any other swarm intelligence algorithm [35][36][37][38]. To address this problem, the GWO algorithm was improved in this study as follows:…”
Section: Improved Gwo Algorithmmentioning
confidence: 99%
“…An optimal simulation was performed to test the optimal ability of the improved GWO algorithm. A single-mode function and multi-mode function were selected for the test [35][36][37][38]. f 1 (x), f 2 (x), and are single-mode functions that represent the typical method of evaluating the global convergence of an algorithm.…”
Section: Verification Of the Superiority Of The Improved Gwo Algorithmmentioning
confidence: 99%
“…One of the main limitations of the TFP method remains in its difficulty in coping with uncertainties described as probability distributions when the available historical data is sufficient (e.g., pollutant discharge allowances) [26][27][28]. Such a problem can be formulated as a two-stage stochastic programming with a recourse (TSP) model [23].…”
Section: Methodsmentioning
confidence: 99%
“…Thus, the number of all objective functions, their coefficient, constraints, and decision variables is naturally known. At the same time, branch and bound approach as one of optimization algorithms is applied to solve this model [46][47][48][49]. Specifically, the objectives and constraints are mapped into the corresponding elements involved in branch and bound approach.…”
Section: A Case Study From Wenchuan Earthquakementioning
confidence: 99%