The Traveling Salesman Problem is a story application of Atom Swarm Optimizations in this research. We have developed several novel techniques intended for solving TSP with PSO. Additionally, we introduced the notions to Swap Operative and Swap Chronological sequence and redefining the remaining operatives their foundation; that way, the study created unique PSO. Research prove it can produce satisfactory outcomes. The aim of this paper be there to assess the functioning of particle swarm optimization, for the going salesman issue TSP. The solution to this trouble is common to be NP-hard, it has N! permutations. The study's goal is to examine the capacity of both algorithms to solve intercontinental and other benchmark problems. Overall, the results suggest that used algorithms know how to understand good quality explanations than PSO algorithm, but they are not good enough in terms of normal generation
The biometric-based keys generation represents the utilization of the extracted features from the human anatomical (physiological) traits like a fingerprint, retina, etc. or behavioral traits like a signature. The retina biometric has inherent robustness, therefore, it is capable of generating random keys with a higher security level compared to the other biometric traits. In this paper, an effective system to generate secure, robust and unique random keys based on retina features has been proposed for cryptographic applications. The retina features are extracted by using the algorithm of glowworm swarm optimization (GSO) that provides promising results through the experiments using the standard retina databases. Additionally, in order t
... Show Morethis paper presents a novel method for solving nonlinear optimal conrol problems of regular type via its equivalent two points boundary value problems using the non-classical
This article studies the nonlocal inverse boundary value problem for a rectangular domain, a second-order, elliptic equation and a two-dimensional equation. The main objective of the article is to find the unidentified coefficient and provide a solution to the problem. The two-dimensional second-order, convection equation is solved directly using the finite difference method (FDM). However, the inverse problem was successfully solved the MATLAB subroutine lsqnonlin from the optimization toolbox after reformulating it as a nonlinear regularized least-square optimization problem with a simple bound on the unknown quantity. Considering that the problem under study is often ill-posed and that even a small error in the input data can hav
... Show MoreAvery large numbers of articles are made by powder metallurgical methods using electrolytically reduced metal powders. Iron powder is one of these powders which play an important role in this field. Its preparation by electrolytic method is economic in comparison with the traditional methods (Atomization and carbonyl processes).
An electrochemical cell consisting of two electrodes (stainless steel cathode and iron anode, 99.9%) was used to study the electrolytic preparation of iron powder with particle size less than 106µm directly as powde1y form. Ferrous sulphate electrolyte was used containing sodium chloride as a stabilizing agent. The produced powder was thoroughly washed with an acidified distilled water and absolute ethan
... Show MoreThe aim of the present study was to develop theophylline (TP) inhalable sustained delivery system by preparing solid lipid microparticles using glyceryl behenate (GB) and poloxamer 188 (PX) as a lipid carrier and a surfactant respectively. The method involves loading TP nanoparticles into the lipid using high shear homogenization – ultrasonication technique followed by lyophilization. The compositional variations and interactions were evaluated using response surface methodology, a Box – Behnken design of experiment (DOE). The DOE constructed using TP (X1), GB (X2) and PX (X3) levels as independent factors. Responses measured were the entrapment efficiency (% EE) (Y1), mass median
... Show MoreThe Ant System Algorithm (ASA) is a member of the ant colony algorithms family in swarm intelligence methods (part of the Artificial Intelligence field), which is based on the behavior of ants seeking a path and a source of food in their colonies. The aim of This algorithm is to search for an optimal solution for Combinational Optimization Problems (COP) for which is extremely difficult to find solution using the classical methods like linear and non-linear programming methods.
The Ant System Algorithm was used in the management of water resources field in Iraq, specifically for Haditha dam which is one of the most important dams in Iraq. The target is to find out an efficient management system for
... Show MoreMolasse medium containing different concentrations of (NH4)2 SO4, (NH4)3 PO4, urea, KCI, and P2O5 were compared with the medium used for commercial production of C. utilis in a factory south of Iraq. An efficient medium, which produced 19. 16% dry wt. and 5. 78% protein, was developed. The effect of adding various concentrations of micronutrients (FeSO4, 7T20, MnSO4. 7H20, ZnSO4. 7E20) was also studied. Results showed that FeSo4. 7H20 caused a noticeable increase in both dry wt. and protein content of the yeast.
Several attempts have been made to modify the quasi-Newton condition in order to obtain rapid convergence with complete properties (symmetric and positive definite) of the inverse of Hessian matrix (second derivative of the objective function). There are many unconstrained optimization methods that do not generate positive definiteness of the inverse of Hessian matrix. One of those methods is the symmetric rank 1( H-version) update (SR1 update), where this update satisfies the quasi-Newton condition and the symmetric property of inverse of Hessian matrix, but does not preserve the positive definite property of the inverse of Hessian matrix where the initial inverse of Hessian matrix is positive definiteness. The positive definite prope
... Show More