Ant colony optimization for multiple knapsack problem and model bias
From MaRDI portal
Recommendations
- Probabilistic Model of Ant Colony Optimization for Multiple Knapsack Problem
- ACO algorithm for MKP using various heuristic information
- Solution bias in ant colony optimisation: Lessons for selecting pheromone models
- Sensitivity analysis of ACO start strategies for subset problems
- A new ant colony optimization algorithm for the multidimensional Knapsack problem
Cited in
(12)- Boosting ant colony optimization via solution prediction and machine learning
- An ant colony optimization approach for the multidimensional knapsack problem
- A new ant colony optimization algorithm for the multidimensional Knapsack problem
- Solution bias in ant colony optimisation: Lessons for selecting pheromone models
- scientific article; zbMATH DE number 5811885 (Why is no real title available?)
- Sensitivity analysis of ACO start strategies for subset problems
- Countering the negative search bias of ant colony optimization in subset selection problems
- Probabilistic Model of Ant Colony Optimization for Multiple Knapsack Problem
- Binary accelerated particle swarm algorithm (BAPSA) for discrete optimization problems
- ACO algorithm for MKP using various heuristic information
- Essential particle swarm optimization queen with tabu search for MKP resolution
- An ant colony optimization approach for binary knapsack problem under fuzziness
This page was built for publication: Ant colony optimization for multiple knapsack problem and model bias
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5710585)