Solving large-scale multidimensional knapsack problems with a new binary harmony search algorithm

DOI10.1016/j.cor.2015.04.018zbMath1349.90714OpenAlexW2029630854MaRDI QIDQ342027

Steven Li, Li-qun Gao, Hai-bin Ou Yang, Xiang-yong Kong

Publication date: 17 November 2016

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2015.04.018

zbMATH Keywords

probability distributionharmony searchingenious pitch adjustment schememultidimensional knapsack problemsrepair operator

Mathematics Subject Classification ID

Large-scale problems in mathematical programming (90C06) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items (4)

Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems ⋮ A two-phase tabu-evolutionary algorithm for the 0-1 multidimensional knapsack problem ⋮ Construct, Merge, Solve and Adapt Versus Large Neighborhood Search for Solving the Multi-dimensional Knapsack Problem: Which One Works Better When? ⋮ A comparative analysis of two matheuristics by means of merged local optima networks

Cites Work

• An improved harmony search algorithm for solving optimization problems
• A theoretical and empirical investigation on the Lagrangian capacities of the \(0\)-\(1\) multidimensional knapsack problem
• Novel derivative of harmony search algorithm for discrete design variables
• Chaotic harmony search algorithms
• Heuristics for the 0-1 multidimensional knapsack problem
• A genetic algorithm for the multidimensional knapsack problem
• An efficient tabu search approach for the 0-1 multidimensional knapsack problem
• Solving the multidimensional knapsack problems with generalized upper bound constraints by the adaptive memory projection method
• Problem reduction heuristic for the \(0\)-\(1\) multidimensional knapsack problem
• A hybrid simulated annealing metaheuristic algorithm for the two-dimensional knapsack packing problem
• A memetic Lagrangian heuristic for the 0-1 multidimensional knapsack problem
• Reduced costs propagation in an efficient implicit enumeration for the 01 multidimensional knapsack problem
• A hybrid quantum inspired harmony search algorithm for 0-1 optimization problems
• A new ant colony optimization algorithm for the multidimensional Knapsack problem
• Greedy algorithm for the general multidimensional knapsack problem
• Global-best harmony search
• An Approximate Dynamic Programming Approach to Multidimensional Knapsack Problems
• A heuristic solution procedure for the multiconstraint zero-one knapsack problem
• Heuristic 0-1 Linear Programming: An Experimental Comparison of Three Methods

This page was built for publication: Solving large-scale multidimensional knapsack problems with a new binary harmony search algorithm