A new ant colony optimization algorithm for the multidimensional Knapsack problem
From MaRDI portal
Publication:2471237
DOI10.1016/j.cor.2006.12.029zbMath1169.90435OpenAlexW1982976253MaRDI QIDQ2471237
Min Kong, Peng Tian, Yucheng Kao
Publication date: 22 February 2008
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2006.12.029
Related Items (13)
A randomized heuristic repair for the multidimensional knapsack problem ⋮ Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems ⋮ Solving large-scale multidimensional knapsack problems with a new binary harmony search algorithm ⋮ Binary accelerated particle swarm algorithm (BAPSA) for discrete optimization problems ⋮ A Modified Binary Particle Swarm Optimization for Knapsack Problems ⋮ 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 ⋮ An ant colony optimization approach for binary knapsack problem under fuzziness ⋮ A theoretical and empirical investigation on the Lagrangian capacities of the \(0\)-\(1\) multidimensional knapsack problem ⋮ Artificial bee colony algorithm merged with pheromone communication mechanism for the 0-1 multidimensional knapsack problem ⋮ Solving 0-1 knapsack problems based on amoeboid organism algorithm ⋮ A binary differential search algorithm for the 0-1 multidimensional knapsack problem ⋮ A hybrid of nested partition, binary ant system, and linear programming for the multidimensional knapsack problem
Uses Software
Cites Work
This page was built for publication: A new ant colony optimization algorithm for the multidimensional Knapsack problem
