A learned harmony search algorithm and its application to 0-1 knapsack problems

MaRDI QIDQ2859967zbMATH OpenFDO

Authors Ruoping Li, Haibin Ouyang, Liqun Gao, Dexuan Zou

Publication date 19 November 2013

Published in Control and Decision (Search for Journal in Brave)

zbMATH Keywords

harmony search algorithmadaptivelearning strategy0-1 knapsack problemsearch speed

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 modified harmony search algorithm for 0-1 knapsack problems
• LAHS: a novel harmony search algorithm based on learning automata
• Solving the multi-objective 0-1 programming problem by a harmony search algorithm
• Harmony search algorithm with dynamic control parameters
• Solving large-scale multidimensional knapsack problems with a new binary harmony search algorithm

Cited in

(5)

• LAHS: a novel harmony search algorithm based on learning automata
• A binary modified harmony search algorithm for 0-1 knapsack problems
• Solving the multi-objective 0-1 programming problem by a harmony search algorithm
• Solving large-scale 0-1 knapsack problem by the social-spider optimisation algorithm
• A new approach to weapon-target assignment in cooperative air combat

This page was built for publication: A learned harmony search algorithm and its application to 0-1 knapsack problems

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