نتایج جستجو برای: invasive weed optimization algorithm
تعداد نتایج: 1114634 فیلتر نتایج به سال:
طراحی و سنتز پرتو کانتوری برای کاربردهای گوناگون از قبیل مخابرات ماهواره در طول چند دهه اخیر مورد توجه قرار گرفته است. با استفاده از تکنیک های سنتز الگوی تشعشعی مورد نظر و همچنین پیاده سازی روش های جستجوی تصادفی پاسخ از قبیل روش های بهینه سازی، می توان پرتوهایی مختلفی از قبیل پرتو مجذور کسکانت، پرتو کانتوری و ... را ایجاد کرد. به همین منظور، ساختارهای متنوعی از قبیل آنتن بازتابنده شکل داده شده،...
a new powerful optimization algorithm inspired from colonizing weeds is utilized to solve the well-known quadratic assignment problem (qap) which is of application in a large number of practical areas such as plant layout, machinery layout and so on. a set of reference numerical problems from qaplib is taken in order to evaluate the efficiency of the algorithm compared with the previous ones wh...
How to select the suitable parameters and kernel model is a very important problem for Twin Support Vector Machines (TSVMs). In order to solve this problem, one solving algorithm called Invasive Weed Optimization Algorithm for Optimizating the Parameters of Mixed Kernel Twin Support Vector Machines (IWO-MKTSVMs) is proposed in this paper. Firstly, introducing the mixed kernel, the twin support ...
The Weighted Set Cover Problem (SCP) is a popular optimization problem that has been applied to different industrial applications, including scheduling, manufacturing, service planning and location problems. It consists in to find low cost solutions covering a set of requirements or needs. In this paper, we solve the SCP using a recent nature inspired algorithm: Invasive Weed Optimization (IWO)...
Invasive Weed Optimization is a recently proposed population based meta-heuristic that mimics the colonizing action of weeds. In this article, an improvement to the classical algorithm has been proposed by introducing a constriction factor in the seed dispersal stage. Temporal Difference Q-Learning has been employed to adapt this parameter for different population members through the successive...
the dynamic facility layout problem (dflp) is the problem of finding positions of departments onthe plant floor for multiple periods (material flows between departments change during the planning horizon)such that departments do not overlap, and the sum of the material handling and rearrangement costs isminimized. in this paper a new optimization algorithm inspired from colonizing weeds, invasi...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید