Home \ Tag Archives: Imperialist Competitive Algorithm

Tag Archives: Imperialist Competitive Algorithm

YPEA: Yarpiz Evolutionary Algorithms

YPEA for MATLAB [+] is a general-purpose toolbox to define and solve optimization problems using Evolutionary Algorithms (EAs) and Metaheuristics. To use this toolbox, you just need to define your optimization problem and then, give the problem to one of the algorithms provided by YPEA, to get it solved. List of Provided Algorithms Currently, YPEA supports these algorithms to solve ...

Read More »

Minimum Spanning Tree using PSO, ICA and FA

Downloads The download link of this project follows. Implementation of Minimum Spanning Tree using PSO, Imperialist Competitive Algorithm (ICA) and Firefly Algorithm (FA) in MATLA Download Citing This Work If you wish, you can cite this content as follows. Cite as: Mostapha Kalami Heris, Minimum Spanning Tree using PSO, ICA and FA (URL: https://yarpiz.com/407/ypap116-minimum-spanning-tree), Yarpiz, 2015.

Read More »

Classic and Intelligent Portfolio Optimization in MATLAB

Downloads The download link of this project follows. Portfolio Optimization using Classic Methods and Intelligent Methods (PSO, ICA, NSGA-II, and SPEA2) in MATLAB Download Citing This Work If you wish, you can cite this content as follows. Cite as: Mostapha Kalami Heris, Classic and Intelligent Portfolio Optimization in MATLAB (URL: https://yarpiz.com/391/ypap112-portfolio-optimization), Yarpiz, 2015.

Read More »

Imperialist Competitive Algorithm (ICA) in MATLAB

Imperialist Competitive Algorithm (ICA), also known as Colonial Competitive Algorithm (CCA), is a sociopolitical metaheuristics, inspired by historical colonization process and competition among imperialists, to capture more colonies. Set of countries (solutions) in ICA, is partitioned to form several Empires, which contains a single Imperialist and several other weaker countries, called Colonies. This algorithm is proposed by Esmaeil Atashpaz Gargari ...

Read More »