An Artificial Bee Colony Algorithm for the 0–1 Multidimensional Knapsack Problem

DOI10.1007/978-3-642-14834-7_14zbMath1206.90096OpenAlexW1504826621MaRDI QIDQ3058830

André Rossi, Alok Singh, Shyam Sundar

Publication date: 7 December 2010

Published in: Communications in Computer and Information Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-14834-7_14

zbMATH Keywords

combinatorial optimizationheuristicswarm intelligenceartificial bee colony algorithmmultidimensional Knapsack problem

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Boolean programming (90C09)

Related Items (4)

A RNN-based hyper-heuristic for combinatorial problems ⋮ Improved artificial bee colony algorithm for global optimization ⋮ Artificial bee colony algorithm merged with pheromone communication mechanism for the 0-1 multidimensional knapsack problem ⋮ A binary differential search algorithm for the 0-1 multidimensional knapsack problem

This page was built for publication: An Artificial Bee Colony Algorithm for the 0–1 Multidimensional Knapsack Problem