An improved binary wolf pack algorithm for solving multidimensional knapsack problems

MaRDI QIDQ3462734zbMATH OpenFDO

Authors Husheng Wu, Fengming Zhang, Renjun Zhan, Hao Li, Xiaolong Liang

Publication date 15 January 2016

zbMATH Keywords

combinatorial optimizationswarm intelligenceevolutionary computationmultidimensional knapsack problembinary wolf pack algorithm

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Recommendations

• A binary wolf pack algorithm for solving 0-1 knapsack problems
• A Modified Binary Particle Swarm Optimization for Knapsack Problems
• Quantum-inspired wolf pack algorithm to solve the 0-1 knapsack problem
• Binary differential evolution algorithm with greedy packaging to solve high-dimensional knapsack problem
• A new ant colony optimization algorithm for the multidimensional Knapsack problem

Cited in

(7)

• A binary wolf pack algorithm for solving 0-1 knapsack problems
• A new swarm intelligence algorithm -- wolf pack algorithm
• A small world algorithm for multi-dimensional knapsack problems
• Binary differential evolution algorithm with greedy packaging to solve high-dimensional knapsack problem
• Intelligent water drops algorithm
• Solving large-scale multidimensional knapsack problems with a new binary harmony search algorithm
• Ring theory-based improved monkey algorithm for bounded knapsack problem

This page was built for publication: An improved binary wolf pack algorithm for solving multidimensional knapsack problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3462734)