A new ant colony optimization algorithm for the multidimensional Knapsack problem
From MaRDI portal
Publication:2471237
Recommendations
- An ant colony optimization approach for the multidimensional knapsack problem
- A dynamic optimisation approach for ant colony optimisation using the multidimensional knapsack problem
- Hybrid optimization algorithm of ant colony optimization and Lagrangian relaxation for solving multidimensional knapsack problem
- Numerical Analysis and Its Applications
- A hybrid of nested partition, binary ant system, and linear programming for the multidimensional knapsack problem
- scientific article; zbMATH DE number 5733644
- Probabilistic Model of Ant Colony Optimization for Multiple Knapsack Problem
Cites work
- scientific article; zbMATH DE number 44282 (Why is no real title available?)
- scientific article; zbMATH DE number 1480194 (Why is no real title available?)
- A genetic algorithm for the multidimensional knapsack problem
- A heuristic solution procedure for the multiconstraint zero-one knapsack problem
- Ant colonies for the quadratic assignment problem
- Ant colony optimization.
Cited in
(24)- scientific article; zbMATH DE number 1969657 (Why is no real title available?)
- A randomized heuristic repair for the multidimensional knapsack problem
- Probabilistic Model of Ant Colony Optimization for Multiple Knapsack Problem
- A hybrid of nested partition, binary ant system, and linear programming for the multidimensional knapsack problem
- scientific article; zbMATH DE number 5811885 (Why is no real title available?)
- Solving 0-1 knapsack problems based on amoeboid organism algorithm
- Intelligent water drops algorithm
- Artificial bee colony algorithm merged with pheromone communication mechanism for the 0-1 multidimensional knapsack problem
- Hybrid optimization algorithm of ant colony optimization and Lagrangian relaxation for solving multidimensional knapsack problem
- Solving large-scale multidimensional knapsack problems with a new binary harmony search algorithm
- A dynamic optimisation approach for ant colony optimisation using the multidimensional knapsack problem
- Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems
- A theoretical and empirical investigation on the Lagrangian capacities of the \(0\)-\(1\) multidimensional knapsack problem
- An ant colony optimization approach for the multidimensional knapsack problem
- Numerical Analysis and Its Applications
- A binary differential search algorithm for the 0-1 multidimensional knapsack problem
- Solving large 0-1 multidimensional knapsack problems by a new simplified binary artificial fish swarm algorithm
- A new discrete electromagnetism-based meta-heuristic for solving the multidimensional knapsack problem using genetic operators
- scientific article; zbMATH DE number 5733644 (Why is no real title available?)
- Binary accelerated particle swarm algorithm (BAPSA) for discrete optimization problems
- An artificial bee colony algorithm for the 0-1 multidimensional Knapsack problem
- A Modified Binary Particle Swarm Optimization for Knapsack Problems
- An ant colony optimization approach for binary knapsack problem under fuzziness
- An improved binary wolf pack algorithm for solving multidimensional knapsack problems
This page was built for publication: A new ant colony optimization algorithm for the multidimensional Knapsack problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2471237)
