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

DOI10.1016/J.COR.2015.04.018MaRDI QIDQ342027zbMATH OpenOpenAlexFDO

Authors Steven Li, Liqun Gao, Haibin Ouyang, Xiangyong 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)

Recommendations

• A binary modified harmony search algorithm for 0-1 knapsack problems
• Solving large 0-1 multidimensional knapsack problems by a new simplified binary artificial fish swarm algorithm
• An improved binary wolf pack algorithm for solving multidimensional knapsack problems
• A binary differential search algorithm for the 0-1 multidimensional knapsack problem
• Very large-scale neighborhood search for the \(K\)-constraint multiple knapsack problem
• A Branch-and-Bound Algorithm to Solve Large Scale Integer Quadratic Multi-Knapsack Problems

Cites work

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

Cited in

(8)

• A binary modified harmony search algorithm for 0-1 knapsack problems
• Solving large-scale 0-1 knapsack problem by the social-spider optimisation algorithm
• A learned harmony search algorithm and its application to 0-1 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
• Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems
• A binary differential search algorithm for the 0-1 multidimensional knapsack problem

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

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