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 via

The emphasis of Master Production Scheduling (MPS) or tactic planning is on time and spatial disintegration of the cumulative planning targets and forecasts, along with the provision and forecast of the required resources. This procedure eventually becomes considerably difficult and slow as the number of resources, products and periods considered increases. A number of studies have been carried out to understand these impediments and formulate algorithms to optimise the production planning problem, or more specifically the master production scheduling (MPS) problem. These algorithms include an Evolutionary Algorithm called Genetic Algorithm, a Swarm Intelligence methodology called Gravitational Search Algorithm (GSA), Bat Algorithm (BAT), T

Isolation and identification of bacterial isolates were carried out according to the morphology and biochemical characteristics on one hundred and twenty stool specimens collected from children under five years old via using biochemical tests and Api 20E compact system for further confirmation. Bacterial isolates were distributed as (34.48, 20.68, 5.17,0.86) % for Escherichia coli, Salmonella typhi ,Enterobacter aerogenos, Citrobacter freundii and Hafnia alvei respectively and 9.48 % for each Proteus mirabilis, Pseudomonas aeruginosa and Klebsiella Pneumonia. As well as, 2.58% for both Shigella sonnei and Serratia marcescens. Antibiotic susceptibility test for 116 bacterial isolates was performed towards 20 antibiotics types using disk d

A mathematical method with a new algorithm with the aid of Matlab language is proposed to compute the linear equivalence (or the recursion length) of the pseudo-random key-stream periodic sequences using Fourier transform. The proposed method enables the computation of the linear equivalence to determine the degree of the complexity of any binary or real periodic sequences produced from linear or nonlinear key-stream generators. The procedure can be used with comparatively greater computational ease and efficiency. The results of this algorithm are compared with Berlekamp-Massey (BM) method and good results are obtained where the results of the Fourier transform are more accurate than those of (BM) method for computing the linear equivalenc

The essential objective of this paper is to introduce new notions of fibrewise topological spaces on D that are named to be upper perfect topological spaces, lower perfect topological spaces, multi-perfect topological spaces, fibrewise upper perfect topological spaces, and fibrewise lower perfect topological spaces. fibrewise multi-perfect topological spaces, filter base, contact point, rigid, multi-rigid, multi-rigid, fibrewise upper weakly closed, fibrewise lower weakly closed, fibrewise multi-weakly closed, set, almost upper perfect, almost lower perfect, almost multi-perfect, fibrewise almost upper perfect, fibrewise almost lower perfect, fibrewise almost multi-perfect, upper^* continuous fibrewise upper^∗ topol