Binary differential evolution algorithm with greedy packaging to solve high-dimensional knapsack problem

DOI10.13195/J.KZYJC.2015.0491MaRDI QIDQ3180105zbMATH OpenFDO

Authors Shuqu Qian, Yongqiang Ye, Huihong Wu

Publication date 6 January 2017

Full work available at URL https://doi.org/10.13195/J.KZYJC.2015.0491

zbMATH Keywords

binary differential evolution algorithmconstraint handlinggreedy packagingknapsack problem

Mathematics Subject Classification ID

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

Recommendations

• Novel binary differential evolution algorithm for knapsack problems
• Dichotomous binary differential evolution for knapsack problems
• An improved binary wolf pack algorithm for solving multidimensional knapsack problems
• A binary differential search algorithm for the 0-1 multidimensional knapsack problem
• A Modified Binary Particle Swarm Optimization for Knapsack Problems

Cited in

(3)

• Dichotomous binary differential evolution for knapsack problems
• Novel binary differential evolution algorithm for knapsack problems
• An improved binary wolf pack algorithm for solving multidimensional knapsack problems

This page was built for publication: Binary differential evolution algorithm with greedy packaging to solve high-dimensional knapsack problem

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