2019
DOI: 10.1007/978-3-030-11890-7_27
|View full text |Cite
|
Sign up to set email alerts
|

Self-configuring Intelligent Water Drops Algorithm for Software Project Scheduling Problem

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
3
0
1

Year Published

2020
2020
2023
2023

Publication Types

Select...
4

Relationship

1
3

Authors

Journals

citations
Cited by 4 publications
(4 citation statements)
references
References 15 publications
0
3
0
1
Order By: Relevance
“…Table 6 shows that the GWO is better than MMAS-HC, ACO, and IWD. To assess the GWO algorithm quality, we compared its results with the results obtained in [13], the GWO algorithm exceeded the results of IWDSTD and IWDAS as shown in Table 7. At last, we compared our results with the results of firefly algorithm in [16], Table 8 shows that GWO exceeded FA for all instances except one.…”
Section: Comparison With Other Methodsmentioning
confidence: 99%
See 1 more Smart Citation
“…Table 6 shows that the GWO is better than MMAS-HC, ACO, and IWD. To assess the GWO algorithm quality, we compared its results with the results obtained in [13], the GWO algorithm exceeded the results of IWDSTD and IWDAS as shown in Table 7. At last, we compared our results with the results of firefly algorithm in [16], Table 8 shows that GWO exceeded FA for all instances except one.…”
Section: Comparison With Other Methodsmentioning
confidence: 99%
“…When the datasets have a few tasks the WOA gave good results but it failed to find feasible solutions when increasing task's number. Crawford et al [13] presented the self-configuring of the velocity parameter of IWD metaheuristic that effects the algorithm behaviour by having a direct relationship between removed soil and velocity. The proposed methodology was used in solving the SPSP and the outcomes of standard version (IWDSTD) and configuring version (IWDAS) were very similar.…”
mentioning
confidence: 99%
“…Optimization problems can be classified depending on the domain of the decision variables in discrete and continuous problems. In recent years, discrete optimization problems have become more and more frequent in the industry with problems as Set Covering Problem (SCP) [11,12], Knapsack Problem [13], Software Project Scheduling Problem [14,15] and Feature Selection [16]. The No-Free-Lunch Theorem (NFLT) [17] tells us that there is no universal optimization algorithm for all existing optimization problems.…”
Section: Introductionmentioning
confidence: 99%
“…Алгоритм інтелектуальних крапель води. Одним із нещодавно запропонованих алгоритмів у сфері ройового інтелекту є алгоритм інтелектуальних крапель води [43,44]. Алгоритм базується на динаміці річкових систем, діях та реакціях, які відбуваються серед крапель води в річках.…”
unclassified