Preferred Language
Articles
/
ijs-5387
Distributed Multi-Ant Colony System Algorithm using Raspberry Pi Cluster for Travelling Salesman Problem

     The traveling salesman problem is addressed in this paper by introducing a distributed multi-ant colony algorithm that is implemented on a Raspberry Pi cluster. The implementation of a master and eight workers, each running on Raspberry Pi nodes, is the central component of this novel technique. Each worker is responsible for managing their own colony of ants, while the master coordinates communications among workers’ nodes and assesses the most optimal approach. To put the newly built cluster through its paces, several datasets of traveling salesman problem are used to test the created cluster. The findings of the experiment indicate that a single board computer cluster, which makes use of multi-ant colony algorithm, is a viable alternative for distributed computing. This approach's extensibility options are extensively discussed as well.

Scopus Crossref
View Publication Preview PDF
Quick Preview PDF
Publication Date
Fri Jan 01 2016
Journal Name
Journal Of Engineering
Enhanced Chain-Cluster Based Mixed Routing Algorithm for Wireless Sensor Networks

Energy efficiency is a significant aspect in designing robust routing protocols for wireless sensor networks (WSNs). A reliable routing protocol has to be energy efficient and adaptive to the network size. To achieve high energy conservation and data aggregation, there are two major techniques, clusters and chains. In clustering technique, sensor networks are often divided into non-overlapping subsets called clusters. In chain technique, sensor nodes will be connected with the closest two neighbors, starting with the farthest node from the base station till the closest node to the base station. Each technique has its own advantages and disadvantages which motivate some researchers to come up with a hybrid routing algorit

... Show More
View Publication Preview PDF
Publication Date
Wed Feb 29 2012
Journal Name
Al-khwarizmi Engineering Journal
Design a Fault Tolerance for Real Time Distributed System

This paper designed a fault tolerance for soft real time distributed system (FTRTDS). This system is designed to be independently on specific mechanisms and facilities of the underlying real time distributed system. It is designed to be distributed on all the computers in the distributed system and controlled by a central unit.

Besides gathering information about a target program spontaneously, it provides information about the target operating system and the target hardware in order to diagnose the fault before occurring, so it can handle the situation before it comes on. And it provides a distributed system with the reactive capability of reconfiguring and reinitializing after the occurrence of a failure.

View Publication Preview PDF
Publication Date
Sun Mar 01 2015
Journal Name
Journal Of Engineering
Multi-Sites Multi-Variables Forecasting Model for Hydrological Data using Genetic Algorithm Modeling

A two time step stochastic multi-variables multi-sites hydrological data forecasting model was developed and verified using a case study. The philosophy of this model is to use the cross-variables correlations, cross-sites correlations and the two steps time lag correlations simultaneously, for estimating the parameters of the model which then are modified using the mutation process of the genetic algorithm optimization model. The objective function that to be minimized is the Akiake test value. The case study is of four variables and three sites. The variables are the monthly air temperature, humidity, precipitation, and evaporation; the sites are Sulaimania, Chwarta, and Penjwin, which are located north Iraq. The model performance was

... Show More
View Publication Preview PDF
Publication Date
Fri Jan 01 2016
Journal Name
Journal Of Computer And Communications
Parallel Quick Search Algorithm for the Exact String Matching Problem Using OpenMP

String matching is seen as one of the essential problems in computer science. A variety of computer applications provide the string matching service for their end users. The remarkable boost in the number of data that is created and kept by modern computational devices influences researchers to obtain even more powerful methods for coping with this problem. In this research, the Quick Search string matching algorithm are adopted to be implemented under the multi-core environment using OpenMP directive which can be employed to reduce the overall execution time of the program. English text, Proteins and DNA data types are utilized to examine the effect of parallelization and implementation of Quick Search string matching algorithm on multi-co

... Show More
Crossref (3)
Crossref
View Publication Preview PDF
Publication Date
Fri Jul 01 2022
Journal Name
Iraqi Journal Of Science
Extractive Multi-Document Text Summarization Using Multi-Objective Evolutionary Algorithm Based Model

Automatic document summarization technology is evolving and may offer a solution to the problem of information overload. Multi-document summarization is an optimization problem demanding optimizing more than one objective function concurrently. The proposed work considers a balance of two significant objectives: content coverage and diversity while generating a summary from a collection of text documents. Despite the large efforts introduced from several researchers for designing and evaluating performance of many text summarization techniques, their formulations lack the introduction of any model that can give an explicit representation of – coverage and diversity – the two contradictory semantics of any summary. The design of gener

