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

     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
Sun Jan 01 2012
Journal Name
International Journal Of Contemporary Mathematical Sciences
Pre-Topology Generated by the Short Path Problems
...Show More Authors

Let G be a graph, each edge e of which is given a weight w(e). The shortest path problem is a path of minimum weight connecting two specified vertices a and b, and from it we have a pre-topology. Furthermore, we study the restriction and separators in pre-topology generated by the shortest path problems. Finally, we study the rate of liaison in pre-topology between two subgraphs. It is formally shown that the new distance measure is a metric

Preview PDF
Publication Date
Mon Sep 16 2019
Journal Name
Ibn Al-haitham Journal For Pure And Applied Sciences
Filter Bases and j-ω-Perfect Mappings
...Show More Authors

This paper consist some new generalizations of some definitions such: j-ω-closure converge to a point,  j-ω-closure directed toward a set, almost  j-ω-converges to a set, almost  j-ω-cluster point, a set  j-ω-H-closed relative, j-ω-closure continuous mappings, j-ω-weakly continuous mappings, j-ω-compact mappings, j-ω-rigid a set, almost j-ω-closed mappings and  j-ω-perfect mappings. Also, we prove several results concerning it, where j ÃŽ{q, δ,a, pre, b, b}.

 

View Publication Preview PDF
Crossref
Publication Date
Mon Aug 01 2016
Journal Name
Journal Of Economics And Administrative Sciences
طرائق جديدة لحل مشاكل البرمجة الخطية الضبابية المتماثلة
...Show More Authors

Several authors have used ranking function for solving linear programming problem. In This paper is proposed two ranking function for solving fuzzy linear programming and compare these two approach with trapezoidal fuzzy number .The proposed approach is very easy to understand and it can applicable, also the data were chosen from general company distribution of dairy (Canon company) was proposed test approach and compare; This paper prove that the second proposed approach is better to give the results and satisfy the minimal cost using Q.M. Software

 

View Publication Preview PDF
Crossref
Publication Date
Sat Oct 01 2016
Journal Name
Journal Of Theoretical And Applied Information Technology
Factors affecting global virtual teams’ performance in software projects
...Show More Authors

Scopus (23)
Scopus