meta-heuristic algorithms
در نشریات گروه فناوری اطلاعات-
شبکه های اجتماعی عمدتا در قالب نمودارهایی با تعداد زیادی راس و یال در قالب یک ماتریس مجاورت نمایش و تحلیل می شوند. لبه ها روابط بین افراد را نشان می دهند و به عنوان پیوند بین رئوس عمل می کنند. ویژگی های ساختاری هر شبکه با ویژگی های لبه ها و رئوس درون آن تعیین می شود. در این تحقیق که بر روی انواع داده های شبکه های اجتماعی از پایگاه داده دانشگاه استنفورد انجام شد، از روش پیش پردازش با استفاده از الگوریتم استعماری رقابتی برای عملیات انتخاب ویژگی هایی با بالاترین شایستگی (کمترین هزینه) استفاده شد. برای ارزیابی تاثیر انتخاب ویژگی بر خروجی نهایی، آزمایش هایی با و بدون عملیات انتخاب ویژگی با استفاده از الگوریتم های مختلف که معمولا در این زمینه استفاده می شوند، انجام شد. شاخص های معتبر مانند دقت، تشخیص، حساسیت و عمده به طور مستقل بر روی نتایج خروجی با میانگین 10 اجرای برنامه اندازه گیری شدند. مقایسه نتایج بین سناریوهای با و بدون انتخاب ویژگی تاثیر قابل توجهی بر همه شاخص های نتیجه نهایی نشان داد. بسیاری از ویژگی ها در مجموعه داده ها یا استفاده نشده بودند یا حاوی حداقل اطلاعات بودند. حذف نکردن این ویژگی ها نه تنها بار محاسباتی را افزایش داد، بلکه بر دقت نتایج خروجی به دلیل اجرای زمان بر تاثیر گذاشت.
کلید واژگان: پیش بینی لینک، الگوریتم های فرااکتشافی، پیش پردازش داده هاSocial networks are primarily represented and analyzed in the form of graphs with a large number of vertices and edges, structured as an adjacency matrix. The edges indicate relationships between individuals and act as connections between the vertices. The structural characteristics of each network are determined by the features of the edges and vertices within it. In this research, conducted on various types of social network data from the Stanford University database, a preprocessing method was employed using a competitive colonial algorithm for feature selection with the highest merit (lowest cost). To evaluate the impact of feature selection on the final output, experiments were conducted both with and without feature selection operations using various algorithms commonly used in this field. Valid metrics such as accuracy, precision, sensitivity, and recall were independently measured on the output results with an average of 10 program executions. The comparison of results between scenarios with and without feature selection showed a significant impact on all metrics of the final outcome. Many features in the datasets were either unused or contained minimal information. Not removing these features not only increased the computational burden but also affected the accuracy of the output results due to time-consuming execution.
Keywords: Link Prediction, Meta-Heuristic Algorithms, Data Preprocessing -
Optimization plays a crucial role in enhancing productivity within the industry. Employing this technique can lead to a reduction in system costs. There exist various efficient methods for optimization, each with its own set of advantages and disadvantages. Meanwhile, meta-heuristic algorithms offer a viable solution for achieving the optimal working point. These algorithms draw inspiration from nature, physical relationships, and other sources. The distinguishing factors between these methods lie in the accuracy of the final optimal solution and the speed of algorithm execution. The superior algorithm provides both precise and rapid optimal solutions. This paper introduces a novel agricultural-inspired algorithm named Elymus Repens Optimization (ERO). This optimization algorithm operates based on the behavioral patterns of Elymus Repens under cultivation conditions. Elymus repens is inclined to move to areas with more suitable conditions. In ERO, exploration and exploitation are carried out through Rhizome Optimization Operator and Stolon Optimization Operators. These two supplementary activities are used to explore the problem space. The potent combination of these operators, as presented in this paper, resolves the challenges encountered in previous research related to speed and accuracy in optimization issues. After the introduction and simulation of ERO, it is compared with popular search algorithms such as Gravitational Search Algorithm (GSA), Grey Wolf Optimizer (GWO), Particle Swarm Optimization (PSO), and Firefly Algorithm (FA). The solution of 23 benchmark functions demonstrates that the proposed algorithm is highly efficient in terms of accuracy and speed.
Keywords: Elymus Repens Optimization, Meta-Heuristic Algorithms, Rhizome Optimization Operator, Stolon Optimization Operator -
In any economy, it is essential to monitor the rate of population change closely. Governments employ various strategies and programs to regulate population growth since different population growth rates have distinct economic consequences. This paper reveals a global trend of reduced desire to have children, with variations across countries. The paper aims to predict the population growth rate in England by employing Artificial Neural Networks (ANN) in combination with various meta-heuristic algorithms, including the Sparrow Search Algorithm (SSA). The selection of SSA and other algorithms is based on factors such as accuracy and computational efficiency. A set of 18 economic indicators serves as input variables, and a Genetic Algorithm (GA) is used for feature selection. The data used for analysis spans the most recent ten years and is presented on a monthly basis. The results indicate that SSA exhibits the lowest prediction errors for the population growth rate among the applied algorithms in this paper. The primary contribution of this study lies in the application of hybrid algorithms that combine SSA-ANN with other algorithms, such as LA. The paper also emphasizes the inclusion of influential and impactful indices as input variables to enhance prediction accuracy.Keywords: Artificial Neural Network, meta-heuristic algorithms, Sparrow Search Algorithm, Mayfly Algorithm, Lichtenberg Algorithm, Population growth rate
-
Medical image registration plays an important role in many clinical applications, including the detection and diagnosis of diseases, planning of therapy, guidance of interventions. Multimodal medical image registration is the process of overlapping two or more images taken from the same scene by different modalities and different sensors. Intensity-based methods are widely used in multimodal medical image registration, these techniques register different modality images that have the same content by optimal transformation. The estimation of the optimal transformation requires the optimization of a similarity metric between the images. Recently, various optimization algorithms have been presented that the selection of appropriate optimization algorithms is very important in determining the optimal transformation parameter. The Social Spider Optimization (SSO) algorithm is one of the meta-heuristic methods that prevents premature convergence. In this paper, medical image registration technique is suggested based on the SSO algorithm. The Mutual Information (MI), Normalization of Mutual Information (NMI), and Sum of Squared Differences (SSD) are used separately as cost function (objective function) and the performance of each of these functions is checked in multimodal medical image registration. The simulation results on Brain Web data set affirm the suggested method outperforms classical registration methods in terms of convergence rate, execution time.
Keywords: Image Registration, Medical Image Processing, Optimization, Meta-Heuristic Algorithms, Social Spider Optimization -
Optimization problems are becoming more complicated, and their resource requirements are rising. Real-life optimization problems are often NP-hard and time or memory consuming. Nature has always been an excellent pattern for humans to pull out the best mechanisms and the best engineering to solve their problems. The concept of optimization seen in several natural processes, such as species evolution, swarm intelligence, social group behavior, the immune system, mating strategies, reproduction and foraging, and animals’ cooperative hunting behavior. This paper proposes a new Meta-Heuristic algorithm for solving NP-hard nonlinear optimization problems inspired by the intelligence, socially, and collaborative behavior of the Qashqai nomad’s migration who have adjusted for many years. In the design of this algorithm uses population-based features, experts’ opinions, and more to improve its performance in achieving the optimal global solution. The performance of this algorithm tested using the well-known optimization test functions and factory facility layout problems. It found that in many cases, the performance of the proposed algorithm was better than other known meta-heuristic algorithms in terms of convergence speed and quality of solutions. The name of this algorithm chooses in honor of the Qashqai nomads, the famous tribes of southwest Iran, the Qashqai algorithm.
Keywords: Optimization, Meta-Heuristic Algorithms, Qashqai Optimization Algorithm (QOA), Complexity, NP-hard Problems, Swarm Algorithms -
Feature selection is the process of identifying relevant features and removing irrelevant and repetitive features with the aim of observing a subset of features that describe the problem well and with minimal loss of efficiency. One of the feature selection approaches is using optimization algorithms. This work provides a summary of some meta-heuristic feature selection methods proposed from 2018 to 2021 that were designed and implemented on a wide range of different data. The results of the study showed that some meta-heuristic algorithms alone cannot perfectly solve the feature selection problem on all types of datasets with an acceptable speed. In other words, depending on dataset, a special meta-heuristic algorithm should be used.
Keywords: Data dimension reduction, Classification, Feature Selection, Optimization algorithm, Meta-Heuristic Algorithms -
In this paper, the performance of meta-heuristic algorithms is compared using statistical analysis based on new criteria (powerfulness and effectiveness). Due to the large number of meta-heuristic methods reported so far, choosing one of them by researchers has always been challenging. In fact, the user does not know which of these methods are able to solve his complex problem. In this paper, in order to compare the performance of several methods from different categories of meta-heuristic methods new criteria are proposed. In fact, by using these criteria, the user is able to choose an effective method for his problem. For this reason, statistical analysis is conducted on each of these methods to clarify the application of each of these methods for the users. Also, powerfulness and effectiveness criteria are defined to compare the performance of the meta-heuristic methods to introduce suitable substrate and suitable quantitative parameters for this purpose. The results of these criteria clearly show the ability of each method for different applications and problems.
Keywords: Effectiveness, Meta-heuristic Algorithms, Optimization, Powerfulness, Statistical Analysis -
بخش بندی تصاویر رنگی چهره یک مرحله ی ضروری در کاربردهای پردازش تصویر و بینایی کامپیوتر نظیر شناسایی چهره، شناسایی هویت و آنالیز جراحی های پلاستیک چهره است. یکی از مهم ترین روش های بخش بندی تصاویر چهره، روش های مبتنی بر خوشه بندی است. خوشه بند فازی (FCM) یک الگوریتم موثر در بخش بندی تصویر بوده، ولی حساسیت به مقدار اولیه ممکن است باعث شود که این الگوریتم در کمینه مکانی بیافتد. به منظور غلبه بر این مسیله، الگوریتم های فرا-ابتکاری شامل بهینه سازی گرگ خاکستری (GWO) و الگوریتم بهینه سازی نهنگ (WOA) به کار گرفته شده اند. بنابراین، تمرکز اصلی این مقاله بر روی عمل کرد الگوریتم های فرا-ابتکاری در بهینه سازی خوشه بند فازی و کاربرد آن در بخش بندی تصاویر رنگی چهره است. تابع هدف خوشه بند FCM به عنوان یک تابع برآزندگی برای الگوریتم های فرا-ابتکاری درنظر گرفته می شود. این الگوریتم n بردار را به C گروه فازی تقسیم کرده و مرکز خوشه بندی را برای هر گروه محاسبه می کند. همچنین، در این مطالعه سه فضای رنگی چهره شامل YCbCr، YPbPr و YIQ به عنوان داده های ورودی در بهینه سازی تابع برازندگی به کار گرفته شده اند. پس از بیشینه کردن تابع عضویت، بخش بندی تصاویر رنگی چهره بر روی سه پایگاه داده شامل (1) پایگاه داده دانشگاه صنعتی سهند (SUT)، (2) پایگاه داده MR2 و (3)پایگاه داده SCUTFBP انجام شده است. نتایج بخش بندی نشان می دهند که عمل کرد الگوریتم های GWO و WOA در بخش بندی تصاویر رنگی چهره نسبت به سایر الگوریتم های فرا-ابتکاری نظیر الگوریتم ژنتیک (GA)، بهینه سازی ازدحام ذرات (PSO)، الگوریتم بهینه سازی ملخ (GOA) و الگوریتم جستجوی کلاغ (CSA) بهتر بوده و همچنین دارای عمل کرد مناسبی نیز در سرعت همگرایی هستند.کلید واژگان: الگوریتم بهینه سازی نهنگ، الگوریتم های فرا-ابتکاری، بخش بندی تصویر، بهینه سازی گرگ خاکستری، تصاویر رنگی چهره، خوشه بند فازیSegmentation of facial color images is an essential step in the image processing and computer vision applications, such as face recognition, identity recognition, and analysis of facial plastic surgeries. One of the most important methods of facial image segmentation is clustering-based methods. The fuzzy c-means (FCM) clustering is an effective method in the image segmentation, but its sensitivity to initial values may cause that this algorithm fall and stuck into the local minima. To overcome this problem, the meta-heuristic algorithms, including Grey Wolf Optimization (GWO) and Whale Optimization Algorithm (WOA) have been used. Therefore, the main focus of this study is on the performance of the meta-heuristic algorithms in optimizing the FCM algorithm and their applications in the segmentation of facial color images. The objective function of the FCM algorithm is considered as a fitness function for meta-heuristic algorithms. This algorithm divides n vectors into C fuzzy groups and calculates the cluster center for each group. Also in this study, three color spaces (1) YCbCr, (2) YPbPr, and (3) YIQ have used as input data in optimization of the fitness function. After maximization of the membership function, segmentation of facial color images has been done on three database including, (1) Sahand University of Technology (SUT), (2) MR2, and (3) SCUTFBP. The result of segmentation show that convergence speed of the GWO and WOA methods is faster than other meta-heuristic algorithm, such as Genetic Algorithm (GA), Particle Swarm Optimization (PSO), Crow Search Algorithm (CSA), and Grasshopper Optimization Algorithm (GOA) and have a suitable performance in facial image segmentation.Keywords: Whale Optimization Algorithm, meta-heuristic algorithms, Image Segmentation, Grey Wolf Optimization, Facial Color Images, Fuzzy c-means clustering
-
By pervasiveness of cloud computing, a colossal amount of applications from gigantic organizations increasingly tend to rely on cloud services. These demands caused a great number of applications in form of couple of virtual machines (VMs) requests to be executed on data centers’ servers. Some of applications are as big as not possible to be processed upon a single VM. Also, there exists several distributed applications such as MapReduce projects which exploit much number of VMs dispersed over physical machines (PMs) attached with high speed networks. These types of VMs involve mutual traffic transferring which is completely processed as an atomic application. High volume of traffic transfer among VMs may saturate network links and leads performance bottleneck for both data center and applications which seriously threat users’ service level agreement (SLA). Furthermore, communication energy consumption increases when network devices are heavily in use. This paper addresses the virtual machine placement (VMP) problem by considering inter-VM communications on VL2 topology. This is an optimization problem with the aim of network traffic transferring minimization. Dependent VMs are tried to be co-hosted or to be placed in close neighborhoods to minimize the amount of total traffic streaming over the network. A combined meta-heuristic approach based and ACO and GA algorithms is employed to solve the problem. The results of simulations imply the superiority of our proposed approach in comparison with other state-of-the-art approaches in terms of reducing total traffic flow, saving energy, and declining resource dissipation in servers.Keywords: cloud computing, network traffic management, virtual machine placement, VL2, Meta-Heuristic Algorithms
-
Journal of Advances in Computer Engineering and Technology, Volume:1 Issue: 3, Summer 2015, PP 9 -16Wireless Sensor Networks are the new generation of networks that typically are formed great numbers of nodes and the communications of these nodes are done as Wireless. The main goal of these networks is collecting data from neighboring environment of network sensors. Since the sensor nodes are battery operated and there is no possibility of charging or replacing the batteries, the lifetime of the networks is dependent on the energy of sensors. The objective of this research, is to combine the Harmony Search Algorithm and Ant Colony Optimization Algorithm, as successful meta heuristic algorithm to routing at wireless sensor to increase lifetime at this type of networks. To this purpose, algorithm called HS-ACO is suggested. In this algorithm, two criterion of reduction consumption of energy and appropriate distribution of consumption energy between nodes of sensor leads to increase lifetime of network is considered. Results of simulations, show the capability of the proposed algorithm in finding the Proper path and establishment appropriate balance in the energy consumed by the nodes. Propose algorithm is better than Harmony Search algorithm and Ant Colony Optimization algorithm and Genetic Ant algorithm.Keywords: Wireless Sensor Network, routing, meta heuristic algorithms, Harmony Search Algorithm, Ant Colony Optimization Algorithm
-
The Quadratic Assignment is a NP-Complete problem, and deterministic algorithms can only solve smaller instances of the problem (at most in size of 21). Thus, developing of Meta heuristic approaches for the problem is worth considering. In this paper, two algorithms have been proposed. The first method is a kind of ICA algorithm and the second one is a hybrid approach which is based on the ICA as well as Object Migration Learning Automaton. Generally, in basic ICA, weaker countries (solutions) are assimilated into stronger solutions as time goes by; therefore, the algorithm may be stuck in local optimum solutions. However, the global optimums can be obtained by exploring the search space; indeed, the learning automaton used in the proposed hybrid method has this responsibility. A number of instances of the standard library of QAPLIB have been used to evaluate performance of the algorithms; in fact, most of these samples are real engineering problems. Experimental results indicate that the newly developed hybrid method is capable of generating highly suitable solutions which a large majority of them are optimal or near optimal; consequently, this algorithm is an effective way to solve the QAP problem.Keywords: The QAP problem, NP problems, Meta heuristic algorithms, The Imperialist Competitive Algorithm, the Object Migration Learning Automaton
- نتایج بر اساس تاریخ انتشار مرتب شدهاند.
- کلیدواژه مورد نظر شما تنها در فیلد کلیدواژگان مقالات جستجو شدهاست. به منظور حذف نتایج غیر مرتبط، جستجو تنها در مقالات مجلاتی انجام شده که با مجله ماخذ هم موضوع هستند.
- در صورتی که میخواهید جستجو را در همه موضوعات و با شرایط دیگر تکرار کنید به صفحه جستجوی پیشرفته مجلات مراجعه کنید.