A new ant colony optimization algorithm for the multidimensional Knapsack problem

DOI10.1016/J.COR.2006.12.029zbMATH Open1169.90435OpenAlexW1982976253MaRDI QIDQ2471237FDOQ2471237

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

zbMATH Keywords

ant colony optimizationcombinatorial optimizationbinary ant systemmultidimensional Knapsack problem

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Cites Work

• Ant colonies for the quadratic assignment problem
• A genetic algorithm for the multidimensional knapsack problem
• A heuristic solution procedure for the multiconstraint zero-one knapsack problem
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (16)

• A randomized heuristic repair for the multidimensional knapsack problem
• A hybrid of nested partition, binary ant system, and linear programming for the multidimensional knapsack problem
• Title not available (Why is that?)
• Solving 0-1 knapsack problems based on amoeboid organism algorithm
• Artificial bee colony algorithm merged with pheromone communication mechanism for the 0-1 multidimensional knapsack problem
• Solving large-scale multidimensional knapsack problems with a new binary harmony search algorithm
• 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
• 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
• Title not available (Why is that?)
• Binary accelerated particle swarm algorithm (BAPSA) for discrete optimization problems
• A Modified Binary Particle Swarm Optimization for Knapsack Problems
• An ant colony optimization approach for binary knapsack problem under fuzziness

Uses Software

• OR-Library
• MACS-VRPTW
• ACOTSP
• HAS-QAP

Recommendations

• Numerical Analysis and Its Applications 👍 👎
• An ant colony optimization approach for the multidimensional knapsack problem 👍 👎
• Chapter 16 A Dynamic Optimisation Approach for Ant Colony Optimisation Using the Multidimensional Knapsack Problem 👍 👎
• A hybrid of nested partition, binary ant system, and linear programming for the multidimensional knapsack problem 👍 👎
• Probabilistic Model of Ant Colony Optimization for Multiple Knapsack Problem 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎

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)