Comparison of Meta-heuristic Algorithms on Benchmark Functions

2019 ◽  
Vol 2 (3) ◽  
pp. 508-517
Author(s):  
FerdaNur Arıcı ◽  
Ersin Kaya
Keyword(s):  
Heuristic Algorithms ◽  
Optimization Problems ◽  
Search Algorithm ◽  
Optimization Algorithms ◽  
Gravitational Search Algorithm ◽  
Differential Evolution Algorithm ◽  
Population Based ◽  
Time Interval ◽  
Bee Colony ◽  
Different Characteristics

Optimization is a process to search the most suitable solution for a problem within an acceptable time interval. The algorithms that solve the optimization problems are called as optimization algorithms. In the literature, there are many optimization algorithms with different characteristics. The optimization algorithms can exhibit different behaviors depending on the size, characteristics and complexity of the optimization problem. In this study, six well-known population based optimization algorithms (artificial algae algorithm - AAA, artificial bee colony algorithm - ABC, differential evolution algorithm - DE, genetic algorithm - GA, gravitational search algorithm - GSA and particle swarm optimization - PSO) were used. These six algorithms were performed on the CEC’17 test functions. According to the experimental results, the algorithms were compared and performances of the algorithms were evaluated.

Segmentation of Brain Tumors using Meta Heuristic Algorithms

2014 ◽  
Vol 2014 (1) ◽  
pp. 1-10 ◽  
Author(s):  
Jobin Christ ◽  
◽  
S. Sivagowri ◽  
Ganesh Babu ◽  
◽  
...  
Keyword(s):  
Brain Tumors ◽  
Heuristic Algorithms

Two Enhanced Heuristic Algorithms for the Minimum Initial Marking Problem of Petri Nets

2009 ◽  
Vol E92-A (11) ◽  
pp. 2732-2744
Author(s):  
Satoru OCHIIWA ◽  
Satoshi TAOKA ◽  
Masahiro YAMAUCHI ◽  
Toshimasa WATANABE
Keyword(s):  
Petri Nets ◽  
Heuristic Algorithms

Two Heuristic Algorithms for the Minimum Initial Marking Problem of Timed Petri Nets

2013 ◽  
Vol E96.A (2) ◽  
pp. 540-553
Author(s):  
Satoru OCHIIWA ◽  
Satoshi TAOKA ◽  
Masahiro YAMAUCHI ◽  
Toshimasa WATANABE
Keyword(s):  
Petri Nets ◽  
Heuristic Algorithms ◽  
Timed Petri Nets

A Hybrid Approach for Virtual Machine Migration in Cloud Computing Environment

2017 ◽  
Vol 7 (9) ◽  
pp. 30 ◽  
Author(s):  
Ramandeep Kaur
Keyword(s):  
Cloud Computing ◽  
Virtual Machine ◽  
Heuristic Algorithms ◽  
Hybrid Approach ◽  
Cloud Infrastructure ◽  
Virtual Machine Migration ◽  
Bee Colony ◽  
Effective Manner ◽  
Effective Performance

