نتایج جستجو برای: hybrid firefly algorithm and particle swarm optimization

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

Blind source separation technique separates mixed signals blindly without any information on the mixing system. In this paper, we have used two evolutionary algorithms, namely, genetic algorithm and particle swarm optimization for blind source separation. In these techniques a novel fitness function that is based on the mutual information and high order statistics is proposed. In order to evalu...

2012
Hichem CHAKER

In this paper a new effective optimization algorithm called hybrid particle swarm optimizer with breeding and subpopulation is presented. This algorithm is essentially, as PSO and GA, a population-based heuristic search technique, now in use for the optimization of electromagnetic structures, modeled on the concepts of natural selection and evolution (GA) but also based on cultural and social r...

2009
Youliang Zhang Domenico Gallipoli Charles Augarde

A novel parallel hybrid particle swarm optimization algorithm named hmPSO is presented. The new algorithm combines particle swarm optimization with a local search method which aims to accelerate the rate of convergence. The hybrid global optimization algorithm adjusts its searching space through the local search results. Parallelization is based on the client-server model, which is ideal for as...

Meta-heuristic algorithms inspired by the natural processes are part of the optimization algorithms that they have been considered in recent years, such as genetic algorithm, particle swarm optimization, ant colony optimization, Firefly algorithm. Recently, a new kind of evolutionary algorithm has been proposed that it is inspired by the human sociopolitical evolution process. This new algorith...

Journal: :iranian journal of management studies 2016
hesam nazari aliyeh kazemi mohammad-hossein hashemi

this study focuses on the forecasting of energy demands of residential and commercial sectors using linear and exponential functions. the coefficients were obtained from genetic and particle swarm optimization (pso) algorithms. totally, 72 different scenarios with various inputs were investigated. consumption data in respect of residential and commercial sectors in iran were collected from the ...

2014
Pei-Wei Tsai Cheng-Wu Chen

With the rapid development of swarm intelligence research field, a large number of algorithms in swarm intelligence are proposed one after another. The strong points and the drawbacks of a specific swarm intelligence algorithm becomes clear to be seen when the number of its application increases. To overcome the handicaps, some hybrid methods are invented. In this review, three hybrid swarm int...

Ahmed F . Ali Mohamed A. Tawhid Walaa H. El-Ashmawi

Formation of effective teams of experts has played a crucial role in successful projects especially in social networks. In this paper, a new particle swarm optimization (PSO) algorithm is proposed for solving a team formation optimization problem by minimizing the communication cost among experts. The proposed algorithm is called by improved particle optimization with new swap operator (IPSONSO...

2015
K. Geetha P. Thangaraj C. Rasi Priya C. Rajan S. Geetha

This paper presents the performance of Integrated Bacterial Foraging Optimization and Particle Swarm Optimization (IBFO_PSO) technique in MANET routing. The BFO is a bioinspired algorithm, which simulates the foraging behavior of bacteria. It is effectively applied in improving the routing performance in MANET. In results, it is proved that the PSO integrated with BFO reduces routing delay, ene...

The traveling salesman problem (TSP) is the problem of finding the shortest tour through all the nodes that a salesman has to visit. The TSP is probably the most famous and extensively studied problem in the field of combinatorial optimization. Because this problem is an NP-hard problem, practical large-scale instances cannot be solved by exact algorithms within acceptable computational times. ...

The traveling salesman problem (TSP) is the problem of finding the shortest tour through all the nodes that a salesman has to visit. The TSP is probably the most famous and extensively studied problem in the field of combinatorial optimization. Because this problem is an NP-hard problem, practical large-scale instances cannot be solved by exact algorithms within acceptable computational times. ...

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

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