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

2015 ◽  
Vol 63 ◽  
pp. 7-22 ◽  
Author(s):  
Xiangyong Kong ◽  
Liqun Gao ◽  
Haibin Ouyang ◽  
Steven Li
2015 ◽  
Vol 42 (12) ◽  
pp. 5337-5355 ◽  
Author(s):  
Xiangyong Kong ◽  
Liqun Gao ◽  
Haibin Ouyang ◽  
Steven Li

2013 ◽  
Vol 365-366 ◽  
pp. 182-185
Author(s):  
Hong Gang Xia ◽  
Qing Liang Wang

In this paper, a modified harmony search (MHS) algorithm was presented for solving 0-1 knapsack problems. MHS employs position update strategy for generating new solution vectors that enhances accuracy and convergence rate of harmony search (HS) algorithm. Besides, the harmony memory consideration rate (HMCR) is dynamically adapted to the changing of objective function value in the current harmony memory, and the key parameters PAR and BW dynamically adjusted with the number of generation. Based on the experiment of solving ten classic 0-1 knapsack problems, the MHS has demonstrated stronger convergence and stability than original harmony search (HS) algorithm and its two improved algorithms (IHS and NGHS).


2011 ◽  
Vol 26 (3) ◽  
pp. 1080-1088 ◽  
Author(s):  
Rayapudi Srinivasa Rao ◽  
Sadhu Venkata Lakshmi Narasimham ◽  
Manyala Ramalinga Raju ◽  
A. Srinivasa Rao

2014 ◽  
Vol 2014 ◽  
pp. 1-19 ◽  
Author(s):  
Shouheng Tuo ◽  
Longquan Yong ◽  
Fang’an Deng

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 strategies (harmony memory consideration, teaching-learning strategy, local pitch adjusting, and random mutation) are employed to improve the performance of HS algorithm. Another improvement in HSTL method is that the dynamic strategies are adopted to change the parameters, which maintains the proper balance effectively between global exploration power and local exploitation power. Finally, simulation experiments with 13 knapsack problems show that the HSTL algorithm can be an efficient alternative for solving 0-1 knapsack problems.


Author(s):  
Khai Phuc Nguyen ◽  
Goro Fujita ◽  
Vo Ngoc Dieu

Abstract This paper presents an application of Cuckoo search algorithm to determine optimal location and sizing of Static VAR Compensator. Cuckoo search algorithm is a modern heuristic technique basing Cuckoo species’ parasitic strategy. The Lévy flight has been employed to generate random Cuckoo eggs. Moreover, the objective function is a multiobjective problem, which minimizes loss power, voltage deviation and investment cost of Static VAR Compensator while satisfying other operating constraints in power system. Cuckoo search algorithm is evaluated on three case studies and compared with the Teaching-learning-based optimization, Particle Swarm optimization and Improved Harmony search algorithm. The results show that Cuckoo search algorithm is better than other optimization techniques and its performance is also better.


Floorplanning plays an important role within the physical design method of very large Scale Integrated (VLSI) chips. It’s a necessary design step to estimate the chip area before the optimized placement of digital blocks and their interconnections. Since VLSI floorplanning is an NP-hard problem, several improvement techniques were adopted to find optimal solution. In this paper, a hybrid algorithm which is genetic algorithm combined with music-inspired Harmony Search (HS) algorithm is employed for the fixed die outline constrained floorplanning, with the ultimate aim of reducing the full chip area. Initially, B*-tree is employed to come up with the first floorplan for the given rectangular hard modules and so Harmony Search algorithm is applied in any stages in genetic algorithm to get an optimum solution for the economical floorplan. The experimental results of the HGA algorithm are obtained for the MCNC benchmark circuits


2011 ◽  
Vol 26 (3) ◽  
pp. 1080-1088 ◽  
Author(s):  
Rayapudi Srinivasa Rao ◽  
Sadhu Venkata Lakshmi Narasimham ◽  
Manyala Ramalinga Raju ◽  
A. Srinivasa Rao

Sign in / Sign up

Export Citation Format

Share Document