A lot of research has been done in the field of cloud computing in computing domain.  For its effective performance, variety of algorithms has been proposed. The role of virtualization is significant and its performance is dependent on VM Migration and allocation. More of the energy is absorbed in cloud; therefore, the utilization of numerous algorithms is required for saving energy and efficiency enhancement in the proposed work. In the proposed work, green algorithm has been considered with meta heuristic algorithms, ABC (Artificial Bee colony .Every server has to perform different or same functions. A cloud computing infrastructure can be modelled as Primary Machineas a set of physical Servers/host PM1, PM2, PM3… PMn. The resources of cloud infrastructure can be used by the virtualization technology, which allows one to create several VMs on a physical server or host and therefore, lessens the hardware amount and enhances the resource utilization. The computing resource/node in cloud is used through the virtual machine. To address this problem, data centre resources have to be managed in resource -effective manner for driving Green Cloud computing that has been proposed in this work using Virtual machine concept with ABC and Neural Network optimization algorithm. The simulations have been carried out in CLOUDSIM environment and the parameters like SLA violations, Energy consumption and VM migrations along with their comparison with existing techniques will be performed.

Investigation of the diversity index trend of the Search Group Algorithm in comparison with others meta-heuristic algorithms

2017 ◽  
Author(s):  
Rafael Souza ◽  
Leandro Fadel Miguel ◽  
Matheus Silva Gonçalves ◽  
Rafael Holdorf Lopez
Keyword(s):  
Heuristic Algorithms ◽  
Diversity Index

Heuristic Algorithms for Waste Load Allocation in a River Basin

1989 ◽  
Vol 21 (8-9) ◽  
pp. 1057-1064 ◽  
Author(s):  
Vijay Joshi ◽  
Prasad Modak
Keyword(s):  
Dynamic Programming ◽  
Heuristic Algorithms ◽  
Water Quality Management ◽  
User Preferences ◽  
Theory And Practice ◽  
Waste Load Allocation ◽  
Practical Applications ◽  
Waste Load ◽  
On Line ◽  
The One

Waste load allocation for rivers has been a topic of growing interest. Dynamic programming based algorithms are particularly attractive in this context and are widely reported in the literature. Codes developed for dynamic programming are however complex, require substantial computer resources and importantly do not allow interactions of the user. Further, there is always resistance to utilizing mathematical programming based algorithms for practical applications. There has been therefore always a gap between theory and practice in systems analysis in water quality management. This paper presents various heuristic algorithms to bridge this gap with supporting comparisons with dynamic programming based algorithms. These heuristics make a good use of the insight gained in the system's behaviour through experience, a process akin to the one adopted by field personnel and therefore can readily be understood by a user familiar with the system. Also they allow user preferences in decision making via on-line interaction. Experience has shown that these heuristics are indeed well founded and compare very favourably with the sophisticated dynamic programming algorithms. Two examples have been included which demonstrate such a success of the heuristic algorithms.

A Comparative Study of Computational Intelligence Algorithms for Sensor Localization

2019 ◽  
Vol 9 (2) ◽  
pp. 224-236
Author(s):  
Vaishali R. Kulkarni ◽  
Veena Desai ◽  
Raghavendra Kulkarni
Keyword(s):  
Firefly Algorithm ◽  
Heuristic Algorithms ◽  
Computing Time ◽  
Sensor Nodes ◽  
Convergence Time ◽  
Localization Error ◽  
Location Awareness ◽  
Cultural Algorithm ◽  
Localization Accuracy ◽  
Multi Stage

Background & Objective: Location of sensors is an important information in wireless sensor networks for monitoring, tracking and surveillance applications. The accurate and quick estimation of the location of sensor nodes plays an important role. Localization refers to creating location awareness for as many sensor nodes as possible. Multi-stage localization of sensor nodes using bio-inspired, heuristic algorithms is the central theme of this paper. Methodology: Biologically inspired heuristic algorithms offer the advantages of simplicity, resourceefficiency and speed. Four such algorithms have been evaluated in this paper for distributed localization of sensor nodes. Two evolutionary computation-based algorithms, namely cultural algorithm and the genetic algorithm, have been presented to optimize the localization process for minimizing the localization error. The results of these algorithms have been compared with those of swarm intelligence- based optimization algorithms, namely the firefly algorithm and the bee algorithm. Simulation results and analysis of stage-wise localization in terms of number of localized nodes, computing time and accuracy have been presented. The tradeoff between localization accuracy and speed has been investigated. Results: The comparative analysis shows that the firefly algorithm performs the localization in the most accurate manner but takes longest convergence time. Conclusion: Further, the cultural algorithm performs the localization in a very quick time; but, results in high localization error.

Multi Disease-Prediction Framework Using Hybrid Deep Learning: An Optimal Prediction Model (Preprint)

2020 ◽  
Author(s):  
Anusha Ampavathi ◽  
Vijaya Saradhi T
Keyword(s):  
Feature Extraction ◽  
Big Data ◽  
Deep Learning ◽  
Weight Function ◽  
Optimization Algorithm ◽  
Large Scale ◽  
Heuristic Algorithms ◽  
Disease Prediction ◽  
Health Care Decisions ◽  
Proposed Model

UNSTRUCTURED Big data and its approaches are generally helpful for healthcare and biomedical sectors for predicting the disease. For trivial symptoms, the difficulty is to meet the doctors at any time in the hospital. Thus, big data provides essential data regarding the diseases on the basis of the patient’s symptoms. For several medical organizations, disease prediction is important for making the best feasible health care decisions. Conversely, the conventional medical care model offers input as structured that requires more accurate and consistent prediction. This paper is planned to develop the multi-disease prediction using the improvised deep learning concept. Here, the different datasets pertain to “Diabetes, Hepatitis, lung cancer, liver tumor, heart disease, Parkinson’s disease, and Alzheimer’s disease”, from the benchmark UCI repository is gathered for conducting the experiment. The proposed model involves three phases (a) Data normalization (b) Weighted normalized feature extraction, and (c) prediction. Initially, the dataset is normalized in order to make the attribute's range at a certain level. Further, weighted feature extraction is performed, in which a weight function is multiplied with each attribute value for making large scale deviation. Here, the weight function is optimized using the combination of two meta-heuristic algorithms termed as Jaya Algorithm-based Multi-Verse Optimization algorithm (JA-MVO). The optimally extracted features are subjected to the hybrid deep learning algorithms like “Deep Belief Network (DBN) and Recurrent Neural Network (RNN)”. As a modification to hybrid deep learning architecture, the weight of both DBN and RNN is optimized using the same hybrid optimization algorithm. Further, the comparative evaluation of the proposed prediction over the existing models certifies its effectiveness through various performance measures.

Sign in / Sign up

Export Citation Format

Share Document