نتایج جستجو برای: cooperative pso

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

2007
B. Jafarpour M. R. Meybodi

يا هچروم يدنب هشوخ متيروگلا ياراد پ ا ار يددعتم ياهرتم هلمج زا ،نتشادرب هب طوبرم ياهرتماراپ نتشاذگ اه هداد ديد عاعش ، يم هك دشاب ريثات و دنراد متيروگلا ييارگمه و دركلمع رد يدايز اطخ و شيامزآ تروص هب لاومعم نييعت يم رگ د دن . شور هلاقم نيا رد ي رب ينتبم CLA-PSO 1 ي هتسسگ لدم كي هك PSO دشاب يم يارب قيبطت كيتاموتا پ ياهرتمارا يا هچروم يدنب هشوخ يم داهنشيپ ددرگ . روظنم هب گلا ساسا رب هك د...

پایان نامه :وزارت علوم، تحقیقات و فناوری - دانشگاه فردوسی مشهد 1388

two groups of students were assigned as experimental and control ones, and were given instruction on directed reading-thinking activities and after some treatment, they were post-tested. although the initial pre-test did not show any significant differences, the final post-test result revealed that the cooperative reading comprehension helped the experimental group. the cooperative students’...

Node cooperation can protect wireless networks from eavesdropping by using the physical characteristics of wireless channels rather than cryptographic methods. Allocating the proper amount of power to cooperative nodes is a challenging task. In this paper, we use three cooperative nodes, one as relay to increase throughput at the destination and two friendly jammers to degrade eavesdropper&rsqu...

2015
Sanjay Saini Nordin Zakaria Dayang Rohaya Awang Rambli Suziah Sulaiman

The high-dimensional search space involved in markerless full-body articulated human motion tracking from multiple-views video sequences has led to a number of solutions based on metaheuristics, the most recent form of which is Particle Swarm Optimization (PSO). However, the classical PSO suffers from premature convergence and it is trapped easily into local optima, significantly affecting the ...

2012
Songdong Xue Jianchao Zeng Jinwei Guo

Extending the particle swarm optimization (PSO) algorithm to be one of systemic modeling and controlling tools, several research groups investigate target search with swarm robots (simulated or physical) respectively (Doctor et al., 2004; Hereford & Siebold, 2008; Jatmiko et al., 2007; Marques et al., 2006; Pugh & Martinoli, 2007; Xue & Zeng, 2008). The common idea they hold is to map such swar...

2002
Xiao-Feng Xie Wenjun Zhang Zhilian Yang

The demand for the solutions to different complex numerical optimization problems has long outstripped the ability of engineers to supply them. Since the numerical optimization is a static problem that is naturally similar to the movement of particulates with particle-wave duality in potential field, it can be simulated by the assistance of cooperative searching agents with social information s...

2002
Xiao-Feng Xie Wen-Jun Zhang Zhi-Lian Yang

The demand for the solutions to different complex numerical optimization problems has long outstripped the ability of engineers to supply them. Since the numerical optimization is a static problem that is naturally similar to the movement of particulates with particle-wave duality in potential field, it can be simulated by the assistance of cooperative searching agents with social information s...

2017
Bin Jiao Shaobin Yan

By taking advantage of niche sharing scheme,we propose a novel co-evolutionary particle swarm optimization algorithm (NCPSO) to solve permutation flow shop scheduling problem. As the core of this algorithm, niche sharing scheme maximizes the diversity of population and hence improves the quality of individuals. To evaluate the performance of the proposed algorithm, we have use eight Taillard in...

2014
Xiaobing Gan Yan Wang Shuhai Li Ben Niu Yuping Wang

This paper considers two additional factors of the widely researched vehicle routing problem with time windows VRPTW . The two factors, which are very common characteristics in realworld, are uncertain number of vehicles and simultaneous delivery and pick-up service. Using minimization of the total transport costs as the objective of the extension VRPTW, a mathematic model is constructed. To so...

2012
Desheng LI Na DENG

Permutation flow shop scheduling problem (PFSSP), a NP-hard combinatorial optimization problem, has strong engineering background of finding the optimal processing sequence and time of jobs on machines under the constraints of resources. Recently, several approaches based on Particle Swarm Optimization (PSO) have been developed to solve the PFSSP, and the experimental results show that they are...

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

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