%%
%?INPUT?VARIABLES
%?Bird_in_swarm=Number?of?particle=agents=candidate
%?Number_of_quality_in_Bird=Number?of?Variable
%
%?MinMaxRange:?jx2?matrix;?jth?row?contains?minimum?and?maximum?values?of?the?jth?variable
%?say?you?have?a?variable?N1?
%?which?can?have?maximum?value?M1?and?minimum?value?m1
%?then?your?matrix?will?be?[m1?M1]?
%?for?more:
%?[m1?M1;?m2?M2;?mj?Mj]
%
%?Food_availability=objective?function?with?one?input?variable?（for?more?than?one?variable?you?may?use?array）
%?example?for?two?variable
%?function?f?=?funfunc（array）
%?????a=array（1）;
%?????b=array（2）;
%?????f?=?a+b?;
%?end
%?Food_availability?is?a?string?for?above?example?:?‘funfunc‘
%
%?availability_type?is?string?‘min‘?or?‘max‘?to?check?depending?upon?need?to?minimize?or?maximize?the?Food_availability
%?velocity_clamping_factor?（normally?2）
%?cognitive_constant=c1=individual?learning?rate?（normally?2）
%?social_constant=c2=social?parameter?（normally?2）
%?normally?C1+C2>=4
%
%?Inertia_weight=At?the?beginning?of?the?search?procedure?diversification?is?heavily?weighted?while?intensification?is?heavily?weighted?at?the?end?of?the?search?procedure.
%?Min_Inertia_weight=min?of?inertia?weight?（normally?0.4）
%?Max_Inertia_weight=max?of?inertia?weight?（normally?0.9）
%?max_iteration=how?many?times?readjust?the?position?of?the?flock/swarm?of?birds?its?quest?for?food
%?
%
%?OUTPUT?VARIABLE
%?optimised_parameters?:?Optimal?parameters
%%
function?[?optimised_parameters?]?=?Particle_Swarm_Optimization?（Bird_in_swarm?Number_of_quality_in_Bird?MinMaxRange?Food_availability?availability_type?velocity_clamping_factor?cognitive_constant?social_constant?Min_Inertia_weight?Max_Inertia_weight?max_iteration）
%{
????Checking?all?functions?are?present
%}
if?（exist?（‘MinMaxCheck.m‘）==0）
????clc;
????fprintf?（‘Please?download?the?following?submission?from:?MATLAB?File?Exchange?（Click?here?to?open?link）?\ndownload?code?by?clicking?“Download?Submission“?button?\nthen?extract?and?put?MinMaxCheck.m?in?current?directory?and?try?again\n‘）;
????return;
end
%{
????Checking?all?parameteres?are?entered
%}
if?nargin?????error（‘Missing?input?parameter（s）!‘）
end

%{
	universalize?availability?type??
%}
availability_type=lower（availability_type（1:3））;

%{
	?Checking?for?proper?boundary?Values?and?entered?Matrix
%}
[rowcol]=size（MinMaxRange）;
if?row~=Number_of_quality_in_Bird?||?col~=2
????error（‘Not?a?proper?MinMaxRange?Matrix‘）
end
for?i=1:Number_of_quality_in_Bird
????if?MinMaxRange（i1）>=MinMaxRange（i2）
????????error（‘Minimum?value?greater?than?Maximum?value!!!‘）
????end
end

%{
	?counter?to?display?%?of?completion
%}
N=Bird_in_swarm*max_iteration;
q=0;

%{
	?distinguishing?min?and?max?range
%}
bird_min_range=MinMaxRange（:1）;
bird_max_range=MinMaxRange（:2）;

%{
	?
%}
format?long;
for?i=1:Number_of_quality_in_Bird
??

?屬性????????????大小?????日期????時間???名稱
-----------?---------??----------?-----??----
?????文件????????5308??2016-06-15?00:49??Particle_Swarm_Optimization.m
?????文件????????1313??2016-06-15?00:49??license.txt