Does anybody has a java implementation of the metaheuristic algorithm Harmony Search for the classical Knapsack Problem?
I have some doubts with upper and lower bound to generate the new harmony vector: If decision variables for every harmony vector are 0|1 then high & low are based only on the single value 0-1?? Finally, HCMR, pitch adjustment and so on, is to obtain a just a 0-1 value? These is all regarded only to KP. Thanx in advance.
refer prof.zong woo geem papers who is the inventor of HS algorithm
There are many published articles on using harmony search for optimization Of Knapsack Problem:
Zou, D., Gao, L., Li, S., & Wu, J. (2011). Solving 0–1 knapsack problem by a novel global harmony search algorithm. Applied Soft Computing, 11(2), 1556-1564.
Greblicki, J., & Kotowski, J. (2009). Analysis of the properties of the Harmony Search Algorithm carried out on the one dimensional binary knapsack problem. In Computer Aided Systems Theory-EUROCAST 2009 (pp. 697-704). Springer Berlin Heidelberg.
Bányai, T., & Veres, P. (2013). Optimisation Of Knapsack Problem With Matlab, Based On Harmony Search Algorithm. Advanced Logistic systems, 7(1), 13-20.
I agree with above references specially
Bányai, T., & Veres, P. (2013). Optimisation Of Knapsack Problem With Matlab, Based On Harmony Search Algorithm. Advanced Logistic systems, 7(1), 13-20.
Thanx Behrouz Ahmadi-Nedushan for the references, but my problem exactly is about the use of the parameter BW. This equation: Xj new = Xj new ± bw × rand; return a real number, but every Xj it's just a 0|1 value. What should I do? Replace it with the nearest value?
I also saw and implement the Discrete Binary Harmony Search as one of the paper recommend, but I insist in the use of the original HS algorithm.
I'm working in Java and also in Haskell, haven't try Matlab.
Thanx in advance for the answers.
You may find the following article useful:
Xiang, W. L., An, M. Q., Li, Y. Z., He, R. C., & Zhang, J. F. (2014). A novel discrete global-best harmony search algorithm for solving 0-1 knapsack problems. Discrete Dynamics in Nature and Society, 2014.
In particular, look at the page 4 where they have used a genetic mutation to deal with binary variable( lines 9 to 11 of the pseudo-code for Algorithm 3, the procedure of improvising a new harmony of DGHS)
If you work with harmony search, you should maybe know about the fact that harmony search is in fact a special case of evolution strategies and that some results reported by the "inventor" of harmony search, Z.W. Geem, seem extremely unlikely: http://www.dennisweyland.net/blog/?p=12
I would like to recommend you the following article: I may be helpful to you..
Mahamad Nabab Alam, Biswarup Das, Vinay Pant, A comparative study of metaheuristic optimization approaches for directional overcurrent relays coordination, Electric Power Systems Research, Volume 128, November 2015, Pages 39-52, ISSN 0378-7796, http://dx.doi.org/10.1016/j.epsr.2015.06.018.
(http://www.sciencedirect.com/science/article/pii/S0378779615001947)
Thanx everyone. I just implemented with nice results, regards it was in a discrete problem (VCSBPP) y it has 3 random generations...Thing is not to use the BW parameter since I didn´t has a solution to adjust.
- Badges
- Science topic
- Similar topics
- Linguistics
- Composition Studies
- Publication