Artificial bee colony algorithm merged with pheromone communication mechanism for the 0-1 multidimensional knapsack problem

DOI10.1155/2013/676275zbMath1299.90245OpenAlexW2134956171WikidataQ59031488 ScholiaQ59031488MaRDI QIDQ474490

Baocai Yin, Hongkai Wei, Junzhong Ji, Chun-Nian Liu

Publication date: 24 November 2014

Published in: Mathematical Problems in Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2013/676275

Mathematics Subject Classification ID

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

Uses Software

• ABC

Cites Work

• Two heuristics for the one-dimensional bin-packing problem
• A genetic algorithm for the multidimensional knapsack problem
• The multidimensional 0-1 knapsack problem: an overview.
• A modified artificial bee colony algorithm
• A comparative study of artificial bee colony algorithm
• A powerful and efficient algorithm for numerical function optimization: artificial bee colony (ABC) algorithm
• A new ant colony optimization algorithm for the multidimensional Knapsack problem
• An Artificial Bee Colony Algorithm for the 0–1 Multidimensional Knapsack Problem
• An Approximate Dynamic Programming Approach to Multidimensional Knapsack Problems
• A Branch and Bound Method for the Multiconstraint Zero-One Knapsack Problem
• An Enumeration Algorithm for Knapsack Problems

This page was built for publication: Artificial bee colony algorithm merged with pheromone communication mechanism for the 0-1 multidimensional knapsack problem