نتایج جستجو برای: imperialist competitive evolutionary algorithm

تعداد نتایج: 933257  

Journal: :journal of artificial intelligence in electrical engineering 0
hossein nasiragdam journal of artificial intelligence in electrical engineering nariman najafian journal of artificial intelligence in electrical engineering

the growth in demand for electric power and the rapid increase in fuel costs, in whole of theworld need to discover new energy resources for electricity production. among of the nonconventionalresources, wind and solar energy, is known as the most promising deviceselectricity production in the future. in this thesis, we study follows to long-term generationscheduling of power systems in the pre...

The human has always been to find the best in all things. This Perfectionism has led to the creation of optimization methods. The goal of optimization is to determine the variables and find the best acceptable answer Due to the limitations of the problem, So that the objective function is minimum or maximum. One of the ways inaccurate optimization is meta-heuristics so that Inspired by nature, ...

Journal: :Algorithms 2012
Jun-Lin Lin Yu-Hsiang Tsai Chun-Ying Yu Meng-Shiou Li

Imperialist Competitive Algorithm (ICA) is a new population-based evolutionary algorithm. It divides its population of solutions into several sub-populations, and then searches for the optimal solution through two operations: assimilation and competition. The assimilation operation moves each non-best solution (called colony) in a sub-population toward the best solution (called imperialist) in ...

2014
S. Fazli

In this paper, a novel technique for neighbor embedding single image super resolution (SR) is proposed. An evolutionary algorithm known as Imperialist Competitive Algorithm (ICA) is applied for neighbor embedding single image super resolution. ICA is used for minimizing the reconstruction error of reconstruction weights for neighbors of each low-resolution patch in the low-resolution training i...

2013
M. Babaei

In this paper, a new model of capacitated lot sizing and scheduling in a permutation flow shop is developed. In this model demand can be totally backlogged. Setups can be carryover and are sequence-dependent. It is well-known from literatures that capacitated lot sizing problem in permutation flow shop systems are NP-hard. This means the model is solved in polynomial time and metaheuristics alg...

Journal: :Research Journal of Applied Sciences, Engineering and Technology 2013

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید