Search
Code Directory
 ASP
 ASP.NET
 C/C++
 CFML
 CGI/PERL
 Delphi
 Development
 Flash
 HTML
 Java
 JavaScript
 Pascal
 PHP
 Python
 SQL
 Tools
 Visual Basic & VB.NET
 XML
New Code
.Net Runtime Library for Delphi 6.0.4.0
Scimbo 1.64
AnyMap JS Maps 8.4.2
GetOrgChart 2.5.3
AnyChart JS Charts and Dashboards 8.4.2
OrgChart JS 3.8.0
dbForge Compare Bundle for MySQL 8.1
dbForge Search for SQL Server 2.3
Database Workbench Pro 5.5.0
Luxand FaceSDK 7.0
SSIS Data Flow Components 1.10
Entity Developer Professional 6.3
dbForge Index Manager for SQL Server 1.9
dbForge Data Generator For MySQL 2.2
Magento Australia Post eParcel Extension 1.0
Top Code
PHP Point of sale 10.0
MATLAB Support Package for Arduino (aka ArduinoIO Package) 1.0
Betting system 6.x-1.x-dev
Java-2-Pseudo 1.0
Faculty Evaluation System 1.1
TeeBI for RAD Studio Suite 2017
Cuckoo Search (CS) Algorithm 1.0
Student Information Management System 1.0
Java/RTR 1.0
JEDI Database Desktop 27012002
Mind Fighter 1.1
JAC (Java Asn.1 Compiler) 3.0
000-516 Free Test Exam Questions 10.0
ICDoctorAppointment - Doctor Appointment Script 1.2
CONTRAST CONTROLLER 1.0
Top Rated
Deals and Discounts Website Script 1.0.2
ADO.NET Provider for ExactTarget 1.0
Solid File System OS edition 5.1
Classified Ad Lister 1.0
Aglowsoft SQL Query Tools 8.2
ICPennyBid Penny Auction Script 4.0
PHP Review Script 1.0
ATN Resume Finder 2.0
ATN Site Builder 3.0
Availability Booking Calendar PHP 1.0
PHP GZ Blog Script 1.1
ATN Jobs Software 4.0
ATN Mall 2.0
WeBuilder 2015 13.3
PHP Digital Download Script 1.0.4
Colonial Competitive Algorithm (CCA) 1.0
File ID: 78820






Colonial Competitive Algorithm (CCA) 1.0
Download Colonial Competitive Algorithm (CCA) 1.0http://www.mathworks.comReport Error Link
License: Freeware
File Size: 450.6 KB
Downloads: 283
Submit Rating:
Colonial Competitive Algorithm (CCA) 1.0 Description
Description: These files are the MATLAB code for "Imperialist Competitive Algorithm (ICA)" which in some papers is referred by "Colonial Competitive Algorithm CCA".

Evolutionary optimization methods, inspired from natural processes, have shown good performance in solving complex optimization problems. For example, genetic algorithms (inspired from biological evolution of human and other species), ant colony optimization (based on ants effort to find optimal path to the food source) and simulated annealing (based on real annealing process in which a substance is heated over its melting point and then cooled to reach to a crystalline lattice) are widely used to solve engineering optimization problems.
The proposed evolutionary optimization algorithms are generally inspired by modeling the natural processes and other aspects of species evolution, especially human evolution, are not considered. The method, proposed in this work, uses socio-political evolution of human as a source of inspiration for developing a powerful optimization strategy. Especially, this algorithm considers the imperialism as a level of humand-deOaos social evolution and by mathematically modeling this complicated political and historical process, harnesses it as tool for evolutionary optimization. Since its recent inception this novel method has been widely adopted by researchers to solve different optimization tasks. This method is used to design optimal layout for factories, adaptive antenna arrays, intelligent recommender systems, optimal controller for industrial and chemical possesses.

For more information visit: <atashpaz.com>

License: Freeware

Related: imperialism, Level, considers, Algorithm, Human, Social, historical, Political, complicated, mathematically, Strategy, Powerful, aspects, Modeling, generally, evolutionary, considered, Developing, quot

O/S:BSD, Linux, Solaris, Mac OS X

File Size: 450.6 KB

Downloads: 283



More Similar Code

Evolutionary optimization methods, inspired from natural processes, have shown good performance in solving complex optimization problems. For example, genetic algorithms (inspired from biological evolution of human and other species), ant colony optimization (based on ants effort to find optimal path to the food source) and simulated annealing (based on real annealing process in which a substance is heated over its melting point and then...



This is an evolutionary algorithm that returns a random list of prime numbers. This code is highly inefficient for a reason. This algorithm is more of a proof of concept that if a prime was a heritable trait, it would not be a desired one.



This is a pure Python implementation of the rsync algorithm. On my desktop (3.0GHz dual core, 7200RPM), best case throughput for target file hash generation and delta generation is around 2.9MB/s. Absolute worst case scenario (no blocks in common)...



A-star (A*) Shortest Path Algorithm



Dijkstra shortest path algorithm.



Floyd-Steinberg dithering is an image dithering algorithm (see http://en.wikipedia.org/wiki/Floyd-Steinberg for more details). While the algorithm is mainly for image manipulation, I use it to create random locations for sensor networt devices.



This is a simple implementation of the famous LZW algorithm.



this algorithm predicts the received signal strength for the mobile user to avoid fluctuation in received signal strength during localization of the mobile user(finding mobile user's location)



NSGA-II is a very famous multi-objective optimization algorithm. I submitted an example previously and wanted to make this submission useful to others by creating it as a function. Even though this function is very specific to benchmark problems,...



Gravitational search algorithm (GSA) is an optimization algorithm based on the law of gravity and mass interactions.This algorithm is based on the Newtonian gravity: "Every particle in the universe attracts every other particle with a force...

User Review for Colonial Competitive Algorithm (CCA)
- required fields
     

Please enter text on the image