An ant colony optimization approach for the multidimensional knapsack problem

DOI10.1007/s10732-008-9087-xzbMath1184.90141OpenAlexW1988739252MaRDI QIDQ2267820

Liangjun Ke, Xiaoliang Wei, Zu-Ren Feng, Zhi-Gang Ren

Publication date: 2 March 2010

Published in: Journal of Heuristics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10732-008-9087-x

zbMATH Keywords

metaheuristic

Mathematics Subject Classification ID

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

Related Items (6)

Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic 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 ⋮ Particle swarm optimization with time-varying acceleration coefficients for the multidimensional knapsack problem ⋮ Memory and Learning in Metaheuristics ⋮ A novel ant colony optimization algorithm for the shortest-path problem in traffic networks

Uses Software

• Paramils

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A genetic algorithm for the multidimensional knapsack problem
• An efficient preprocessing procedure for the multidimensional 0-1 knapsack problem
• An efficient tabu search approach for the 0-1 multidimensional knapsack problem
• New metaheuristic approaches for the edge-weighted \(k\)-cardinality tree problem
• Local search with memory: Benchmarking RTS
• How to assess and report the performance of a stochastic algorithm on a benchmark problem: \textit{mean} or \textit{best} result on a number of runs?
• A study of ACO capabilities for solving the maximum clique problem
• Ant colony optimization theory: a survey
• Fine-Tuning of Algorithms Using Fractional Experimental Designs and Local Search
• A Branch and Bound Method for the Multiconstraint Zero-One Knapsack Problem
• The Ant Colony Optimization Metaheuristic: Algorithms, Applications, and Advances
• Une approche hybride pour le sac à dos multidimensionnel en variables 0–1
• Ant colony optimization and local search for bin packing and cutting stock problems
• The Theory and Computation of Knapsack Functions

This page was built for publication: An ant colony optimization approach for the multidimensional knapsack problem