0% found this document useful (0 votes)
22 views2 pages

Chimp Optimization Algorithm Code

This document contains source code for the Chimp Optimization Algorithm (ChOA) version 1.0. It includes functions for plotting benchmark functions, including ranges and dimensions. The code references two papers that provide more information on ChOA and the Grey Wolf Optimizer from which some functions and code were adapted.

Uploaded by

DHEENATHAYALAN K
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as TXT, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
22 views2 pages

Chimp Optimization Algorithm Code

This document contains source code for the Chimp Optimization Algorithm (ChOA) version 1.0. It includes functions for plotting benchmark functions, including ranges and dimensions. The code references two papers that provide more information on ChOA and the Grey Wolf Optimizer from which some functions and code were adapted.

Uploaded by

DHEENATHAYALAN K
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as TXT, PDF, TXT or read online on Scribd

%% % Chimp Optimization Algorithm (ChOA) source codes version 1.

0
% By: M. Khishe, M. R. Musavi
% m_khishe@[Link]
%For more information please refer to the following papers:
% M. Khishe, M. R. Mosavi, �Chimp Optimization Algorithm,� Expert Systems
% With Applications, 2020.
%[Link]

% Please note that some files and functions are taken from the GWO algorithm
% such as: Get_Functions_details, PSO, initialization.
% For more information please refer to the following papers:
% Mirjalili, S., Mirjalili, S. M., & Lewis, A. (2014). Grey Wolf Optimizer.
Advances in engineering software, 69, 46-61.
%%
-----------------------------------------------------------------------------------
---------------------------------% %
%
%

% This function draw the benchmark functions

function func_plot(func_name)

[lb,ub,dim,fobj]=Get_Functions_details(func_name);

switch func_name
case 'F1'
x=-100:2:100; y=x; %[-100,100]

case 'F2'
x=-100:2:100; y=x; %[-10,10]

case 'F3'
x=-100:2:100; y=x; %[-100,100]

case 'F4'
x=-100:2:100; y=x; %[-100,100]
case 'F5'
x=-200:2:200; y=x; %[-5,5]
case 'F6'
x=-100:2:100; y=x; %[-100,100]
case 'F7'
x=-1:0.03:1; y=x %[-1,1]
case 'F8'
x=-500:10:500;y=x; %[-500,500]
case 'F9'
x=-5:0.1:5; y=x; %[-5,5]
case 'F10'
x=-20:0.5:20; y=x;%[-500,500]
case 'F11'
x=-500:10:500; y=x;%[-0.5,0.5]
case 'F12'
x=-10:0.1:10; y=x;%[-pi,pi]
case 'F13'
x=-5:0.08:5; y=x;%[-3,1]
case 'F14'
x=-100:2:100; y=x;%[-100,100]
case 'F15'
x=-5:0.1:5; y=x;%[-5,5]
case 'F16'
x=-1:0.01:1; y=x;%[-5,5]
case 'F17'
x=-5:0.1:5; y=x;%[-5,5]
case 'F18'
x=-5:0.06:5; y=x;%[-5,5]
case 'F19'
x=-5:0.1:5; y=x;%[-5,5]
case 'F20'
x=-5:0.1:5; y=x;%[-5,5]
case 'F21'
x=-5:0.1:5; y=x;%[-5,5]
case 'F22'
x=-5:0.1:5; y=x;%[-5,5]
case 'F23'
x=-5:0.1:5; y=x;%[-5,5]
end

L=length(x);
f=[];

