Imperialist competitive algorithm: Difference between revisions

Revision as of 11:25, 23 February 2013

Revision as of 15:50, 12 March 2013

Line 1:

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 [[Optimizationoptimization problem|optimization problems]]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.

== Algorithm ==

Line 27:

== 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/>.

== Applications ==

Line 35:

* 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/>

* Solving scheduling and production management problems<ref name=ica_en_2009_jnl_jolai_pareto_simulated_annealing_offline_scheduling_problem_with_rejectionica_en_2010_jnl_nazari_integrated_product_mix_outsourcing/><ref name=ica_en_2010_jnl_shokrollahpour_bi_criteria_flowshopica_en_2009_jnl_jolai_pareto_simulated_annealing_offline_scheduling_problem_with_rejection/><ref name=ica_en_2010_jnl_nazari_integrated_product_mix_outsourcingica_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/>

* 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/>

* Nash Equilibrium Point Achievement<ref name=ica_en_2008_en_bchtr_rajabioun_nash_equilibrium_point_achievement/>

Line 54:

|year= 2011

|volume= 6

|pages= 4749-47594749–4759

}}

</ref>

<ref name=ica_en_2007_cnf_atashpaz_ica_ica>

Line 72 ⟶ 71:

}}

</ref>

<ref name= ica_en_2009_jnl_duan_template_matching_chaotic_ica>

Line 92 ⟶ 90:

}}

</ref>

<ref name=ica_en_2009_cnf_zhang_improved_ica_constrained_optimization>

Line 107 ⟶ 104:

}}

</ref>

<ref name=ica_en_2008_en_conf_rajabioun_decentralized_pid_controller_design_mimo_evaporator>

Line 127 ⟶ 123:

}}

</ref>

<ref name=ica_en_2008_jnl_atashpaz_ijicc_pid_mimo_distillation_column_process>

Line 147 ⟶ 142:

}}

</ref>

<ref name=ica_en_2008_jnl_atashpaz_ijicc_pid_mimo_distillation_column_process>

Line 166 ⟶ 160:

}}

</ref>

<ref name=ica_en_2007_cnf_atashpaz_optimal_pid_controller_isfs2007>

Line 179 ⟶ 172:

}}

</ref>

<ref name=ica_en_2008_en_bchtr_rajabioun_nash_equilibrium_point_achievement>

Line 195 ⟶ 187:

}}

</ref>

<ref name=ica_en_2009_jnl_atashpaz_decentralized_pid_controller_optimal_shrinkage_gershgorin_bands>

Line 214 ⟶ 205:

}}

</ref>

<ref name=ica_en_2008_cnf_sepehrirad_recommender_systems>

Line 227 ⟶ 217:

}}

</ref>

<ref name=ica_en_2009_jnl_khabbazi_minimum_bit_error_rate_beamforming>

Line 245 ⟶ 234:

}}

</ref>

<ref name=ica_2010_en_jnl_Alikhani_Evaluation_of_Image_Segmentation_Methods>

Line 260 ⟶ 248:

}}

</ref>

<ref name=ica_2010_en_cnf_Sayadnavard_Wireless_sensor_network_localization>

Line 275 ⟶ 262:

}}

</ref>

<ref name=ica_en_2009_jnl_jolai_pareto_simulated_annealing_offline_scheduling_problem_with_rejection >

Line 293 ⟶ 279:

}}

</ref>

<ref name=ica_en_2010_jnl_shokrollahpour_bi_criteria_flowshop>

Line 308 ⟶ 293:

}}

</ref>

<ref name=ica_en_2010_jnl_nazari_integrated_product_mix_outsourcing>

Line 330 ⟶ 314:

}}

</ref>

<ref name=ica_2010_en_jnl_Forouharfard_schedule_cross_docking_systems>

Line 358 ⟶ 341:

}}

</ref>

<ref name=ica_2010_en_jnl_Bagher_Balancing_of_stochastic_U_Type_assembly_lines>

Line 391 ⟶ 373:

}}

</ref>

<ref name=ica_en_2008_jnl_oskouyi_material_properties_characterization_sharp_indentation_test>

Line 411 ⟶ 392:

}}

</ref>

<ref name=ica_en_2009_cnf_mahmoudi_ann_weights_optimization>

Line 428 ⟶ 408:

}}

</ref>

<ref name=ica_en_2008_en_bchtr_rajabioun_nash_equilibrium_point_achievement>

Line 444 ⟶ 423:

}}

</ref>

<ref name=ica_en_2010_jnl_lucas_linear_induction_motor>

Line 490 ⟶ 468:

}}

</ref>

<ref name=ica_2010_en_jnl_mozafari_thin_interphase>

Line 512 ⟶ 489:

[[Category:Optimization algorithms and methods]]

[[fa:الگوریتم رقابت استعماری]]

<!--Other languages-->

[[fa:الگوریتم_رقابت_استعماری]]