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.
In this article, we propose a Bayesian Adaptive bridge regression for ordinal model. We developed a new hierarchical model for ordinal regression in the Bayesian adaptive bridge. We consider a fully Bayesian approach that yields a new algorithm with tractable full conditional posteriors. All of the results in real data and simulation application indicate that our method is effective and performs very good compared to other methods. We can also observe that the estimator parameters in our proposed method, compared with other methods, are very close to the true parameter values.
Position control of servo motor systems is a challenging task because of inevitable factors such as uncertainties, nonlinearities, parametric variations, and external perturbations. In this article, to alleviate the above issues, a practical adaptive fast terminal sliding mode control (PAFTSMC) is proposed for better tracking performance of the servo motor system by using a state observer and bidirectional adaptive law. First, a smooth-tangent-hyperbolic-function-based practical fast terminal sliding mode control (PFTSM) surface is designed to ensure not only fast finite time tracking error convergence but also chattering reduction. Second, the PAFTSMC is proposed for the servo motor, in which a two-way adaptive law is designed to further s
... Show MoreIn this paper we will investigate some Heuristic methods to solve travelling salesman problem. The discussed methods are Minimizing Distance Method (MDM), Branch and Bound Method (BABM), Tree Type Heuristic Method (TTHM) and Greedy Method (GRM).
The weak points of MDM are manipulated in this paper. The Improved MDM (IMDM) gives better results than classical MDM, and other discussed methods, while the GRM gives best time for 5≤ n ≤500, where n is the number of visited cities.
In this article, the boundary value problem of convection propagation through the permeable fin in a natural convection environment is solved by the Haar wavelet collocation method (HWCM). We also compare the solutions with the application of a semi-analytical method , namely the Temimi and Ansari (TAM), that is characterized by accuracy and efficiency.The proposed method is also characterized by simplicity and efficiency. The possibility of applying the proposed method to many types of linear or nonlinear ordinary and partial differential equations.
This paper aimed to determine the Optimal Reliable Frequency (ORF) that can maintain certain connection link between different transmitter/receiver stations laid over the Iraqi territory. Three different transmitting sites were chosen as tested stations located in the northern, central, and southern regions of Iraq. These sites are Mosul, Baghdad, and Basra, respectively. In this study, the years 2009 and 2014, which represent the minimum and maximum years of solar cycle 24, were chosen to examine the effect of low and high solar activity on the determined ORF. The datasets of the Best Usable Frequency (BUF) were calculated using the ASAPS international communication model. An analytical study was made on the generated BUF parameter data
... Show MoreThe research dealt with the analysis of the relations between the GDP of the agricultural sector in Iraq, oil prices, the exchange rate and the GDP both on the short term and long term. The research adopted data analysis for the period from 1980-2019 using the ARDL model. the results indicate the existence of long-term relationships between oil prices and the prices of each agricultural commodity at a significance level of 5%. Also, oil prices have a negative consequence on agricultural production in Iraq, and the Iraqi economy is a rentier economy that depends mainly on oil as a source of income and budget financing.
Simulated annealing (SA) has been an effective means that can address difficulties related to optimization problems. is now a common discipline for research with several productive applications such as production planning. Due to the fact that aggregate production planning (APP) is one of the most considerable problems in production planning, in this paper, we present multi-objective linear programming model for APP and optimized by . During the course of optimizing for the APP problem, it uncovered that the capability of was inadequate and its performance was substandard, particularly for a sizable controlled problem with many decision variables and plenty of constraints. Since this algorithm works sequentially then the current state wi
... Show More