نتایج جستجو برای: particle swarm algorithm mopso

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

Journal: :transactions on combinatorics 2013
soniya lalwani sorabh singhal rajesh kumar nilama gupta

numerous problems encountered in real life cannot be actually formulated as a single objective problem; hence the requirement of multi-objective optimization (moo) had arisen several years ago. due to the complexities in such type of problems powerful heuristic techniques were needed, which has been strongly satisfied by swarm intelligence (si) techniques. particle swarm optimization (pso) has ...

2006
Alexandre M. Baltar Darrell G. Fontane

This paper presents an application of an evolutionary optimization algorithm for multiobjective analysis of selective withdrawal from a thermally stratified reservoir. A multiobjective particle swarm optimization (MOPSO) algorithm is used to find nondominated (Pareto) solutions when minimizing deviations from outflow water quality targets of: (i) temperature; (ii) dissolved oxygen (DO); (iii) t...

2011
Andrew Kusiak Guanglin Xu Fan Tang

A data-driven approach for the optimization of a heating, ventilation, and air conditioning (HVAC) system in an office building is presented. A neural network (NN) algorithm is used to build a predictive model since it outperformed five other algorithms investigated in this paper. The NN-derived predictive model is then optimized with a strength multi-objective particle-swarm optimization (S-MO...

Journal: :Eurasip Journal on Wireless Communications and Networking 2022

Abstract The integration of Internet Things devices onto the Blockchain implies an increase in transactions that occur on Blockchain, thus increasing storage requirements. A solution approach is to leverage cloud resources for storing blocks within chain. paper, therefore, proposes two solutions this problem. first being improved hybrid architecture design which uses containerization create a s...

2005
Daniel Kunkle

The following MOEA algorithms are briefly summarized and compared: • NPGA Niched Pareto Genetic Algorithm (1994) – NPGA II (2001) • NSGA Non-dominated Sorting Genetic Algorithm (1994) – NSGA II (2000) • SPEA Strength Pareto Evolutionary Algorithm (1998) – SPEA2 (2001) – SPEA2+ (2004) – ISPEA Immunity SPEA (2003) • PAES Pareto Archived Evolution Strategy (2000) – M-PAES Mimetic PAES (2000) • PES...

Journal: :JDIM 2010
Tad Gonsalves Kei Yamagishi Kiyoshi Itoh

AbstrAct: Muti-objective optimization deals with the simultaneous optimization of two or more conflicting objective functions in real-life systems. This paper deals with the multi-objective optimization in service systems. The goal of service systems is to provide cost-efficient service to customers, while at the same time, reducing the customer waiting time for service. In general, a low cost ...

2013
S. LALWANI Alireza Abdollahi

Numerous problems encountered in real life cannot be actually formulated as a single objective problem; hence the requirement of Multi-Objective Optimization (MOO) had arisen several years ago. Due to the complexities in such type of problems powerful heuristic techniques were needed, which has been strongly satisfied by Swarm Intelligence (SI) techniques. Particle Swarm Optimization (PSO) has ...

Journal: :CoRR 2017
Tianxian Zhang Jiadong Liang Yichuan Yang Guolong Cui Lingjiang Kong Xiaobo Yang

In this paper, considering multiple interference regions simultaneously, an optimal antenna deployment problem for distributed Multi-Input Multi-Output (MIMO) radar is investigated. The optimal antenna deployment problem is solved by proposing an antenna deployment method based on MultiObjective Particle Swarm Optimization (MOPSO). Firstly, we construct a multi-objective optimization problem fo...

2009
Gérard Dupont

Nowadays, the core of the Particle Swarm Optimization (PSO) algorithm has proved to be reliable. However, faced with multi-objective problems, adaptations are needed. Deeper researches must be conducted on its key steps, such as solution set management and guide selection, in order to improve its efficiency in this context. Indeed, numerous parameters and implementation strategies can impact on...

پایان نامه :دانشگاه آزاد اسلامی - دانشگاه آزاد اسلامی واحد تهران مرکزی - دانشکده برق و الکترونیک 1390

there are many approaches for solving variety combinatorial optimization problems (np-compelete) that devided to exact solutions and approximate solutions. exact methods can only be used for very small size instances due to their expontional search space. for real-world problems, we have to employ approximate methods such as evolutionary algorithms (eas) that find a near-optimal solution in a r...

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

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