A Novel Harmony Search Algorithm Based on Teaching-Learning Strategies for 0-1 Knapsack Problems
نویسندگان
چکیده
منابع مشابه
A Novel Harmony Search Algorithm Based on Teaching-Learning Strategies for 0-1 Knapsack Problems
To enhance the performance of harmony search (HS) algorithm on solving the discrete optimization problems, this paper proposes a novel harmony search algorithm based on teaching-learning (HSTL) strategies to solve 0-1 knapsack problems. In the HSTL algorithm, firstly, a method is presented to adjust dimension dynamically for selected harmony vector in optimization procedure. In addition, four s...
متن کاملA Novel Hybrid Cuckoo Search Algorithm with Global Harmony Search for 0-1 Knapsack Problems
Cuckoo search (CS) is a novel biologically inspired algorithm and has been widely applied to many fields. Although some binary-coded CS variants are developed to solve 0-1 knapsack problems, the search accuracy and the convergence speed are still needed to further improve. According to the analysis of the shortcomings of the standard CS and the advantage of the global harmony search (GHS), a no...
متن کاملA simplified binary harmony search algorithm for large scale 0-1 knapsack problems
As an important subset of combinatorial optimization, 0–1 knapsack problems, especially the highdimensional ones, are often difficult to solve. This study aims to provide a new simplified binary harmony search (SBHS) algorithm to tackle such NP-hard problems arising in diverse research fields. The key difference between SBHS and other HS methods is in the process of improvisation. The differenc...
متن کاملSolving 0-1 knapsack problem by a novel global harmony search algorithm
This paper proposes a novel global harmony search algorithm (NGHS) to solve 0–1 knapsack problems. Theproposed algorithm includes two important operations: positionupdating andgeneticmutationwith a small probability. The former enables the worst harmony of harmony memory to move to the global best harmony rapidly in each iteration, and the latter can effectively prevent theNGHS from trapping in...
متن کاملSolving 0-1 knapsack problems based on amoeboid organism algorithm
The 0-1 knapsack problem is an open issue in discrete optimization problems, which plays an important role in real applications. In this paper, a new bio-inspired model is proposed to solve this problem. The proposed method has three main steps. First, the 0-1 knapsack problem is converted into a directed graph by the network converting algorithm. Then, for the purpose of using the amoeboid org...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Scientific World Journal
سال: 2014
ISSN: 2356-6140,1537-744X
DOI: 10.1155/2014/637412