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.
Stick- slip is the continuous stopping& release of the Bit/BHA due to the irregular down-hole rotation prompted by the existing relationship between the friction torque and the torque applied from the surface to free the bit.
Friction coefficient between BHA and wellbore is the main player of stick slip amount, which can be mitigated by support a good lubricators as additives in drilling mud.
Mathematical (or empirical) solves should be done through adjusting all parameters which supposed to reduce stick- slip as low as possible using different models, one of the main parameters is drilling mud. As per Nanoparticles drilling fluid is a new technology that offers high performance
... Show MoreThis paper provides a four-stage Trigonometrically Fitted Improved Runge-Kutta (TFIRK4) method of four orders to solve oscillatory problems, which contains an oscillatory character in the solutions. Compared to the traditional Runge-Kutta method, the Improved Runge-Kutta (IRK) method is a natural two-step method requiring fewer steps. The suggested method extends the fourth-order Improved Runge-Kutta (IRK4) method with trigonometric calculations. This approach is intended to integrate problems with particular initial value problems (IVPs) using the set functions and for trigonometrically fitted. To improve the method's accuracy, the problem primary frequency is used. The novel method is more accurate than the conventional Runge-Ku
... Show MoreThis research deals with the design and simulation of a solar power system consisting of a KC200GT solar panel, a closed loop boost converter and a three phase inverter by using Matlab / Simulink. The mathematical equations of the solar panel design are presented. The electrical characteristics of the panel are tested at the values of 1000 for light radiation and 25 °C for temperature environment. The Proportional Integral (PI) controller is connected as feedback with the Boost converter to obtain a stable output voltage by reducing the oscillations in the voltage to charge a battery connected to the output of the converter. Two methods (Particle Swarm Optimization (PSO) and Zeigler- Nichols) are used for tuning
... Show More<span>Distributed denial-of-service (DDoS) attack is bluster to network security that purpose at exhausted the networks with malicious traffic. Although several techniques have been designed for DDoS attack detection, intrusion detection system (IDS) It has a great role in protecting the network system and has the ability to collect and analyze data from various network sources to discover any unauthorized access. The goal of IDS is to detect malicious traffic and defend the system against any fraudulent activity or illegal traffic. Therefore, IDS monitors outgoing and incoming network traffic. This paper contains a based intrusion detection system for DDoS attack, and has the ability to detect the attack intelligently, dynami
... Show MoreWithin this research, The problem of scheduling jobs on a single machine is the subject of study to minimize the multi-criteria and multi-objective functions. The first problem, minimizing the multi-criteria, which include Total Completion Time, Total Late Work, and Maximum Earliness Time (∑𝐶𝑗, ∑𝑉𝑗, 𝐸𝑚𝑎𝑥), and the second problem, minimizing the multi-objective functions ∑𝐶𝑗 + ∑𝑉𝑗 +𝐸𝑚𝑎𝑥 are the problems at hand in this paper. In this study, a mathematical model is created to address the research problems, and some rules provide efficient (optimal) solutions to these problems. It has also been proven that each optimal solution for ∑𝐶𝑗 + ∑𝑉𝑗 + 𝐸𝑚𝑎𝑥 is an effic
... Show MoreIn this paper, we studied the travelling wave solving for some models of Burger's equations. We used sine-cosine method to solution nonlinear equation and we used direct solution after getting travelling wave equation.
Association rules mining (ARM) is a fundamental and widely used data mining technique to achieve useful information about data. The traditional ARM algorithms are degrading computation efficiency by mining too many association rules which are not appropriate for a given user. Recent research in (ARM) is investigating the use of metaheuristic algorithms which are looking for only a subset of high-quality rules. In this paper, a modified discrete cuckoo search algorithm for association rules mining DCS-ARM is proposed for this purpose. The effectiveness of our algorithm is tested against a set of well-known transactional databases. Results indicate that the proposed algorithm outperforms the existing metaheuristic methods.
Most vegetation’s are Land cover (LC) for the globe, and there is an increased attention to plants since they represent an element of balance to natural ecology and maintain the natural balance of rapid changes due to systematic and random human uses, including the subject of the current study (Bassia eriophora ) Which represent an essential part of the United Nations system for land cover classification (LCCS), developed by the World Food Organization (FAO) and the world Organization for environmental program (UNEP), to observe basic environmental elements with modern techniques. Although this plant is distributed all over Iraq, we found that this plant exists primarily in the middle
... Show MoreToday’s academics have a major hurdle in solving combinatorial problems in the actual world. It is nevertheless possible to use optimization techniques to find, design, and solve a genuine optimal solution to a particular problem, despite the limitations of the applied approach. A surge in interest in population-based optimization methodologies has spawned a plethora of new and improved approaches to a wide range of engineering problems. Optimizing test suites is a combinatorial testing challenge that has been demonstrated to be an extremely difficult combinatorial optimization limitation of the research. The authors have proposed an almost infallible method for selecting combinatorial test cases. It uses a hybrid whale–gray wol
... Show More