A numerical algorithm for solving linear and non-linear fractional differential equations is proposed based on the Bees algorithm and Chebyshev polynomials. The proposed algorithm was applied to a set of numerical examples. Faster results are obtained compared to the wavelet methods.
This paper deals with testing a numerical solution for the discrete classical optimal control problem governed by a linear hyperbolic boundary value problem with variable coefficients. When the discrete classical control is fixed, the proof of the existence and uniqueness theorem for the discrete solution of the discrete weak form is achieved. The existence theorem for the discrete classical optimal control and the necessary conditions for optimality of the problem are proved under suitable assumptions. The discrete classical optimal control problem (DCOCP) is solved by using the mixed Galerkin finite element method to find the solution of the discrete weak form (discrete state). Also, it is used to find the solution for the discrete adj
... Show MoreThe aim of robot path planning is to search for a safe path for the mobile robot. Even though there exist various path planning algorithms for mobile robots, yet only a few are optimized. The optimized algorithms include the Particle Swarm Optimization (PSO) that finds the optimal path with respect to avoiding the obstacles while ensuring safety. In PSO, the sub-optimal solution takes place frequently while finding a solution to the optimal path problem. This paper proposes an enhanced PSO algorithm that contains an improved particle velocity. Experimental results show that the proposed Enhanced PSO performs better than the standard PSO in terms of solution’s quality. Hence, a mobile robot implementing the proposed algorithm opera
... Show MoreThis paper applies the Modified Adomian Decomposition Method (MADM) for solving Integro-Differential Inequality, this method is one of effective to construct analytic approximate solutions for linear and nonlinear integro-differential inequalities without solving many integrals and transformed or discretization. Several examples are presented, the analytic results show that this method is a promising and powerful for solving these problems.
The paper aims to propose Teaching Learning based Optimization (TLBO) algorithm to solve 3-D packing problem in containers. The objective which can be presented in a mathematical model is optimizing the space usage in a container. Besides the interaction effect between students and teacher, this algorithm also observes the learning process between students in the classroom which does not need any control parameters. Thus, TLBO provides the teachers phase and students phase as its main updating process to find the best solution. More precisely, to validate the algorithm effectiveness, it was implemented in three sample cases. There was small data which had 5 size-types of items with 12 units, medium data which had 10 size-types of items w
... Show MoreThe nonlinear refractive index and the nonlinear absorption coefficient of unmodified and functional poly(methyl methacrylate) PMMA films were studied before and after the addition of the filler by the z-scan technique, using a Q-switched Nd:YAG laser at two wavelengths: 532 nm and 1064 nm, and at three input energies (13, 33 and 53) mJ. Both linear and nonlinear refractive indices and absorption coefficients of polymer films were studied by using UV-VIS spectrophotometer. The results show that the creation of functional PMMA from unmodified PMMA will increase the nonlinear optical properties in the functional PMMA/copper matrix more than in the unmodified PMMA/copper matrix. Hence, the functional PMMA appears promising as a useful third
... Show MoreThe 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
... Show MoreThe principal goal guiding any designed encryption algorithm must be security against unauthorized attackers. Within the last decade, there has been a vast increase in the communication of digital computer data in both the private and public sectors. Much of this information has a significant value; therefore it does require the protection by design strength algorithm to cipher it. This algorithm defines the mathematical steps required to transform data into a cryptographic cipher and also to transform the cipher back to the original form. The Performance and security level is the main characteristics that differentiate one encryption algorithm from another. In this paper suggested a new technique to enhance the performance of the Data E
... Show MoreIn this Paper, we proposed two new predictor corrector methods for solving Kepler's equation in hyperbolic case using quadrature formula which plays an important and significant rule in the evaluation of the integrals. The two procedures are developed that, in two or three iterations, solve the hyperbolic orbit equation in a very efficient manner, and to an accuracy that proves to be always better than 10-15. The solution is examined with and with grid size , using the first guesses hyperbolic eccentric anomaly is and , where is the eccentricity and is the hyperbolic mean anomaly.
While analytical solutions to Quadratic Assignment Problems (QAP) have indeed been since a long time, the expanding use of Evolutionary Algorithms (EAs) for similar issues gives a framework for dealing with QAP with an extraordinarily broad scope. The study's key contribution is that it normalizes all of the criteria into a single scale, regardless of their measurement systems or the requirements of minimum or maximum, relieving the researchers of the exhaustively quantifying the quality criteria. A tabu search algorithm for quadratic assignment problems (TSQAP) is proposed, which combines the limitations of tabu search with a discrete assignment problem. The effectiveness of the proposed technique has been compared to well-established a
... Show MoreIn this study, the quality assurance of the linear accelerator available at the Baghdad Center for Radiation Therapy and Nuclear Medicine was verified using Star Track and Perspex. The study was established from August to December 2018. This study showed that there was an acceptable variation in the dose output of the linear accelerator. This variation was ±2% and it was within the permissible range according to the recommendations of the manufacturer of the accelerator (Elkta).