This paper presents a meta-heuristic swarm based optimization technique for solving robot path planning. The natural activities of actual ants inspire which named Ant Colony Optimization. (ACO) has been proposed in this work to find the shortest and safest path for a mobile robot in different static environments with different complexities. A nonzero size for the mobile robot has been considered in the project by taking a tolerance around the obstacle to account for the actual size of the mobile robot. A new concept was added to standard Ant Colony Optimization (ACO) for further modifications. Simulations results, which carried out using MATLAB 2015(a) environment, prove that the suggested algorithm outperforms the standard version of ACO algorithm for the same problem with the same environmental conditions by providing the shortest path for multiple testing environments.
A finite element is a study that is capable of predicting crack initiation and simulating crack propagation of human bone. The material model is implemented in MATLAB finite element package, which allows extension to any geometry and any load configuration. The fracture mechanics parameters for transverse and longitudinal crack propagation in human bone are analyzed. A fracture toughness as well as stress and strain contour are generated and thoroughly evaluated. Discussion is given on how this knowledge needs to be extended to allow prediction of whole bone fracture from external loading to aid the design of protective systems.
That the essential contribution of this research is a description of how complex systems analysis service of the properties of the queue in Baghdad Teaching Hospital using a technique network is techniques method (Q - GERT) an acronym of the words:
Queuing theory _ Graphical Evaluation and Review Technique
Any method of assessment and review chart where you will be see the movement flow of patients within the system and after using this portal will be represented system in the form of planned network probabilistic analysis and knowledge of statistical distributions appropriate for times of arrival and departure were using the program ready (Win QSB) and simulatio
... Show MoreIn light of the rapid changes in the business environment and the entry of administrative leaders in the challenges of the atheist and twenty- increasing competition between sectors and the desire to acquire the skills, the traditional methods are no longer viable, which requires doing evaluates performance according to a more holistic, rather than limiting the performance evaluation on the financial hub that has not longer enough alone, as well as benchmarking method that has proven successful in developed countries as a way to develop and improve products and services.
I've touched your search to the development of indicators evaluating the performance and preparation of a mechanism for making comparisons of reference between o
... Show MoreIn the present work, a z-scan technique was used to study the nonlinear optical properties, represented by the nonlinear refractive index and nonlinear absorption coefficients of nanoparticles cadmium sulfide thin film. The sample was prepared by the chemical bath deposition method. Several testing were done including, x-ray, transmission and thickness of thin film. z-Scan experiment was performed at two wavelengths (1064 nm and 532 nm) and different energies. The results showed the effect of self-focusing in the material at higher intensities, which evaluated n2 to be (0.11-0.16) cm2/GW. The effect of two-photon absorption was studied, which evaluated β to be (24-106) cm/GW. In addition, the optical limiting behavior has been studied.
... Show MoreThe main focus of this research is to examine the Travelling Salesman Problem (TSP) and the methods used to solve this problem where this problem is considered as one of the combinatorial optimization problems which met wide publicity and attention from the researches for to it's simple formulation and important applications and engagement to the rest of combinatorial problems , which is based on finding the optimal path through known number of cities where the salesman visits each city only once before returning to the city of departure n this research , the benefits of( FMOLP) algorithm is employed as one of the best methods to solve the (TSP) problem and the application of the algorithm in conjun
... Show MoreBroyden update is one of the one-rank updates which solves the unconstrained optimization problem but this update does not guarantee the positive definite and the symmetric property of Hessian matrix.
In this paper the guarantee of positive definite and symmetric property for the Hessian matrix will be established by updating the vector which represents the difference between the next gradient and the current gradient of the objective function assumed to be twice continuous and differentiable .Numerical results are reported to compare the proposed method with the Broyden method under standard problems.
In this paper, a new class of nonconvex sets and functions called strongly -convex sets and strongly -convex functions are introduced. This class is considered as a natural extension of strongly -convex sets and functions introduced in the literature. Some basic and differentiability properties related to strongly -convex functions are discussed. As an application to optimization problems, some optimality properties of constrained optimization problems are proved. In these optimization problems, either the objective function or the inequality constraints functions are strongly -convex.
The purpose of this paper is to find the best multiplier approximation of unbounded functions in –space by using some discrete linear positive operators. Also we will estimate the degree of the best multiplier approximation in term of modulus of continuity and the averaged modulus.