Crow Search Algorithm (CSA) can be defined as one of the new swarm intelligence algorithms that has been developed lately, simulating the behavior of a crow in a storage place and the retrieval of the additional food when required. In the theory of the optimization, a crow represents a searcher, the surrounding environment represents the search space, and the random storage of food location represents a feasible solution. Amongst all the food locations, the one where the maximum amount of the food is stored is considered as the global optimum solution, and objective function represents the food amount. Through the simulation of crows’ intelligent behavior, the CSA attempts to find the optimum solutions to a variety of the problems that are related to the optimization. This study presents a new adaptive distributed algorithm of routing on CSA. Because the search space may be modified according to the size and kind of the network, the algorithm can be easily customized to the issue space. In contrast to population-based algorithms that have a broad and time-consuming search space. For ten networks of various sizes, the technique was used to solve the shortest path issue. And its capability for solving the problem of the routing in the switched networks is examined: detecting the shortest path in the process of a data packet transfer amongst the networks. The suggested method was compared with four common metaheuristic algorithms (which are: ACO, AHA, PSO and GA) on 10 datasets (integer, weighted, and not negative graphs) with a variety of the node sizes (10 - 297 nodes). The results have proven that the efficiency of the suggested methods is promising as well as competing with other approaches.
A new Differential Evolution (ARDE) algorithm is introduced that automatically adapt a repository of DE strategies and parameters adaptation schemes of the mutation factor and the crossover rate to avoid the problems of stagnation and make DE responds to a wide range of function characteristics at different stages of the evolution. ARDE algorithm makes use of JADE strategy and the MDE_pBX parameters adaptive schemes as frameworks. Then a new adaptive procedure called adaptive repository (AR) has been developed to select the appropriate combinations of the JADE strategies and the parameter control schemes of the MDE_pBX to generate the next population based on their fitness values. Experimental results have been presented to confirm the reli
... Show MoreIn this paper, an adaptive polynomial compression technique is introduced of hard and soft thresholding of transformed residual image that efficiently exploited both the spatial and frequency domains, where the technique starts by applying the polynomial coding in the spatial domain and then followed by the frequency domain of discrete wavelet transform (DWT) that utilized to decompose the residual image of hard and soft thresholding base. The results showed the improvement of adaptive techniques compared to the traditional polynomial coding technique.
The Sliding Mode Control (SMC) has been among powerful control techniques increasingly. Much attention is paid to both theoretical and practical aspects of disciplines due to their distinctive characteristics such as insensitivity to bounded matched uncertainties, reduction of the order of sliding equations of motion, decoupling mechanical systems design. In the current study, two-link robot performance in the Classical SMC is enhanced via Adaptive Sliding Mode Controller (ASMC) despite uncertainty, external disturbance, and coulomb friction. The key idea is abstracted as follows: switching gains are depressed to the low allowable values, resulting in decreased chattering motion and control's efforts of the two-link robo
... Show MoreAbstract-Servo motors are important parts of industry automation due to their several advantages such as cost and energy efficiency, simple design, and flexibility. However, the position control of the servo motor is a difficult task because of different factors of external disturbances, nonlinearities, and uncertainties. To tackle these challenges, an adaptive integral sliding mode control (AISMC) is proposed, in which a novel bidirectional adaptive law is constructed to reduce the control chattering. The proposed control has three steps to be designed. Firstly, a full-order integral sliding manifold is designed to improve the servo motor position tracking performance, in which the reaching phase is eliminated to achieve the invariance of
... Show MoreThe research aims to identify the concept of green taxes and their role in reducing environmental pollution through the poll of Abnh of taxpayers and employees of the General Authority for taxes totaling 200 individual .autam adoption of the resolution as a tool head for the collection of data and information from the sample and analyzed their responses using a statistical program (spss - 10), and calculating the percentages and the arithmetic mean, standard deviation and research found to a number of conclusions, notably the lack of legislation with the challenges and the difficulty of the existence of a measure or a standard lack of planning for the application of environmental taxes that the state taxation application between the Gene
... Show MoreIn this paper, the Adomian decomposition method (ADM) is successfully applied to find the approximate solutions for the system of fuzzy Fredholm integral equations (SFFIEs) and we also study the convergence of the technique. A consistent way to reduce the size of the computation is given to reach the exact solution. One of the best methods adopted to determine the behavior of the approximate solutions. Finally, the problems that have been addressed confirm the validity of the method applied in this research using a comparison by combining numerical methods such as the Trapezoidal rule and Simpson rule with ADM.
The aim of this article is to solve the Volterra-Fredholm integro-differential equations of fractional order numerically by using the shifted Jacobi polynomial collocation method. The Jacobi polynomial and collocation method properties are presented. This technique is used to convert the problem into the solution of linear algebraic equations. The fractional derivatives are considered in the Caputo sense. Numerical examples are given to show the accuracy and reliability of the proposed technique.