% Harmony Search Algorithm %By Sajjad Yazdani % % Base on: % [1]: clc;clear all;close all %% Problem Prametters Dim=2; % problem Dimention Low=[-10 -10]; % Low Boundry of Problem High=[10 10]; % High Boundry of Problem Min=1; % Minimaization or maximaiz of Fun? if Min=1 it will be minimaze the func tion and if Min=0 it will be maximized the function. %% Harmony Search Parametters HMS=100;%Harmony Memory Size (Population Number) bw=0.2; HMCR=0.95;%[1], Harmony Memory Considering Rate PAR=0.3;%[1], Pitch Adjustment Rate MaxItr=10000;% Maximum number of Iteration %% Initialization HM=zeros(HMS,Dim); HF=zeros(HMS,1); for i=1:HMS HM(i,:)=Low+(High-Low).*rand(1,Dim); HF(i,1)=MyFun(HM(i,:)); end if Min==1 [WorstFit,WorstLoc]=max(HF); else [WorstFit,WorstLoc]=min(HF); end %% Iteration Loop for Itr=1:MaxItr HarmonyIndex=fix(rand(1,Dim)*HMS)+1;% Random Selection of Harmony Harmony=diag(HM(HarmonyIndex,1:Dim))';% Extraxt Value of harmony from Memory (Can Be better???) CMMask=rand(1,Dim)