for i=1:L
for j=1:L
if strcmp(func_name,'F15')==0 && strcmp(func_name,'F19')==0 &&
strcmp(func_name,'F20')==0 && strcmp(func_name,'F21')==0 &&
strcmp(func_name,'F22')==0 && strcmp(func_name,'F23')==0
f(i,j)=fobj([x(i),y(j)]);
end
if strcmp(func_name,'F15')==1
f(i,j)=fobj([x(i),y(j),0,0]);
end
if strcmp(func_name,'F19')==1
f(i,j)=fobj([x(i),y(j),0]);
end
if strcmp(func_name,'F20')==1
f(i,j)=fobj([x(i),y(j),0,0,0,0]);
end
if strcmp(func_name,'F21')==1 || strcmp(func_name,'F22')==1 ||
strcmp(func_name,'F23')==1
f(i,j)=fobj([x(i),y(j),0,0]);
end
end
end

surfc(x,y,f,'LineStyle','none');

end

Common questions

Powered by AI

ChOA is particularly suitable for multidimensional search spaces due to its flexible parameter adjustment capabilities that enhance both exploration and exploitation phases. The algorithm can dynamically shift focus depending on the search phase requirements, ensuring effective navigation through complex landscapes with multiple optima. This versatility allows ChOA to maintain performance consistency despite the increased complexity encountered in higher-dimensional spaces .

The Chimp Optimization Algorithm (ChOA) is designed to simulate the intelligent foraging behavior of chimps, providing a balance between exploration and exploitation. Its distinct advantage over traditional methods lies in this ability to dynamically adjust its parameters to maintain a balance between searching globally (exploration) and refining solutions locally (exploitation). This adaptability is critical in complex, multidimensional optimization problems where fixed parameter strategies of traditional methods might falter .

The function plot mechanism in ChOA contributes to the testing and verification process by allowing visual inspection of the optimization landscape and results. By plotting benchmark functions, researchers can visually assess how well the algorithm navigates the search space and converges to optimal solutions, which is crucial for identifying potential improvements and validating algorithmic performance .

The ChOA handles constraints by incorporating them into the fitness evaluation process, which is pivotal for ensuring compliance with problem-specific requirements. Constraints are typically enforced by adjusting the fitness values or incorporating penalty factors that deter the algorithm from considering infeasible solutions, thereby guiding the search process within acceptable bounds .

ChOA might outperform other similar optimization algorithms in scenarios where the problem involves highly complex, noisy, or dynamic search spaces that require adaptive strategies. Its ability to balance exploration and exploitation dynamically and effectively manage constraints makes it especially advantageous in situations where traditional algorithms struggle to maintain efficiency and accuracy due to their static parameterization .

The dynamic parameter adjustment in ChOA is significant for search efficiency as it allows the algorithm to effectively balance exploration and exploitation throughout the search process. By adapting parameters such as the learning rate or search step sizes based on current conditions and search progress, ChOA can avoid stagnation in local optima and enhance its overall performance in dynamically changing problem landscapes .

The initialization phase is critical in ChOA and similar optimization algorithms because it sets the preliminary conditions for the search process. Proper initialization ensures that the search space is adequately covered, which helps prevent premature convergence on local optima and lays a foundation for effective exploration. Inadequate initialization can lead to biased search results and reduced optimization efficiency .

The interface for benchmark functions in the ChOA code helps ensure broad applicability by allowing a versatile and parameterized approach to function definitions. This is evidenced by the use of a function switch-case structure which supports various benchmark functions with different domains and dimensions, providing a wide range of test scenarios for evaluating optimization performance across diverse conditions .

Potential limitations of using ChOA in optimization tasks include its potentially high computational cost due to dynamic parameter adjustments and complex mathematical operations required during optimization. Additionally, while the algorithm is adept at balancing exploration and exploitation, there may be scenarios where it still faces challenges in global convergence efficiency especially in extremely rugged landscapes with deceptive local optima .

The integration of elements from the Grey Wolf Optimizer, such as initialization and function detail handling, adds robustness to the ChOA by incorporating proven strategies in swarm intelligence. This synergy leverages the hierarchical and social structure mechanisms of grey wolves, enhancing the ChOA’s ability to converge on optimal solutions by facilitating efficient leadership and group decision-making dynamics in the search process .

You might also like