2019
DOI: 10.1007/s12555-017-0451-1
|View full text |Cite
|
Sign up to set email alerts
|

Design of type-2 Fuzzy Logic Systems Based on Improved Ant Colony Optimization

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
9
0

Year Published

2019
2019
2022
2022

Publication Types

Select...
7
1

Relationship

0
8

Authors

Journals

citations
Cited by 12 publications
(9 citation statements)
references
References 14 publications
0
9
0
Order By: Relevance
“…In the following, some of the latest research in this field will be reviewed and analyzed. In (Zhang et al 2019 ), a general T2F-NN has been used for Mackey–Glass time series data (for τ = 17) prediction. The disadvantage of the mentioned paper is the training time of their proposed general T2F-NN, because it trains and predicts to the work of others over a longer period of time.…”
Section: T2f-nnsmentioning
confidence: 99%
“…In the following, some of the latest research in this field will be reviewed and analyzed. In (Zhang et al 2019 ), a general T2F-NN has been used for Mackey–Glass time series data (for τ = 17) prediction. The disadvantage of the mentioned paper is the training time of their proposed general T2F-NN, because it trains and predicts to the work of others over a longer period of time.…”
Section: T2f-nnsmentioning
confidence: 99%
“…Each order has a final delivery date constraint (the same distributor may have different delivery dates for the two products A and B). Contact with process providers to obtain process-related data such as total production time and total production cost for each order at each process provider [38,39]. The time required for each process workshop of the core manufacturer to complete each process with the co-manufacturer is shown in Tab.…”
Section: Instance Datamentioning
confidence: 99%
“…For mobile robot path planning, the convergence of ACO is more sensitive to the initial parameter settings [20]. In response to the shortcomings, Shan [14]and Ou [11] et al improved the global search capability by combining the pheromone update with a differential evolutionary algorithm and improved selection of ant colony nodes, respectively.…”
Section: Introductionmentioning
confidence: 99%
“…In response to the shortcomings, Shan [14]and Ou [11] et al improved the global search capability by combining the pheromone update with a differential evolutionary algorithm and improved selection of ant colony nodes, respectively. Zhang [20] et al accelerated the convergence of ACO by updating the path pheromone of the optimal ant in each generation, which makes the ant colony easier to approach the optimal solution in a complex environment. Ali [1] et al proposed a twostage ant colony algorithm for the problem that the algorithm is prone to fall into locally optimum solutions.…”
Section: Introductionmentioning
confidence: 99%