Content deleted Content added
remove duplicate ref |
m Cleaned up using AutoEd |
||
Line 1:
{{Orphan|date=April 2016}}
In [[computer science]], '''Imperialist Competitive Algorithm (ICA)'''<ref name=ica_en_2007_cnf_atashpaz_ica_ica /> is a computational method that is used to solve [[optimization problem]]s of different types. Like most of the methods in the area of [[evolutionary computation]], ICA does not need the gradient of the function in its optimization process.
From a specific point of view, ICA can be thought of as the social counterpart of [[genetic algorithms]] (GAs). ICA is the mathematical model and the computer simulation of human [[social evolution]], while GAs are based on the [[biological evolution]] of species.
Applications, advantages and disadvantages of ICA are discussed with details in <ref name=ICA_2014_Survey />
== Algorithm ==
[[File:Imperialist-competitive-algorithm-flowchart.jpg|thumb|420px|Figure 1: Flowchart of Imperialist Competitive Algorithm (ICA)]]
Figure 1 shows the flowchart of the Imperialist Competitive Algorithm. This algorithm starts by generating a set of candidate random solutions in the search space of the optimization problem. The generated random points are called the initial ''Countries''. Countries in this algorithm are the counterpart of ''Chromosome''s in GAs and ''Particle''s in [[Particle Swarm Optimization]] (PSO) and it is an array of values of a candidate solution of optimization problem. The [[Loss function|cost function]] of the optimization problem determines the power of each country. Based on their power, some of the best initial countries (the countries with the least cost function value), become ''Imperialists'' and start taking control of other countries (called ''colonies'') and form the initial ''Empires''.<ref name=ica_en_2007_cnf_atashpaz_ica_ica />
Two main operators of this algorithm are ''Assimilation'' and ''Revolution''. Assimilation makes the colonies of each empire get closer to the imperialist state in the space of socio-political characteristics (optimization search space). Revolution brings about sudden random changes in the position of some of the countries in the search space. During assimilation and revolution a colony might reach a better position and has the chance to take the control of the entire empire and replace the current imperialist state of the empire.<ref name=ica_en_2010_jnl_nazari_integrated_product_mix_outsourcing />
''Imperialistic Competition'' is another part of this algorithm. All the empires try to win this game and take possession of colonies of other empires. In each step of the algorithm, based on their power, all the empires have a chance to take control of one or more of the colonies of the weakest empire.<ref name=ica_en_2007_cnf_atashpaz_ica_ica />
Algorithm continues with the mentioned steps (Assimilation, Revolution, Competition) until a stop condition is satisfied.
== Pseudocode ==
The above steps can be summarized as the below [[pseudocode]].
0) Define objective function: <math>f(\mathbf{x}), \quad \mathbf{x}=(x_1,x_2,\dots,x_d); \, </math>
1) Initialization of the algorithm. Generate some random solution in the search space and create initial empires.
2) Assimilation: Colonies move towards imperialist states in different in directions.
3) Revolution: Random changes occur in the characteristics of some countries.
4) Position exchange between a colony and Imperialist. A colony with a better position than the imperialist,
has the chance to take the control of empire by replacing the existing imperialist.
5) Imperialistic competition: All imperialists compete to take possession of colonies of each other.
Line 31:
== Variants ==
Like for [[Particle Swarm Optimization|PSO]], the first version of ICA was proposed for solving continuous optimization problems. Then in other works different variants of ICA were proposed for solving both discrete and continuous problems. For example Chaotic ICA is proposed by Duan, etal.<ref name=ica_en_2009_jnl_duan_template_matching_chaotic_ica /> and also a version of this algorithm for handling constrained optimization problems is proposed by Zhang, etal.<ref name=ica_en_2009_cnf_zhang_improved_ica_constrained_optimization />
== Some new points on Meta-heuristic Algorithm ==
Line 38:
== Applications ==
ICA is used to solve different optimization problems in various areas of engineering and science. The following are some of the applications of this algorithm.
* Designing controller for industrial systems<ref name=ica_en_2008_en_conf_rajabioun_decentralized_pid_controller_design_mimo_evaporator /><ref name=ica_en_2008_jnl_atashpaz_ijicc_pid_mimo_distillation_column_process /><ref name=ica_en_2007_cnf_atashpaz_optimal_pid_controller_isfs2007 /><ref name=ica_en_2008_en_bchtr_rajabioun_nash_equilibrium_point_achievement /><ref name=ica_en_2009_jnl_atashpaz_decentralized_pid_controller_optimal_shrinkage_gershgorin_bands />▼
* Designing Intelligent Recommender Systems<ref name=ica_en_2008_cnf_sepehrirad_recommender_systems />▼
▲* Designing controller for industrial systems<ref name=ica_en_2008_en_conf_rajabioun_decentralized_pid_controller_design_mimo_evaporator/><ref name=ica_en_2008_jnl_atashpaz_ijicc_pid_mimo_distillation_column_process/><ref name=ica_en_2007_cnf_atashpaz_optimal_pid_controller_isfs2007/><ref name=ica_en_2008_en_bchtr_rajabioun_nash_equilibrium_point_achievement/><ref name=ica_en_2009_jnl_atashpaz_decentralized_pid_controller_optimal_shrinkage_gershgorin_bands/>
▲* Designing Intelligent Recommender Systems<ref name=ica_en_2008_cnf_sepehrirad_recommender_systems/>
* Solving optimization problems in communication systems.<ref name=ica_en_2009_jnl_khabbazi_minimum_bit_error_rate_beamforming /><ref name=ica_2010_en_jnl_Alikhani_Evaluation_of_Image_Segmentation_Methods /><ref name=ica_2010_en_cnf_Sayadnavard_Wireless_sensor_network_localization />▼
▲* Fuzzy ICA<ref name=Fuzzy_ICA_2014_NC/>
* Solving scheduling and production management problems<ref name=ica_en_2010_jnl_nazari_integrated_product_mix_outsourcing /><ref name=ica_en_2009_jnl_jolai_pareto_simulated_annealing_offline_scheduling_problem_with_rejection /><ref name=ica_en_2010_jnl_shokrollahpour_bi_criteria_flowshop /><ref name=ica_2010_en_jnl_Forouharfard_schedule_cross_docking_systems /><ref name=ica_2010_en_jnl_Karimi_scheduling_flexible_flow_shops_ica_electromagnetic /><ref name=ica_2010_en_jnl_Bagher_Balancing_of_stochastic_U_Type_assembly_lines /><ref name=ica_2010_en_jnl_Sarayloo_ica_Dynamic_Cell_Formation /><ref>{{cite journal|last1=Piroozfard|first1=H.|last2=Wong|first2=K. Y.|title=An imperialist competitive algorithm for the job shop scheduling problems|journal=IEEE Industrial Engineering and Engineering Management (IEEM)|pages=69–73|doi=10.1109/IEEM.2014.7058602}}</ref>▼
▲* Solving optimization problems in communication systems.<ref name=ica_en_2009_jnl_khabbazi_minimum_bit_error_rate_beamforming/><ref name=ica_2010_en_jnl_Alikhani_Evaluation_of_Image_Segmentation_Methods/><ref name=ica_2010_en_cnf_Sayadnavard_Wireless_sensor_network_localization/>
* Training and analysis of Artificial Neural Networks<ref name=ica_en_2008_jnl_oskouyi_material_properties_characterization_sharp_indentation_test /><ref name=ica_en_2009_cnf_mahmoudi_ann_weights_optimization />▼
▲* Solving scheduling and production management problems<ref name=ica_en_2010_jnl_nazari_integrated_product_mix_outsourcing/><ref name=ica_en_2009_jnl_jolai_pareto_simulated_annealing_offline_scheduling_problem_with_rejection/><ref name=ica_en_2010_jnl_shokrollahpour_bi_criteria_flowshop/><ref name=ica_2010_en_jnl_Forouharfard_schedule_cross_docking_systems/><ref name=ica_2010_en_jnl_Karimi_scheduling_flexible_flow_shops_ica_electromagnetic/><ref name=ica_2010_en_jnl_Bagher_Balancing_of_stochastic_U_Type_assembly_lines/><ref name=ica_2010_en_jnl_Sarayloo_ica_Dynamic_Cell_Formation/><ref>{{cite journal|last1=Piroozfard|first1=H.|last2=Wong|first2=K. Y.|title=An imperialist competitive algorithm for the job shop scheduling problems|journal=IEEE Industrial Engineering and Engineering Management (IEEM)|pages=69–73|doi=10.1109/IEEM.2014.7058602}}</ref>
* Nash Equilibrium Point Achievement<ref name=ica_en_2008_en_bchtr_rajabioun_nash_equilibrium_point_achievement />▼
▲* Training and analysis of Artificial Neural Networks<ref name=ica_en_2008_jnl_oskouyi_material_properties_characterization_sharp_indentation_test/><ref name=ica_en_2009_cnf_mahmoudi_ann_weights_optimization/>
* Design and thermodynamic optimization of plate-fin heat exchangers<ref name=ica_moslem_2011 />▼
▲* Nash Equilibrium Point Achievement<ref name=ica_en_2008_en_bchtr_rajabioun_nash_equilibrium_point_achievement/>
▲* Design and thermodynamic optimization of plate-fin heat exchangers<ref name=ica_moslem_2011/>
* Feature selection<ref>Seyed Jalaleddin Mousavi Rad, Fardin Akhlaghian Tab, Kaveh Mollazade, “ Application of Imperialist Competition Algorithm for Feature Selection: A Case Study On Rice Classification”, International Journal of Computer Application, Vol. 40, No.16, 2012</ref><ref>S.J. Mousavirad, H. Ebrahimpour, Feature selection using modified Imperilaist Competitive Algorithm, International Conference on Computer and Knowledge Engineering(ICKKE 2013), October 31 & November 1, 2013, Ferdowsi University of Mashhad, Mashhad, Iran</ref>
* and so on<ref name=ica_en_2010_jnl_lucas_linear_induction_motor /><ref name=ica_2010_en_jnl_omid_phev /><ref name=ica_2010_en_jnl_niknam_k_means_clustering /><ref name=ica_2010_en_jnl_mozafari_thin_interphase />
== References ==
{{Reflist|refs=
<ref name=ica_moslem_2011>{{cite conference
|last1= Yousefi
|first1= Moslem
Line 64 ⟶ 62:
|volume= 6
|pages= 4749–4759
}}</ref>
</ref>▼
<ref name=ica_en_2007_cnf_atashpaz_ica_ica>{{cite conference
|last1= Atashpaz-Gargari
|first1= E.
Line 78 ⟶ 74:
|volume= 7
|pages= 4661–4666
}}</ref>
<ref name=Fuzzy_and_Intelligent_Systems_2008>{{cite conference
|last1= Jasour
|first1= A.
Line 92 ⟶ 86:
|booktitle= Second First Iranian Joint Congress on Fuzzy and Intelligent Systems
|year= 2008
|volume=
|pages=
}}</ref>
<ref name= ica_en_2009_jnl_duan_template_matching_chaotic_ica>{{cite journal
|last1= Duan
|first1=H.
Line 113 ⟶ 105:
|issue=6
|pages=1362–1381
}}</ref>
<ref name=ICA_2014_Survey>{{cite journal
|last1= Hosseini
|first1=S.
Line 127 ⟶ 117:
|volume=24
|pages=1078–1094
}}</ref>
<ref name=Fuzzy_ICA_2014_NC>{{cite journal
|last1= Al Khaled
|first1=A.
Line 142 ⟶ 130:
|issue= 4
|pages=813–825
}}</ref>
<ref name=ica_en_2009_cnf_zhang_improved_ica_constrained_optimization>{{cite conference
|last1=Zhang
|first1=Yang
Line 156 ⟶ 142:
|booktitle=Computer Science-Technology and Applications, IFCSTA
|year=2009
}}</ref>
<ref name=ica_en_2008_en_conf_rajabioun_decentralized_pid_controller_design_mimo_evaporator>{{cite conference
|last1=Rajabioun
|first1=R.
Line 175 ⟶ 159:
|year=2008
|pages=9952–9957
}}</ref>
<ref name=ica_en_2008_jnl_atashpaz_ijicc_pid_mimo_distillation_column_process>{{cite journal
|last1= Atashpaz-Gargari
|first1= E.
Line 195 ⟶ 177:
|pages= 337–355
|doi=10.1108/17563780810893446
}}</ref>
<ref name=ica_en_2007_cnf_atashpaz_optimal_pid_controller_isfs2007>{{cite conference
|last1= Atashpaz-Gargari
|first1= E.
Line 207 ⟶ 187:
|booktitle= Proceeding of First Iranian Joint Congress on Intelligent and Fuzzy Systems
|year= 2007
}}</ref>
<ref name=ica_en_2008_en_bchtr_rajabioun_nash_equilibrium_point_achievement>{{cite conference
|last1= Rajabioun
|first1= R.
Line 222 ⟶ 200:
|year= 2008
|pages= 680–695
}}</ref>
<ref name=ica_en_2009_jnl_atashpaz_decentralized_pid_controller_optimal_shrinkage_gershgorin_bands>{{cite journal
|last1= Atashpaz-Gargari
|first1= E.
|last2= Rajabioun
|first2= R.
|last3= Hashemzadeh
|first3= F.
|last4= R. Salmasi
Line 240 ⟶ 216:
|volume= 5
|issue= 10(A)
}}</ref>
<ref name=ica_en_2008_cnf_sepehrirad_recommender_systems>{{cite conference
|last1= Sepehri Rad
|first1= H.
Line 252 ⟶ 226:
|booktitle= In 13th Int'l CSI Computer Conference (CSICC'08)
|year= 2008
}}</ref>
<ref name=ica_en_2009_jnl_khabbazi_minimum_bit_error_rate_beamforming>{{cite journal
|last1= Khabbazi
|first1= Arash
Line 270 ⟶ 242:
|pages= 125–133
|doi=10.1504/ijbic.2009.022781
}}</ref>
<ref name=ica_2010_en_jnl_Alikhani_Evaluation_of_Image_Segmentation_Methods>{{cite journal
|last1= Alikhani koupaei
|first1= Javad
Line 284 ⟶ 254:
|volume= 2
|issue= 6
}}</ref>
<ref name=ica_2010_en_cnf_Sayadnavard_Wireless_sensor_network_localization>{{cite conference
|last1= H. Sayadnavard
|first1= Monireh
Line 298 ⟶ 266:
|booktitle= 3rd IEEE International Conference on Computer Science and Information Technology
|year= 2010
}}</ref>
<ref name=ica_en_2009_jnl_jolai_pareto_simulated_annealing_offline_scheduling_problem_with_rejection
|last1= Jolai
|first1= F.
Line 316 ⟶ 282:
|pages= 1119–1131
|doi=10.1243/09544054jem1746
}}</ref>
<ref name=ica_en_2010_jnl_shokrollahpour_bi_criteria_flowshop>{{cite journal
|last1= Shokrollahpour
|first1= E.
Line 330 ⟶ 294:
|journal= International Journal of Production Research
|year= 2010
}}</ref>
<ref name=ica_en_2010_jnl_nazari_integrated_product_mix_outsourcing>{{cite journal
|last1= Nazari-Shirkouhi
|first1= S.
Line 352 ⟶ 314:
|pages= 7615–7626
|doi=10.1016/j.eswa.2010.04.081
}}</ref>
<ref name=ica_2010_en_jnl_Forouharfard_schedule_cross_docking_systems>{{cite journal
|last1= Forouharfard
|first1= S.
Line 364 ⟶ 324:
|journal= International Journal of Advanced Manufacturing Technology
|year= 2010
}}</ref>
<ref name=ica_2010_en_jnl_Karimi_scheduling_flexible_flow_shops_ica_electromagnetic>{{cite journal
|last1= Karimi
|first1= N.
Line 376 ⟶ 334:
|journal= International Journal of Production Research
|year= 2010
|volume=
|issue=
|pages=
|doi=10.1080/00207543.2010.481644
}}</ref>
<ref name=ica_2010_en_jnl_Bagher_Balancing_of_stochastic_U_Type_assembly_lines>{{cite journal
|last1= Bagher
|first1= M.
Line 394 ⟶ 350:
|journal= International Journal of Advanced Manufacturing Technology
|year= 2010
|volume=
|issue=
|pages=
}}</ref>
<ref name=ica_2010_en_jnl_Sarayloo_ica_Dynamic_Cell_Formation>{{cite journal
|last1= Sarayloo
|first1= Fatemeh
Line 410 ⟶ 364:
|year= 2010
|volume= 6215
|issue=
|pages= 266–276
|doi=10.1007/978-3-642-14922-1_34
}}</ref>
<ref name=ica_en_2008_jnl_oskouyi_material_properties_characterization_sharp_indentation_test>{{cite journal
|last1= Biabangard-Oskouyi
|first1= A.
Line 431 ⟶ 383:
|volume= 10
|issue= 1
|pages=
}}</ref>
<ref name=ica_en_2009_cnf_mahmoudi_ann_weights_optimization>{{cite conference
|last1= T.
|first1= Maryam
Line 448 ⟶ 398:
|booktitle= Seventh International Conference on Computer Science and Information Technologies
|year= 2009
▲}}</ref></ref>
<ref name=ica_en_2010_jnl_lucas_linear_induction_motor>{{cite journal
|last1= Lucas
|first1= C.
Line 468 ⟶ 414:
|pages= 1407–1411
|doi=10.1016/j.enconman.2010.01.014
}}</ref>
<ref name=ica_2010_en_jnl_omid_phev>{{cite journal
|last1= Movahhedi
|first1= Omid
|last2= R. Salmasi
|first2= Farzad
|title= Optimal Design of Propulsion System with Adaptive Fuzzy Controller for a PHEV Based on Non-dominated Sorting Genetic and Colonial Competitive Algorithms
|journal= International Review of Automatic Control
|year= 2009
}}</ref>
<ref name=ica_2010_en_jnl_niknam_k_means_clustering>{{cite journal
|last1= Niknam
|first1= Taher
|last2= Taherian Fard
|first2= Elahe
|last3= Pourjafarian
|first3= Narges
|last4= Rousta
Line 496 ⟶ 438:
|journal= Engineering Applications of Artificial Intelligence
|year= 2010
}}</ref>
<ref name=ica_2010_en_jnl_mozafari_thin_interphase>{{cite journal
|last1= Mozafari
|first1= Hamid
|last2= Abdi
|first2= Behzad
|last3= Ayob
|first3= Amran
|title= Optimization of Transmission Conditions for Thin Interphase Layer Based on Imperialist Competitive Algorithm
|journal= International Journal on Computer Science and Engineering
Line 513 ⟶ 453:
|issue= 7
|pages= 2486–2490
}}</ref>
}}
| |||