.png){kind=icon}
.png){kind=icon}
Return
Dynamic impact for ant colony optimization algorithm
.png){kind=icon}
OA
AI
DOI：10.1016/j.swevo.2021.100993.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This paper proposes an extension method for Ant Colony Optimization (ACO) algorithm called Dynamic Impact. Dynamic Impact is designed to improve convergence and solution quality solving challenging optimization problems that have a non-linear relationship between resource consumption and fitness. This proposed method is tested against the real-world Microchip Manufacturing Plant Production Floor Optimization (MMPPFO) problem and the theoretical benchmark Multidimensional Knapsack problem (MKP). Using Dynamic Impact on single-objective optimization the fitness value is improved by 33.2% over the ACO algorithm without Dynamic Impact. Furthermore, MKP benchmark instances of low complexity have been solved to a 100% success rate even when a high degree of solution sparseness is observed. Large complexity instances have shown the average gap improved by 4.26 times.
Keywords:
Ant colony optimization
Dynamic impact
Sub-heuristics
Scheduling
Multidimensional knapsack problem
Sparse data
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
8.5
Papers:
2.1K
Citations:
1.0W