... Show More
View Publication Preview PDF
Publication Date
Sun Feb 27 2022
Journal Name
Iraqi Journal Of Science
An Improved Meerkat Clan Algorithm for Solving 0-1 Knapsack Problem

     Meerkat Clan Algorithm (MCA) is a nature-based metaheuristic algorithm which imitates the intelligent behavior of the meerkat animal. This paper presents an improvement on the MCA based on a chaotic map and crossover strategy (MCA-CC). These two strategies increase the diversification and intensification of the proposed algorithm and boost the searching ability to find more quality solutions. The 0-1 knapsack problem was solved by the basic MCA and the improved version of this algorithm (MCA-CC). The performance of these algorithms was tested on low and high dimensional problems. The experimental results demonstrate that the proposed algorithm had overcome the basic algorithm in terms of solution quality, speed a

... Show More
Scopus (4)
Crossref (1)
Scopus Crossref
View Publication Preview PDF
Publication Date
Wed Feb 08 2023
Journal Name
Iraqi Journal Of Science
Hybrid Fuzzy Logic and Artificial Bee Colony Algorithm for Intrusion Detection and Classification

In recent years, with the growing size and the importance of computer networks, it is very necessary to provide adequate protection for users data from snooping through the use of one of the protection techniques: encryption, firewall and intrusion detection systems etc. Intrusion detection systems is considered one of the most important components in the computer networks that deal with Network security problems. In this research, we suggested the intrusion detection and classification system through merging Fuzzy logic and Artificial Bee Colony Algorithm. Fuzzy logic has been used to build a classifier which has the ability to distinguish between the behavior of the normal user and behavior of the intruder. The artificial bee colony al

... Show More
View Publication Preview PDF
Publication Date
Sun Apr 29 2018
Journal Name
Iraqi Journal Of Science
Solving Flexible Job Shop Scheduling Problem Using Meerkat Clan Algorithm

Meerkat Clan Algorithm (MCA) that is a swarm intelligence algorithm resulting from watchful observation of the Meerkat (Suricata suricatta) in the Kalahari Desert in southern Africa. Meerkat has some behaviour. Sentry, foraging, and baby-sitter are the behaviour used to build this algorithm through dividing the solution sets into two sets, all the operations are performed on the foraging set. The sentry presents the best solution. The Flexible Job Shop Scheduling Problem (FJSSP) is vital in the two fields of generation administration and combinatorial advancement. In any case, it is very hard to accomplish an ideal answer for this problem with customary streamlining approaches attributable to the high computational unpredictability. Most

... Show More
View Publication Preview PDF
Publication Date
Sun May 28 2017
Journal Name
Ibn Al-haitham Journal For Pure And Applied Sciences
On-Line Navigational Problem of a Mobile Robot Using Genetic Algorithm

  Manufacturing systems of the future foresee the use of intelligent vehicles, optimizing and navigating. The navigational problem is an important and challenging problem in the field of robotics. The robots often find themselves in a situation where they must find a trajectory to another position in their environment, subject to constraints posed by obstacles and the capabilities of the robot itself. On-line navigation is a set of algorithms that plans and executes a trajectory at the same time.         The system adopted in this research searches for a robot collision-free trajectory in a dynamic environment in which obstacles can move while the robot was moving toward the target. So, the ro

... Show More
View Publication Preview PDF
Publication Date
Sun Jan 30 2022
Journal Name
Iraqi Journal Of Science
A New Image Encryption Algorithm Based on Multi Chaotic System

       In recent years, encryption technology has been developed rapidly and many image encryption methods have been put forward. The chaos-based image encryption technique is a modern encryption system for images. To encrypt images, it uses random sequence chaos, which is an efficient way to solve the intractable problem of simple and highly protected image encryption. There are, however, some shortcomings in the technique of chaos-based image encryption, such limited accuracy issue. The approach focused on the chaotic system in this paper is to construct a dynamic IP permutation and S-Box substitution by following steps. First of all, use of a new IP table for more diffusion of al

... Show More
Scopus (14)
Crossref (10)
Scopus Crossref
View Publication Preview PDF