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 AC

The 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

The 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 (X₁), GB (X₂) and PX (X₃) levels as independent factors. Responses measured were the entrapment efficiency (% EE) (Y₁), mass median

    Identification of complex communities in biological networks is a critical and ongoing challenge since lots of network-related problems correspond to the subgraph isomorphism problem known in the literature as NP-hard. Several optimization algorithms have been dedicated and applied to solve this problem. The main challenge regarding the application of optimization algorithms, specifically to handle large-scale complex networks, is their relatively long execution time. Thus, this paper proposes a parallel extension of the PSO algorithm to detect communities in complex biological networks. The main contribution of this study is summarized in three- fold; Firstly, a modified PSO algorithm with a local search operator is proposed

    Identification of complex communities in biological networks is a critical and ongoing challenge since lots of network-related problems correspond to the subgraph isomorphism problem known in the literature as NP-hard. Several optimization algorithms have been dedicated and applied to solve this problem. The main challenge regarding the application of optimization algorithms, specifically to handle large-scale complex networks, is their relatively long execution time. Thus, this paper proposes a parallel extension of the PSO algorithm to detect communities in complex biological networks. The main contribution of this study is summarized in three- fold; Firstly, a modified PSO algorithm with a local search operator is proposed to d

Many objective optimizations (MaOO) algorithms that intends to solve problems with many objectives (MaOP) (i.e., the problem with more than three objectives) are widely used in various areas such as industrial manufacturing, transportation, sustainability, and even in the medical sector.  Various approaches of MaOO algorithms are available and employed to handle different MaOP cases. In contrast, the performance of the MaOO algorithms assesses based on the balance between the convergence and diversity of the non-dominated solutions measured using different evaluation criteria of the quality performance indicators. Although many evaluation criteria are available, yet most of the evaluation and benchmarking of the MaOO with state-of-art a

This work deals with determination of optimum conditions of direct diffusion bonding welding of austenitic stainlesssteel type AISI 304L with Oxygen Free High Conductivity (OFHC) pure copper grade (C10200) in vacuum atmosphere of (1.5 *10^-5 mbr.). Mini tab (response surface) was applied for optimizing the influence of diffusion bonding parameters (temperature, time and applied load) on the bonding joints characteristics and the empirical relationship was evaluated which represents the effect of each parameter of the process. The yield strength of diffusion bonded joint was equal to 153 MPa and the efficiency of joint was equal to 66.5% as compared with hard drawn copper. The diffusion zone reveals high microhardness than coppe