Science.gov

Sample records for algorithms particle swarm

  1. A Novel Particle Swarm Optimization Algorithm for Global Optimization

    PubMed Central

    Wang, Chun-Feng; Liu, Kui

    2016-01-01

    Particle Swarm Optimization (PSO) is a recently developed optimization method, which has attracted interest of researchers in various areas due to its simplicity and effectiveness, and many variants have been proposed. In this paper, a novel Particle Swarm Optimization algorithm is presented, in which the information of the best neighbor of each particle and the best particle of the entire population in the current iteration is considered. Meanwhile, to avoid premature, an abandoned mechanism is used. Furthermore, for improving the global convergence speed of our algorithm, a chaotic search is adopted in the best solution of the current iteration. To verify the performance of our algorithm, standard test functions have been employed. The experimental results show that the algorithm is much more robust and efficient than some existing Particle Swarm Optimization algorithms. PMID:26955387

  2. Genetic algorithm and particle swarm optimization combined with Powell method

    NASA Astrophysics Data System (ADS)

    Bento, David; Pinho, Diana; Pereira, Ana I.; Lima, Rui

    2013-10-01

    In recent years, the population algorithms are becoming increasingly robust and easy to use, based on Darwin's Theory of Evolution, perform a search for the best solution around a population that will progress according to several generations. This paper present variants of hybrid genetic algorithm - Genetic Algorithm and a bio-inspired hybrid algorithm - Particle Swarm Optimization, both combined with the local method - Powell Method. The developed methods were tested with twelve test functions from unconstrained optimization context.

  3. An improved particle swarm optimization algorithm for reliability problems.

    PubMed

    Wu, Peifeng; Gao, Liqun; Zou, Dexuan; Li, Steven

    2011-01-01

    An improved particle swarm optimization (IPSO) algorithm is proposed to solve reliability problems in this paper. The IPSO designs two position updating strategies: In the early iterations, each particle flies and searches according to its own best experience with a large probability; in the late iterations, each particle flies and searches according to the fling experience of the most successful particle with a large probability. In addition, the IPSO introduces a mutation operator after position updating, which can not only prevent the IPSO from trapping into the local optimum, but also enhances its space developing ability. Experimental results show that the proposed algorithm has stronger convergence and stability than the other four particle swarm optimization algorithms on solving reliability problems, and that the solutions obtained by the IPSO are better than the previously reported best-known solutions in the recent literature.

  4. Acoustic Radiation Optimization Using the Particle Swarm Optimization Algorithm

    NASA Astrophysics Data System (ADS)

    Jeon, Jin-Young; Okuma, Masaaki

    The present paper describes a fundamental study on structural bending design to reduce noise using a new evolutionary population-based heuristic algorithm called the particle swarm optimization algorithm (PSOA). The particle swarm optimization algorithm is a parallel evolutionary computation technique proposed by Kennedy and Eberhart in 1995. This algorithm is based on the social behavior models for bird flocking, fish schooling and other models investigated by zoologists. Optimal structural design problems to reduce noise are highly nonlinear, so that most conventional methods are difficult to apply. The present paper investigates the applicability of PSOA to such problems. Optimal bending design of a vibrating plate using PSOA is performed in order to minimize noise radiation. PSOA can be effectively applied to such nonlinear acoustic radiation optimization.

  5. A Parallel Particle Swarm Optimization Algorithm Accelerated by Asynchronous Evaluations

    NASA Technical Reports Server (NTRS)

    Venter, Gerhard; Sobieszczanski-Sobieski, Jaroslaw

    2005-01-01

    A parallel Particle Swarm Optimization (PSO) algorithm is presented. Particle swarm optimization is a fairly recent addition to the family of non-gradient based, probabilistic search algorithms that is based on a simplified social model and is closely tied to swarming theory. Although PSO algorithms present several attractive properties to the designer, they are plagued by high computational cost as measured by elapsed time. One approach to reduce the elapsed time is to make use of coarse-grained parallelization to evaluate the design points. Previous parallel PSO algorithms were mostly implemented in a synchronous manner, where all design points within a design iteration are evaluated before the next iteration is started. This approach leads to poor parallel speedup in cases where a heterogeneous parallel environment is used and/or where the analysis time depends on the design point being analyzed. This paper introduces an asynchronous parallel PSO algorithm that greatly improves the parallel e ciency. The asynchronous algorithm is benchmarked on a cluster assembled of Apple Macintosh G5 desktop computers, using the multi-disciplinary optimization of a typical transport aircraft wing as an example.

  6. Designing Artificial Neural Networks Using Particle Swarm Optimization Algorithms.

    PubMed

    Garro, Beatriz A; Vázquez, Roberto A

    2015-01-01

    Artificial Neural Network (ANN) design is a complex task because its performance depends on the architecture, the selected transfer function, and the learning algorithm used to train the set of synaptic weights. In this paper we present a methodology that automatically designs an ANN using particle swarm optimization algorithms such as Basic Particle Swarm Optimization (PSO), Second Generation of Particle Swarm Optimization (SGPSO), and a New Model of PSO called NMPSO. The aim of these algorithms is to evolve, at the same time, the three principal components of an ANN: the set of synaptic weights, the connections or architecture, and the transfer functions for each neuron. Eight different fitness functions were proposed to evaluate the fitness of each solution and find the best design. These functions are based on the mean square error (MSE) and the classification error (CER) and implement a strategy to avoid overtraining and to reduce the number of connections in the ANN. In addition, the ANN designed with the proposed methodology is compared with those designed manually using the well-known Back-Propagation and Levenberg-Marquardt Learning Algorithms. Finally, the accuracy of the method is tested with different nonlinear pattern classification problems. PMID:26221132

  7. Designing Artificial Neural Networks Using Particle Swarm Optimization Algorithms

    PubMed Central

    Garro, Beatriz A.; Vázquez, Roberto A.

    2015-01-01

    Artificial Neural Network (ANN) design is a complex task because its performance depends on the architecture, the selected transfer function, and the learning algorithm used to train the set of synaptic weights. In this paper we present a methodology that automatically designs an ANN using particle swarm optimization algorithms such as Basic Particle Swarm Optimization (PSO), Second Generation of Particle Swarm Optimization (SGPSO), and a New Model of PSO called NMPSO. The aim of these algorithms is to evolve, at the same time, the three principal components of an ANN: the set of synaptic weights, the connections or architecture, and the transfer functions for each neuron. Eight different fitness functions were proposed to evaluate the fitness of each solution and find the best design. These functions are based on the mean square error (MSE) and the classification error (CER) and implement a strategy to avoid overtraining and to reduce the number of connections in the ANN. In addition, the ANN designed with the proposed methodology is compared with those designed manually using the well-known Back-Propagation and Levenberg-Marquardt Learning Algorithms. Finally, the accuracy of the method is tested with different nonlinear pattern classification problems. PMID:26221132

  8. Microwave-based medical diagnosis using particle swarm optimization algorithm

    NASA Astrophysics Data System (ADS)

    Modiri, Arezoo

    This dissertation proposes and investigates a novel architecture intended for microwave-based medical diagnosis (MBMD). Furthermore, this investigation proposes novel modifications of particle swarm optimization algorithm for achieving enhanced convergence performance. MBMD has been investigated through a variety of innovative techniques in the literature since the 1990's and has shown significant promise in early detection of some specific health threats. In comparison to the X-ray- and gamma-ray-based diagnostic tools, MBMD does not expose patients to ionizing radiation; and due to the maturity of microwave technology, it lends itself to miniaturization of the supporting systems. This modality has been shown to be effective in detecting breast malignancy, and hence, this study focuses on the same modality. A novel radiator device and detection technique is proposed and investigated in this dissertation. As expected, hardware design and implementation are of paramount importance in such a study, and a good deal of research, analysis, and evaluation has been done in this regard which will be reported in ensuing chapters of this dissertation. It is noteworthy that an important element of any detection system is the algorithm used for extracting signatures. Herein, the strong intrinsic potential of the swarm-intelligence-based algorithms in solving complicated electromagnetic problems is brought to bear. This task is accomplished through addressing both mathematical and electromagnetic problems. These problems are called benchmark problems throughout this dissertation, since they have known answers. After evaluating the performance of the algorithm for the chosen benchmark problems, the algorithm is applied to MBMD tumor detection problem. The chosen benchmark problems have already been tackled by solution techniques other than particle swarm optimization (PSO) algorithm, the results of which can be found in the literature. However, due to the relatively high level

  9. Parallel global optimization with the particle swarm algorithm.

    PubMed

    Schutte, J F; Reinbolt, J A; Fregly, B J; Haftka, R T; George, A D

    2004-12-01

    Present day engineering optimization problems often impose large computational demands, resulting in long solution times even on a modern high-end processor. To obtain enhanced computational throughput and global search capability, we detail the coarse-grained parallelization of an increasingly popular global search method, the particle swarm optimization (PSO) algorithm. Parallel PSO performance was evaluated using two categories of optimization problems possessing multiple local minima-large-scale analytical test problems with computationally cheap function evaluations and medium-scale biomechanical system identification problems with computationally expensive function evaluations. For load-balanced analytical test problems formulated using 128 design variables, speedup was close to ideal and parallel efficiency above 95% for up to 32 nodes on a Beowulf cluster. In contrast, for load-imbalanced biomechanical system identification problems with 12 design variables, speedup plateaued and parallel efficiency decreased almost linearly with increasing number of nodes. The primary factor affecting parallel performance was the synchronization requirement of the parallel algorithm, which dictated that each iteration must wait for completion of the slowest fitness evaluation. When the analytical problems were solved using a fixed number of swarm iterations, a single population of 128 particles produced a better convergence rate than did multiple independent runs performed using sub-populations (8 runs with 16 particles, 4 runs with 32 particles, or 2 runs with 64 particles). These results suggest that (1) parallel PSO exhibits excellent parallel performance under load-balanced conditions, (2) an asynchronous implementation would be valuable for real-life problems subject to load imbalance, and (3) larger population sizes should be considered when multiple processors are available.

  10. Parallel global optimization with the particle swarm algorithm

    PubMed Central

    Schutte, J. F.; Reinbolt, J. A.; Fregly, B. J.; Haftka, R. T.; George, A. D.

    2007-01-01

    SUMMARY Present day engineering optimization problems often impose large computational demands, resulting in long solution times even on a modern high-end processor. To obtain enhanced computational throughput and global search capability, we detail the coarse-grained parallelization of an increasingly popular global search method, the particle swarm optimization (PSO) algorithm. Parallel PSO performance was evaluated using two categories of optimization problems possessing multiple local minima—large-scale analytical test problems with computationally cheap function evaluations and medium-scale biomechanical system identification problems with computationally expensive function evaluations. For load-balanced analytical test problems formulated using 128 design variables, speedup was close to ideal and parallel efficiency above 95% for up to 32 nodes on a Beowulf cluster. In contrast, for load-imbalanced biomechanical system identification problems with 12 design variables, speedup plateaued and parallel efficiency decreased almost linearly with increasing number of nodes. The primary factor affecting parallel performance was the synchronization requirement of the parallel algorithm, which dictated that each iteration must wait for completion of the slowest fitness evaluation. When the analytical problems were solved using a fixed number of swarm iterations, a single population of 128 particles produced a better convergence rate than did multiple independent runs performed using sub-populations (8 runs with 16 particles, 4 runs with 32 particles, or 2 runs with 64 particles). These results suggest that (1) parallel PSO exhibits excellent parallel performance under load-balanced conditions, (2) an asynchronous implementation would be valuable for real-life problems subject to load imbalance, and (3) larger population sizes should be considered when multiple processors are available. PMID:17891226

  11. Evaluation of a Particle Swarm Algorithm For Biomechanical Optimization

    PubMed Central

    Schutte, Jaco F.; Koh, Byung; Reinbolt, Jeffrey A.; Haftka, Raphael T.; George, Alan D.; Fregly, Benjamin J.

    2006-01-01

    Optimization is frequently employed in biomechanics research to solve system identification problems, predict human movement, or estimate muscle or other internal forces that cannot be measured directly. Unfortunately, biomechanical optimization problems often possess multiple local minima, making it difficult to find the best solution. Furthermore, convergence in gradient-based algorithms can be affected by scaling to account for design variables with different length scales or units. In this study we evaluate a recently-developed version of the particle swarm optimization (PSO) algorithm to address these problems. The algorithm’s global search capabilities were investigated using a suite of difficult analytical test problems, while its scale-independent nature was proven mathematically and verified using a biomechanical test problem. For comparison, all test problems were also solved with three off-the-shelf optimization algorithms—a global genetic algorithm (GA) and multistart gradient-based sequential quadratic programming (SQP) and quasi-Newton (BFGS) algorithms. For the analytical test problems, only the PSO algorithm was successful on the majority of the problems. When compared to previously published results for the same problems, PSO was more robust than a global simulated annealing algorithm but less robust than a different, more complex genetic algorithm. For the biomechanical test problem, only the PSO algorithm was insensitive to design variable scaling, with the GA algorithm being mildly sensitive and the SQP and BFGS algorithms being highly sensitive. The proposed PSO algorithm provides a new off-the-shelf global optimization option for difficult biomechanical problems, especially those utilizing design variables with different length scales or units. PMID:16060353

  12. Multivariable optimization of liquid rocket engines using particle swarm algorithms

    NASA Astrophysics Data System (ADS)

    Jones, Daniel Ray

    Liquid rocket engines are highly reliable, controllable, and efficient compared to other conventional forms of rocket propulsion. As such, they have seen wide use in the space industry and have become the standard propulsion system for launch vehicles, orbit insertion, and orbital maneuvering. Though these systems are well understood, historical optimization techniques are often inadequate due to the highly non-linear nature of the engine performance problem. In this thesis, a Particle Swarm Optimization (PSO) variant was applied to maximize the specific impulse of a finite-area combustion chamber (FAC) equilibrium flow rocket performance model by controlling the engine's oxidizer-to-fuel ratio and de Laval nozzle expansion and contraction ratios. In addition to the PSO-controlled parameters, engine performance was calculated based on propellant chemistry, combustion chamber pressure, and ambient pressure, which are provided as inputs to the program. The performance code was validated by comparison with NASA's Chemical Equilibrium with Applications (CEA) and the commercially available Rocket Propulsion Analysis (RPA) tool. Similarly, the PSO algorithm was validated by comparison with brute-force optimization, which calculates all possible solutions and subsequently determines which is the optimum. Particle Swarm Optimization was shown to be an effective optimizer capable of quick and reliable convergence for complex functions of multiple non-linear variables.

  13. Particle Swarm Optimization

    NASA Technical Reports Server (NTRS)

    Venter, Gerhard; Sobieszczanski-Sobieski Jaroslaw

    2002-01-01

    The purpose of this paper is to show how the search algorithm known as particle swarm optimization performs. Here, particle swarm optimization is applied to structural design problems, but the method has a much wider range of possible applications. The paper's new contributions are improvements to the particle swarm optimization algorithm and conclusions and recommendations as to the utility of the algorithm, Results of numerical experiments for both continuous and discrete applications are presented in the paper. The results indicate that the particle swarm optimization algorithm does locate the constrained minimum design in continuous applications with very good precision, albeit at a much higher computational cost than that of a typical gradient based optimizer. However, the true potential of particle swarm optimization is primarily in applications with discrete and/or discontinuous functions and variables. Additionally, particle swarm optimization has the potential of efficient computation with very large numbers of concurrently operating processors.

  14. Generalized Particle Swarm Algorithm for HCR Gearing Geometry Optimization

    NASA Astrophysics Data System (ADS)

    Kuzmanović, Siniša; Vereš, Miroslav; Rackov, Milan

    2012-12-01

    Temperature scuffing evidenced by damage to teeth flanks of gears is one of the mostimportant problems needing to be solved in the process of gearing design and calculation. Accordingto current valid standards, such calculations can be resolved with a high level of reliability for all theusual gearing types. However, suitable calculations for HCR gears have not been adequatelyresearched to date. It has been identified that in HCR gears some different process of scuffingformation occurs during the gear`s operation. In this article, the authors describe a new method forfinding optimal solutions for * a1 h , * a 2 h and x1, using a Generalized Particle Swarm OptimizationAlgorithm.

  15. Expedite Particle Swarm Optimization Algorithm (EPSO) for Optimization of MSA

    NASA Astrophysics Data System (ADS)

    Rathi, Amit; Vijay, Ritu

    This paper presents a new designing method of Rectangular patch Microstrip Antenna using an Artificial searches Algorithm with some constraints. It requires two stages for designing. In first stage, bandwidth of MSA is modeled using bench Mark function. In second stage, output of first stage give to modified Artificial search Algorithm which is Particle Swarm Algorithm (PSO) as input and get output in the form of five parameter- dimensions width, frequency range, dielectric loss tangent, length over a ground plane with a substrate thickness and electrical thickness. In PSO Cognition, factor and Social learning Factor give very important effect on balancing the local search and global search in PSO. Basing the modification of cognition factor and social learning factor, this paper presents the strategy that at the starting process cognition-learning factor has more effect then social learning factor. Gradually social learning factor has more impact after learning cognition factor for find out global best. The aim is to find out under above circumstances these modifications in PSO can give better result for optimization of microstrip Antenna (MSA).

  16. A Novel Flexible Inertia Weight Particle Swarm Optimization Algorithm.

    PubMed

    Amoshahy, Mohammad Javad; Shamsi, Mousa; Sedaaghi, Mohammad Hossein

    2016-01-01

    Particle swarm optimization (PSO) is an evolutionary computing method based on intelligent collective behavior of some animals. It is easy to implement and there are few parameters to adjust. The performance of PSO algorithm depends greatly on the appropriate parameter selection strategies for fine tuning its parameters. Inertia weight (IW) is one of PSO's parameters used to bring about a balance between the exploration and exploitation characteristics of PSO. This paper proposes a new nonlinear strategy for selecting inertia weight which is named Flexible Exponential Inertia Weight (FEIW) strategy because according to each problem we can construct an increasing or decreasing inertia weight strategy with suitable parameters selection. The efficacy and efficiency of PSO algorithm with FEIW strategy (FEPSO) is validated on a suite of benchmark problems with different dimensions. Also FEIW is compared with best time-varying, adaptive, constant and random inertia weights. Experimental results and statistical analysis prove that FEIW improves the search performance in terms of solution quality as well as convergence rate. PMID:27560945

  17. A Novel Flexible Inertia Weight Particle Swarm Optimization Algorithm

    PubMed Central

    Shamsi, Mousa; Sedaaghi, Mohammad Hossein

    2016-01-01

    Particle swarm optimization (PSO) is an evolutionary computing method based on intelligent collective behavior of some animals. It is easy to implement and there are few parameters to adjust. The performance of PSO algorithm depends greatly on the appropriate parameter selection strategies for fine tuning its parameters. Inertia weight (IW) is one of PSO’s parameters used to bring about a balance between the exploration and exploitation characteristics of PSO. This paper proposes a new nonlinear strategy for selecting inertia weight which is named Flexible Exponential Inertia Weight (FEIW) strategy because according to each problem we can construct an increasing or decreasing inertia weight strategy with suitable parameters selection. The efficacy and efficiency of PSO algorithm with FEIW strategy (FEPSO) is validated on a suite of benchmark problems with different dimensions. Also FEIW is compared with best time-varying, adaptive, constant and random inertia weights. Experimental results and statistical analysis prove that FEIW improves the search performance in terms of solution quality as well as convergence rate. PMID:27560945

  18. A Novel Flexible Inertia Weight Particle Swarm Optimization Algorithm.

    PubMed

    Amoshahy, Mohammad Javad; Shamsi, Mousa; Sedaaghi, Mohammad Hossein

    2016-01-01

    Particle swarm optimization (PSO) is an evolutionary computing method based on intelligent collective behavior of some animals. It is easy to implement and there are few parameters to adjust. The performance of PSO algorithm depends greatly on the appropriate parameter selection strategies for fine tuning its parameters. Inertia weight (IW) is one of PSO's parameters used to bring about a balance between the exploration and exploitation characteristics of PSO. This paper proposes a new nonlinear strategy for selecting inertia weight which is named Flexible Exponential Inertia Weight (FEIW) strategy because according to each problem we can construct an increasing or decreasing inertia weight strategy with suitable parameters selection. The efficacy and efficiency of PSO algorithm with FEIW strategy (FEPSO) is validated on a suite of benchmark problems with different dimensions. Also FEIW is compared with best time-varying, adaptive, constant and random inertia weights. Experimental results and statistical analysis prove that FEIW improves the search performance in terms of solution quality as well as convergence rate.

  19. GRAVITATIONAL LENS MODELING WITH GENETIC ALGORITHMS AND PARTICLE SWARM OPTIMIZERS

    SciTech Connect

    Rogers, Adam; Fiege, Jason D.

    2011-02-01

    Strong gravitational lensing of an extended object is described by a mapping from source to image coordinates that is nonlinear and cannot generally be inverted analytically. Determining the structure of the source intensity distribution also requires a description of the blurring effect due to a point-spread function. This initial study uses an iterative gravitational lens modeling scheme based on the semilinear method to determine the linear parameters (source intensity profile) of a strongly lensed system. Our 'matrix-free' approach avoids construction of the lens and blurring operators while retaining the least-squares formulation of the problem. The parameters of an analytical lens model are found through nonlinear optimization by an advanced genetic algorithm (GA) and particle swarm optimizer (PSO). These global optimization routines are designed to explore the parameter space thoroughly, mapping model degeneracies in detail. We develop a novel method that determines the L-curve for each solution automatically, which represents the trade-off between the image {chi}{sup 2} and regularization effects, and allows an estimate of the optimally regularized solution for each lens parameter set. In the final step of the optimization procedure, the lens model with the lowest {chi}{sup 2} is used while the global optimizer solves for the source intensity distribution directly. This allows us to accurately determine the number of degrees of freedom in the problem to facilitate comparison between lens models and enforce positivity on the source profile. In practice, we find that the GA conducts a more thorough search of the parameter space than the PSO.

  20. Application of Particle Swarm Optimization Algorithm in the Heating System Planning Problem

    PubMed Central

    Ma, Rong-Jiang; Yu, Nan-Yang; Hu, Jun-Yi

    2013-01-01

    Based on the life cycle cost (LCC) approach, this paper presents an integral mathematical model and particle swarm optimization (PSO) algorithm for the heating system planning (HSP) problem. The proposed mathematical model minimizes the cost of heating system as the objective for a given life cycle time. For the particularity of HSP problem, the general particle swarm optimization algorithm was improved. An actual case study was calculated to check its feasibility in practical use. The results show that the improved particle swarm optimization (IPSO) algorithm can more preferably solve the HSP problem than PSO algorithm. Moreover, the results also present the potential to provide useful information when making decisions in the practical planning process. Therefore, it is believed that if this approach is applied correctly and in combination with other elements, it can become a powerful and effective optimization tool for HSP problem. PMID:23935429

  1. Application of particle swarm optimization algorithm in the heating system planning problem.

    PubMed

    Ma, Rong-Jiang; Yu, Nan-Yang; Hu, Jun-Yi

    2013-01-01

    Based on the life cycle cost (LCC) approach, this paper presents an integral mathematical model and particle swarm optimization (PSO) algorithm for the heating system planning (HSP) problem. The proposed mathematical model minimizes the cost of heating system as the objective for a given life cycle time. For the particularity of HSP problem, the general particle swarm optimization algorithm was improved. An actual case study was calculated to check its feasibility in practical use. The results show that the improved particle swarm optimization (IPSO) algorithm can more preferably solve the HSP problem than PSO algorithm. Moreover, the results also present the potential to provide useful information when making decisions in the practical planning process. Therefore, it is believed that if this approach is applied correctly and in combination with other elements, it can become a powerful and effective optimization tool for HSP problem.

  2. Particle Swarm Optimization Toolbox

    NASA Technical Reports Server (NTRS)

    Grant, Michael J.

    2010-01-01

    The Particle Swarm Optimization Toolbox is a library of evolutionary optimization tools developed in the MATLAB environment. The algorithms contained in the library include a genetic algorithm (GA), a single-objective particle swarm optimizer (SOPSO), and a multi-objective particle swarm optimizer (MOPSO). Development focused on both the SOPSO and MOPSO. A GA was included mainly for comparison purposes, and the particle swarm optimizers appeared to perform better for a wide variety of optimization problems. All algorithms are capable of performing unconstrained and constrained optimization. The particle swarm optimizers are capable of performing single and multi-objective optimization. The SOPSO and MOPSO algorithms are based on swarming theory and bird-flocking patterns to search the trade space for the optimal solution or optimal trade in competing objectives. The MOPSO generates Pareto fronts for objectives that are in competition. A GA, based on Darwin evolutionary theory, is also included in the library. The GA consists of individuals that form a population in the design space. The population mates to form offspring at new locations in the design space. These offspring contain traits from both of the parents. The algorithm is based on this combination of traits from parents to hopefully provide an improved solution than either of the original parents. As the algorithm progresses, individuals that hold these optimal traits will emerge as the optimal solutions. Due to the generic design of all optimization algorithms, each algorithm interfaces with a user-supplied objective function. This function serves as a "black-box" to the optimizers in which the only purpose of this function is to evaluate solutions provided by the optimizers. Hence, the user-supplied function can be numerical simulations, analytical functions, etc., since the specific detail of this function is of no concern to the optimizer. These algorithms were originally developed to support entry

  3. An Improved Quantum-Behaved Particle Swarm Optimization Algorithm with Elitist Breeding for Unconstrained Optimization

    PubMed Central

    Yang, Zhen-Lun; Wu, Angus; Min, Hua-Qing

    2015-01-01

    An improved quantum-behaved particle swarm optimization with elitist breeding (EB-QPSO) for unconstrained optimization is presented and empirically studied in this paper. In EB-QPSO, the novel elitist breeding strategy acts on the elitists of the swarm to escape from the likely local optima and guide the swarm to perform more efficient search. During the iterative optimization process of EB-QPSO, when criteria met, the personal best of each particle and the global best of the swarm are used to generate new diverse individuals through the transposon operators. The new generated individuals with better fitness are selected to be the new personal best particles and global best particle to guide the swarm for further solution exploration. A comprehensive simulation study is conducted on a set of twelve benchmark functions. Compared with five state-of-the-art quantum-behaved particle swarm optimization algorithms, the proposed EB-QPSO performs more competitively in all of the benchmark functions in terms of better global search capability and faster convergence rate. PMID:26064085

  4. Localization of WSN using Distributed Particle Swarm Optimization algorithm with precise references

    NASA Astrophysics Data System (ADS)

    Janapati, Ravi Chander; Balaswamy, Ch.; Soundararajan, K.

    2016-08-01

    Localization is the key research area in Wireless Sensor Networks. Finding the exact position of the node is known as localization. Different algorithms have been proposed. Here we consider a cooperative localization algorithm with censoring schemes using Crammer Rao Bound (CRB). This censoring scheme can improve the positioning accuracy and reduces computation complexity, traffic and latency. Particle swarm optimization (PSO) is a population based search algorithm based on the swarm intelligence like social behavior of birds, bees or a school of fishes. To improve the algorithm efficiency and localization precision, this paper presents an objective function based on the normal distribution of ranging error and a method of obtaining the search space of particles. In this paper Distributed localization algorithm PSO with CRB is proposed. Proposed method shows better results in terms of position accuracy, latency and complexity.

  5. Dynamic topology multi force particle swarm optimization algorithm and its application

    NASA Astrophysics Data System (ADS)

    Chen, Dongning; Zhang, Ruixing; Yao, Chengyu; Zhao, Zheyu

    2016-01-01

    Particle swarm optimization (PSO) algorithm is an effective bio-inspired algorithm but it has shortage of premature convergence. Researchers have made some improvements especially in force rules and population topologies. However, the current algorithms only consider a single kind of force rules and lack consideration of comprehensive improvement in both multi force rules and population topologies. In this paper, a dynamic topology multi force particle swarm optimization (DTMFPSO) algorithm is proposed in order to get better search performance. First of all, the principle of the presented multi force particle swarm optimization (MFPSO) algorithm is that different force rules are used in different search stages, which can balance the ability of global and local search. Secondly, a fitness-driven edge-changing (FE) topology based on the probability selection mechanism of roulette method is designed to cut and add edges between the particles, and the DTMFPSO algorithm is proposed by combining the FE topology with the MFPSO algorithm through concurrent evolution of both algorithm and structure in order to further improve the search accuracy. Thirdly, Benchmark functions are employed to evaluate the performance of the DTMFPSO algorithm, and test results show that the proposed algorithm is better than the well-known PSO algorithms, such as µPSO, MPSO, and EPSO algorithms. Finally, the proposed algorithm is applied to optimize the process parameters for ultrasonic vibration cutting on SiC wafer, and the surface quality of the SiC wafer is improved by 12.8% compared with the PSO algorithm in Ref. [25]. This research proposes a DTMFPSO algorithm with multi force rules and dynamic population topologies evolved simultaneously, and it has better search performance.

  6. Use of the particle swarm optimization algorithm for second order design of levelling networks

    NASA Astrophysics Data System (ADS)

    Yetkin, Mevlut; Inal, Cevat; Yigit, Cemal Ozer

    2009-08-01

    The weight problem in geodetic networks can be dealt with as an optimization procedure. This classic problem of geodetic network optimization is also known as second-order design. The basic principles of geodetic network optimization are reviewed. Then the particle swarm optimization (PSO) algorithm is applied to a geodetic levelling network in order to solve the second-order design problem. PSO, which is an iterative-stochastic search algorithm in swarm intelligence, emulates the collective behaviour of bird flocking, fish schooling or bee swarming, to converge probabilistically to the global optimum. Furthermore, it is a powerful method because it is easy to implement and computationally efficient. Second-order design of a geodetic levelling network using PSO yields a practically realizable solution. It is also suitable for non-linear matrix functions that are very often encountered in geodetic network optimization. The fundamentals of the method and a numeric example are given.

  7. Inverse problem of flame surface properties of wood using a repulsive particle swarm optimization algorithm

    NASA Astrophysics Data System (ADS)

    Yoon, Kyung-Beom; Park, Won-Hee

    2015-04-01

    The convective heat transfer coefficient and surface emissivity before and after flame occurrence on a wood specimen surface and the flame heat flux were estimated using the repulsive particle swarm optimization algorithm and cone heater test results. The cone heater specified in the ISO 5660 standards was used, and six cone heater heat fluxes were tested. Preservative-treated Douglas fir 21 mm in thickness was used as the wood specimen in the tests. This study confirmed that the surface temperature of the specimen, which was calculated using the convective heat transfer coefficient, surface emissivity and flame heat flux on the wood specimen by a repulsive particle swarm optimization algorithm, was consistent with the measured temperature. Considering the measurement errors in the surface temperature of the specimen, the applicability of the optimization method considered in this study was evaluated.

  8. Binary particle swarm optimization algorithm assisted to design of plasmonic nanospheres sensor

    NASA Astrophysics Data System (ADS)

    Kaboli, Milad; Akhlaghi, Majid; Shahmirzaee, Hossein

    2016-04-01

    In this study, a coherent perfect absorption (CPA)-type sensor based on plasmonic nanoparticles is proposed. It consists of a plasmonic nanospheres array on top of a quartz substrate. The refractive index changes above the sensor surface, which is due to the appearance of gas or the absorption of biomolecules, can be detected by measuring the resulting spectral shifts of the absorption coefficient. Since the CPA efficiency depends strongly on the number of plasmonic nanoparticles and the locations of nanoparticles, binary particle swarm optimization (BPSO) algorithm is used to design an optimized array of the plasmonic nanospheres. This optimized structure should be maximizing the absorption coefficient only in the one frequency. BPSO algorithm, a swarm of birds including a matrix with binary entries responsible for controlling nanospheres in the array, shows the presence with symbol of ('1') and the absence with ('0'). The sensor can be used for sensing both gas and low refractive index materials in an aqueous environment.

  9. Optimal control of switched linear systems based on Migrant Particle Swarm Optimization algorithm

    NASA Astrophysics Data System (ADS)

    Xie, Fuqiang; Wang, Yongji; Zheng, Zongzhun; Li, Chuanfeng

    2009-10-01

    The optimal control problem for switched linear systems with internally forced switching has more constraints than with externally forced switching. Heavy computations and slow convergence in solving this problem is a major obstacle. In this paper we describe a new approach for solving this problem, which is called Migrant Particle Swarm Optimization (Migrant PSO). Imitating the behavior of a flock of migrant birds, the Migrant PSO applies naturally to both continuous and discrete spaces, in which definitive optimization algorithm and stochastic search method are combined. The efficacy of the proposed algorithm is illustrated via a numerical example.

  10. A Combination of Genetic Algorithm and Particle Swarm Optimization for Vehicle Routing Problem with Time Windows

    PubMed Central

    Xu, Sheng-Hua; Liu, Ji-Ping; Zhang, Fu-Hao; Wang, Liang; Sun, Li-Jian

    2015-01-01

    A combination of genetic algorithm and particle swarm optimization (PSO) for vehicle routing problems with time windows (VRPTW) is proposed in this paper. The improvements of the proposed algorithm include: using the particle real number encoding method to decode the route to alleviate the computation burden, applying a linear decreasing function based on the number of the iterations to provide balance between global and local exploration abilities, and integrating with the crossover operator of genetic algorithm to avoid the premature convergence and the local minimum. The experimental results show that the proposed algorithm is not only more efficient and competitive with other published results but can also obtain more optimal solutions for solving the VRPTW issue. One new well-known solution for this benchmark problem is also outlined in the following. PMID:26343655

  11. Optimal high speed CMOS inverter design using craziness based Particle Swarm Optimization Algorithm

    NASA Astrophysics Data System (ADS)

    De, Bishnu P.; Kar, Rajib; Mandal, Durbadal; Ghoshal, Sakti P.

    2015-07-01

    The inverter is the most fundamental logic gate that performs a Boolean operation on a single input variable. In this paper, an optimal design of CMOS inverter using an improved version of particle swarm optimization technique called Craziness based Particle Swarm Optimization (CRPSO) is proposed. CRPSO is very simple in concept, easy to implement and computationally efficient algorithm with two main advantages: it has fast, nearglobal convergence, and it uses nearly robust control parameters. The performance of PSO depends on its control parameters and may be influenced by premature convergence and stagnation problems. To overcome these problems the PSO algorithm has been modiffed to CRPSO in this paper and is used for CMOS inverter design. In birds' flocking or ffsh schooling, a bird or a ffsh often changes direction suddenly. In the proposed technique, the sudden change of velocity is modelled by a direction reversal factor associated with the previous velocity and a "craziness" velocity factor associated with another direction reversal factor. The second condition is introduced depending on a predeffned craziness probability to maintain the diversity of particles. The performance of CRPSO is compared with real code.gnetic algorithm (RGA), and conventional PSO reported in the recent literature. CRPSO based design results are also compared with the PSPICE based results. The simulation results show that the CRPSO is superior to the other algorithms for the examples considered and can be efficiently used for the CMOS inverter design.

  12. Parameter estimation of fractional-order chaotic systems by using quantum parallel particle swarm optimization algorithm.

    PubMed

    Huang, Yu; Guo, Feng; Li, Yongling; Liu, Yufeng

    2015-01-01

    Parameter estimation for fractional-order chaotic systems is an important issue in fractional-order chaotic control and synchronization and could be essentially formulated as a multidimensional optimization problem. A novel algorithm called quantum parallel particle swarm optimization (QPPSO) is proposed to solve the parameter estimation for fractional-order chaotic systems. The parallel characteristic of quantum computing is used in QPPSO. This characteristic increases the calculation of each generation exponentially. The behavior of particles in quantum space is restrained by the quantum evolution equation, which consists of the current rotation angle, individual optimal quantum rotation angle, and global optimal quantum rotation angle. Numerical simulation based on several typical fractional-order systems and comparisons with some typical existing algorithms show the effectiveness and efficiency of the proposed algorithm. PMID:25603158

  13. A dynamic programming-based particle swarm optimization algorithm for an inventory management problem under uncertainty

    NASA Astrophysics Data System (ADS)

    Xu, Jiuping; Zeng, Ziqiang; Han, Bernard; Lei, Xiao

    2013-07-01

    This article presents a dynamic programming-based particle swarm optimization (DP-based PSO) algorithm for solving an inventory management problem for large-scale construction projects under a fuzzy random environment. By taking into account the purchasing behaviour and strategy under rules of international bidding, a multi-objective fuzzy random dynamic programming model is constructed. To deal with the uncertainties, a hybrid crisp approach is used to transform fuzzy random parameters into fuzzy variables that are subsequently defuzzified by using an expected value operator with optimistic-pessimistic index. The iterative nature of the authors' model motivates them to develop a DP-based PSO algorithm. More specifically, their approach treats the state variables as hidden parameters. This in turn eliminates many redundant feasibility checks during initialization and particle updates at each iteration. Results and sensitivity analysis are presented to highlight the performance of the authors' optimization method, which is very effective as compared to the standard PSO algorithm.

  14. New hybrid genetic particle swarm optimization algorithm to design multi-zone binary filter.

    PubMed

    Lin, Jie; Zhao, Hongyang; Ma, Yuan; Tan, Jiubin; Jin, Peng

    2016-05-16

    The binary phase filters have been used to achieve an optical needle with small lateral size. Designing a binary phase filter is still a scientific challenge in such fields. In this paper, a hybrid genetic particle swarm optimization (HGPSO) algorithm is proposed to design the binary phase filter. The HGPSO algorithm includes self-adaptive parameters, recombination and mutation operations that originated from the genetic algorithm. Based on the benchmark test, the HGPSO algorithm has achieved global optimization and fast convergence. In an easy-to-perform optimizing procedure, the iteration number of HGPSO is decreased to about a quarter of the original particle swarm optimization process. A multi-zone binary phase filter is designed by using the HGPSO. The long depth of focus and high resolution are achieved simultaneously, where the depth of focus and focal spot transverse size are 6.05λ and 0.41λ, respectively. Therefore, the proposed HGPSO can be applied to the optimization of filter with multiple parameters. PMID:27409895

  15. Optimizing the Shunting Schedule of Electric Multiple Units Depot Using an Enhanced Particle Swarm Optimization Algorithm.

    PubMed

    Wang, Jiaxi; Lin, Boliang; Jin, Junchen

    2016-01-01

    The shunting schedule of electric multiple units depot (SSED) is one of the essential plans for high-speed train maintenance activities. This paper presents a 0-1 programming model to address the problem of determining an optimal SSED through automatic computing. The objective of the model is to minimize the number of shunting movements and the constraints include track occupation conflicts, shunting routes conflicts, time durations of maintenance processes, and shunting running time. An enhanced particle swarm optimization (EPSO) algorithm is proposed to solve the optimization problem. Finally, an empirical study from Shanghai South EMU Depot is carried out to illustrate the model and EPSO algorithm. The optimization results indicate that the proposed method is valid for the SSED problem and that the EPSO algorithm outperforms the traditional PSO algorithm on the aspect of optimality. PMID:27436998

  16. Double global optimum genetic algorithm-particle swarm optimization-based welding robot path planning

    NASA Astrophysics Data System (ADS)

    Wang, Xuewu; Shi, Yingpan; Ding, Dongyan; Gu, Xingsheng

    2016-02-01

    Spot-welding robots have a wide range of applications in manufacturing industries. There are usually many weld joints in a welding task, and a reasonable welding path to traverse these weld joints has a significant impact on welding efficiency. Traditional manual path planning techniques can handle a few weld joints effectively, but when the number of weld joints is large, it is difficult to obtain the optimal path. The traditional manual path planning method is also time consuming and inefficient, and cannot guarantee optimality. Double global optimum genetic algorithm-particle swarm optimization (GA-PSO) based on the GA and PSO algorithms is proposed to solve the welding robot path planning problem, where the shortest collision-free paths are used as the criteria to optimize the welding path. Besides algorithm effectiveness analysis and verification, the simulation results indicate that the algorithm has strong searching ability and practicality, and is suitable for welding robot path planning.

  17. Optimizing the Shunting Schedule of Electric Multiple Units Depot Using an Enhanced Particle Swarm Optimization Algorithm

    PubMed Central

    Jin, Junchen

    2016-01-01

    The shunting schedule of electric multiple units depot (SSED) is one of the essential plans for high-speed train maintenance activities. This paper presents a 0-1 programming model to address the problem of determining an optimal SSED through automatic computing. The objective of the model is to minimize the number of shunting movements and the constraints include track occupation conflicts, shunting routes conflicts, time durations of maintenance processes, and shunting running time. An enhanced particle swarm optimization (EPSO) algorithm is proposed to solve the optimization problem. Finally, an empirical study from Shanghai South EMU Depot is carried out to illustrate the model and EPSO algorithm. The optimization results indicate that the proposed method is valid for the SSED problem and that the EPSO algorithm outperforms the traditional PSO algorithm on the aspect of optimality. PMID:27436998

  18. Improved particle swarm optimization algorithm for android medical care IOT using modified parameters.

    PubMed

    Sung, Wen-Tsai; Chiang, Yen-Chun

    2012-12-01

    This study examines wireless sensor network with real-time remote identification using the Android study of things (HCIOT) platform in community healthcare. An improved particle swarm optimization (PSO) method is proposed to efficiently enhance physiological multi-sensors data fusion measurement precision in the Internet of Things (IOT) system. Improved PSO (IPSO) includes: inertia weight factor design, shrinkage factor adjustment to allow improved PSO algorithm data fusion performance. The Android platform is employed to build multi-physiological signal processing and timely medical care of things analysis. Wireless sensor network signal transmission and Internet links allow community or family members to have timely medical care network services.

  19. Improved particle swarm optimization algorithm for android medical care IOT using modified parameters.

    PubMed

    Sung, Wen-Tsai; Chiang, Yen-Chun

    2012-12-01

    This study examines wireless sensor network with real-time remote identification using the Android study of things (HCIOT) platform in community healthcare. An improved particle swarm optimization (PSO) method is proposed to efficiently enhance physiological multi-sensors data fusion measurement precision in the Internet of Things (IOT) system. Improved PSO (IPSO) includes: inertia weight factor design, shrinkage factor adjustment to allow improved PSO algorithm data fusion performance. The Android platform is employed to build multi-physiological signal processing and timely medical care of things analysis. Wireless sensor network signal transmission and Internet links allow community or family members to have timely medical care network services. PMID:22492176

  20. An adaptive image enhancement technique by combining cuckoo search and particle swarm optimization algorithm.

    PubMed

    Ye, Zhiwei; Wang, Mingwei; Hu, Zhengbing; Liu, Wei

    2015-01-01

    Image enhancement is an important procedure of image processing and analysis. This paper presents a new technique using a modified measure and blending of cuckoo search and particle swarm optimization (CS-PSO) for low contrast images to enhance image adaptively. In this way, contrast enhancement is obtained by global transformation of the input intensities; it employs incomplete Beta function as the transformation function and a novel criterion for measuring image quality considering three factors which are threshold, entropy value, and gray-level probability density of the image. The enhancement process is a nonlinear optimization problem with several constraints. CS-PSO is utilized to maximize the objective fitness criterion in order to enhance the contrast and detail in an image by adapting the parameters of a novel extension to a local enhancement technique. The performance of the proposed method has been compared with other existing techniques such as linear contrast stretching, histogram equalization, and evolutionary computing based image enhancement methods like backtracking search algorithm, differential search algorithm, genetic algorithm, and particle swarm optimization in terms of processing time and image quality. Experimental results demonstrate that the proposed method is robust and adaptive and exhibits the better performance than other methods involved in the paper. PMID:25784928

  1. An adaptive image enhancement technique by combining cuckoo search and particle swarm optimization algorithm.

    PubMed

    Ye, Zhiwei; Wang, Mingwei; Hu, Zhengbing; Liu, Wei

    2015-01-01

    Image enhancement is an important procedure of image processing and analysis. This paper presents a new technique using a modified measure and blending of cuckoo search and particle swarm optimization (CS-PSO) for low contrast images to enhance image adaptively. In this way, contrast enhancement is obtained by global transformation of the input intensities; it employs incomplete Beta function as the transformation function and a novel criterion for measuring image quality considering three factors which are threshold, entropy value, and gray-level probability density of the image. The enhancement process is a nonlinear optimization problem with several constraints. CS-PSO is utilized to maximize the objective fitness criterion in order to enhance the contrast and detail in an image by adapting the parameters of a novel extension to a local enhancement technique. The performance of the proposed method has been compared with other existing techniques such as linear contrast stretching, histogram equalization, and evolutionary computing based image enhancement methods like backtracking search algorithm, differential search algorithm, genetic algorithm, and particle swarm optimization in terms of processing time and image quality. Experimental results demonstrate that the proposed method is robust and adaptive and exhibits the better performance than other methods involved in the paper.

  2. An Adaptive Image Enhancement Technique by Combining Cuckoo Search and Particle Swarm Optimization Algorithm

    PubMed Central

    Ye, Zhiwei; Wang, Mingwei; Hu, Zhengbing; Liu, Wei

    2015-01-01

    Image enhancement is an important procedure of image processing and analysis. This paper presents a new technique using a modified measure and blending of cuckoo search and particle swarm optimization (CS-PSO) for low contrast images to enhance image adaptively. In this way, contrast enhancement is obtained by global transformation of the input intensities; it employs incomplete Beta function as the transformation function and a novel criterion for measuring image quality considering three factors which are threshold, entropy value, and gray-level probability density of the image. The enhancement process is a nonlinear optimization problem with several constraints. CS-PSO is utilized to maximize the objective fitness criterion in order to enhance the contrast and detail in an image by adapting the parameters of a novel extension to a local enhancement technique. The performance of the proposed method has been compared with other existing techniques such as linear contrast stretching, histogram equalization, and evolutionary computing based image enhancement methods like backtracking search algorithm, differential search algorithm, genetic algorithm, and particle swarm optimization in terms of processing time and image quality. Experimental results demonstrate that the proposed method is robust and adaptive and exhibits the better performance than other methods involved in the paper. PMID:25784928

  3. Bayesian network structure learning based on the chaotic particle swarm optimization algorithm.

    PubMed

    Zhang, Q; Li, Z; Zhou, C J; Wei, X P

    2013-01-01

    The Bayesian network (BN) is a knowledge representation form, which has been proven to be valuable in the gene regulatory network reconstruction because of its capability of capturing causal relationships between genes. Learning BN structures from a database is a nondeterministic polynomial time (NP)-hard problem that remains one of the most exciting challenges in machine learning. Several heuristic searching techniques have been used to find better network structures. Among these algorithms, the classical K2 algorithm is the most successful. Nonetheless, the performance of the K2 algorithm is greatly affected by a prior ordering of input nodes. The proposed method in this paper is based on the chaotic particle swarm optimization (CPSO) and the K2 algorithm. Because the PSO algorithm completely entraps the local minimum in later evolutions, we combined the PSO algorithm with the chaos theory, which has the properties of ergodicity, randomness, and regularity. Experimental results show that the proposed method can improve the convergence rate of particles and identify networks more efficiently and accurately. PMID:24222226

  4. Identification of robust adaptation gene regulatory network parameters using an improved particle swarm optimization algorithm.

    PubMed

    Huang, X N; Ren, H P

    2016-01-01

    Robust adaptation is a critical ability of gene regulatory network (GRN) to survive in a fluctuating environment, which represents the system responding to an input stimulus rapidly and then returning to its pre-stimulus steady state timely. In this paper, the GRN is modeled using the Michaelis-Menten rate equations, which are highly nonlinear differential equations containing 12 undetermined parameters. The robust adaption is quantitatively described by two conflicting indices. To identify the parameter sets in order to confer the GRNs with robust adaptation is a multi-variable, multi-objective, and multi-peak optimization problem, which is difficult to acquire satisfactory solutions especially high-quality solutions. A new best-neighbor particle swarm optimization algorithm is proposed to implement this task. The proposed algorithm employs a Latin hypercube sampling method to generate the initial population. The particle crossover operation and elitist preservation strategy are also used in the proposed algorithm. The simulation results revealed that the proposed algorithm could identify multiple solutions in one time running. Moreover, it demonstrated a superior performance as compared to the previous methods in the sense of detecting more high-quality solutions within an acceptable time. The proposed methodology, owing to its universality and simplicity, is useful for providing the guidance to design GRN with superior robust adaptation. PMID:27323043

  5. ARIMA Model Estimated by Particle Swarm Optimization Algorithm for Consumer Price Index Forecasting

    NASA Astrophysics Data System (ADS)

    Wang, Hongjie; Zhao, Weigang

    This paper presents an ARIMA model which uses particle swarm optimization algorithm (PSO) for model estimation. Because the traditional estimation method is complex and may obtain very bad results, PSO which can be implemented with ease and has a powerful optimizing performance is employed to optimize the coefficients of ARIMA. In recent years, inflation and deflation plague the world moreover the consumer price index (CPI) which is a measure of the average price of consumer goods and services purchased by households is usually observed as an important indicator of the level of inflation, so the forecast of CPI has been focused on by both scientific community and relevant authorities. Furthermore, taking the forecast of CPI as a case, we illustrate the improvement of accuracy and efficiency of the new method and the result shows it is predominant in forecasting.

  6. A feature extraction method of the particle swarm optimization algorithm based on adaptive inertia weight and chaos optimization for Brillouin scattering spectra

    NASA Astrophysics Data System (ADS)

    Zhang, Yanjun; Zhao, Yu; Fu, Xinghu; Xu, Jinrui

    2016-10-01

    A novel particle swarm optimization algorithm based on adaptive inertia weight and chaos optimization is proposed for extracting the features of Brillouin scattering spectra. Firstly, the adaptive inertia weight parameter of the velocity is introduced to the basic particle swarm algorithm. Based on the current iteration number of particles and the adaptation value, the algorithm can change the weight coefficient and adjust the iteration speed of searching space for particles, so the local optimization ability can be enhanced. Secondly, the logical self-mapping chaotic search is carried out by using the chaos optimization in particle swarm optimization algorithm, which makes the particle swarm optimization algorithm jump out of local optimum. The novel algorithm is compared with finite element analysis-Levenberg Marquardt algorithm, particle swarm optimization-Levenberg Marquardt algorithm and particle swarm optimization algorithm by changing the linewidth, the signal-to-noise ratio and the linear weight ratio of Brillouin scattering spectra. Then the algorithm is applied to the feature extraction of Brillouin scattering spectra in different temperatures. The simulation analysis and experimental results show that this algorithm has a high fitting degree and small Brillouin frequency shift error for different linewidth, SNR and linear weight ratio. Therefore, this algorithm can be applied to the distributed optical fiber sensing system based on Brillouin optical time domain reflection, which can effectively improve the accuracy of Brillouin frequency shift extraction.

  7. An Accelerated Particle Swarm Optimization Algorithm on Parametric Optimization of WEDM of Die-Steel

    NASA Astrophysics Data System (ADS)

    Muthukumar, V.; Suresh Babu, A.; Venkatasamy, R.; Senthil Kumar, N.

    2015-01-01

    This study employed Accelerated Particle Swarm Optimization (APSO) algorithm to optimize the machining parameters that lead to a maximum Material Removal Rate (MRR), minimum surface roughness and minimum kerf width values for Wire Electrical Discharge Machining (WEDM) of AISI D3 die-steel. Four machining parameters that are optimized using APSO algorithm include Pulse on-time, Pulse off-time, Gap voltage, Wire feed. The machining parameters are evaluated by Taguchi's L9 Orthogonal Array (OA). Experiments are conducted on a CNC WEDM and output responses such as material removal rate, surface roughness and kerf width are determined. The empirical relationship between control factors and output responses are established by using linear regression models using Minitab software. Finally, APSO algorithm, a nature inspired metaheuristic technique, is used to optimize the WEDM machining parameters for higher material removal rate and lower kerf width with surface roughness as constraint. The confirmation experiments carried out with the optimum conditions show that the proposed algorithm was found to be potential in finding numerous optimal input machining parameters which can fulfill wide requirements of a process engineer working in WEDM industry.

  8. Resolving superimposed MUAPs using particle swarm optimization.

    PubMed

    Marateb, Hamid Reza; McGill, Kevin C

    2009-03-01

    This paper presents an algorithm to resolve superimposed action potentials encountered during the decomposition of electromyographic signals. The algorithm uses particle swarm optimization with a variety of features including randomization, crossover, and multiple swarms. In a simulation study involving realistic superpositions of two to five motor-unit action potentials, the algorithm had an accuracy of 98%.

  9. Designing a mirrored Howland circuit with a particle swarm optimisation algorithm

    NASA Astrophysics Data System (ADS)

    Bertemes-Filho, Pedro; Negri, Lucas H.; Vincence, Volney C.

    2016-06-01

    Electrical impedance spectroscopy usually requires a wide bandwidth current source with high output impedance. Non-idealities of the operational amplifier (op-amp) degrade its performance. This work presents a particle swarm algorithm for extracting the main AC characteristics of the op-amp used to design a mirrored modified Howland current source circuit which satisfies both the output current and the impedance spectra required. User specifications were accommodated. Both resistive and biological loads were used in the simulations. The results showed that the algorithm can correctly identify the open-loop gain and the input and output resistance of the op-amp which best fit the performance requirements of the circuit. It was also shown that the higher the open-loop gain corner frequency the higher the output impedance of the circuit. The algorithm could be a powerful tool for developing a desirable current source for different bioimpedance medical and clinical applications, such as cancer tissue characterisation and tissue cell measurements.

  10. Detection of Carious Lesions and Restorations Using Particle Swarm Optimization Algorithm

    PubMed Central

    Naebi, Mohammad; Saberi, Eshaghali; Risbaf Fakour, Sirous; Naebi, Ahmad; Hosseini Tabatabaei, Somayeh; Ansari Moghadam, Somayeh; Bozorgmehr, Elham; Davtalab Behnam, Nasim; Azimi, Hamidreza

    2016-01-01

    Background/Purpose. In terms of the detection of tooth diagnosis, no intelligent detection has been done up till now. Dentists just look at images and then they can detect the diagnosis position in tooth based on their experiences. Using new technologies, scientists will implement detection and repair of tooth diagnosis intelligently. In this paper, we have introduced one intelligent method for detection using particle swarm optimization (PSO) and our mathematical formulation. This method was applied to 2D special images. Using developing of our method, we can detect tooth diagnosis for all of 2D and 3D images. Materials and Methods. In recent years, it is possible to implement intelligent processing of images by high efficiency optimization algorithms in many applications especially for detection of dental caries and restoration without human intervention. In the present work, we explain PSO algorithm with our detection formula for detection of dental caries and restoration. Also image processing helped us to implement our method. And to do so, pictures taken by digital radiography systems of tooth are used. Results and Conclusion. We implement some mathematics formula for fitness of PSO. Our results show that this method can detect dental caries and restoration in digital radiography pictures with the good convergence. In fact, the error rate of this method was 8%, so that it can be implemented for detection of dental caries and restoration. Using some parameters, it is possible that the error rate can be even reduced below 0.5%. PMID:27212947

  11. Parameters optimisation of a vehicle suspension system using a particle swarm optimisation algorithm

    NASA Astrophysics Data System (ADS)

    Centeno Drehmer, Luis Roberto; Paucar Casas, Walter Jesus; Martins Gomes, Herbert

    2015-04-01

    The purpose of this paper is to determine the lumped suspension parameters that minimise a multi-objective function in a vehicle model under different standard PSD road profiles. This optimisation tries to meet the rms vertical acceleration weighted limits for human sensitivity curves from ISO 2631 [ISO-2631: guide for evaluation of human exposure to whole-body vibration. Europe; 1997] at the driver's seat, the road holding capability and the suspension working space. The vehicle is modelled in the frequency domain using eight degrees of freedom under a random road profile. The particle swarm optimisation and sequential quadratic programming algorithms are used to obtain the suspension optimal parameters in different road profile and vehicle velocity conditions. A sensitivity analysis is performed using the obtained results and, in Class G road profile, the seat damping has the major influence on the minimisation of the multi-objective function. The influence of vehicle parameters in vibration attenuation is analysed and it is concluded that the front suspension stiffness should be less stiff than the rear ones when the driver's seat relative position is located forward the centre of gravity of the car body. Graphs and tables for the behaviour of suspension parameters related to road classes, used algorithms and velocities are presented to illustrate the results. In Class A road profile it was possible to find optimal parameters within the boundaries of the design variables that resulted in acceptable values for the comfort, road holding and suspension working space.

  12. Detection of Carious Lesions and Restorations Using Particle Swarm Optimization Algorithm.

    PubMed

    Naebi, Mohammad; Saberi, Eshaghali; Risbaf Fakour, Sirous; Naebi, Ahmad; Hosseini Tabatabaei, Somayeh; Ansari Moghadam, Somayeh; Bozorgmehr, Elham; Davtalab Behnam, Nasim; Azimi, Hamidreza

    2016-01-01

    Background/Purpose. In terms of the detection of tooth diagnosis, no intelligent detection has been done up till now. Dentists just look at images and then they can detect the diagnosis position in tooth based on their experiences. Using new technologies, scientists will implement detection and repair of tooth diagnosis intelligently. In this paper, we have introduced one intelligent method for detection using particle swarm optimization (PSO) and our mathematical formulation. This method was applied to 2D special images. Using developing of our method, we can detect tooth diagnosis for all of 2D and 3D images. Materials and Methods. In recent years, it is possible to implement intelligent processing of images by high efficiency optimization algorithms in many applications especially for detection of dental caries and restoration without human intervention. In the present work, we explain PSO algorithm with our detection formula for detection of dental caries and restoration. Also image processing helped us to implement our method. And to do so, pictures taken by digital radiography systems of tooth are used. Results and Conclusion. We implement some mathematics formula for fitness of PSO. Our results show that this method can detect dental caries and restoration in digital radiography pictures with the good convergence. In fact, the error rate of this method was 8%, so that it can be implemented for detection of dental caries and restoration. Using some parameters, it is possible that the error rate can be even reduced below 0.5%. PMID:27212947

  13. An Improved Particle Swarm Optimization for Traveling Salesman Problem

    NASA Astrophysics Data System (ADS)

    Liu, Xinmei; Su, Jinrong; Han, Yan

    In allusion to particle swarm optimization being prone to get into local minimum, an improved particle swarm optimization algorithm is proposed. The algorithm draws on the thinking of the greedy algorithm to initialize the particle swarm. Two swarms are used to optimize synchronously. Crossover and mutation operators in genetic algorithm are introduced into the new algorithm to realize the sharing of information among swarms. We test the algorithm with Traveling Salesman Problem with 14 nodes and 30 nodes. The result shows that the algorithm can break away from local minimum earlier and it has high convergence speed and convergence ratio.

  14. Tunning PID controller using particle swarm optimization algorithm on automatic voltage regulator system

    NASA Astrophysics Data System (ADS)

    Aranza, M. F.; Kustija, J.; Trisno, B.; Hakim, D. L.

    2016-04-01

    PID Controller (Proportional Integral Derivative) was invented since 1910, but till today still is used in industries, even though there are many kind of modern controllers like fuzz controller and neural network controller are being developed. Performance of PID controller is depend on on Proportional Gain (Kp), Integral Gain (Ki) and Derivative Gain (Kd). These gains can be got by using method Ziegler-Nichols (ZN), gain-phase margin, Root Locus, Minimum Variance dan Gain Scheduling however these methods are not optimal to control systems that nonlinear and have high-orde, in addition, some methods relative hard. To solve those obstacles, particle swarm optimization (PSO) algorithm is proposed to get optimal Kp, Ki and Kd. PSO is proposed because PSO has convergent result and not require many iterations. On this research, PID controller is applied on AVR (Automatic Voltage Regulator). Based on result of analyzing transient, stability Root Locus and frequency response, performance of PID controller is better than Ziegler-Nichols.

  15. Particle swarm optimization algorithm for optimizing assignment of blood in blood banking system.

    PubMed

    Olusanya, Micheal O; Arasomwan, Martins A; Adewumi, Aderemi O

    2015-01-01

    This paper reports the performance of particle swarm optimization (PSO) for the assignment of blood to meet patients' blood transfusion requests for blood transfusion. While the drive for blood donation lingers, there is need for effective and efficient management of available blood in blood banking systems. Moreover, inherent danger of transfusing wrong blood types to patients, unnecessary importation of blood units from external sources, and wastage of blood products due to nonusage necessitate the development of mathematical models and techniques for effective handling of blood distribution among available blood types in order to minimize wastages and importation from external sources. This gives rise to the blood assignment problem (BAP) introduced recently in literature. We propose a queue and multiple knapsack models with PSO-based solution to address this challenge. Simulation is based on sets of randomly generated data that mimic real-world population distribution of blood types. Results obtained show the efficiency of the proposed algorithm for BAP with no blood units wasted and very low importation, where necessary, from outside the blood bank. The result therefore can serve as a benchmark and basis for decision support tools for real-life deployment.

  16. Motion generation of peristaltic mobile robot with particle swarm optimization algorithm

    NASA Astrophysics Data System (ADS)

    Homma, Takahiro; Kamamichi, Norihiro

    2015-03-01

    In developments of robots, bio-mimetics is attracting attention, which is a technology for the design of the structure and function inspired from biological system. There are a lot of examples of bio-mimetics in robotics such as legged robots, flapping robots, insect-type robots, fish-type robots. In this study, we focus on the motion of earthworm and aim to develop a peristaltic mobile robot. The earthworm is a slender animal moving in soil. It has a segmented body, and each segment can be shorted and lengthened by muscular actions. It can move forward by traveling expanding motions of each segment backward. By mimicking the structure and motion of the earthworm, we can construct a robot with high locomotive performance against an irregular ground or a narrow space. In this paper, to investigate the motion analytically, a dynamical model is introduced, which consist of a series-connected multi-mass model. Simple periodic patterns which mimic the motions of earthworms are applied in an open-loop fashion, and the moving patterns are verified through numerical simulations. Furthermore, to generate efficient motion of the robot, a particle swarm optimization algorithm, one of the meta-heuristic optimization, is applied. The optimized results are investigated by comparing to simple periodic patterns.

  17. Side scan sonar image segmentation based on neutrosophic set and quantum-behaved particle swarm optimization algorithm

    NASA Astrophysics Data System (ADS)

    Zhao, Jianhu; Wang, Xiao; Zhang, Hongmei; Hu, Jun; Jian, Xiaomin

    2016-06-01

    To fulfill side scan sonar (SSS) image segmentation accurately and efficiently, a novel segmentation algorithm based on neutrosophic set (NS) and quantum-behaved particle swarm optimization (QPSO) is proposed in this paper. Firstly, the neutrosophic subset images are obtained by transforming the input image into the NS domain. Then, a co-occurrence matrix is accurately constructed based on these subset images, and the entropy of the gray level image is described to serve as the fitness function of the QPSO algorithm. Moreover, the optimal two-dimensional segmentation threshold vector is quickly obtained by QPSO. Finally, the contours of the interested target are segmented with the threshold vector and extracted by the mathematic morphology operation. To further improve the segmentation efficiency, the single threshold segmentation, an alternative algorithm, is recommended for the shadow segmentation by considering the gray level characteristics of the shadow. The accuracy and efficiency of the proposed algorithm are assessed with experiments of SSS image segmentation.

  18. Side scan sonar image segmentation based on neutrosophic set and quantum-behaved particle swarm optimization algorithm

    NASA Astrophysics Data System (ADS)

    Zhao, Jianhu; Wang, Xiao; Zhang, Hongmei; Hu, Jun; Jian, Xiaomin

    2016-09-01

    To fulfill side scan sonar (SSS) image segmentation accurately and efficiently, a novel segmentation algorithm based on neutrosophic set (NS) and quantum-behaved particle swarm optimization (QPSO) is proposed in this paper. Firstly, the neutrosophic subset images are obtained by transforming the input image into the NS domain. Then, a co-occurrence matrix is accurately constructed based on these subset images, and the entropy of the gray level image is described to serve as the fitness function of the QPSO algorithm. Moreover, the optimal two-dimensional segmentation threshold vector is quickly obtained by QPSO. Finally, the contours of the interested target are segmented with the threshold vector and extracted by the mathematic morphology operation. To further improve the segmentation efficiency, the single threshold segmentation, an alternative algorithm, is recommended for the shadow segmentation by considering the gray level characteristics of the shadow. The accuracy and efficiency of the proposed algorithm are assessed with experiments of SSS image segmentation.

  19. Big Data: A Parallel Particle Swarm Optimization-Back-Propagation Neural Network Algorithm Based on MapReduce.

    PubMed

    Cao, Jianfang; Cui, Hongyan; Shi, Hao; Jiao, Lijuan

    2016-01-01

    A back-propagation (BP) neural network can solve complicated random nonlinear mapping problems; therefore, it can be applied to a wide range of problems. However, as the sample size increases, the time required to train BP neural networks becomes lengthy. Moreover, the classification accuracy decreases as well. To improve the classification accuracy and runtime efficiency of the BP neural network algorithm, we proposed a parallel design and realization method for a particle swarm optimization (PSO)-optimized BP neural network based on MapReduce on the Hadoop platform using both the PSO algorithm and a parallel design. The PSO algorithm was used to optimize the BP neural network's initial weights and thresholds and improve the accuracy of the classification algorithm. The MapReduce parallel programming model was utilized to achieve parallel processing of the BP algorithm, thereby solving the problems of hardware and communication overhead when the BP neural network addresses big data. Datasets on 5 different scales were constructed using the scene image library from the SUN Database. The classification accuracy of the parallel PSO-BP neural network algorithm is approximately 92%, and the system efficiency is approximately 0.85, which presents obvious advantages when processing big data. The algorithm proposed in this study demonstrated both higher classification accuracy and improved time efficiency, which represents a significant improvement obtained from applying parallel processing to an intelligent algorithm on big data. PMID:27304987

  20. Big Data: A Parallel Particle Swarm Optimization-Back-Propagation Neural Network Algorithm Based on MapReduce.

    PubMed

    Cao, Jianfang; Cui, Hongyan; Shi, Hao; Jiao, Lijuan

    2016-01-01

    A back-propagation (BP) neural network can solve complicated random nonlinear mapping problems; therefore, it can be applied to a wide range of problems. However, as the sample size increases, the time required to train BP neural networks becomes lengthy. Moreover, the classification accuracy decreases as well. To improve the classification accuracy and runtime efficiency of the BP neural network algorithm, we proposed a parallel design and realization method for a particle swarm optimization (PSO)-optimized BP neural network based on MapReduce on the Hadoop platform using both the PSO algorithm and a parallel design. The PSO algorithm was used to optimize the BP neural network's initial weights and thresholds and improve the accuracy of the classification algorithm. The MapReduce parallel programming model was utilized to achieve parallel processing of the BP algorithm, thereby solving the problems of hardware and communication overhead when the BP neural network addresses big data. Datasets on 5 different scales were constructed using the scene image library from the SUN Database. The classification accuracy of the parallel PSO-BP neural network algorithm is approximately 92%, and the system efficiency is approximately 0.85, which presents obvious advantages when processing big data. The algorithm proposed in this study demonstrated both higher classification accuracy and improved time efficiency, which represents a significant improvement obtained from applying parallel processing to an intelligent algorithm on big data.

  1. Big Data: A Parallel Particle Swarm Optimization-Back-Propagation Neural Network Algorithm Based on MapReduce

    PubMed Central

    Cao, Jianfang; Cui, Hongyan; Shi, Hao; Jiao, Lijuan

    2016-01-01

    A back-propagation (BP) neural network can solve complicated random nonlinear mapping problems; therefore, it can be applied to a wide range of problems. However, as the sample size increases, the time required to train BP neural networks becomes lengthy. Moreover, the classification accuracy decreases as well. To improve the classification accuracy and runtime efficiency of the BP neural network algorithm, we proposed a parallel design and realization method for a particle swarm optimization (PSO)-optimized BP neural network based on MapReduce on the Hadoop platform using both the PSO algorithm and a parallel design. The PSO algorithm was used to optimize the BP neural network’s initial weights and thresholds and improve the accuracy of the classification algorithm. The MapReduce parallel programming model was utilized to achieve parallel processing of the BP algorithm, thereby solving the problems of hardware and communication overhead when the BP neural network addresses big data. Datasets on 5 different scales were constructed using the scene image library from the SUN Database. The classification accuracy of the parallel PSO-BP neural network algorithm is approximately 92%, and the system efficiency is approximately 0.85, which presents obvious advantages when processing big data. The algorithm proposed in this study demonstrated both higher classification accuracy and improved time efficiency, which represents a significant improvement obtained from applying parallel processing to an intelligent algorithm on big data. PMID:27304987

  2. RBF neural network based PI pitch controller for a class of 5-MW wind turbines using particle swarm optimization algorithm.

    PubMed

    Poultangari, Iman; Shahnazi, Reza; Sheikhan, Mansour

    2012-09-01

    In order to control the pitch angle of blades in wind turbines, commonly the proportional and integral (PI) controller due to its simplicity and industrial usability is employed. The neural networks and evolutionary algorithms are tools that provide a suitable ground to determine the optimal PI gains. In this paper, a radial basis function (RBF) neural network based PI controller is proposed for collective pitch control (CPC) of a 5-MW wind turbine. In order to provide an optimal dataset to train the RBF neural network, particle swarm optimization (PSO) evolutionary algorithm is used. The proposed method does not need the complexities, nonlinearities and uncertainties of the system under control. The simulation results show that the proposed controller has satisfactory performance. PMID:22738782

  3. Temperature drift modeling and compensation of fiber optical gyroscope based on improved support vector machine and particle swarm optimization algorithms.

    PubMed

    Wang, Wei; Chen, Xiyuan

    2016-08-10

    Modeling and compensation of temperature drift is an important method for improving the precision of fiber-optic gyroscopes (FOGs). In this paper, a new method of modeling and compensation for FOGs based on improved particle swarm optimization (PSO) and support vector machine (SVM) algorithms is proposed. The convergence speed and reliability of PSO are improved by introducing a dynamic inertia factor. The regression accuracy of SVM is improved by introducing a combined kernel function with four parameters and piecewise regression with fixed steps. The steps are as follows. First, the parameters of the combined kernel functions are optimized by the improved PSO algorithm. Second, the proposed kernel function of SVM is used to carry out piecewise regression, and the regression model is also obtained. Third, the temperature drift is compensated for by the regression data. The regression accuracy of the proposed method (in the case of mean square percentage error indicators) increased by 83.81% compared to the traditional SVM.

  4. Particle swarm optimization algorithm based parameters estimation and control of epileptiform spikes in a neural mass model.

    PubMed

    Shan, Bonan; Wang, Jiang; Deng, Bin; Wei, Xile; Yu, Haitao; Zhang, Zhen; Li, Huiyan

    2016-07-01

    This paper proposes an epilepsy detection and closed-loop control strategy based on Particle Swarm Optimization (PSO) algorithm. The proposed strategy can effectively suppress the epileptic spikes in neural mass models, where the epileptiform spikes are recognized as the biomarkers of transitions from the normal (interictal) activity to the seizure (ictal) activity. In addition, the PSO algorithm shows capabilities of accurate estimation for the time evolution of key model parameters and practical detection for all the epileptic spikes. The estimation effects of unmeasurable parameters are improved significantly compared with unscented Kalman filter. When the estimated excitatory-inhibitory ratio exceeds a threshold value, the epileptiform spikes can be inhibited immediately by adopting the proportion-integration controller. Besides, numerical simulations are carried out to illustrate the effectiveness of the proposed method as well as the potential value for the model-based early seizure detection and closed-loop control treatment design. PMID:27475078

  5. RBF neural network based PI pitch controller for a class of 5-MW wind turbines using particle swarm optimization algorithm.

    PubMed

    Poultangari, Iman; Shahnazi, Reza; Sheikhan, Mansour

    2012-09-01

    In order to control the pitch angle of blades in wind turbines, commonly the proportional and integral (PI) controller due to its simplicity and industrial usability is employed. The neural networks and evolutionary algorithms are tools that provide a suitable ground to determine the optimal PI gains. In this paper, a radial basis function (RBF) neural network based PI controller is proposed for collective pitch control (CPC) of a 5-MW wind turbine. In order to provide an optimal dataset to train the RBF neural network, particle swarm optimization (PSO) evolutionary algorithm is used. The proposed method does not need the complexities, nonlinearities and uncertainties of the system under control. The simulation results show that the proposed controller has satisfactory performance.

  6. Particle swarm optimization algorithm based parameters estimation and control of epileptiform spikes in a neural mass model

    NASA Astrophysics Data System (ADS)

    Shan, Bonan; Wang, Jiang; Deng, Bin; Wei, Xile; Yu, Haitao; Zhang, Zhen; Li, Huiyan

    2016-07-01

    This paper proposes an epilepsy detection and closed-loop control strategy based on Particle Swarm Optimization (PSO) algorithm. The proposed strategy can effectively suppress the epileptic spikes in neural mass models, where the epileptiform spikes are recognized as the biomarkers of transitions from the normal (interictal) activity to the seizure (ictal) activity. In addition, the PSO algorithm shows capabilities of accurate estimation for the time evolution of key model parameters and practical detection for all the epileptic spikes. The estimation effects of unmeasurable parameters are improved significantly compared with unscented Kalman filter. When the estimated excitatory-inhibitory ratio exceeds a threshold value, the epileptiform spikes can be inhibited immediately by adopting the proportion-integration controller. Besides, numerical simulations are carried out to illustrate the effectiveness of the proposed method as well as the potential value for the model-based early seizure detection and closed-loop control treatment design.

  7. Classification of Medical Datasets Using SVMs with Hybrid Evolutionary Algorithms Based on Endocrine-Based Particle Swarm Optimization and Artificial Bee Colony Algorithms.

    PubMed

    Lin, Kuan-Cheng; Hsieh, Yi-Hsiu

    2015-10-01

    The classification and analysis of data is an important issue in today's research. Selecting a suitable set of features makes it possible to classify an enormous quantity of data quickly and efficiently. Feature selection is generally viewed as a problem of feature subset selection, such as combination optimization problems. Evolutionary algorithms using random search methods have proven highly effective in obtaining solutions to problems of optimization in a diversity of applications. In this study, we developed a hybrid evolutionary algorithm based on endocrine-based particle swarm optimization (EPSO) and artificial bee colony (ABC) algorithms in conjunction with a support vector machine (SVM) for the selection of optimal feature subsets for the classification of datasets. The results of experiments using specific UCI medical datasets demonstrate that the accuracy of the proposed hybrid evolutionary algorithm is superior to that of basic PSO, EPSO and ABC algorithms, with regard to classification accuracy using subsets with a reduced number of features.

  8. Design of fiber coupled Er:chalcogenide microsphere amplifier via particle swarm optimization algorithm

    NASA Astrophysics Data System (ADS)

    Palma, Giuseppe; Bia, Pietro; Mescia, Luciano; Yano, Tetsuji; Nazabal, Virginie; Taguchi, Jun; Moréac, Alain; Prudenzano, Francesco

    2014-07-01

    A mid-IR amplifier consisting of a tapered chalcogenide fiber coupled to an Er-doped chalcogenide microsphere has been optimized via a particle swarm optimization (PSO) approach. More precisely, a dedicated three-dimensional numerical model, based on the coupled mode theory and solving the rate equations, has been integrated with the PSO procedure. The rate equations have included the main transitions among the erbium energy levels, the amplified spontaneous emission, and the most important secondary transitions pertaining to the ion-ion interactions. The PSO has allowed the optimal choice of the microsphere and fiber radius, taper angle, and fiber-microsphere gap in order to maximize the amplifier gain. The taper angle and the fiber-microsphere gap have been optimized to efficiently inject into the microsphere both the pump and the signal beams and to improve their spatial overlapping with the rare-earth-doped region. The employment of the PSO approach shows different attractive features, especially when many parameters have to be optimized. The numerical results demonstrate the effectiveness of the proposed approach for the design of amplifying systems. The PSO-based optimization approach has allowed the design of a microsphere-based amplifying system more efficient than a similar device designed by using a deterministic optimization method. In fact, the amplifier designed via the PSO exhibits a simulated gain G=33.7 dB, which is higher than the gain G=6.9 dB of the amplifier designed via the deterministic method.

  9. Pump scheme for gain-flattened Raman fiber amplifiers using improved particle swarm optimization and modified shooting algorithm.

    PubMed

    Jiang, Hai-ming; Xie, Kang; Wang, Ya-fei

    2010-05-24

    An effective pump scheme for the design of broadband and flat gain spectrum Raman fiber amplifiers is proposed. This novel approach uses a new shooting algorithm based on a modified Newton-Raphson method and a contraction factor to solve the two point boundary problems of Raman coupled equations more stably and efficiently. In combination with an improved particle swarm optimization method, which improves the efficiency and convergence rate by introducing a new parameter called velocity acceptability probability, this scheme optimizes the wavelengths and power levels for the pumps quickly and accurately. Several broadband Raman fiber amplifiers in C+L band with optimized pump parameters are designed. An amplifier of 4 pumps is designed to deliver an average on-off gain of 13.3 dB for a bandwidth of 80 nm, with about +/-0.5 dB in band maximum gain ripples.

  10. A Localization Method for Underwater Wireless Sensor Networks Based on Mobility Prediction and Particle Swarm Optimization Algorithms.

    PubMed

    Zhang, Ying; Liang, Jixing; Jiang, Shengming; Chen, Wei

    2016-01-01

    Due to their special environment, Underwater Wireless Sensor Networks (UWSNs) are usually deployed over a large sea area and the nodes are usually floating. This results in a lower beacon node distribution density, a longer time for localization, and more energy consumption. Currently most of the localization algorithms in this field do not pay enough consideration on the mobility of the nodes. In this paper, by analyzing the mobility patterns of water near the seashore, a localization method for UWSNs based on a Mobility Prediction and a Particle Swarm Optimization algorithm (MP-PSO) is proposed. In this method, the range-based PSO algorithm is used to locate the beacon nodes, and their velocities can be calculated. The velocity of an unknown node is calculated by using the spatial correlation of underwater object's mobility, and then their locations can be predicted. The range-based PSO algorithm may cause considerable energy consumption and its computation complexity is a little bit high, nevertheless the number of beacon nodes is relatively smaller, so the calculation for the large number of unknown nodes is succinct, and this method can obviously decrease the energy consumption and time cost of localizing these mobile nodes. The simulation results indicate that this method has higher localization accuracy and better localization coverage rate compared with some other widely used localization methods in this field. PMID:26861348

  11. A Localization Method for Underwater Wireless Sensor Networks Based on Mobility Prediction and Particle Swarm Optimization Algorithms

    PubMed Central

    Zhang, Ying; Liang, Jixing; Jiang, Shengming; Chen, Wei

    2016-01-01

    Due to their special environment, Underwater Wireless Sensor Networks (UWSNs) are usually deployed over a large sea area and the nodes are usually floating. This results in a lower beacon node distribution density, a longer time for localization, and more energy consumption. Currently most of the localization algorithms in this field do not pay enough consideration on the mobility of the nodes. In this paper, by analyzing the mobility patterns of water near the seashore, a localization method for UWSNs based on a Mobility Prediction and a Particle Swarm Optimization algorithm (MP-PSO) is proposed. In this method, the range-based PSO algorithm is used to locate the beacon nodes, and their velocities can be calculated. The velocity of an unknown node is calculated by using the spatial correlation of underwater object’s mobility, and then their locations can be predicted. The range-based PSO algorithm may cause considerable energy consumption and its computation complexity is a little bit high, nevertheless the number of beacon nodes is relatively smaller, so the calculation for the large number of unknown nodes is succinct, and this method can obviously decrease the energy consumption and time cost of localizing these mobile nodes. The simulation results indicate that this method has higher localization accuracy and better localization coverage rate compared with some other widely used localization methods in this field. PMID:26861348

  12. A Localization Method for Underwater Wireless Sensor Networks Based on Mobility Prediction and Particle Swarm Optimization Algorithms.

    PubMed

    Zhang, Ying; Liang, Jixing; Jiang, Shengming; Chen, Wei

    2016-01-01

    Due to their special environment, Underwater Wireless Sensor Networks (UWSNs) are usually deployed over a large sea area and the nodes are usually floating. This results in a lower beacon node distribution density, a longer time for localization, and more energy consumption. Currently most of the localization algorithms in this field do not pay enough consideration on the mobility of the nodes. In this paper, by analyzing the mobility patterns of water near the seashore, a localization method for UWSNs based on a Mobility Prediction and a Particle Swarm Optimization algorithm (MP-PSO) is proposed. In this method, the range-based PSO algorithm is used to locate the beacon nodes, and their velocities can be calculated. The velocity of an unknown node is calculated by using the spatial correlation of underwater object's mobility, and then their locations can be predicted. The range-based PSO algorithm may cause considerable energy consumption and its computation complexity is a little bit high, nevertheless the number of beacon nodes is relatively smaller, so the calculation for the large number of unknown nodes is succinct, and this method can obviously decrease the energy consumption and time cost of localizing these mobile nodes. The simulation results indicate that this method has higher localization accuracy and better localization coverage rate compared with some other widely used localization methods in this field.

  13. Selectively-informed particle swarm optimization.

    PubMed

    Gao, Yang; Du, Wenbo; Yan, Gang

    2015-01-01

    Particle swarm optimization (PSO) is a nature-inspired algorithm that has shown outstanding performance in solving many realistic problems. In the original PSO and most of its variants all particles are treated equally, overlooking the impact of structural heterogeneity on individual behavior. Here we employ complex networks to represent the population structure of swarms and propose a selectively-informed PSO (SIPSO), in which the particles choose different learning strategies based on their connections: a densely-connected hub particle gets full information from all of its neighbors while a non-hub particle with few connections can only follow a single yet best-performed neighbor. Extensive numerical experiments on widely-used benchmark functions show that our SIPSO algorithm remarkably outperforms the PSO and its existing variants in success rate, solution quality, and convergence speed. We also explore the evolution process from a microscopic point of view, leading to the discovery of different roles that the particles play in optimization. The hub particles guide the optimization process towards correct directions while the non-hub particles maintain the necessary population diversity, resulting in the optimum overall performance of SIPSO. These findings deepen our understanding of swarm intelligence and may shed light on the underlying mechanism of information exchange in natural swarm and flocking behaviors. PMID:25787315

  14. Selectively-informed particle swarm optimization

    PubMed Central

    Gao, Yang; Du, Wenbo; Yan, Gang

    2015-01-01

    Particle swarm optimization (PSO) is a nature-inspired algorithm that has shown outstanding performance in solving many realistic problems. In the original PSO and most of its variants all particles are treated equally, overlooking the impact of structural heterogeneity on individual behavior. Here we employ complex networks to represent the population structure of swarms and propose a selectively-informed PSO (SIPSO), in which the particles choose different learning strategies based on their connections: a densely-connected hub particle gets full information from all of its neighbors while a non-hub particle with few connections can only follow a single yet best-performed neighbor. Extensive numerical experiments on widely-used benchmark functions show that our SIPSO algorithm remarkably outperforms the PSO and its existing variants in success rate, solution quality, and convergence speed. We also explore the evolution process from a microscopic point of view, leading to the discovery of different roles that the particles play in optimization. The hub particles guide the optimization process towards correct directions while the non-hub particles maintain the necessary population diversity, resulting in the optimum overall performance of SIPSO. These findings deepen our understanding of swarm intelligence and may shed light on the underlying mechanism of information exchange in natural swarm and flocking behaviors. PMID:25787315

  15. Selectively-informed particle swarm optimization

    NASA Astrophysics Data System (ADS)

    Gao, Yang; Du, Wenbo; Yan, Gang

    2015-03-01

    Particle swarm optimization (PSO) is a nature-inspired algorithm that has shown outstanding performance in solving many realistic problems. In the original PSO and most of its variants all particles are treated equally, overlooking the impact of structural heterogeneity on individual behavior. Here we employ complex networks to represent the population structure of swarms and propose a selectively-informed PSO (SIPSO), in which the particles choose different learning strategies based on their connections: a densely-connected hub particle gets full information from all of its neighbors while a non-hub particle with few connections can only follow a single yet best-performed neighbor. Extensive numerical experiments on widely-used benchmark functions show that our SIPSO algorithm remarkably outperforms the PSO and its existing variants in success rate, solution quality, and convergence speed. We also explore the evolution process from a microscopic point of view, leading to the discovery of different roles that the particles play in optimization. The hub particles guide the optimization process towards correct directions while the non-hub particles maintain the necessary population diversity, resulting in the optimum overall performance of SIPSO. These findings deepen our understanding of swarm intelligence and may shed light on the underlying mechanism of information exchange in natural swarm and flocking behaviors.

  16. Designing a multistage supply chain in cross-stage reverse logistics environments: application of particle swarm optimization algorithms.

    PubMed

    Chiang, Tzu-An; Che, Z H; Cui, Zhihua

    2014-01-01

    This study designed a cross-stage reverse logistics course for defective products so that damaged products generated in downstream partners can be directly returned to upstream partners throughout the stages of a supply chain for rework and maintenance. To solve this reverse supply chain design problem, an optimal cross-stage reverse logistics mathematical model was developed. In addition, we developed a genetic algorithm (GA) and three particle swarm optimization (PSO) algorithms: the inertia weight method (PSOA_IWM), V(Max) method (PSOA_VMM), and constriction factor method (PSOA_CFM), which we employed to find solutions to support this mathematical model. Finally, a real case and five simulative cases with different scopes were used to compare the execution times, convergence times, and objective function values of the four algorithms used to validate the model proposed in this study. Regarding system execution time, the GA consumed more time than the other three PSOs did. Regarding objective function value, the GA, PSOA_IWM, and PSOA_CFM could obtain a lower convergence value than PSOA_VMM could. Finally, PSOA_IWM demonstrated a faster convergence speed than PSOA_VMM, PSOA_CFM, and the GA did. PMID:24772026

  17. Constant optimization of oral drug absorption kinetics in the compartment absorption and transit models using particle swarm optimization algorithm

    NASA Astrophysics Data System (ADS)

    Prabowo, K.; Sumaryada, T.; Kartono, A.

    2016-01-01

    Simulation of predictive modeling oral drug namely Compartment Absorption and Transit (CAT) using Particle Swarm Optimization (PSO) algorithm has been performed. This research will be carried out optimization of kinetic constant value oral drug use PSO algorithm to obtain the best global transport constant values for CAT equation that can predict drug concentration in plasma. The value of drug absorption rate constant for drug atenolol 25 mg is k10, k12, k21, k13 and k31 with each value is 0.8562, 0.3736, 0.2191, 0.4334 and 1.000 have been obtained thus raising the value of the coefficient of determination of a model CAT. From the experimental data plasma drug concentrations used are Atenolol, the coefficient of determination (R2) obtained from simulations atenolol 25 mg (PSO) was 81.72% and 99.46%. Better correlation between the dependent variable as the drug concentration and explanatory variables such as mass medication, plasma volume, and rate of absorption of the drug has increased in CAT models using PSO algorithm. Based on the results of CAT models fit charts can predict drug concentration in plasma.

  18. Designing a Multistage Supply Chain in Cross-Stage Reverse Logistics Environments: Application of Particle Swarm Optimization Algorithms

    PubMed Central

    Chiang, Tzu-An; Che, Z. H.

    2014-01-01

    This study designed a cross-stage reverse logistics course for defective products so that damaged products generated in downstream partners can be directly returned to upstream partners throughout the stages of a supply chain for rework and maintenance. To solve this reverse supply chain design problem, an optimal cross-stage reverse logistics mathematical model was developed. In addition, we developed a genetic algorithm (GA) and three particle swarm optimization (PSO) algorithms: the inertia weight method (PSOA_IWM), VMax method (PSOA_VMM), and constriction factor method (PSOA_CFM), which we employed to find solutions to support this mathematical model. Finally, a real case and five simulative cases with different scopes were used to compare the execution times, convergence times, and objective function values of the four algorithms used to validate the model proposed in this study. Regarding system execution time, the GA consumed more time than the other three PSOs did. Regarding objective function value, the GA, PSOA_IWM, and PSOA_CFM could obtain a lower convergence value than PSOA_VMM could. Finally, PSOA_IWM demonstrated a faster convergence speed than PSOA_VMM, PSOA_CFM, and the GA did. PMID:24772026

  19. Incremental social learning in particle swarms.

    PubMed

    de Oca, Marco A Montes; Stutzle, Thomas; Van den Enden, Ken; Dorigo, Marco

    2011-04-01

    Incremental social learning (ISL) was proposed as a way to improve the scalability of systems composed of multiple learning agents. In this paper, we show that ISL can be very useful to improve the performance of population-based optimization algorithms. Our study focuses on two particle swarm optimization (PSO) algorithms: a) the incremental particle swarm optimizer (IPSO), which is a PSO algorithm with a growing population size in which the initial position of new particles is biased toward the best-so-far solution, and b) the incremental particle swarm optimizer with local search (IPSOLS), in which solutions are further improved through a local search procedure. We first derive analytically the probability density function induced by the proposed initialization rule applied to new particles. Then, we compare the performance of IPSO and IPSOLS on a set of benchmark functions with that of other PSO algorithms (with and without local search) and a random restart local search algorithm. Finally, we measure the benefits of using incremental social learning on PSO algorithms by running IPSO and IPSOLS on problems with different fitness distance correlations. PMID:20875976

  20. A comprehensive review of swarm optimization algorithms.

    PubMed

    Ab Wahab, Mohd Nadhir; Nefti-Meziani, Samia; Atyabi, Adham

    2015-01-01

    Many swarm optimization algorithms have been introduced since the early 60's, Evolutionary Programming to the most recent, Grey Wolf Optimization. All of these algorithms have demonstrated their potential to solve many optimization problems. This paper provides an in-depth survey of well-known optimization algorithms. Selected algorithms are briefly explained and compared with each other comprehensively through experiments conducted using thirty well-known benchmark functions. Their advantages and disadvantages are also discussed. A number of statistical tests are then carried out to determine the significant performances. The results indicate the overall advantage of Differential Evolution (DE) and is closely followed by Particle Swarm Optimization (PSO), compared with other considered approaches. PMID:25992655

  1. A Comprehensive Review of Swarm Optimization Algorithms

    PubMed Central

    2015-01-01

    Many swarm optimization algorithms have been introduced since the early 60’s, Evolutionary Programming to the most recent, Grey Wolf Optimization. All of these algorithms have demonstrated their potential to solve many optimization problems. This paper provides an in-depth survey of well-known optimization algorithms. Selected algorithms are briefly explained and compared with each other comprehensively through experiments conducted using thirty well-known benchmark functions. Their advantages and disadvantages are also discussed. A number of statistical tests are then carried out to determine the significant performances. The results indicate the overall advantage of Differential Evolution (DE) and is closely followed by Particle Swarm Optimization (PSO), compared with other considered approaches. PMID:25992655

  2. Multiswarm Particle Swarm Optimization with Transfer of the Best Particle

    PubMed Central

    Wei, Xiao-peng; Zhang, Jian-xia; Zhou, Dong-sheng; Zhang, Qiang

    2015-01-01

    We propose an improved algorithm, for a multiswarm particle swarm optimization with transfer of the best particle called BMPSO. In the proposed algorithm, we introduce parasitism into the standard particle swarm algorithm (PSO) in order to balance exploration and exploitation, as well as enhancing the capacity for global search to solve nonlinear optimization problems. First, the best particle guides other particles to prevent them from being trapped by local optima. We provide a detailed description of BMPSO. We also present a diversity analysis of the proposed BMPSO, which is explained based on the Sphere function. Finally, we tested the performance of the proposed algorithm with six standard test functions and an engineering problem. Compared with some other algorithms, the results showed that the proposed BMPSO performed better when applied to the test functions and the engineering problem. Furthermore, the proposed BMPSO can be applied to other nonlinear optimization problems. PMID:26345200

  3. Temperature drift modeling and compensation of fiber optical gyroscope based on improved support vector machine and particle swarm optimization algorithms.

    PubMed

    Wang, Wei; Chen, Xiyuan

    2016-08-10

    Modeling and compensation of temperature drift is an important method for improving the precision of fiber-optic gyroscopes (FOGs). In this paper, a new method of modeling and compensation for FOGs based on improved particle swarm optimization (PSO) and support vector machine (SVM) algorithms is proposed. The convergence speed and reliability of PSO are improved by introducing a dynamic inertia factor. The regression accuracy of SVM is improved by introducing a combined kernel function with four parameters and piecewise regression with fixed steps. The steps are as follows. First, the parameters of the combined kernel functions are optimized by the improved PSO algorithm. Second, the proposed kernel function of SVM is used to carry out piecewise regression, and the regression model is also obtained. Third, the temperature drift is compensated for by the regression data. The regression accuracy of the proposed method (in the case of mean square percentage error indicators) increased by 83.81% compared to the traditional SVM. PMID:27534465

  4. Comparison of Genetic Algorithm, Particle Swarm Optimization and Biogeography-based Optimization for Feature Selection to Classify Clusters of Microcalcifications

    NASA Astrophysics Data System (ADS)

    Khehra, Baljit Singh; Pharwaha, Amar Partap Singh

    2016-06-01

    Ductal carcinoma in situ (DCIS) is one type of breast cancer. Clusters of microcalcifications (MCCs) are symptoms of DCIS that are recognized by mammography. Selection of robust features vector is the process of selecting an optimal subset of features from a large number of available features in a given problem domain after the feature extraction and before any classification scheme. Feature selection reduces the feature space that improves the performance of classifier and decreases the computational burden imposed by using many features on classifier. Selection of an optimal subset of features from a large number of available features in a given problem domain is a difficult search problem. For n features, the total numbers of possible subsets of features are 2n. Thus, selection of an optimal subset of features problem belongs to the category of NP-hard problems. In this paper, an attempt is made to find the optimal subset of MCCs features from all possible subsets of features using genetic algorithm (GA), particle swarm optimization (PSO) and biogeography-based optimization (BBO). For simulation, a total of 380 benign and malignant MCCs samples have been selected from mammogram images of DDSM database. A total of 50 features extracted from benign and malignant MCCs samples are used in this study. In these algorithms, fitness function is correct classification rate of classifier. Support vector machine is used as a classifier. From experimental results, it is also observed that the performance of PSO-based and BBO-based algorithms to select an optimal subset of features for classifying MCCs as benign or malignant is better as compared to GA-based algorithm.

  5. Chaotic Particle Swarm Optimization with Mutation for Classification

    PubMed Central

    Assarzadeh, Zahra; Naghsh-Nilchi, Ahmad Reza

    2015-01-01

    In this paper, a chaotic particle swarm optimization with mutation-based classifier particle swarm optimization is proposed to classify patterns of different classes in the feature space. The introduced mutation operators and chaotic sequences allows us to overcome the problem of early convergence into a local minima associated with particle swarm optimization algorithms. That is, the mutation operator sharpens the convergence and it tunes the best possible solution. Furthermore, to remove the irrelevant data and reduce the dimensionality of medical datasets, a feature selection approach using binary version of the proposed particle swarm optimization is introduced. In order to demonstrate the effectiveness of our proposed classifier, mutation-based classifier particle swarm optimization, it is checked out with three sets of data classifications namely, Wisconsin diagnostic breast cancer, Wisconsin breast cancer and heart-statlog, with different feature vector dimensions. The proposed algorithm is compared with different classifier algorithms including k-nearest neighbor, as a conventional classifier, particle swarm-classifier, genetic algorithm, and Imperialist competitive algorithm-classifier, as more sophisticated ones. The performance of each classifier was evaluated by calculating the accuracy, sensitivity, specificity and Matthews's correlation coefficient. The experimental results show that the mutation-based classifier particle swarm optimization unequivocally performs better than all the compared algorithms. PMID:25709937

  6. Chaotic particle swarm optimization with mutation for classification.

    PubMed

    Assarzadeh, Zahra; Naghsh-Nilchi, Ahmad Reza

    2015-01-01

    In this paper, a chaotic particle swarm optimization with mutation-based classifier particle swarm optimization is proposed to classify patterns of different classes in the feature space. The introduced mutation operators and chaotic sequences allows us to overcome the problem of early convergence into a local minima associated with particle swarm optimization algorithms. That is, the mutation operator sharpens the convergence and it tunes the best possible solution. Furthermore, to remove the irrelevant data and reduce the dimensionality of medical datasets, a feature selection approach using binary version of the proposed particle swarm optimization is introduced. In order to demonstrate the effectiveness of our proposed classifier, mutation-based classifier particle swarm optimization, it is checked out with three sets of data classifications namely, Wisconsin diagnostic breast cancer, Wisconsin breast cancer and heart-statlog, with different feature vector dimensions. The proposed algorithm is compared with different classifier algorithms including k-nearest neighbor, as a conventional classifier, particle swarm-classifier, genetic algorithm, and Imperialist competitive algorithm-classifier, as more sophisticated ones. The performance of each classifier was evaluated by calculating the accuracy, sensitivity, specificity and Matthews's correlation coefficient. The experimental results show that the mutation-based classifier particle swarm optimization unequivocally performs better than all the compared algorithms. PMID:25709937

  7. Multi-Item Multiperiodic Inventory Control Problem with Variable Demand and Discounts: A Particle Swarm Optimization Algorithm

    PubMed Central

    Mousavi, Seyed Mohsen; Niaki, S. T. A.; Bahreininejad, Ardeshir; Musa, Siti Nurmaya

    2014-01-01

    A multi-item multiperiod inventory control model is developed for known-deterministic variable demands under limited available budget. Assuming the order quantity is more than the shortage quantity in each period, the shortage in combination of backorder and lost sale is considered. The orders are placed in batch sizes and the decision variables are assumed integer. Moreover, all unit discounts for a number of products and incremental quantity discount for some other items are considered. While the objectives are to minimize both the total inventory cost and the required storage space, the model is formulated into a fuzzy multicriteria decision making (FMCDM) framework and is shown to be a mixed integer nonlinear programming type. In order to solve the model, a multiobjective particle swarm optimization (MOPSO) approach is applied. A set of compromise solution including optimum and near optimum ones via MOPSO has been derived for some numerical illustration, where the results are compared with those obtained using a weighting approach. To assess the efficiency of the proposed MOPSO, the model is solved using multi-objective genetic algorithm (MOGA) as well. A large number of numerical examples are generated at the end, where graphical and statistical approaches show more efficiency of MOPSO compared with MOGA. PMID:25093195

  8. Analysis of image thresholding segmentation algorithms based on swarm intelligence

    NASA Astrophysics Data System (ADS)

    Zhang, Yi; Lu, Kai; Gao, Yinghui; Yang, Bo

    2013-03-01

    Swarm intelligence-based image thresholding segmentation algorithms are playing an important role in the research field of image segmentation. In this paper, we briefly introduce the theories of four existing image segmentation algorithms based on swarm intelligence including fish swarm algorithm, artificial bee colony, bacteria foraging algorithm and particle swarm optimization. Then some image benchmarks are tested in order to show the differences of the segmentation accuracy, time consumption, convergence and robustness for Salt & Pepper noise and Gaussian noise of these four algorithms. Through these comparisons, this paper gives qualitative analyses for the performance variance of the four algorithms. The conclusions in this paper would give a significant guide for the actual image segmentation.

  9. Lagrange Interpolation Learning Particle Swarm Optimization.

    PubMed

    Kai, Zhang; Jinchun, Song; Ke, Ni; Song, Li

    2016-01-01

    In recent years, comprehensive learning particle swarm optimization (CLPSO) has attracted the attention of many scholars for using in solving multimodal problems, as it is excellent in preserving the particles' diversity and thus preventing premature convergence. However, CLPSO exhibits low solution accuracy. Aiming to address this issue, we proposed a novel algorithm called LILPSO. First, this algorithm introduced a Lagrange interpolation method to perform a local search for the global best point (gbest). Second, to gain a better exemplar, one gbest, another two particle's historical best points (pbest) are chosen to perform Lagrange interpolation, then to gain a new exemplar, which replaces the CLPSO's comparison method. The numerical experiments conducted on various functions demonstrate the superiority of this algorithm, and the two methods are proven to be efficient for accelerating the convergence without leading the particle to premature convergence. PMID:27123982

  10. Feed-Forward Neural Network Soft-Sensor Modeling of Flotation Process Based on Particle Swarm Optimization and Gravitational Search Algorithm.

    PubMed

    Wang, Jie-Sheng; Han, Shuang

    2015-01-01

    For predicting the key technology indicators (concentrate grade and tailings recovery rate) of flotation process, a feed-forward neural network (FNN) based soft-sensor model optimized by the hybrid algorithm combining particle swarm optimization (PSO) algorithm and gravitational search algorithm (GSA) is proposed. Although GSA has better optimization capability, it has slow convergence velocity and is easy to fall into local optimum. So in this paper, the velocity vector and position vector of GSA are adjusted by PSO algorithm in order to improve its convergence speed and prediction accuracy. Finally, the proposed hybrid algorithm is adopted to optimize the parameters of FNN soft-sensor model. Simulation results show that the model has better generalization and prediction accuracy for the concentrate grade and tailings recovery rate to meet the online soft-sensor requirements of the real-time control in the flotation process.

  11. Feed-Forward Neural Network Soft-Sensor Modeling of Flotation Process Based on Particle Swarm Optimization and Gravitational Search Algorithm

    PubMed Central

    Wang, Jie-Sheng; Han, Shuang

    2015-01-01

    For predicting the key technology indicators (concentrate grade and tailings recovery rate) of flotation process, a feed-forward neural network (FNN) based soft-sensor model optimized by the hybrid algorithm combining particle swarm optimization (PSO) algorithm and gravitational search algorithm (GSA) is proposed. Although GSA has better optimization capability, it has slow convergence velocity and is easy to fall into local optimum. So in this paper, the velocity vector and position vector of GSA are adjusted by PSO algorithm in order to improve its convergence speed and prediction accuracy. Finally, the proposed hybrid algorithm is adopted to optimize the parameters of FNN soft-sensor model. Simulation results show that the model has better generalization and prediction accuracy for the concentrate grade and tailings recovery rate to meet the online soft-sensor requirements of the real-time control in the flotation process. PMID:26583034

  12. A Particle Swarm Optimization Algorithm for Optimal Operating Parameters of VMI Systems in a Two-Echelon Supply Chain

    NASA Astrophysics Data System (ADS)

    Sue-Ann, Goh; Ponnambalam, S. G.

    This paper focuses on the operational issues of a Two-echelon Single-Vendor-Multiple-Buyers Supply chain (TSVMBSC) under vendor managed inventory (VMI) mode of operation. To determine the optimal sales quantity for each buyer in TSVMBC, a mathematical model is formulated. Based on the optimal sales quantity can be obtained and the optimal sales price that will determine the optimal channel profit and contract price between the vendor and buyer. All this parameters depends upon the understanding of the revenue sharing between the vendor and buyers. A Particle Swarm Optimization (PSO) is proposed for this problem. Solutions obtained from PSO is compared with the best known results reported in literature.

  13. Particle Swarm Optimization with Double Learning Patterns.

    PubMed

    Shen, Yuanxia; Wei, Linna; Zeng, Chuanhua; Chen, Jian

    2016-01-01

    Particle Swarm Optimization (PSO) is an effective tool in solving optimization problems. However, PSO usually suffers from the premature convergence due to the quick losing of the swarm diversity. In this paper, we first analyze the motion behavior of the swarm based on the probability characteristic of learning parameters. Then a PSO with double learning patterns (PSO-DLP) is developed, which employs the master swarm and the slave swarm with different learning patterns to achieve a trade-off between the convergence speed and the swarm diversity. The particles in the master swarm and the slave swarm are encouraged to explore search for keeping the swarm diversity and to learn from the global best particle for refining a promising solution, respectively. When the evolutionary states of two swarms interact, an interaction mechanism is enabled. This mechanism can help the slave swarm in jumping out of the local optima and improve the convergence precision of the master swarm. The proposed PSO-DLP is evaluated on 20 benchmark functions, including rotated multimodal and complex shifted problems. The simulation results and statistical analysis show that PSO-DLP obtains a promising performance and outperforms eight PSO variants. PMID:26858747

  14. Particle Swarm Optimization with Double Learning Patterns

    PubMed Central

    Shen, Yuanxia; Wei, Linna; Zeng, Chuanhua; Chen, Jian

    2016-01-01

    Particle Swarm Optimization (PSO) is an effective tool in solving optimization problems. However, PSO usually suffers from the premature convergence due to the quick losing of the swarm diversity. In this paper, we first analyze the motion behavior of the swarm based on the probability characteristic of learning parameters. Then a PSO with double learning patterns (PSO-DLP) is developed, which employs the master swarm and the slave swarm with different learning patterns to achieve a trade-off between the convergence speed and the swarm diversity. The particles in the master swarm and the slave swarm are encouraged to explore search for keeping the swarm diversity and to learn from the global best particle for refining a promising solution, respectively. When the evolutionary states of two swarms interact, an interaction mechanism is enabled. This mechanism can help the slave swarm in jumping out of the local optima and improve the convergence precision of the master swarm. The proposed PSO-DLP is evaluated on 20 benchmark functions, including rotated multimodal and complex shifted problems. The simulation results and statistical analysis show that PSO-DLP obtains a promising performance and outperforms eight PSO variants. PMID:26858747

  15. Lagrange Interpolation Learning Particle Swarm Optimization

    PubMed Central

    2016-01-01

    In recent years, comprehensive learning particle swarm optimization (CLPSO) has attracted the attention of many scholars for using in solving multimodal problems, as it is excellent in preserving the particles’ diversity and thus preventing premature convergence. However, CLPSO exhibits low solution accuracy. Aiming to address this issue, we proposed a novel algorithm called LILPSO. First, this algorithm introduced a Lagrange interpolation method to perform a local search for the global best point (gbest). Second, to gain a better exemplar, one gbest, another two particle’s historical best points (pbest) are chosen to perform Lagrange interpolation, then to gain a new exemplar, which replaces the CLPSO’s comparison method. The numerical experiments conducted on various functions demonstrate the superiority of this algorithm, and the two methods are proven to be efficient for accelerating the convergence without leading the particle to premature convergence. PMID:27123982

  16. Particle Swarm Transport in Fracture Networks

    NASA Astrophysics Data System (ADS)

    Pyrak-Nolte, L. J.; Mackin, T.; Boomsma, E.

    2012-12-01

    Colloidal particles of many types occur in fractures in the subsurface as a result of both natural and industrial processes (e.g., environmental influences, synthetic nano- & micro-particles from consumer products, chemical and mechanical erosion of geologic material, proppants used in gas and oil extraction, etc.). The degree of localization and speed of transport of such particles depends on the transport mechanisms, the chemical and physical properties of the particles and the surrounding rock, and the flow path geometry through the fracture. In this study, we investigated the transport of particle swarms through artificial fracture networks. A synthetic fracture network was created using an Objet Eden 350V 3D printer to build a network of fractures. Each fracture in the network had a rectangular cross-sectional area with a constant depth of 7 mm but with widths that ranged from 2 mm to 11 mm. The overall dimensions of the network were 132 mm by 166 mm. The fracture network had 7 ports that were used either as the inlet or outlet for fluid flow through the sample or for introducing a particle swarm. Water flow rates through the fracture were controlled with a syringe pump, and ranged from zero flow to 6 ml/min. Swarms were composed of a dilute suspension (2% by mass) of 3 μm fluorescent polystyrene beads in water. Swarms with volumes of 5, 10, 20, 30 and 60 μl were used and delivered into the network using a second syringe pump. The swarm behavior was imaged using an optical fluorescent imaging system illuminated by green (525 nm) LED arrays and captured by a CCD camera. For fracture networks with quiescent fluids, particle swarms fell under gravity and remained localized within the network. Large swarms (30-60 μl) were observed to bifurcate at shallower depths resulting in a broader dispersal of the particles than for smaller swarm volumes. For all swarm volumes studied, particle swarms tended to bifurcate at the intersection between fractures. These

  17. Integration of process planning and production scheduling with particle swarm optimization (PSO) algorithm and fuzzy inference systems

    NASA Astrophysics Data System (ADS)

    Yang, Yahong; Zhao, Fuqing; Hong, Yi; Yu, Dongmei

    2005-12-01

    Integration of process planning with scheduling by considering the manufacturing system's capacity, cost and capacity in its workshop is a critical issue. The concurrency between them can also eliminate the redundant process and optimize the entire production cycle, but most integrated process planning and scheduling methods only consider the time aspects of the alternative machines when constructing schedules. In this paper, a fuzzy inference system (FIS) in choosing alternative machines for integrated process planning and scheduling of a job shop manufacturing system is presented. Instead of choosing alternative machines randomly, machines are being selected based on the machines reliability. The mean time to failure (MTF) values is input in a fuzzy inference mechanism, which outputs the machine reliability. The machine is then being penalized based on the fuzzy output. The most reliable machine will have the higher priority to be chosen. In order to overcome the problem of un-utilization machines, sometimes faced by unreliable machine, the particle swarm optimization (PSO) have been used to balance the load for all the machines. Simulation study shows that the system can be used as an alternative way of choosing machines in integrated process planning and scheduling.

  18. Multiplex protein pattern unmixing using a non-linear variable-weighted support vector machine as optimized by a particle swarm optimization algorithm.

    PubMed

    Yang, Qin; Zou, Hong-Yan; Zhang, Yan; Tang, Li-Juan; Shen, Guo-Li; Jiang, Jian-Hui; Yu, Ru-Qin

    2016-01-15

    Most of the proteins locate more than one organelle in a cell. Unmixing the localization patterns of proteins is critical for understanding the protein functions and other vital cellular processes. Herein, non-linear machine learning technique is proposed for the first time upon protein pattern unmixing. Variable-weighted support vector machine (VW-SVM) is a demonstrated robust modeling technique with flexible and rational variable selection. As optimized by a global stochastic optimization technique, particle swarm optimization (PSO) algorithm, it makes VW-SVM to be an adaptive parameter-free method for automated unmixing of protein subcellular patterns. Results obtained by pattern unmixing of a set of fluorescence microscope images of cells indicate VW-SVM as optimized by PSO is able to extract useful pattern features by optimally rescaling each variable for non-linear SVM modeling, consequently leading to improved performances in multiplex protein pattern unmixing compared with conventional SVM and other exiting pattern unmixing methods.

  19. Land Surface Model and Particle Swarm Optimization Algorithm Based on the Model-Optimization Method for Improving Soil Moisture Simulation in a Semi-Arid Region.

    PubMed

    Yang, Qidong; Zuo, Hongchao; Li, Weidong

    2016-01-01

    Improving the capability of land-surface process models to simulate soil moisture assists in better understanding the atmosphere-land interaction. In semi-arid regions, due to limited near-surface observational data and large errors in large-scale parameters obtained by the remote sensing method, there exist uncertainties in land surface parameters, which can cause large offsets between the simulated results of land-surface process models and the observational data for the soil moisture. In this study, observational data from the Semi-Arid Climate Observatory and Laboratory (SACOL) station in the semi-arid loess plateau of China were divided into three datasets: summer, autumn, and summer-autumn. By combing the particle swarm optimization (PSO) algorithm and the land-surface process model SHAW (Simultaneous Heat and Water), the soil and vegetation parameters that are related to the soil moisture but difficult to obtain by observations are optimized using three datasets. On this basis, the SHAW model was run with the optimized parameters to simulate the characteristics of the land-surface process in the semi-arid loess plateau. Simultaneously, the default SHAW model was run with the same atmospheric forcing as a comparison test. Simulation results revealed the following: parameters optimized by the particle swarm optimization algorithm in all simulation tests improved simulations of the soil moisture and latent heat flux; differences between simulated results and observational data are clearly reduced, but simulation tests involving the adoption of optimized parameters cannot simultaneously improve the simulation results for the net radiation, sensible heat flux, and soil temperature. Optimized soil and vegetation parameters based on different datasets have the same order of magnitude but are not identical; soil parameters only vary to a small degree, but the variation range of vegetation parameters is large. PMID:26991786

  20. Land Surface Model and Particle Swarm Optimization Algorithm Based on the Model-Optimization Method for Improving Soil Moisture Simulation in a Semi-Arid Region

    PubMed Central

    Yang, Qidong; Zuo, Hongchao; Li, Weidong

    2016-01-01

    Improving the capability of land-surface process models to simulate soil moisture assists in better understanding the atmosphere-land interaction. In semi-arid regions, due to limited near-surface observational data and large errors in large-scale parameters obtained by the remote sensing method, there exist uncertainties in land surface parameters, which can cause large offsets between the simulated results of land-surface process models and the observational data for the soil moisture. In this study, observational data from the Semi-Arid Climate Observatory and Laboratory (SACOL) station in the semi-arid loess plateau of China were divided into three datasets: summer, autumn, and summer-autumn. By combing the particle swarm optimization (PSO) algorithm and the land-surface process model SHAW (Simultaneous Heat and Water), the soil and vegetation parameters that are related to the soil moisture but difficult to obtain by observations are optimized using three datasets. On this basis, the SHAW model was run with the optimized parameters to simulate the characteristics of the land-surface process in the semi-arid loess plateau. Simultaneously, the default SHAW model was run with the same atmospheric forcing as a comparison test. Simulation results revealed the following: parameters optimized by the particle swarm optimization algorithm in all simulation tests improved simulations of the soil moisture and latent heat flux; differences between simulated results and observational data are clearly reduced, but simulation tests involving the adoption of optimized parameters cannot simultaneously improve the simulation results for the net radiation, sensible heat flux, and soil temperature. Optimized soil and vegetation parameters based on different datasets have the same order of magnitude but are not identical; soil parameters only vary to a small degree, but the variation range of vegetation parameters is large. PMID:26991786

  1. Transport of Particle Swarms Through Fractures

    NASA Astrophysics Data System (ADS)

    Boomsma, E.; Pyrak-Nolte, L. J.

    2011-12-01

    The transport of engineered micro- and nano-scale particles through fractured rock is often assumed to occur as dispersions or emulsions. Another potential transport mechanism is the release of particle swarms from natural or industrial processes where small liquid drops, containing thousands to millions of colloidal-size particles, are released over time from seepage or leaks. Swarms have higher velocities than any individual colloid because the interactions among the particles maintain the cohesiveness of the swarm as it falls under gravity. Thus particle swarms give rise to the possibility that engineered particles may be transported farther and faster in fractures than predicted by traditional dispersion models. In this study, the effect of fractures on colloidal swarm cohesiveness and evolution was studied as a swarm falls under gravity and interacts with fracture walls. Transparent acrylic was used to fabricate synthetic fracture samples with either (1) a uniform aperture or (2) a converging aperture followed by a uniform aperture (funnel-shaped). The samples consisted of two blocks that measured 100 x 100 x 50 mm. The separation between these blocks determined the aperture (0.5 mm to 50 mm). During experiments, a fracture was fully submerged in water and swarms were released into it. The swarms consisted of dilute suspensions of either 25 micron soda-lime glass beads (2% by mass) or 3 micron polystyrene fluorescent beads (1% by mass) with an initial volume of 5μL. The swarms were illuminated with a green (525 nm) LED array and imaged optically with a CCD camera. In the uniform aperture fracture, the speed of the swarm prior to bifurcation increased with aperture up to a maximum at a fracture width of approximately 10 mm. For apertures greater than ~15 mm, the velocity was essentially constant with fracture width (but less than at 10 mm). This peak suggests that two competing mechanisms affect swarm velocity in fractures. The wall provides both drag, which

  2. Joint inversion of T1-T2 spectrum combining the iterative truncated singular value decomposition and the parallel particle swarm optimization algorithms

    NASA Astrophysics Data System (ADS)

    Ge, Xinmin; Wang, Hua; Fan, Yiren; Cao, Yingchang; Chen, Hua; Huang, Rui

    2016-01-01

    With more information than the conventional one dimensional (1D) longitudinal relaxation time (T1) and transversal relaxation time (T2) spectrums, a two dimensional (2D) T1-T2 spectrum in a low field nuclear magnetic resonance (NMR) is developed to discriminate the relaxation components of fluids such as water, oil and gas in porous rock. However, the accuracy and efficiency of the T1-T2 spectrum are limited by the existing inversion algorithms and data acquisition schemes. We introduce a joint method to inverse the T1-T2 spectrum, which combines iterative truncated singular value decomposition (TSVD) and a parallel particle swarm optimization (PSO) algorithm to get fast computational speed and stable solutions. We reorganize the first kind Fredholm integral equation of two kernels to a nonlinear optimization problem with non-negative constraints, and then solve the ill-conditioned problem by the iterative TSVD. Truncating positions of the two diagonal matrices are obtained by the Akaike information criterion (AIC). With the initial values obtained by TSVD, we use a PSO with parallel structure to get the global optimal solutions with a high computational speed. We use the synthetic data with different signal to noise ratio (SNR) to test the performance of the proposed method. The result shows that the new inversion algorithm can achieve favorable solutions for signals with SNR larger than 10, and the inversion precision increases with the decrease of the components of the porous rock.

  3. A new optimization algorithm based on a combination of particle swarm optimization, convergence and divergence operators for single-objective and multi-objective problems

    NASA Astrophysics Data System (ADS)

    Mahmoodabadi, M. J.; Bagheri, A.; Nariman-zadeh, N.; Jamali, A.

    2012-10-01

    Particle swarm optimization (PSO) is a randomized and population-based optimization method that was inspired by the flocking behaviour of birds and human social interactions. In this work, multi-objective PSO is modified in two stages. In the first stage, PSO is combined with convergence and divergence operators. Here, this method is named CDPSO. In the second stage, to produce a set of Pareto optimal solutions which has good convergence, diversity and distribution, two mechanisms are used. In the first mechanism, a new leader selection method is defined, which uses the periodic iteration and the concept of the particle's neighbour number. This method is named periodic multi-objective algorithm. In the second mechanism, an adaptive elimination method is employed to limit the number of non-dominated solutions in the archive, which has influences on computational time, convergence and diversity of solution. Single-objective results show that CDPSO performs very well on the complex test functions in terms of solution accuracy and convergence speed. Furthermore, some benchmark functions are used to evaluate the performance of periodic multi-objective CDPSO. This analysis demonstrates that the proposed algorithm operates better in three metrics through comparison with three well-known elitist multi-objective evolutionary algorithms. Finally, the algorithm is used for Pareto optimal design of a two-degree of freedom vehicle vibration model. The conflicting objective functions are sprung mass acceleration and relative displacement between sprung mass and tyre. The feasibility and efficiency of periodic multi-objective CDPSO are assessed in comparison with multi-objective modified NSGAII.

  4. Human behavior-based particle swarm optimization.

    PubMed

    Liu, Hao; Xu, Gang; Ding, Gui-Yan; Sun, Yu-Bo

    2014-01-01

    Particle swarm optimization (PSO) has attracted many researchers interested in dealing with various optimization problems, owing to its easy implementation, few tuned parameters, and acceptable performance. However, the algorithm is easy to trap in the local optima because of rapid losing of the population diversity. Therefore, improving the performance of PSO and decreasing the dependence on parameters are two important research hot points. In this paper, we present a human behavior-based PSO, which is called HPSO. There are two remarkable differences between PSO and HPSO. First, the global worst particle was introduced into the velocity equation of PSO, which is endowed with random weight which obeys the standard normal distribution; this strategy is conducive to trade off exploration and exploitation ability of PSO. Second, we eliminate the two acceleration coefficients c 1 and c 2 in the standard PSO (SPSO) to reduce the parameters sensitivity of solved problems. Experimental results on 28 benchmark functions, which consist of unimodal, multimodal, rotated, and shifted high-dimensional functions, demonstrate the high performance of the proposed algorithm in terms of convergence accuracy and speed with lower computation cost.

  5. A discrete particle swarm optimization algorithm with local search for a production-based two-echelon single-vendor multiple-buyer supply chain

    NASA Astrophysics Data System (ADS)

    Seifbarghy, Mehdi; Kalani, Masoud Mirzaei; Hemmati, Mojtaba

    2016-11-01

    This paper formulates a two-echelon single-producer multi-buyer supply chain model, while a single product is produced and transported to the buyers by the producer. The producer and the buyers apply vendor-managed inventory mode of operation. It is assumed that the producer applies economic production quantity policy, which implies a constant production rate at the producer. The operational parameters of each buyer are sales quantity, sales price and production rate. Channel profit of the supply chain and contract price between the producer and each buyer is determined based on the values of the operational parameters. Since the model belongs to nonlinear integer programs, we use a discrete particle swarm optimization algorithm (DPSO) to solve the addressed problem; however, the performance of the DPSO is compared utilizing two well-known heuristics, namely genetic algorithm and simulated annealing. A number of examples are provided to verify the model and assess the performance of the proposed heuristics. Experimental results indicate that DPSO outperforms the rival heuristics, with respect to some comparison metrics.

  6. Null Steering of Adaptive Beamforming Using Linear Constraint Minimum Variance Assisted by Particle Swarm Optimization, Dynamic Mutated Artificial Immune System, and Gravitational Search Algorithm

    PubMed Central

    Sieh Kiong, Tiong; Tariqul Islam, Mohammad; Ismail, Mahamod; Salem, Balasem

    2014-01-01

    Linear constraint minimum variance (LCMV) is one of the adaptive beamforming techniques that is commonly applied to cancel interfering signals and steer or produce a strong beam to the desired signal through its computed weight vectors. However, weights computed by LCMV usually are not able to form the radiation beam towards the target user precisely and not good enough to reduce the interference by placing null at the interference sources. It is difficult to improve and optimize the LCMV beamforming technique through conventional empirical approach. To provide a solution to this problem, artificial intelligence (AI) technique is explored in order to enhance the LCMV beamforming ability. In this paper, particle swarm optimization (PSO), dynamic mutated artificial immune system (DM-AIS), and gravitational search algorithm (GSA) are incorporated into the existing LCMV technique in order to improve the weights of LCMV. The simulation result demonstrates that received signal to interference and noise ratio (SINR) of target user can be significantly improved by the integration of PSO, DM-AIS, and GSA in LCMV through the suppression of interference in undesired direction. Furthermore, the proposed GSA can be applied as a more effective technique in LCMV beamforming optimization as compared to the PSO technique. The algorithms were implemented using Matlab program. PMID:25147859

  7. Null steering of adaptive beamforming using linear constraint minimum variance assisted by particle swarm optimization, dynamic mutated artificial immune system, and gravitational search algorithm.

    PubMed

    Darzi, Soodabeh; Kiong, Tiong Sieh; Islam, Mohammad Tariqul; Ismail, Mahamod; Kibria, Salehin; Salem, Balasem

    2014-01-01

    Linear constraint minimum variance (LCMV) is one of the adaptive beamforming techniques that is commonly applied to cancel interfering signals and steer or produce a strong beam to the desired signal through its computed weight vectors. However, weights computed by LCMV usually are not able to form the radiation beam towards the target user precisely and not good enough to reduce the interference by placing null at the interference sources. It is difficult to improve and optimize the LCMV beamforming technique through conventional empirical approach. To provide a solution to this problem, artificial intelligence (AI) technique is explored in order to enhance the LCMV beamforming ability. In this paper, particle swarm optimization (PSO), dynamic mutated artificial immune system (DM-AIS), and gravitational search algorithm (GSA) are incorporated into the existing LCMV technique in order to improve the weights of LCMV. The simulation result demonstrates that received signal to interference and noise ratio (SINR) of target user can be significantly improved by the integration of PSO, DM-AIS, and GSA in LCMV through the suppression of interference in undesired direction. Furthermore, the proposed GSA can be applied as a more effective technique in LCMV beamforming optimization as compared to the PSO technique. The algorithms were implemented using Matlab program.

  8. Particle Swarm Optimization with Dynamic Step Length

    NASA Astrophysics Data System (ADS)

    Cui, Zhihua; Cai, Xingjuan; Zeng, Jianchao; Sun, Guoji

    Particle swarm optimization (PSO) is a robust swarm intelligent technique inspired from birds flocking and fish schooling. Though many effective improvements have been proposed, however, the premature convergence is still its main problem. Because each particle's movement is a continuous process and can be modelled with differential equation groups, a new variant, particle swarm optimization with dynamic step length (PSO-DSL), with additional control coefficient- step length, is introduced. Then the absolute stability theory is introduced to analyze the stability character of the standard PSO, the theoretical result indicates the PSO with constant step length can not always be stable, this may be one of the reason for premature convergence. Simulation results show the PSO-DSL is effective.

  9. A solution quality assessment method for swarm intelligence optimization algorithms.

    PubMed

    Zhang, Zhaojun; Wang, Gai-Ge; Zou, Kuansheng; Zhang, Jianhua

    2014-01-01

    Nowadays, swarm intelligence optimization has become an important optimization tool and wildly used in many fields of application. In contrast to many successful applications, the theoretical foundation is rather weak. Therefore, there are still many problems to be solved. One problem is how to quantify the performance of algorithm in finite time, that is, how to evaluate the solution quality got by algorithm for practical problems. It greatly limits the application in practical problems. A solution quality assessment method for intelligent optimization is proposed in this paper. It is an experimental analysis method based on the analysis of search space and characteristic of algorithm itself. Instead of "value performance," the "ordinal performance" is used as evaluation criteria in this method. The feasible solutions were clustered according to distance to divide solution samples into several parts. Then, solution space and "good enough" set can be decomposed based on the clustering results. Last, using relative knowledge of statistics, the evaluation result can be got. To validate the proposed method, some intelligent algorithms such as ant colony optimization (ACO), particle swarm optimization (PSO), and artificial fish swarm algorithm (AFS) were taken to solve traveling salesman problem. Computational results indicate the feasibility of proposed method.

  10. A Novel Particle Swarm Optimization Approach for Grid Job Scheduling

    NASA Astrophysics Data System (ADS)

    Izakian, Hesam; Tork Ladani, Behrouz; Zamanifar, Kamran; Abraham, Ajith

    This paper represents a Particle Swarm Optimization (PSO) algorithm, for grid job scheduling. PSO is a population-based search algorithm based on the simulation of the social behavior of bird flocking and fish schooling. Particles fly in problem search space to find optimal or near-optimal solutions. In this paper we used a PSO approach for grid job scheduling. The scheduler aims at minimizing makespan and flowtime simultaneously. Experimental studies show that the proposed novel approach is more efficient than the PSO approach reported in the literature.

  11. Particle swarm optimization applied to impulsive orbital transfers

    NASA Astrophysics Data System (ADS)

    Pontani, Mauro; Conway, Bruce A.

    2012-05-01

    The particle swarm optimization (PSO) technique is a population-based stochastic method developed in recent years and successfully applied in several fields of research. It mimics the unpredictable motion of bird flocks while searching for food, with the intent of determining the optimal values of the unknown parameters of the problem under consideration. At the end of the process, the best particle (i.e. the best solution with reference to the objective function) is expected to contain the globally optimal values of the unknown parameters. The central idea underlying the method is contained in the formula for velocity updating. This formula includes three terms with stochastic weights. This research applies the particle swarm optimization algorithm to the problem of optimizing impulsive orbital transfers. More specifically, the following problems are considered and solved with the PSO algorithm: (i) determination of the globally optimal two- and three-impulse transfer trajectories between two coplanar circular orbits; (ii) determination of the optimal transfer between two coplanar, elliptic orbits with arbitrary orientation; (iii) determination of the optimal two-impulse transfer between two circular, non-coplanar orbits; (iv) determination of the globally optimal two-impulse transfer between two non-coplanar elliptic orbits. Despite its intuitiveness and simplicity, the particle swarm optimization method proves to be capable of effectively solving the orbital transfer problems of interest with great numerical accuracy.

  12. Scenario-Based Multi-Objective Optimum Allocation Model for Earthquake Emergency Shelters Using a Modified Particle Swarm Optimization Algorithm: A Case Study in Chaoyang District, Beijing, China

    PubMed Central

    Zhao, Xiujuan; Xu, Wei; Ma, Yunjia; Hu, Fuyu

    2015-01-01

    The correct location of earthquake emergency shelters and their allocation to residents can effectively reduce the number of casualties by providing safe havens and efficient evacuation routes during the chaotic period of the unfolding disaster. However, diverse and strict constraints and the discrete feasible domain of the required models make the problem of shelter location and allocation more difficult. A number of models have been developed to solve this problem, but there are still large differences between the models and the actual situation because the characteristics of the evacuees and the construction costs of the shelters have been excessively simplified. We report here the development of a multi-objective model for the allocation of residents to earthquake shelters by considering these factors using the Chaoyang district, Beijing, China as a case study. The two objectives of this model were to minimize the total weighted evacuation time from residential areas to a specified shelter and to minimize the total area of all the shelters. The two constraints were the shelter capacity and the service radius. Three scenarios were considered to estimate the number of people who would need to be evacuated. The particle swarm optimization algorithm was first modified by applying the von Neumann structure in former loops and global structure in later loops, and then used to solve this problem. The results show that increasing the shelter area can result in a large decrease in the total weighted evacuation time from scheme 1 to scheme 9 in scenario A, from scheme 1 to scheme 9 in scenario B, from scheme 1 to scheme 19 in scenario C. If the funding were not a limitation, then the final schemes of each scenario are the best solutions, otherwise the earlier schemes are more reasonable. The modified model proved to be useful for the optimization of shelter allocation, and the result can be used as a scientific reference for planning shelters in the Chaoyang district

  13. Particle Swarm Based Collective Searching Model for Adaptive Environment

    SciTech Connect

    Cui, Xiaohui; Patton, Robert M; Potok, Thomas E; Treadwell, Jim N

    2008-01-01

    This report presents a pilot study of an integration of particle swarm algorithm, social knowledge adaptation and multi-agent approaches for modeling the collective search behavior of self-organized groups in an adaptive environment. The objective of this research is to apply the particle swarm metaphor as a model of social group adaptation for the dynamic environment and to provide insight and understanding of social group knowledge discovering and strategic searching. A new adaptive environment model, which dynamically reacts to the group collective searching behaviors, is proposed in this research. The simulations in the research indicate that effective communication between groups is not the necessary requirement for whole self-organized groups to achieve the efficient collective searching behavior in the adaptive environment.

  14. Particle Swarm Based Collective Searching Model for Adaptive Environment

    SciTech Connect

    Cui, Xiaohui; Patton, Robert M; Potok, Thomas E; Treadwell, Jim N

    2007-01-01

    This report presents a pilot study of an integration of particle swarm algorithm, social knowledge adaptation and multi-agent approaches for modeling the collective search behavior of self-organized groups in an adaptive environment. The objective of this research is to apply the particle swarm metaphor as a model of social group adaptation for the dynamic environment and to provide insight and understanding of social group knowledge discovering and strategic searching. A new adaptive environment model, which dynamically reacts to the group collective searching behaviors, is proposed in this research. The simulations in the research indicate that effective communication between groups is not the necessary requirement for whole self-organized groups to achieve the efficient collective searching behavior in the adaptive environment.

  15. Emergent system identification using particle swarm optimization

    NASA Astrophysics Data System (ADS)

    Voss, Mark S.; Feng, Xin

    2001-10-01

    Complex Adaptive Structures can be viewed as a combination of Complex Adaptive Systems and fully integrated autonomous Smart Structures. Traditionally when designing a structure, one combines rules of thumb with theoretical results to develop an acceptable solution. This methodology will have to be extended for Complex Adaptive Structures, since they, by definition, will participate in their own design. In this paper we introduce a new methodology for Emergent System Identification that is concerned with combining the methodologies of self-organizing functional networks (GMDH - Alexy G. Ivakhnenko), Particle Swarm Optimization (PSO - James Kennedy and Russell C. Eberhart) and Genetic Programming (GP - John Koza). This paper will concentrate on the utilization of Particle Swarm Optimization in this effort and discuss how Particle Swarm Optimization relates to our ultimate goal of emergent self-organizing functional networks that can be used to identify overlapping internal structural models. The ability for Complex Adaptive Structures to identify emerging internal models will be a key component for their success.

  16. Particle swarm optimization for the clustering of wireless sensors

    NASA Astrophysics Data System (ADS)

    Tillett, Jason C.; Rao, Raghuveer M.; Sahin, Ferat; Rao, T. M.

    2003-07-01

    Clustering is necessary for data aggregation, hierarchical routing, optimizing sleep patterns, election of extremal sensors, optimizing coverage and resource allocation, reuse of frequency bands and codes, and conserving energy. Optimal clustering is typically an NP-hard problem. Solutions to NP-hard problems involve searches through vast spaces of possible solutions. Evolutionary algorithms have been applied successfully to a variety of NP-hard problems. We explore one such approach, Particle Swarm Optimization (PSO), an evolutionary programming technique where a 'swarm' of test solutions, analogous to a natural swarm of bees, ants or termites, is allowed to interact and cooperate to find the best solution to the given problem. We use the PSO approach to cluster sensors in a sensor network. The energy efficiency of our clustering in a data-aggregation type sensor network deployment is tested using a modified LEACH-C code. The PSO technique with a recursive bisection algorithm is tested against random search and simulated annealing; the PSO technique is shown to be robust. We further investigate developing a distributed version of the PSO algorithm for clustering optimally a wireless sensor network.

  17. Adaptive Flocking of Robot Swarms: Algorithms and Properties

    NASA Astrophysics Data System (ADS)

    Lee, Geunho; Chong, Nak Young

    This paper presents a distributed approach for adaptive flocking of swarms of mobile robots that enables to navigate autonomously in complex environments populated with obstacles. Based on the observation of the swimming behavior of a school of fish, we propose an integrated algorithm that allows a swarm of robots to navigate in a coordinated manner, split into multiple swarms, or merge with other swarms according to the environment conditions. We prove the convergence of the proposed algorithm using Lyapunov stability theory. We also verify the effectiveness of the algorithm through extensive simulations, where a swarm of robots repeats the process of splitting and merging while passing around multiple stationary and moving obstacles. The simulation results show that the proposed algorithm is scalable, and robust to variations in the sensing capability of individual robots.

  18. Roundness error assessment based on particle swarm optimization

    NASA Astrophysics Data System (ADS)

    Zhao, J. W.; Chen, G. Q.

    2005-01-01

    Roundness error assessment is always a nonlinear optimization problem without constraints. The method of particle swarm optimization (PSO) is proposed to evaluate the roundness error. PSO is an evolution algorithm derived from the behavior of preying birds. PSO regards each feasible solution as a particle (point in n-dimensional space). It initializes a swarm of random particles in the feasible region. All particles always trace two particles in which one is the best position itself; another is the best position of all particles. According to the inertia weight and two best particles, all particles update their positions and velocities according to the fitness function. After iterations, it converges to an optimized solution. The reciprocal of the error assessment objective function is adopted as the fitness. In this paper the calculating procedures with PSO are given. Finally, an assessment example is used to verify this method. The results show that the method proposed provides a new way for other form and position error assessment because it can always converge to the global optimal solution.

  19. Land use zoning at the county level based on a multi-objective particle swarm optimization algorithm: a case study from Yicheng, China.

    PubMed

    Liu, Yaolin; Wang, Hua; Ji, Yingli; Liu, Zhongqiu; Zhao, Xiang

    2012-08-01

    Comprehensive land-use planning (CLUP) at the county level in China must include land-use zoning. This is specifically stipulated by the China Land Management Law and aims to achieve strict control on the usages of land. The land-use zoning problem is treated as a multi-objective optimization problem (MOOP) in this article, which is different from the traditional treatment. A particle swarm optimization (PSO) based model is applied to the problem and is developed to maximize the attribute differences between land-use zones, the spatial compactness, the degree of spatial harmony and the ecological benefits of the land-use zones. This is subject to some constraints such as: the quantity limitations for varying land-use zones, regulations assigning land units to a certain land-use zone, and the stipulation of a minimum parcel area in a land-use zoning map. In addition, a crossover and mutation operator from a genetic algorithm is adopted to avoid the prematurity of PSO. The results obtained for Yicheng, a county in central China, using different objective weighting schemes, are compared and suggest that: (1) the fundamental demand for attribute difference between land-use zones leads to a mass of fragmentary land-use zones; (2) the spatial pattern of land-use zones is remarkably optimized when a weight is given to the sub-objectives of spatial compactness and the degree of spatial harmony, simultaneously, with a reduction of attribute difference between land-use zones; (3) when a weight is given to the sub-objective of ecological benefits of the land-use zones, the ecological benefits get a slight increase also at the expense of a reduction in attribute difference between land-use zones; (4) the pursuit of spatial harmony or spatial compactness may have a negative effect on each other; (5) an increase in the ecological benefits may improve the spatial compactness and spatial harmony of the land-use zones; (6) adjusting the weights assigned to each sub-objective can

  20. Particle swarm optimization with recombination and dynamic linkage discovery.

    PubMed

    Chen, Ying-Ping; Peng, Wen-Chih; Jian, Ming-Chung

    2007-12-01

    In this paper, we try to improve the performance of the particle swarm optimizer by incorporating the linkage concept, which is an essential mechanism in genetic algorithms, and design a new linkage identification technique called dynamic linkage discovery to address the linkage problem in real-parameter optimization problems. Dynamic linkage discovery is a costless and effective linkage recognition technique that adapts the linkage configuration by employing only the selection operator without extra judging criteria irrelevant to the objective function. Moreover, a recombination operator that utilizes the discovered linkage configuration to promote the cooperation of particle swarm optimizer and dynamic linkage discovery is accordingly developed. By integrating the particle swarm optimizer, dynamic linkage discovery, and recombination operator, we propose a new hybridization of optimization methodologies called particle swarm optimization with recombination and dynamic linkage discovery (PSO-RDL). In order to study the capability of PSO-RDL, numerical experiments were conducted on a set of benchmark functions as well as on an important real-world application. The benchmark functions used in this paper were proposed in the 2005 Institute of Electrical and Electronics Engineers Congress on Evolutionary Computation. The experimental results on the benchmark functions indicate that PSO-RDL can provide a level of performance comparable to that given by other advanced optimization techniques. In addition to the benchmark, PSO-RDL was also used to solve the economic dispatch (ED) problem for power systems, which is a real-world problem and highly constrained. The results indicate that PSO-RDL can successfully solve the ED problem for the three-unit power system and obtain the currently known best solution for the 40-unit system. PMID:18179066

  1. Swarm Intelligence Algorithm for Induction Motor Field Efficiency Evaluation

    NASA Astrophysics Data System (ADS)

    Sakthivel, V. P.; Subramanian, S.

    Determining induction motor field efficiency is imperative in industries for energy conservation and cost savings. The induction motor efficiency is generally tested in a laboratories by certain methods defined in IEEE Standard - 112. But these methods cannot be used for motor efficiency evaluations in the field because it disrupts the production process of the industry. This paper proposes a swarm intelligence algorithm, Particle Swarm Optimization (PSO) for efficiency evaluation of in-service induction motor based on a modified induction motor equivalent circuit model. In this model, stray load losses are considered. The proposed efficiency evaluation method combines the PSO and the equivalent circuit method. First, the equivalent circuit parameters are estimated by minimizing the difference between measured and calculated values of stator current and input power of the motor using the PSO algorithm. Based on these parameters, the efficiency of the motor at various load points are evaluated by using the equivalent circuit method. To exemplify the performance of the PSO based efficiency estimation method, a 5 HP motor has been tested, compared with genetic algorithm (GA), torque gauge method, equivalent circuit method, slip method, current method and segregated loss method and found to be superior. Accordingly, the method will be useful for engineers who implement the energy efficiency programs to the electric motor systems in industries.

  2. Adaptive particle swarm optimization for optimal orbital elements of binary stars

    NASA Astrophysics Data System (ADS)

    Attia, Abdel-Fattah

    2016-10-01

    The paper presents an adaptive particle swarm optimization (APSO) as an alternative method to determine the optimal orbital elements of the star η Bootis of MK type G0 IV. The proposed algorithm transforms the problem of finding periodic orbits into the problem of detecting global minimizers as a function, to get a best fit of Keplerian and Phase curves. The experimental results demonstrate that the proposed approach of APSO generally more accurate than the standard particle swarm optimization (PSO) and other published optimization algorithms, in terms of solution accuracy, convergence speed and algorithm reliability.

  3. Particle Swarm Inspired Underwater Sensor Self-Deployment

    PubMed Central

    Du, Huazheng; Xia, Na; Zheng, Rong

    2014-01-01

    Underwater sensor networks (UWSNs) can be applied in sea resource reconnaissance, pollution monitoring and assistant navigation, etc., and have become a hot research field in wireless sensor networks. In open and complicated underwater environments, targets (events) tend to be highly dynamic and uncertain. It is important to deploy sensors to cover potential events in an optimal manner. In this paper, the underwater sensor deployment problem and its performance evaluation metrics are introduced. Furthermore, a particle swarm inspired sensor self-deployment algorithm is presented. By simulating the flying behavior of particles and introducing crowd control, the proposed algorithm can drive sensors to cover almost all the events, and make the distribution of sensors match that of events. Through extensive simulations, we demonstrate that it can solve the underwater sensor deployment problem effectively, with fast convergence rate, and amiable to distributed implementation. PMID:25195852

  4. Strength Pareto particle swarm optimization and hybrid EA-PSO for multi-objective optimization.

    PubMed

    Elhossini, Ahmed; Areibi, Shawki; Dony, Robert

    2010-01-01

    This paper proposes an efficient particle swarm optimization (PSO) technique that can handle multi-objective optimization problems. It is based on the strength Pareto approach originally used in evolutionary algorithms (EA). The proposed modified particle swarm algorithm is used to build three hybrid EA-PSO algorithms to solve different multi-objective optimization problems. This algorithm and its hybrid forms are tested using seven benchmarks from the literature and the results are compared to the strength Pareto evolutionary algorithm (SPEA2) and a competitive multi-objective PSO using several metrics. The proposed algorithm shows a slower convergence, compared to the other algorithms, but requires less CPU time. Combining PSO and evolutionary algorithms leads to superior hybrid algorithms that outperform SPEA2, the competitive multi-objective PSO (MO-PSO), and the proposed strength Pareto PSO based on different metrics.

  5. Optimal satellite formation reconfiguration using co-evolutionary particle swarm optimization in deep space

    NASA Astrophysics Data System (ADS)

    Huang, Haibin; Zhuang, Yufei

    2015-08-01

    This paper proposes a method that plans energy-optimal trajectories for multi-satellite formation reconfiguration in deep space environment. A novel co-evolutionary particle swarm optimization algorithm is stated to solve the nonlinear programming problem, so that the computational complexity of calculating the gradient information could be avoided. One swarm represents one satellite, and through communication with other swarms during the evolution, collisions between satellites can be avoided. In addition, a dynamic depth first search algorithm is proposed to solve the redundant search problem of a co-evolutionary particle swarm optimization method, with which the computation time can be shorten a lot. In order to make the actual trajectories optimal and collision-free with disturbance, a re-planning strategy is deduced for formation reconfiguration maneuver.

  6. A Hybrid Swarm Algorithm for optimizing glaucoma diagnosis.

    PubMed

    Raja, Chandrasekaran; Gangatharan, Narayanan

    2015-08-01

    Glaucoma is among the most common causes of permanent blindness in human. Because the initial symptoms are not evident, mass screening would assist early diagnosis in the vast population. Such mass screening requires an automated diagnosis technique. Our proposed automation consists of pre-processing, optimal wavelet transformation, feature extraction, and classification modules. The hyper analytic wavelet transformation (HWT) based statistical features are extracted from fundus images. Because HWT preserves phase information, it is appropriate for feature extraction. The features are then classified by a Support Vector Machine (SVM) with a radial basis function (RBF) kernel. The filter coefficients of the wavelet transformation process and the SVM-RB width parameter are simultaneously tailored to best-fit the diagnosis by the hybrid Particle Swarm algorithm. To overcome premature convergence, a Group Search Optimizer (GSO) random searching (ranging) and area scanning behavior (around the optima) are embedded within the Particle Swarm Optimization (PSO) framework. We also embed a novel potential-area scanning as a preventive mechanism against premature convergence, rather than diagnosis and cure. This embedding does not compromise the generality and utility of PSO. In two 10-fold cross-validated test runs, the diagnostic accuracy of the proposed hybrid PSO exceeded that of conventional PSO. Furthermore, the hybrid PSO maintained the ability to explore even at later iterations, ensuring maturity in fitness. PMID:26093787

  7. Fishing for Data: Using Particle Swarm Optimization to Search Data

    NASA Astrophysics Data System (ADS)

    Caputo, Daniel P.; Dolan, R.

    2010-01-01

    As the size of data and model sets continue to increase, more efficient ways are needed to sift through the available information. We present a computational method which will efficiently search large parameter spaces to either map the space or find individual data/models of interest. Particle swarm optimization (PSO) is a subclass of artificial life computer algorithms. The PSO algorithm attempts to leverage "swarm intelligence” against finding optimal solutions to a problem. This system is often based on a biological model of a swarm (e.g. schooling fish). These biological models are broken down into a few simple rules which govern the behavior of the system. "Agents” (e.g. fish) are introduced and the agents, following the rules, search out solutions much like a fish would seek out food. We have made extensive modifications to the standard PSO model which increase its efficiency as-well-as adding the capacity to map a parameter space and find multiple solutions. Our modified PSO is ideally suited to search and map large sets of data/models which are degenerate or to search through data/models which are too numerous to analyze by hand. One example of this would include radiative transfer models, which are inherently degenerate. Applying the PSO algorithm will allow the degeneracy space to be mapped and thus better determine limits on dust shell parameters. Another example is searching through legacy data from a survey for hints of Polycyclic Aromatic Hydrocarbon emission. What might have once taken years of searching (and many frustrated graduate students) can now be relegated to the task of a computer which will work day and night for only the cost of electricity. We hope this algorithm will allow fellow astronomers to more efficiently search data and models, thereby freeing them to focus on the physics of the Universe.

  8. Quantum-behaved particle swarm optimization: analysis of individual particle behavior and parameter selection.

    PubMed

    Sun, Jun; Fang, Wei; Wu, Xiaojun; Palade, Vasile; Xu, Wenbo

    2012-01-01

    Quantum-behaved particle swarm optimization (QPSO), motivated by concepts from quantum mechanics and particle swarm optimization (PSO), is a probabilistic optimization algorithm belonging to the bare-bones PSO family. Although it has been shown to perform well in finding the optimal solutions for many optimization problems, there has so far been little analysis on how it works in detail. This paper presents a comprehensive analysis of the QPSO algorithm. In the theoretical analysis, we analyze the behavior of a single particle in QPSO in terms of probability measure. Since the particle's behavior is influenced by the contraction-expansion (CE) coefficient, which is the most important parameter of the algorithm, the goal of the theoretical analysis is to find out the upper bound of the CE coefficient, within which the value of the CE coefficient selected can guarantee the convergence or boundedness of the particle's position. In the experimental analysis, the theoretical results are first validated by stochastic simulations for the particle's behavior. Then, based on the derived upper bound of the CE coefficient, we perform empirical studies on a suite of well-known benchmark functions to show how to control and select the value of the CE coefficient, in order to obtain generally good algorithmic performance in real world applications. Finally, a further performance comparison between QPSO and other variants of PSO on the benchmarks is made to show the efficiency of the QPSO algorithm with the proposed parameter control and selection methods.

  9. Particle Swarm and Ant Colony Approaches in Multiobjective Optimization

    NASA Astrophysics Data System (ADS)

    Rao, S. S.

    2010-10-01

    The social behavior of groups of birds, ants, insects and fish has been used to develop evolutionary algorithms known as swarm intelligence techniques for solving optimization problems. This work presents the development of strategies for the application of two of the popular swarm intelligence techniques, namely the particle swarm and ant colony methods, for the solution of multiobjective optimization problems. In a multiobjective optimization problem, the objectives exhibit a conflicting nature and hence no design vector can minimize all the objectives simultaneously. The concept of Pareto-optimal solution is used in finding a compromise solution. A modified cooperative game theory approach, in which each objective is associated with a different player, is used in this work. The applicability and computational efficiencies of the proposed techniques are demonstrated through several illustrative examples involving unconstrained and constrained problems with single and multiple objectives and continuous and mixed design variables. The present methodologies are expected to be useful for the solution of a variety of practical continuous and mixed optimization problems involving single or multiple objectives with or without constraints.

  10. Algorithmic requirements for swarm intelligence in differently coupled collective systems.

    PubMed

    Stradner, Jürgen; Thenius, Ronald; Zahadat, Payam; Hamann, Heiko; Crailsheim, Karl; Schmickl, Thomas

    2013-05-01

    Swarm systems are based on intermediate connectivity between individuals and dynamic neighborhoods. In natural swarms self-organizing principles bring their agents to that favorable level of connectivity. They serve as interesting sources of inspiration for control algorithms in swarm robotics on the one hand, and in modular robotics on the other hand. In this paper we demonstrate and compare a set of bio-inspired algorithms that are used to control the collective behavior of swarms and modular systems: BEECLUST, AHHS (hormone controllers), FGRN (fractal genetic regulatory networks), and VE (virtual embryogenesis). We demonstrate how such bio-inspired control paradigms bring their host systems to a level of intermediate connectivity, what delivers sufficient robustness to these systems for collective decentralized control. In parallel, these algorithms allow sufficient volatility of shared information within these systems to help preventing local optima and deadlock situations, this way keeping those systems flexible and adaptive in dynamic non-deterministic environments. PMID:23805030

  11. What is Particle Swarm optimization? Application to hydrogeophysics (Invited)

    NASA Astrophysics Data System (ADS)

    Fernández Martïnez, J.; García Gonzalo, E.; Mukerji, T.

    2009-12-01

    Inverse problems are generally ill-posed. This yields lack of uniqueness and/or numerical instabilities. These features cause local optimization methods without prior information to provide unpredictable results, not being able to discriminate among the multiple models consistent with the end criteria. Stochastic approaches to inverse problems consist in shifting attention to the probability of existence of certain interesting subsurface structures instead of "looking for a unique model". Some well-known stochastic methods include genetic algorithms and simulated annealing. A more recent method, Particle Swarm Optimization, is a global optimization technique that has been successfully applied to solve inverse problems in many engineering fields, although its use in geosciences is still limited. Like all stochastic methods, PSO requires reasonably fast forward modeling. The basic idea behind PSO is that each model searches the model space according to its misfit history and the misfit of the other models of the swarm. PSO algorithm can be physically interpreted as a damped spring-mass system. This physical analogy was used to define a whole family of PSO optimizers and to establish criteria, based on the stability of particle swarm trajectories, to tune the PSO parameters: inertia, local and global accelerations. In this contribution we show application to different low-cost hydrogeophysical inverse problems: 1) a salt water intrusion problem using Vertical Electrical Soundings, 2) the inversion of Spontaneous Potential data for groundwater modeling, 3) the identification of Cole-Cole parameters for Induced Polarization data. We show that with this stochastic approach we are able to answer questions related to risk analysis, such as what is the depth of the salt intrusion with a certain probability, or giving probabilistic bounds for the water table depth. Moreover, these measures of uncertainty are obtained with small computational cost and time, allowing us a very

  12. Particle swarm optimization of ascent trajectories of multistage launch vehicles

    NASA Astrophysics Data System (ADS)

    Pontani, Mauro

    2014-02-01

    Multistage launch vehicles are commonly employed to place spacecraft and satellites in their operational orbits. If the rocket characteristics are specified, the optimization of its ascending trajectory consists of determining the optimal control law that leads to maximizing the final mass at orbit injection. The numerical solution of a similar problem is not trivial and has been pursued with different methods, for decades. This paper is concerned with an original approach based on the joint use of swarming theory and the necessary conditions for optimality. The particle swarm optimization technique represents a heuristic population-based optimization method inspired by the natural motion of bird flocks. Each individual (or particle) that composes the swarm corresponds to a solution of the problem and is associated with a position and a velocity vector. The formula for velocity updating is the core of the method and is composed of three terms with stochastic weights. As a result, the population migrates toward different regions of the search space taking advantage of the mechanism of information sharing that affects the overall swarm dynamics. At the end of the process the best particle is selected and corresponds to the optimal solution to the problem of interest. In this work the three-dimensional trajectory of the multistage rocket is assumed to be composed of four arcs: (i) first stage propulsion, (ii) second stage propulsion, (iii) coast arc (after release of the second stage), and (iv) third stage propulsion. The Euler-Lagrange equations and the Pontryagin minimum principle, in conjunction with the Weierstrass-Erdmann corner conditions, are employed to express the thrust angles as functions of the adjoint variables conjugate to the dynamics equations. The use of these analytical conditions coming from the calculus of variations leads to obtaining the overall rocket dynamics as a function of seven parameters only, namely the unknown values of the initial state

  13. Cosmological parameter estimation using Particle Swarm Optimization

    NASA Astrophysics Data System (ADS)

    Prasad, J.; Souradeep, T.

    2014-03-01

    Constraining parameters of a theoretical model from observational data is an important exercise in cosmology. There are many theoretically motivated models, which demand greater number of cosmological parameters than the standard model of cosmology uses, and make the problem of parameter estimation challenging. It is a common practice to employ Bayesian formalism for parameter estimation for which, in general, likelihood surface is probed. For the standard cosmological model with six parameters, likelihood surface is quite smooth and does not have local maxima, and sampling based methods like Markov Chain Monte Carlo (MCMC) method are quite successful. However, when there are a large number of parameters or the likelihood surface is not smooth, other methods may be more effective. In this paper, we have demonstrated application of another method inspired from artificial intelligence, called Particle Swarm Optimization (PSO) for estimating cosmological parameters from Cosmic Microwave Background (CMB) data taken from the WMAP satellite.

  14. Active Power Rescheduling for Avoiding Voltage Collapse Using Modified Bare Bones Particle Swarm Optimization

    NASA Astrophysics Data System (ADS)

    Arya, Rajesh; Purey, Pradeep

    2016-06-01

    MW-generation rescheduling is being considered for voltage stability improvement under stressed operating condition. At times it can avoid voltage collapse. This paper describes an algorithm for determination of optimum MW-generation participation pattern for static voltage stability margin enhancement. The optimum search direction has been obtained by employing modified bare born particle swarm optimization technique. Optimum search direction is based on maximization of distance to point of collapse in generation space. Developed algorithm has been implemented on a standard 25 bus test system. Results obtained have been compared with those obtained using standard particle swarm optimization.

  15. Particle Swarm Optimization Approach in a Consignment Inventory System

    NASA Astrophysics Data System (ADS)

    Sharifyazdi, Mehdi; Jafari, Azizollah; Molamohamadi, Zohreh; Rezaeiahari, Mandana; Arshizadeh, Rahman

    2009-09-01

    Consignment Inventory (CI) is a kind of inventory which is in the possession of the customer, but is still owned by the supplier. This creates a condition of shared risk whereby the supplier risks the capital investment associated with the inventory while the customer risks dedicating retail space to the product. This paper considers both the vendor's and the retailers' costs in an integrated model. The vendor here is a warehouse which stores one type of product and supplies it at the same wholesale price to multiple retailers who then sell the product in independent markets at retail prices. Our main aim is to design a CI system which generates minimum costs for the two parties. Here a Particle Swarm Optimization (PSO) algorithm is developed to calculate the proper values. Finally a sensitivity analysis is performed to examine the effects of each parameter on decision variables. Also PSO performance is compared with genetic algorithm.

  16. Planar straightness error evaluation based on particle swarm optimization

    NASA Astrophysics Data System (ADS)

    Mao, Jian; Zheng, Huawen; Cao, Yanlong; Yang, Jiangxin

    2006-11-01

    The straightness error generally refers to the deviation between an actual line and an ideal line. According to the characteristics of planar straightness error evaluation, a novel method to evaluate planar straightness errors based on the particle swarm optimization (PSO) is proposed. The planar straightness error evaluation problem is formulated as a nonlinear optimization problem. According to minimum zone condition the mathematical model of planar straightness together with the optimal objective function and fitness function is developed. Compared with the genetic algorithm (GA), the PSO algorithm has some advantages. It is not only implemented without crossover and mutation but also has fast congruence speed. Moreover fewer parameters are needed to set up. The results show that the PSO method is very suitable for nonlinear optimization problems and provides a promising new method for straightness error evaluation. It can be applied to deal with the measured data of planar straightness obtained by the three-coordinates measuring machines.

  17. A novel swarm intelligence algorithm for finding DNA motifs

    PubMed Central

    Lei, Chengwei; Ruan, Jianhua

    2010-01-01

    Discovering DNA motifs from co-expressed or co-regulated genes is an important step towards deciphering complex gene regulatory networks and understanding gene functions. Despite significant improvement in the last decade, it still remains one of the most challenging problems in computational molecular biology. In this work, we propose a novel motif finding algorithm that finds consensus patterns using a population-based stochastic optimisation technique called Particle Swarm Optimisation (PSO), which has been shown to be effective in optimising difficult multidimensional problems in continuous domains. We propose to use a word dissimilarity graph to remap the neighborhood structure of the solution space of DNA motifs, and propose a modification of the naive PSO algorithm to accommodate discrete variables. In order to improve efficiency, we also propose several strategies for escaping from local optima and for automatically determining the termination criteria. Experimental results on simulated challenge problems show that our method is both more efficient and more accurate than several existing algorithms. Applications to several sets of real promoter sequences also show that our approach is able to detect known transcription factor binding sites, and outperforms two of the most popular existing algorithms. PMID:20090174

  18. Transport of Particle Swarms Through Variable Aperture Fractures

    NASA Astrophysics Data System (ADS)

    Boomsma, E.; Pyrak-Nolte, L. J.

    2012-12-01

    Particle transport through fractured rock is a key concern with the increased use of micro- and nano-size particles in consumer products as well as from other activities in the sub- and near surface (e.g. mining, industrial waste, hydraulic fracturing, etc.). While particle transport is often studied as the transport of emulsions or dispersions, particles may also enter the subsurface from leaks or seepage that lead to particle swarms. Swarms are drop-like collections of millions of colloidal-sized particles that exhibit a number of unique characteristics when compared to dispersions and emulsions. Any contaminant or engineered particle that forms a swarm can be transported farther, faster, and more cohesively in fractures than would be expected from a traditional dispersion model. In this study, the effects of several variable aperture fractures on colloidal swarm cohesiveness and evolution were studied as a swarm fell under gravity and interacted with the fracture walls. Transparent acrylic was used to fabricate synthetic fracture samples with (1) a uniform aperture, (2) a converging region followed by a uniform region (funnel shaped), (3) a uniform region followed by a diverging region (inverted funnel), and (4) a cast of a an induced fracture from a carbonate rock. All of the samples consisted of two blocks that measured 100 x 100 x 50 mm. The minimum separation between these blocks determined the nominal aperture (0.5 mm to 20 mm). During experiments a fracture was fully submerged in water and swarms were released into it. The swarms consisted of a dilute suspension of 3 micron polystyrene fluorescent beads (1% by mass) with an initial volume of 5μL. The swarms were illuminated with a green (525 nm) LED array and imaged optically with a CCD camera. The variation in fracture aperture controlled swarm behavior. Diverging apertures caused a sudden loss of confinement that resulted in a rapid change in the swarm's shape as well as a sharp increase in its velocity

  19. Particle Swarm Transport through Immiscible Fluid Layers in a Fracture

    NASA Astrophysics Data System (ADS)

    Teasdale, N. D.; Boomsma, E.; Pyrak-Nolte, L. J.

    2011-12-01

    Immiscible fluids occur either naturally (e.g. oil & water) or from anthropogenic processes (e.g. liquid CO2 & water) in the subsurface and complicate the transport of natural or engineered micro- or nano-scale particles. In this study, we examined the effect of immiscible fluids on the formation and evolution of particle swarms in a fracture. A particle swarm is a collection of colloidal-size particles in a dilute suspension that exhibits cohesive behavior. Swarms fall under gravity with a velocity that is greater than the settling velocity of a single particle. Thus a particle swarm of colloidal contaminants can potentially travel farther and faster in a fracture than expected for a dispersion or emulsion of colloidal particles. We investigated the formation, evolution, and break-up of colloidal swarms under gravity in a uniform aperture fracture as hydrophobic/hydrophyllic particle swarms move across an oil-water interface. A uniform aperture fracture was fabricated from two transparent acrylic rectangular prisms (100 mm x 50 mm x 100 mm) that are separated by 1, 2.5, 5, 10 or 50 mm. The fracture was placed, vertically, inside a glass tank containing a layer of pure silicone oil (polydimethylsiloxane) on distilled water. Along the length of the fracture, 30 mm was filled with oil and 70 mm with water. Experiments were conducted using silicone oils with viscosities of 5, 10, 100, or 1000 cSt. Particle swarms (5 μl) were comprised of a 1% concentration (by mass) of 25 micron glass beads (hydrophilic) suspended in a water drop, or a 1% concentration (by mass) of 3 micron polystyrene fluorescent beads (hydrophobic) suspended in a water drop. The swarm behavior was imaged using an optical fluorescent imaging system composed of a CCD camera and by green (525 nm) LED arrays for illumination. Swarms were spherical and remained coherent as they fell through the oil because of the immiscibility of oil and water. However, as a swarm approached the oil-water interface, it

  20. Particle Swarms in Fractures: Open Versus Partially Closed Systems

    NASA Astrophysics Data System (ADS)

    Boomsma, E.; Pyrak-Nolte, L. J.

    2014-12-01

    In the field, fractures may be isolated or connected to fluid reservoirs anywhere along the perimeter of a fracture. These boundaries affect fluid circulation, flow paths and communication with external reservoirs. The transport of drop like collections of colloidal-sized particles (particle swarms) in open and partially closed systems was studied. A uniform aperture synthetic fracture was constructed using two blocks (100 x 100 x 50 mm) of transparent acrylic placed parallel to each other. The fracture was fully submerged a tank filled with 100cSt silicone oil. Fracture apertures were varied from 5-80 mm. Partially closed systems were created by sealing the sides of the fracture with plastic film. The four boundary conditions study were: (Case 1) open, (Case 2) closed on the sides, (Case 3) closed on the bottom, and (Case 4) closed on both the sides and bottom of the fracture. A 15 μL dilute suspension of soda-lime glass particles in oil (2% by mass) were released into the fracture. Particle swarms were illuminated using a green (525 nm) LED array and imaged with a CCD camera. The presence of the additional boundaries modified the speed of the particle swarms (see figure). In Case 1, enhanced swarm transport was observed for a range of apertures, traveling faster than either very small or very large apertures. In Case 2, swarm velocities were enhanced over a larger range of fracture apertures than in any of the other cases. Case 3 shifted the enhanced transport regime to lower apertures and also reduced swarm speed when compared to Case 2. Finally, Case 4 eliminated the enhanced transport regime entirely. Communication between the fluid in the fracture and an external fluid reservoir resulted in enhanced swarm transport in Cases 1-3. The non-rigid nature of a swarm enables drag from the fracture walls to modify the swarm geometry. The particles composing a swarm reorganize in response to the fracture, elongating the swarm and maintaining its density. Unlike a

  1. Searching for Planets using Particle Swarm Optimization

    NASA Astrophysics Data System (ADS)

    Chambers, John E.

    2008-05-01

    The Doppler radial velocity technique has been highly successful in discovering planetary-mass companions in orbit around nearby stars. A typical data set contains around one hundred instantaneous velocities for the star, spread over a period of several years,with each observation measuring only the radial component of velocity. From this data set, one would like to determine the masses and orbital parameters of the system of planets responsible for the star's reflex motion. Assuming coplanar orbits, each planet is characterized by five parameters, with an additional parameter for each telescope used to make observations, representing the instrument's velocity offset. The large number of free parameters and the relatively sparse data sets make the fitting process challenging when multiple planets are present, especially if some of these objects have low masses. Conventional approaches using periodograms often perform poorly when the orbital periods are not separated by large amounts or the longest period is comparable to the length of the data set. Here, I will describe a new approach to fitting Doppler radial velocity sets using particle swarm optimization (PSO). I will describe how the PSO method works, and show examples of PSO fits to existing radial velocity data sets, with comparisons to published solutions and those submitted to the Systemic website (http://www.oklo.org).

  2. R2-Based Multi/Many-Objective Particle Swarm Optimization

    PubMed Central

    Toscano, Gregorio; Barron-Zambrano, Jose Hugo; Tello-Leal, Edgar

    2016-01-01

    We propose to couple the R2 performance measure and Particle Swarm Optimization in order to handle multi/many-objective problems. Our proposal shows that through a well-designed interaction process we could maintain the metaheuristic almost inalterable and through the R2 performance measure we did not use neither an external archive nor Pareto dominance to guide the search. The proposed approach is validated using several test problems and performance measures commonly adopted in the specialized literature. Results indicate that the proposed algorithm produces results that are competitive with respect to those obtained by four well-known MOEAs. Additionally, we validate our proposal in many-objective optimization problems. In these problems, our approach showed its main strength, since it could outperform another well-known indicator-based MOEA.

  3. R2-Based Multi/Many-Objective Particle Swarm Optimization

    PubMed Central

    Toscano, Gregorio; Barron-Zambrano, Jose Hugo; Tello-Leal, Edgar

    2016-01-01

    We propose to couple the R2 performance measure and Particle Swarm Optimization in order to handle multi/many-objective problems. Our proposal shows that through a well-designed interaction process we could maintain the metaheuristic almost inalterable and through the R2 performance measure we did not use neither an external archive nor Pareto dominance to guide the search. The proposed approach is validated using several test problems and performance measures commonly adopted in the specialized literature. Results indicate that the proposed algorithm produces results that are competitive with respect to those obtained by four well-known MOEAs. Additionally, we validate our proposal in many-objective optimization problems. In these problems, our approach showed its main strength, since it could outperform another well-known indicator-based MOEA. PMID:27656200

  4. Multidisciplinary Optimization of a Transport Aircraft Wing using Particle Swarm Optimization

    NASA Technical Reports Server (NTRS)

    Sobieszczanski-Sobieski, Jaroslaw; Venter, Gerhard

    2002-01-01

    The purpose of this paper is to demonstrate the application of particle swarm optimization to a realistic multidisciplinary optimization test problem. The paper's new contributions to multidisciplinary optimization is the application of a new algorithm for dealing with the unique challenges associated with multidisciplinary optimization problems, and recommendations as to the utility of the algorithm in future multidisciplinary optimization applications. The selected example is a bi-level optimization problem that demonstrates severe numerical noise and has a combination of continuous and truly discrete design variables. The use of traditional gradient-based optimization algorithms is thus not practical. The numerical results presented indicate that the particle swarm optimization algorithm is able to reliably find the optimum design for the problem presented here. The algorithm is capable of dealing with the unique challenges posed by multidisciplinary optimization as well as the numerical noise and truly discrete variables present in the current example problem.

  5. Particle Swarm Social Model for Group Social Learning in Adaptive Environment

    SciTech Connect

    Cui, Xiaohui; Potok, Thomas E; Treadwell, Jim N; Patton, Robert M; Pullum, Laura L

    2008-01-01

    This report presents a study of integrating particle swarm algorithm, social knowledge adaptation and multi-agent approaches for modeling the social learning of self-organized groups and their collective searching behavior in an adaptive environment. The objective of this research is to apply the particle swarm metaphor as a model of social learning for a dynamic environment. The research provides a platform for understanding and insights into knowledge discovery and strategic search in human self-organized social groups, such as insurgents or online communities.

  6. Particle swarm optimization and uncertainty in Dempster-Shafer fusion

    NASA Astrophysics Data System (ADS)

    Ranney, Kenneth; Nasrabadi, Nasser

    2009-05-01

    Recent investigations into multi-sensor fusion have yielded a variety of data fusion algorithms. Some fuse imagery from multiple sensors at the pixel level, while others fuse outputs of detection algorithms-such as radar prescreeners or hyperspectral anomaly detectors-at the feature level. Many of the feature-level fusion algorithms build upon the foundation of Bayesian probability, and they assign probability to the event that a certain feature value is due either to a target or to clutter. A few of the feature-level fusion algorithms, however, exploit tools developed within the framework of the Dempster-Shafer (DS) theory of evidence. In these formulations some of the probability can be assigned to a third hypothesis representing uncertainty, and the algorithm developer must specify an uncertainty function that maps feature values to probability "mass" for this third hypothesis. Unfortunately, the DS paradigm lacks a standard method for assignment of mass to the "don't know" hypothesis for a particular input feature. In this paper we define a feature-level DS fusion algorithm and determine a method for specifying its uncertainty function. We begin by developing and describing a measure of performance based on the area under the receiver operating characteristic (ROC) curve. We then incorporate this measure of performance into a training procedure that exploits the dynamics of the particle swarm and is capable of discovering locally optimal uncertainty functions. We exercise the training algorithm using simulated data, and analyze the performance of its hypothesized optimal uncertainty function. Next we apply the newly developed training techniques to data produced by separate prescreener algorithms operating on measured Hyperspectral Imager (HSI) and synthetic aperture radar (SAR) data from the same scene. Finally, we quantify the performance of the entire DS fusion procedure using ROC curves.

  7. A hybrid search algorithm for swarm robots searching in an unknown environment.

    PubMed

    Li, Shoutao; Li, Lina; Lee, Gordon; Zhang, Hao

    2014-01-01

    This paper proposes a novel method to improve the efficiency of a swarm of robots searching in an unknown environment. The approach focuses on the process of feeding and individual coordination characteristics inspired by the foraging behavior in nature. A predatory strategy was used for searching; hence, this hybrid approach integrated a random search technique with a dynamic particle swarm optimization (DPSO) search algorithm. If a search robot could not find any target information, it used a random search algorithm for a global search. If the robot found any target information in a region, the DPSO search algorithm was used for a local search. This particle swarm optimization search algorithm is dynamic as all the parameters in the algorithm are refreshed synchronously through a communication mechanism until the robots find the target position, after which, the robots fall back to a random searching mode. Thus, in this searching strategy, the robots alternated between two searching algorithms until the whole area was covered. During the searching process, the robots used a local communication mechanism to share map information and DPSO parameters to reduce the communication burden and overcome hardware limitations. If the search area is very large, search efficiency may be greatly reduced if only one robot searches an entire region given the limited resources available and time constraints. In this research we divided the entire search area into several subregions, selected a target utility function to determine which subregion should be initially searched and thereby reduced the residence time of the target to improve search efficiency.

  8. Automatic Clustering Using Multi-objective Particle Swarm and Simulated Annealing

    PubMed Central

    Abubaker, Ahmad; Baharum, Adam; Alrefaei, Mahmoud

    2015-01-01

    This paper puts forward a new automatic clustering algorithm based on Multi-Objective Particle Swarm Optimization and Simulated Annealing, “MOPSOSA”. The proposed algorithm is capable of automatic clustering which is appropriate for partitioning datasets to a suitable number of clusters. MOPSOSA combines the features of the multi-objective based particle swarm optimization (PSO) and the Multi-Objective Simulated Annealing (MOSA). Three cluster validity indices were optimized simultaneously to establish the suitable number of clusters and the appropriate clustering for a dataset. The first cluster validity index is centred on Euclidean distance, the second on the point symmetry distance, and the last cluster validity index is based on short distance. A number of algorithms have been compared with the MOPSOSA algorithm in resolving clustering problems by determining the actual number of clusters and optimal clustering. Computational experiments were carried out to study fourteen artificial and five real life datasets. PMID:26132309

  9. Automatic Clustering Using Multi-objective Particle Swarm and Simulated Annealing.

    PubMed

    Abubaker, Ahmad; Baharum, Adam; Alrefaei, Mahmoud

    2015-01-01

    This paper puts forward a new automatic clustering algorithm based on Multi-Objective Particle Swarm Optimization and Simulated Annealing, "MOPSOSA". The proposed algorithm is capable of automatic clustering which is appropriate for partitioning datasets to a suitable number of clusters. MOPSOSA combines the features of the multi-objective based particle swarm optimization (PSO) and the Multi-Objective Simulated Annealing (MOSA). Three cluster validity indices were optimized simultaneously to establish the suitable number of clusters and the appropriate clustering for a dataset. The first cluster validity index is centred on Euclidean distance, the second on the point symmetry distance, and the last cluster validity index is based on short distance. A number of algorithms have been compared with the MOPSOSA algorithm in resolving clustering problems by determining the actual number of clusters and optimal clustering. Computational experiments were carried out to study fourteen artificial and five real life datasets.

  10. A self-learning particle swarm optimizer for global optimization problems.

    PubMed

    Li, Changhe; Yang, Shengxiang; Nguyen, Trung Thanh

    2012-06-01

    Particle swarm optimization (PSO) has been shown as an effective tool for solving global optimization problems. So far, most PSO algorithms use a single learning pattern for all particles, which means that all particles in a swarm use the same strategy. This monotonic learning pattern may cause the lack of intelligence for a particular particle, which makes it unable to deal with different complex situations. This paper presents a novel algorithm, called self-learning particle swarm optimizer (SLPSO), for global optimization problems. In SLPSO, each particle has a set of four strategies to cope with different situations in the search space. The cooperation of the four strategies is implemented by an adaptive learning framework at the individual level, which can enable a particle to choose the optimal strategy according to its own local fitness landscape. The experimental study on a set of 45 test functions and two real-world problems show that SLPSO has a superior performance in comparison with several other peer algorithms.

  11. Discrete particle swarm optimization with scout particles for library materials acquisition.

    PubMed

    Wu, Yi-Ling; Ho, Tsu-Feng; Shyu, Shyong Jian; Lin, Bertrand M T

    2013-01-01

    Materials acquisition is one of the critical challenges faced by academic libraries. This paper presents an integer programming model of the studied problem by considering how to select materials in order to maximize the average preference and the budget execution rate under some practical restrictions including departmental budget, limitation of the number of materials in each category and each language. To tackle the constrained problem, we propose a discrete particle swarm optimization (DPSO) with scout particles, where each particle, represented as a binary matrix, corresponds to a candidate solution to the problem. An initialization algorithm and a penalty function are designed to cope with the constraints, and the scout particles are employed to enhance the exploration within the solution space. To demonstrate the effectiveness and efficiency of the proposed DPSO, a series of computational experiments are designed and conducted. The results are statistically analyzed, and it is evinced that the proposed DPSO is an effective approach for the studied problem.

  12. Discrete particle swarm optimization with scout particles for library materials acquisition.

    PubMed

    Wu, Yi-Ling; Ho, Tsu-Feng; Shyu, Shyong Jian; Lin, Bertrand M T

    2013-01-01

    Materials acquisition is one of the critical challenges faced by academic libraries. This paper presents an integer programming model of the studied problem by considering how to select materials in order to maximize the average preference and the budget execution rate under some practical restrictions including departmental budget, limitation of the number of materials in each category and each language. To tackle the constrained problem, we propose a discrete particle swarm optimization (DPSO) with scout particles, where each particle, represented as a binary matrix, corresponds to a candidate solution to the problem. An initialization algorithm and a penalty function are designed to cope with the constraints, and the scout particles are employed to enhance the exploration within the solution space. To demonstrate the effectiveness and efficiency of the proposed DPSO, a series of computational experiments are designed and conducted. The results are statistically analyzed, and it is evinced that the proposed DPSO is an effective approach for the studied problem. PMID:24072983

  13. Markerless human motion tracking using hierarchical multi-swarm cooperative particle swarm optimization.

    PubMed

    Saini, Sanjay; Zakaria, Nordin; Rambli, Dayang Rohaya Awang; Sulaiman, Suziah

    2015-01-01

    The high-dimensional search space involved in markerless full-body articulated human motion tracking from multiple-views video sequences has led to a number of solutions based on metaheuristics, the most recent form of which is Particle Swarm Optimization (PSO). However, the classical PSO suffers from premature convergence and it is trapped easily into local optima, significantly affecting the tracking accuracy. To overcome these drawbacks, we have developed a method for the problem based on Hierarchical Multi-Swarm Cooperative Particle Swarm Optimization (H-MCPSO). The tracking problem is formulated as a non-linear 34-dimensional function optimization problem where the fitness function quantifies the difference between the observed image and a projection of the model configuration. Both the silhouette and edge likelihoods are used in the fitness function. Experiments using Brown and HumanEva-II dataset demonstrated that H-MCPSO performance is better than two leading alternative approaches-Annealed Particle Filter (APF) and Hierarchical Particle Swarm Optimization (HPSO). Further, the proposed tracking method is capable of automatic initialization and self-recovery from temporary tracking failures. Comprehensive experimental results are presented to support the claims.

  14. Markerless Human Motion Tracking Using Hierarchical Multi-Swarm Cooperative Particle Swarm Optimization

    PubMed Central

    Saini, Sanjay; Zakaria, Nordin; Rambli, Dayang Rohaya Awang; Sulaiman, Suziah

    2015-01-01

    The high-dimensional search space involved in markerless full-body articulated human motion tracking from multiple-views video sequences has led to a number of solutions based on metaheuristics, the most recent form of which is Particle Swarm Optimization (PSO). However, the classical PSO suffers from premature convergence and it is trapped easily into local optima, significantly affecting the tracking accuracy. To overcome these drawbacks, we have developed a method for the problem based on Hierarchical Multi-Swarm Cooperative Particle Swarm Optimization (H-MCPSO). The tracking problem is formulated as a non-linear 34-dimensional function optimization problem where the fitness function quantifies the difference between the observed image and a projection of the model configuration. Both the silhouette and edge likelihoods are used in the fitness function. Experiments using Brown and HumanEva-II dataset demonstrated that H-MCPSO performance is better than two leading alternative approaches—Annealed Particle Filter (APF) and Hierarchical Particle Swarm Optimization (HPSO). Further, the proposed tracking method is capable of automatic initialization and self-recovery from temporary tracking failures. Comprehensive experimental results are presented to support the claims. PMID:25978493

  15. Influence of Color Noise on Processing of Optical Signals by Swarm Intellect Algorithm

    NASA Astrophysics Data System (ADS)

    Galimullin, D. Z.; Sibgatullin, M. E.; Kamalova, D. I.; Salakhov, M. Kh.

    2015-09-01

    An approach based on stochastic particle swarm optimization was applied for the mathematical processing of spectral profiles with noise. To test the algorithm's stability with respect to noise, we used the noises with different values of the Hurst index which characterizes noise component from the point of view of prevalence of low-frequency or high-frequency component in it. The Hurst index varied from 0.1 to 0.9. An influence of color noise with level from 1 to 10% on processing of optical signals by particle swarm optimization algorithm was analyzed. This method is shown to be stable with respect to noise with the level of 10% if it's the Hurst index does not exceed the value of 0.5.

  16. A Winner Determination Algorithm for Combinatorial Auctions Based on Hybrid Artificial Fish Swarm Algorithm

    NASA Astrophysics Data System (ADS)

    Zheng, Genrang; Lin, ZhengChun

    The problem of winner determination in combinatorial auctions is a hotspot electronic business, and a NP hard problem. A Hybrid Artificial Fish Swarm Algorithm(HAFSA), which is combined with First Suite Heuristic Algorithm (FSHA) and Artificial Fish Swarm Algorithm (AFSA), is proposed to solve the problem after probing it base on the theories of AFSA. Experiment results show that the HAFSA is a rapidly and efficient algorithm for The problem of winner determining. Compared with Ant colony Optimization Algorithm, it has a good performance with broad and prosperous application.

  17. Parameter estimation of Lorenz chaotic system using a hybrid swarm intelligence algorithm

    NASA Astrophysics Data System (ADS)

    Lazzús, Juan A.; Rivera, Marco; López-Caraballo, Carlos H.

    2016-03-01

    A novel hybrid swarm intelligence algorithm for chaotic system parameter estimation is present. For this purpose, the parameters estimation on Lorenz systems is formulated as a multidimensional problem, and a hybrid approach based on particle swarm optimization with ant colony optimization (PSO-ACO) is implemented to solve this problem. Firstly, the performance of the proposed PSO-ACO algorithm is tested on a set of three representative benchmark functions, and the impact of the parameter settings on PSO-ACO efficiency is studied. Secondly, the parameter estimation is converted into an optimization problem on a three-dimensional Lorenz system. Numerical simulations on Lorenz model and comparisons with results obtained by other algorithms showed that PSO-ACO is a very powerful tool for parameter estimation with high accuracy and low deviations.

  18. Resolution of the stochastic strategy spatial prisoner's dilemma by means of particle swarm optimization.

    PubMed

    Zhang, Jianlei; Zhang, Chunyan; Chu, Tianguang; Perc, Matjaž

    2011-01-01

    We study the evolution of cooperation among selfish individuals in the stochastic strategy spatial prisoner's dilemma game. We equip players with the particle swarm optimization technique, and find that it may lead to highly cooperative states even if the temptations to defect are strong. The concept of particle swarm optimization was originally introduced within a simple model of social dynamics that can describe the formation of a swarm, i.e., analogous to a swarm of bees searching for a food source. Essentially, particle swarm optimization foresees changes in the velocity profile of each player, such that the best locations are targeted and eventually occupied. In our case, each player keeps track of the highest payoff attained within a local topological neighborhood and its individual highest payoff. Thus, players make use of their own memory that keeps score of the most profitable strategy in previous actions, as well as use of the knowledge gained by the swarm as a whole, to find the best available strategy for themselves and the society. Following extensive simulations of this setup, we find a significant increase in the level of cooperation for a wide range of parameters, and also a full resolution of the prisoner's dilemma. We also demonstrate extreme efficiency of the optimization algorithm when dealing with environments that strongly favor the proliferation of defection, which in turn suggests that swarming could be an important phenomenon by means of which cooperation can be sustained even under highly unfavorable conditions. We thus present an alternative way of understanding the evolution of cooperative behavior and its ubiquitous presence in nature, and we hope that this study will be inspirational for future efforts aimed in this direction. PMID:21760906

  19. Particle Swarm Optimization with Scale-Free Interactions

    PubMed Central

    Liu, Chen; Du, Wen-Bo; Wang, Wen-Xu

    2014-01-01

    The particle swarm optimization (PSO) algorithm, in which individuals collaborate with their interacted neighbors like bird flocking to search for the optima, has been successfully applied in a wide range of fields pertaining to searching and convergence. Here we employ the scale-free network to represent the inter-individual interactions in the population, named SF-PSO. In contrast to the traditional PSO with fully-connected topology or regular topology, the scale-free topology used in SF-PSO incorporates the diversity of individuals in searching and information dissemination ability, leading to a quite different optimization process. Systematic results with respect to several standard test functions demonstrate that SF-PSO gives rise to a better balance between the convergence speed and the optimum quality, accounting for its much better performance than that of the traditional PSO algorithms. We further explore the dynamical searching process microscopically, finding that the cooperation of hub nodes and non-hub nodes play a crucial role in optimizing the convergence process. Our work may have implications in computational intelligence and complex networks. PMID:24859007

  20. Using Animal Instincts to Design Efficient Biomedical Studies via Particle Swarm Optimization

    PubMed Central

    Qiu, Jiaheng; Chen, Ray-Bing; Wang, Weichung; Wong, Weng Kee

    2014-01-01

    Particle swarm optimization (PSO) is an increasingly popular metaheuristic algorithm for solving complex optimization problems. Its popularity is due to its repeated successes in finding an optimum or a near optimal solution for problems in many applied disciplines. The algorithm makes no assumption of the function to be optimized and for biomedical experiments like those presented here, PSO typically finds the optimal solutions in a few seconds of CPU time on a garden-variety laptop. We apply PSO to find various types of optimal designs for several problems in the biological sciences and compare PSO performance relative to the differential evolution algorithm, another popular metaheuristic algorithm in the engineering literature. PMID:25285268

  1. Swarming of active colloidal Janus particles: Polar waves and vortices

    NASA Astrophysics Data System (ADS)

    Xu, Cong; Yan, Jing; Han, Ming; Luijten, Erik; Granick, Steve

    2015-03-01

    The synthesis of artificial ``swarming'' particles with tunable interaction represents a strong interest of the soft active matter community. Here, we demonstrate a straightforward design of swarming Janus colloids that exhibit transient mutual alignment within a certain frequency range of an applied AC electric field. In a dense two-dimensional suspension of these Janus colloids, we observe that coherent polar waves emerge at first, which then collide and merge into stable discrete vortices. Based upon a careful analysis of the pair interaction, we propose a simple mechanism that explains the formation of the polar waves, with agreement between experiment and simulation. A rich spectrum of phenomena, including dimer swarming, chain formation, and particle clustering, can be further achieved by changing the frequency of the AC electric field. Currently working as a postdoctoral researcher in Princeton University.

  2. Particle swarm optimization and genetic algorithm as feature selection techniques for the QSAR modeling of imidazo[1,5-a]pyrido[3,2-e]pyrazines, inhibitors of phosphodiesterase 10A.

    PubMed

    Goodarzi, Mohammad; Saeys, Wouter; Deeb, Omar; Pieters, Sigrid; Vander Heyden, Yvan

    2013-12-01

    Quantitative structure-activity relationship (QSAR) modeling was performed for imidazo[1,5-a]pyrido[3,2-e]pyrazines, which constitute a class of phosphodiesterase 10A inhibitors. Particle swarm optimization (PSO) and genetic algorithm (GA) were used as feature selection techniques to find the most reliable molecular descriptors from a large pool. Modeling of the relationship between the selected descriptors and the pIC50 activity data was achieved by linear [multiple linear regression (MLR)] and non-linear [locally weighted regression (LWR) based on both Euclidean (E) and Mahalanobis (M) distances] methods. In addition, a stepwise MLR model was built using only a limited number of quantum chemical descriptors, selected because of their correlation with the pIC50 . The model was not found interesting. It was concluded that the LWR model, based on the Euclidean distance, applied on the descriptors selected by PSO has the best prediction ability. However, some other models behaved similarly. The root-mean-squared errors of prediction (RMSEP) for the test sets obtained by PSO/MLR, GA/MLR, PSO/LWRE, PSO/LWRM, GA/LWRE, and GA/LWRM models were 0.333, 0.394, 0.313, 0.333, 0.421, and 0.424, respectively. The PSO-selected descriptors resulted in the best prediction models, both linear and non-linear.

  3. A Lyapunov-Based Extension to Particle Swarm Dynamics for Continuous Function Optimization

    PubMed Central

    Bhattacharya, Sayantani; Konar, Amit; Das, Swagatam; Han, Sang Yong

    2009-01-01

    The paper proposes three alternative extensions to the classical global-best particle swarm optimization dynamics, and compares their relative performance with the standard particle swarm algorithm. The first extension, which readily follows from the well-known Lyapunov's stability theorem, provides a mathematical basis of the particle dynamics with a guaranteed convergence at an optimum. The inclusion of local and global attractors to this dynamics leads to faster convergence speed and better accuracy than the classical one. The second extension augments the velocity adaptation equation by a negative randomly weighted positional term of individual particle, while the third extension considers the negative positional term in place of the inertial term. Computer simulations further reveal that the last two extensions outperform both the classical and the first extension in terms of convergence speed and accuracy. PMID:22303158

  4. The Study of Intelligent Vehicle Navigation Path Based on Behavior Coordination of Particle Swarm.

    PubMed

    Han, Gaining; Fu, Weiping; Wang, Wen

    2016-01-01

    In the behavior dynamics model, behavior competition leads to the shock problem of the intelligent vehicle navigation path, because of the simultaneous occurrence of the time-variant target behavior and obstacle avoidance behavior. Considering the safety and real-time of intelligent vehicle, the particle swarm optimization (PSO) algorithm is proposed to solve these problems for the optimization of weight coefficients of the heading angle and the path velocity. Firstly, according to the behavior dynamics model, the fitness function is defined concerning the intelligent vehicle driving characteristics, the distance between intelligent vehicle and obstacle, and distance of intelligent vehicle and target. Secondly, behavior coordination parameters that minimize the fitness function are obtained by particle swarm optimization algorithms. Finally, the simulation results show that the optimization method and its fitness function can improve the perturbations of the vehicle planning path and real-time and reliability. PMID:26880881

  5. The Study of Intelligent Vehicle Navigation Path Based on Behavior Coordination of Particle Swarm.

    PubMed

    Han, Gaining; Fu, Weiping; Wang, Wen

    2016-01-01

    In the behavior dynamics model, behavior competition leads to the shock problem of the intelligent vehicle navigation path, because of the simultaneous occurrence of the time-variant target behavior and obstacle avoidance behavior. Considering the safety and real-time of intelligent vehicle, the particle swarm optimization (PSO) algorithm is proposed to solve these problems for the optimization of weight coefficients of the heading angle and the path velocity. Firstly, according to the behavior dynamics model, the fitness function is defined concerning the intelligent vehicle driving characteristics, the distance between intelligent vehicle and obstacle, and distance of intelligent vehicle and target. Secondly, behavior coordination parameters that minimize the fitness function are obtained by particle swarm optimization algorithms. Finally, the simulation results show that the optimization method and its fitness function can improve the perturbations of the vehicle planning path and real-time and reliability.

  6. The Study of Intelligent Vehicle Navigation Path Based on Behavior Coordination of Particle Swarm

    PubMed Central

    Han, Gaining; Fu, Weiping; Wang, Wen

    2016-01-01

    In the behavior dynamics model, behavior competition leads to the shock problem of the intelligent vehicle navigation path, because of the simultaneous occurrence of the time-variant target behavior and obstacle avoidance behavior. Considering the safety and real-time of intelligent vehicle, the particle swarm optimization (PSO) algorithm is proposed to solve these problems for the optimization of weight coefficients of the heading angle and the path velocity. Firstly, according to the behavior dynamics model, the fitness function is defined concerning the intelligent vehicle driving characteristics, the distance between intelligent vehicle and obstacle, and distance of intelligent vehicle and target. Secondly, behavior coordination parameters that minimize the fitness function are obtained by particle swarm optimization algorithms. Finally, the simulation results show that the optimization method and its fitness function can improve the perturbations of the vehicle planning path and real-time and reliability. PMID:26880881

  7. Hybrid Particle Swarm Optimization for Hybrid Flowshop Scheduling Problem with Maintenance Activities

    PubMed Central

    Li, Jun-qing; Pan, Quan-ke; Mao, Kun

    2014-01-01

    A hybrid algorithm which combines particle swarm optimization (PSO) and iterated local search (ILS) is proposed for solving the hybrid flowshop scheduling (HFS) problem with preventive maintenance (PM) activities. In the proposed algorithm, different crossover operators and mutation operators are investigated. In addition, an efficient multiple insert mutation operator is developed for enhancing the searching ability of the algorithm. Furthermore, an ILS-based local search procedure is embedded in the algorithm to improve the exploitation ability of the proposed algorithm. The detailed experimental parameter for the canonical PSO is tuning. The proposed algorithm is tested on the variation of 77 Carlier and Néron's benchmark problems. Detailed comparisons with the present efficient algorithms, including hGA, ILS, PSO, and IG, verify the efficiency and effectiveness of the proposed algorithm. PMID:24883414

  8. Application of Particle Swarm Optimization in Computer Aided Setup Planning

    NASA Astrophysics Data System (ADS)

    Kafashi, Sajad; Shakeri, Mohsen; Abedini, Vahid

    2011-01-01

    New researches are trying to integrate computer aided design (CAD) and computer aided manufacturing (CAM) environments. The role of process planning is to convert the design specification into manufacturing instructions. Setup planning has a basic role in computer aided process planning (CAPP) and significantly affects the overall cost and quality of machined part. This research focuses on the development for automatic generation of setups and finding the best setup plan in feasible condition. In order to computerize the setup planning process, three major steps are performed in the proposed system: a) Extraction of machining data of the part. b) Analyzing and generation of all possible setups c) Optimization to reach the best setup plan based on cost functions. Considering workshop resources such as machine tool, cutter and fixture, all feasible setups could be generated. Then the problem is adopted with technological constraints such as TAD (tool approach direction), tolerance relationship and feature precedence relationship to have a completely real and practical approach. The optimal setup plan is the result of applying the PSO (particle swarm optimization) algorithm into the system using cost functions. A real sample part is illustrated to demonstrate the performance and productivity of the system.

  9. Surface Navigation Using Optimized Waypoints and Particle Swarm Optimization

    NASA Technical Reports Server (NTRS)

    Birge, Brian

    2013-01-01

    The design priority for manned space exploration missions is almost always placed on human safety. Proposed manned surface exploration tasks (lunar, asteroid sample returns, Mars) have the possibility of astronauts traveling several kilometers away from a home base. Deviations from preplanned paths are expected while exploring. In a time-critical emergency situation, there is a need to develop an optimal home base return path. The return path may or may not be similar to the outbound path, and what defines optimal may change with, and even within, each mission. A novel path planning algorithm and prototype program was developed using biologically inspired particle swarm optimization (PSO) that generates an optimal path of traversal while avoiding obstacles. Applications include emergency path planning on lunar, Martian, and/or asteroid surfaces, generating multiple scenarios for outbound missions, Earth-based search and rescue, as well as human manual traversal and/or path integration into robotic control systems. The strategy allows for a changing environment, and can be re-tasked at will and run in real-time situations. Given a random extraterrestrial planetary or small body surface position, the goal was to find the fastest (or shortest) path to an arbitrary position such as a safe zone or geographic objective, subject to possibly varying constraints. The problem requires a workable solution 100% of the time, though it does not require the absolute theoretical optimum. Obstacles should be avoided, but if they cannot be, then the algorithm needs to be smart enough to recognize this and deal with it. With some modifications, it works with non-stationary error topologies as well.

  10. A hybrid search algorithm for swarm robots searching in an unknown environment.

    PubMed

    Li, Shoutao; Li, Lina; Lee, Gordon; Zhang, Hao

    2014-01-01

    This paper proposes a novel method to improve the efficiency of a swarm of robots searching in an unknown environment. The approach focuses on the process of feeding and individual coordination characteristics inspired by the foraging behavior in nature. A predatory strategy was used for searching; hence, this hybrid approach integrated a random search technique with a dynamic particle swarm optimization (DPSO) search algorithm. If a search robot could not find any target information, it used a random search algorithm for a global search. If the robot found any target information in a region, the DPSO search algorithm was used for a local search. This particle swarm optimization search algorithm is dynamic as all the parameters in the algorithm are refreshed synchronously through a communication mechanism until the robots find the target position, after which, the robots fall back to a random searching mode. Thus, in this searching strategy, the robots alternated between two searching algorithms until the whole area was covered. During the searching process, the robots used a local communication mechanism to share map information and DPSO parameters to reduce the communication burden and overcome hardware limitations. If the search area is very large, search efficiency may be greatly reduced if only one robot searches an entire region given the limited resources available and time constraints. In this research we divided the entire search area into several subregions, selected a target utility function to determine which subregion should be initially searched and thereby reduced the residence time of the target to improve search efficiency. PMID:25386855

  11. A Hybrid Search Algorithm for Swarm Robots Searching in an Unknown Environment

    PubMed Central

    Li, Shoutao; Li, Lina; Lee, Gordon; Zhang, Hao

    2014-01-01

    This paper proposes a novel method to improve the efficiency of a swarm of robots searching in an unknown environment. The approach focuses on the process of feeding and individual coordination characteristics inspired by the foraging behavior in nature. A predatory strategy was used for searching; hence, this hybrid approach integrated a random search technique with a dynamic particle swarm optimization (DPSO) search algorithm. If a search robot could not find any target information, it used a random search algorithm for a global search. If the robot found any target information in a region, the DPSO search algorithm was used for a local search. This particle swarm optimization search algorithm is dynamic as all the parameters in the algorithm are refreshed synchronously through a communication mechanism until the robots find the target position, after which, the robots fall back to a random searching mode. Thus, in this searching strategy, the robots alternated between two searching algorithms until the whole area was covered. During the searching process, the robots used a local communication mechanism to share map information and DPSO parameters to reduce the communication burden and overcome hardware limitations. If the search area is very large, search efficiency may be greatly reduced if only one robot searches an entire region given the limited resources available and time constraints. In this research we divided the entire search area into several subregions, selected a target utility function to determine which subregion should be initially searched and thereby reduced the residence time of the target to improve search efficiency. PMID:25386855

  12. Joint global optimization of tomographic data based on particle swarm optimization and decision theory

    NASA Astrophysics Data System (ADS)

    Paasche, H.; Tronicke, J.

    2012-04-01

    In many near surface geophysical applications multiple tomographic data sets are routinely acquired to explore subsurface structures and parameters. Linking the model generation process of multi-method geophysical data sets can significantly reduce ambiguities in geophysical data analysis and model interpretation. Most geophysical inversion approaches rely on local search optimization methods used to find an optimal model in the vicinity of a user-given starting model. The final solution may critically depend on the initial model. Alternatively, global optimization (GO) methods have been used to invert geophysical data. They explore the solution space in more detail and determine the optimal model independently from the starting model. Additionally, they can be used to find sets of optimal models allowing a further analysis of model parameter uncertainties. Here we employ particle swarm optimization (PSO) to realize the global optimization of tomographic data. PSO is an emergent methods based on swarm intelligence characterized by fast and robust convergence towards optimal solutions. The fundamental principle of PSO is inspired by nature, since the algorithm mimics the behavior of a flock of birds searching food in a search space. In PSO, a number of particles cruise a multi-dimensional solution space striving to find optimal model solutions explaining the acquired data. The particles communicate their positions and success and direct their movement according to the position of the currently most successful particle of the swarm. The success of a particle, i.e. the quality of the currently found model by a particle, must be uniquely quantifiable to identify the swarm leader. When jointly inverting disparate data sets, the optimization solution has to satisfy multiple optimization objectives, at least one for each data set. Unique determination of the most successful particle currently leading the swarm is not possible. Instead, only statements about the Pareto

  13. Multiple Sequence Alignment with Hidden Markov Models Learned by Random Drift Particle Swarm Optimization.

    PubMed

    Sun, Jun; Palade, Vasile; Wu, Xiaojun; Fang, Wei

    2014-01-01

    Hidden Markov Models (HMMs) are powerful tools for multiple sequence alignment (MSA), which is known to be an NP-complete and important problem in bioinformatics. Learning HMMs is a difficult task, and many meta-heuristic methods, including particle swarm optimization (PSO), have been used for that. In this paper, a new variant of PSO, called the random drift particle swarm optimization (RDPSO) algorithm, is proposed to be used for HMM learning tasks in MSA problems. The proposed RDPSO algorithm, inspired by the free electron model in metal conductors in an external electric field, employs a novel set of evolution equations that can enhance the global search ability of the algorithm. Moreover, in order to further enhance the algorithmic performance of the RDPSO, we incorporate a diversity control method into the algorithm and, thus, propose an RDPSO with diversity-guided search (RDPSO-DGS). The performances of the RDPSO, RDPSO-DGS and other algorithms are tested and compared by learning HMMs for MSA on two well-known benchmark data sets. The experimental results show that the HMMs learned by the RDPSO and RDPSO-DGS are able to generate better alignments for the benchmark data sets than other most commonly used HMM learning methods, such as the Baum-Welch and other PSO algorithms. The performance comparison with well-known MSA programs, such as ClustalW and MAFFT, also shows that the proposed methods have advantages in multiple sequence alignment.

  14. A novel bee swarm optimization algorithm for numerical function optimization

    NASA Astrophysics Data System (ADS)

    Akbari, Reza; Mohammadi, Alireza; Ziarati, Koorush

    2010-10-01

    The optimization algorithms which are inspired from intelligent behavior of honey bees are among the most recently introduced population based techniques. In this paper, a novel algorithm called bee swarm optimization, or BSO, and its two extensions for improving its performance are presented. The BSO is a population based optimization technique which is inspired from foraging behavior of honey bees. The proposed approach provides different patterns which are used by the bees to adjust their flying trajectories. As the first extension, the BSO algorithm introduces different approaches such as repulsion factor and penalizing fitness (RP) to mitigate the stagnation problem. Second, to maintain efficiently the balance between exploration and exploitation, time-varying weights (TVW) are introduced into the BSO algorithm. The proposed algorithm (BSO) and its two extensions (BSO-RP and BSO-RPTVW) are compared with existing algorithms which are based on intelligent behavior of honey bees, on a set of well known numerical test functions. The experimental results show that the BSO algorithms are effective and robust; produce excellent results, and outperform other algorithms investigated in this consideration.

  15. Support Vector Machine Based on Adaptive Acceleration Particle Swarm Optimization

    PubMed Central

    Abdulameer, Mohammed Hasan; Othman, Zulaiha Ali

    2014-01-01

    Existing face recognition methods utilize particle swarm optimizer (PSO) and opposition based particle swarm optimizer (OPSO) to optimize the parameters of SVM. However, the utilization of random values in the velocity calculation decreases the performance of these techniques; that is, during the velocity computation, we normally use random values for the acceleration coefficients and this creates randomness in the solution. To address this problem, an adaptive acceleration particle swarm optimization (AAPSO) technique is proposed. To evaluate our proposed method, we employ both face and iris recognition based on AAPSO with SVM (AAPSO-SVM). In the face and iris recognition systems, performance is evaluated using two human face databases, YALE and CASIA, and the UBiris dataset. In this method, we initially perform feature extraction and then recognition on the extracted features. In the recognition process, the extracted features are used for SVM training and testing. During the training and testing, the SVM parameters are optimized with the AAPSO technique, and in AAPSO, the acceleration coefficients are computed using the particle fitness values. The parameters in SVM, which are optimized by AAPSO, perform efficiently for both face and iris recognition. A comparative analysis between our proposed AAPSO-SVM and the PSO-SVM technique is presented. PMID:24790584

  16. Support vector machine based on adaptive acceleration particle swarm optimization.

    PubMed

    Abdulameer, Mohammed Hasan; Sheikh Abdullah, Siti Norul Huda; Othman, Zulaiha Ali

    2014-01-01

    Existing face recognition methods utilize particle swarm optimizer (PSO) and opposition based particle swarm optimizer (OPSO) to optimize the parameters of SVM. However, the utilization of random values in the velocity calculation decreases the performance of these techniques; that is, during the velocity computation, we normally use random values for the acceleration coefficients and this creates randomness in the solution. To address this problem, an adaptive acceleration particle swarm optimization (AAPSO) technique is proposed. To evaluate our proposed method, we employ both face and iris recognition based on AAPSO with SVM (AAPSO-SVM). In the face and iris recognition systems, performance is evaluated using two human face databases, YALE and CASIA, and the UBiris dataset. In this method, we initially perform feature extraction and then recognition on the extracted features. In the recognition process, the extracted features are used for SVM training and testing. During the training and testing, the SVM parameters are optimized with the AAPSO technique, and in AAPSO, the acceleration coefficients are computed using the particle fitness values. The parameters in SVM, which are optimized by AAPSO, perform efficiently for both face and iris recognition. A comparative analysis between our proposed AAPSO-SVM and the PSO-SVM technique is presented. PMID:24790584

  17. Particle swarm optimization for complex nonlinear optimization problems

    NASA Astrophysics Data System (ADS)

    Alexandridis, Alex; Famelis, Ioannis Th.; Tsitouras, Charalambos

    2016-06-01

    This work presents the application of a technique belonging to evolutionary computation, namely particle swarm optimization (PSO), to complex nonlinear optimization problems. To be more specific, a PSO optimizer is setup and applied to the derivation of Runge-Kutta pairs for the numerical solution of initial value problems. The effect of critical PSO operational parameters on the performance of the proposed scheme is thoroughly investigated.

  18. Particle Swarm Imaging (PSIM) - Innovative Gamma-Ray Assay - 13497

    SciTech Connect

    Parvin, Daniel; Clarke, Sean; Humes, Sarah J.

    2013-07-01

    Particle Swarm Imaging is an innovative technique used to perform quantitative gamma-ray assay. The innovation overcomes some of the difficulties associated with the accurate measurement and declaration of measurement uncertainties of radionuclide inventories within waste items when the distribution of activity is unknown. Implementation requires minimal equipment, with field measurements and results obtained using only a single electrically cooled HRGS gamma-ray detector. Examples of its application in the field are given in this paper. (authors)

  19. An immune-inspired swarm aggregation algorithm for self-healing swarm robotic systems.

    PubMed

    Timmis, J; Ismail, A R; Bjerknes, J D; Winfield, A F T

    2016-08-01

    Swarm robotics is concerned with the decentralised coordination of multiple robots having only limited communication and interaction abilities. Although fault tolerance and robustness to individual robot failures have often been used to justify the use of swarm robotic systems, recent studies have shown that swarm robotic systems are susceptible to certain types of failure. In this paper we propose an approach to self-healing swarm robotic systems and take inspiration from the process of granuloma formation, a process of containment and repair found in the immune system. We use a case study of a swarm performing team work where previous works have demonstrated that partially failed robots have the most detrimental effect on overall swarm behaviour. We have developed an immune inspired approach that permits the recovery from certain failure modes during operation of the swarm, overcoming issues that effect swarm behaviour associated with partially failed robots. PMID:27178784

  20. Detecting compact galactic binaries using a hybrid swarm-based algorithm

    NASA Astrophysics Data System (ADS)

    Bouffanais, Yann; Porter, Edward K.

    2016-03-01

    Compact binaries in our galaxy are expected to be one of the main sources of gravitational waves for the future eLISA mission. During the mission lifetime, many thousands of galactic binaries should be individually resolved. However, the identification of the sources and the extraction of the signal parameters in a noisy environment are real challenges for data analysis. So far, stochastic searches have proven to be the most successful for this problem. In this work, we present the first application of a swarm-based algorithm combining Particle Swarm Optimization and Differential Evolution. These algorithms have been shown to converge faster to global solutions on complicated likelihood surfaces than other stochastic methods. We first demonstrate the effectiveness of the algorithm for the case of a single binary in a 1-mHz search bandwidth. This interesting problem gave the algorithm plenty of opportunity to fail, as it can be easier to find a strong noise peak rather than the signal itself. After a successful detection of a fictitious low-frequency source, as well as the verification binary RXJ 0806.3 +1527 , we then applied the algorithm to the detection of multiple binaries, over different search bandwidths, in the cases of low and mild source confusion. In all cases, we show that we can successfully identify the sources and recover the true parameters within a 99% credible interval.

  1. Non-linear system control using a recurrent fuzzy neural network based on improved particle swarm optimisation

    NASA Astrophysics Data System (ADS)

    Lin, Cheng-Jian; Lee, Chi-Yung

    2010-04-01

    This article introduces a recurrent fuzzy neural network based on improved particle swarm optimisation (IPSO) for non-linear system control. An IPSO method which consists of the modified evolutionary direction operator (MEDO) and the Particle Swarm Optimisation (PSO) is proposed in this article. A MEDO combining the evolutionary direction operator and the migration operation is also proposed. The MEDO will improve the global search solution. Experimental results have shown that the proposed IPSO method controls the magnetic levitation system and the planetary train type inverted pendulum system better than the traditional PSO and the genetic algorithm methods.

  2. Application of particle swarm optimization to interpret Rayleigh wave dispersion curves

    NASA Astrophysics Data System (ADS)

    Song, Xianhai; Tang, Li; Lv, Xiaochun; Fang, Hongping; Gu, Hanming

    2012-09-01

    Rayleigh waves have been used increasingly as an appealing tool to obtain near-surface shear (S)-wave velocity profiles. However, inversion of Rayleigh wave dispersion curves is challenging for most local-search methods due to its high nonlinearity and to its multimodality. In this study, we proposed and tested a new Rayleigh wave dispersion curve inversion scheme based on particle swarm optimization (PSO). PSO is a global optimization strategy that simulates the social behavior observed in a flock (swarm) of birds searching for food. A simple search strategy in PSO guides the algorithm toward the best solution through constant updating of the cognitive knowledge and social behavior of the particles in the swarm. To evaluate calculation efficiency and stability of PSO to inversion of surface wave data, we first inverted three noise-free and three noise-corrupted synthetic data sets. Then, we made a comparative analysis with genetic algorithms (GA) and a Monte Carlo (MC) sampler and reconstructed a histogram of model parameters sampled on a low-misfit region less than 15% relative error to further investigate the performance of the proposed inverse procedure. Finally, we inverted a real-world example from a waste disposal site in NE Italy to examine the applicability of PSO on Rayleigh wave dispersion curves. Results from both synthetic and field data demonstrate that particle swarm optimization can be used for quantitative interpretation of Rayleigh wave dispersion curves. PSO seems superior to GA and MC in terms of both reliability and computational efforts. The great advantages of PSO are fast in locating the low misfit region and easy to implement. Also there are only three parameters to tune (inertia weight or constriction factor, local and global acceleration constants). Theoretical results exist to explain how to tune these parameters.

  3. Particle swarm optimization for optimal sensor placement in ultrasonic SHM systems

    NASA Astrophysics Data System (ADS)

    Blanloeuil, Philippe; Nurhazli, Nur A. E.; Veidt, Martin

    2016-04-01

    A Particle Swarm Optimization (PSO) algorithm is used to improve sensors placement in an ultrasonic Structural Health Monitoring (SHM) system where the detection is performed through the beam-forming imaging algorithm. The imaging algorithm reconstructs the defect image and estimates its location based on analytically generated signals, considering circular through hole damage in an aluminum plate as the tested structure. Then, the PSO algorithm changes the position of sensors to improve the accuracy of the detection. Thus, the two algorithms are working together iteratively to optimize the system configuration, taking into account a complete modeling of the SHM system. It is shown that this approach can provide good sensors placements for detection of multiple defects in the target area, and for different numbers of sensors.

  4. Swarm.

    ERIC Educational Resources Information Center

    Petersen, Hugh

    2002-01-01

    Describes an eighth grade art project for which students created bug swarms on scratchboard. Explains that the project also teaches students about design principles, such as balance. Discusses how the students created their drawings. (CMK)

  5. Short-term cascaded hydroelectric system scheduling based on chaotic particle swarm optimization using improved logistic map

    NASA Astrophysics Data System (ADS)

    He, Yaoyao; Yang, Shanlin; Xu, Qifa

    2013-07-01

    In order to solve the model of short-term cascaded hydroelectric system scheduling, a novel chaotic particle swarm optimization (CPSO) algorithm using improved logistic map is introduced, which uses the water discharge as the decision variables combined with the death penalty function. According to the principle of maximum power generation, the proposed approach makes use of the ergodicity, symmetry and stochastic property of improved logistic chaotic map for enhancing the performance of particle swarm optimization (PSO) algorithm. The new hybrid method has been examined and tested on two test functions and a practical cascaded hydroelectric system. The experimental results show that the effectiveness and robustness of the proposed CPSO algorithm in comparison with other traditional algorithms.

  6. Application of particle swarm optimization in chaos synchronization in noisy environment in presence of unknown parameter uncertainty

    NASA Astrophysics Data System (ADS)

    Shirazi, Masoud Jahromi; Vatankhah, Ramin; Boroushaki, Mehrdad; Salarieh, Hassan; Alasty, Aria

    2012-02-01

    In this paper, particle swarm optimization (PSO) is applied to synchronize chaotic systems in presence of parameter uncertainties and measurement noise. Particle swarm optimization is an evolutionary algorithm which is introduced by Kennedy and Eberhart. This algorithm is inspired by birds flocking. Optimization algorithms can be applied to control by defining an appropriate cost function that guarantees stability of system. In presence of environment noise and parameter uncertainty, robustness plays a crucial role in succeed of controller. Since PSO needs only rudimentary information about the system, it can be a suitable algorithm for this case. Simulation results confirm that the proposed controller can handle the uncertainty and environment noise without any extra information about them. A comparison with some earlier works is performed during simulations.

  7. Multi-Robot, Multi-Target Particle Swarm Optimization Search in Noisy Wireless Environments

    SciTech Connect

    Kurt Derr; Milos Manic

    2009-05-01

    Multiple small robots (swarms) can work together using Particle Swarm Optimization (PSO) to perform tasks that are difficult or impossible for a single robot to accomplish. The problem considered in this paper is exploration of an unknown environment with the goal of finding a target(s) at an unknown location(s) using multiple small mobile robots. This work demonstrates the use of a distributed PSO algorithm with a novel adaptive RSS weighting factor to guide robots for locating target(s) in high risk environments. The approach was developed and analyzed on multiple robot single and multiple target search. The approach was further enhanced by the multi-robot-multi-target search in noisy environments. The experimental results demonstrated how the availability of radio frequency signal can significantly affect robot search time to reach a target.

  8. Parameter identification of robot manipulators: a heuristic particle swarm search approach.

    PubMed

    Yan, Danping; Lu, Yongzhong; Levy, David

    2015-01-01

    Parameter identification of robot manipulators is an indispensable pivotal process of achieving accurate dynamic robot models. Since these kinetic models are highly nonlinear, it is not easy to tackle the matter of identifying their parameters. To solve the difficulty effectively, we herewith present an intelligent approach, namely, a heuristic particle swarm optimization (PSO) algorithm, which we call the elitist learning strategy (ELS) and proportional integral derivative (PID) controller hybridized PSO approach (ELPIDSO). A specified PID controller is designed to improve particles' local and global positions information together with ELS. Parameter identification of robot manipulators is conducted for performance evaluation of our proposed approach. Experimental results clearly indicate the following findings: Compared with standard PSO (SPSO) algorithm, ELPIDSO has improved a lot. It not only enhances the diversity of the swarm, but also features better search effectiveness and efficiency in solving practical optimization problems. Accordingly, ELPIDSO is superior to least squares (LS) method, genetic algorithm (GA), and SPSO algorithm in estimating the parameters of the kinetic models of robot manipulators. PMID:26039090

  9. Parameter identification of robot manipulators: a heuristic particle swarm search approach.

    PubMed

    Yan, Danping; Lu, Yongzhong; Levy, David

    2015-01-01

    Parameter identification of robot manipulators is an indispensable pivotal process of achieving accurate dynamic robot models. Since these kinetic models are highly nonlinear, it is not easy to tackle the matter of identifying their parameters. To solve the difficulty effectively, we herewith present an intelligent approach, namely, a heuristic particle swarm optimization (PSO) algorithm, which we call the elitist learning strategy (ELS) and proportional integral derivative (PID) controller hybridized PSO approach (ELPIDSO). A specified PID controller is designed to improve particles' local and global positions information together with ELS. Parameter identification of robot manipulators is conducted for performance evaluation of our proposed approach. Experimental results clearly indicate the following findings: Compared with standard PSO (SPSO) algorithm, ELPIDSO has improved a lot. It not only enhances the diversity of the swarm, but also features better search effectiveness and efficiency in solving practical optimization problems. Accordingly, ELPIDSO is superior to least squares (LS) method, genetic algorithm (GA), and SPSO algorithm in estimating the parameters of the kinetic models of robot manipulators.

  10. Biochemical systems identification by a random drift particle swarm optimization approach

    PubMed Central

    2014-01-01

    Background Finding an efficient method to solve the parameter estimation problem (inverse problem) for nonlinear biochemical dynamical systems could help promote the functional understanding at the system level for signalling pathways. The problem is stated as a data-driven nonlinear regression problem, which is converted into a nonlinear programming problem with many nonlinear differential and algebraic constraints. Due to the typical ill conditioning and multimodality nature of the problem, it is in general difficult for gradient-based local optimization methods to obtain satisfactory solutions. To surmount this limitation, many stochastic optimization methods have been employed to find the global solution of the problem. Results This paper presents an effective search strategy for a particle swarm optimization (PSO) algorithm that enhances the ability of the algorithm for estimating the parameters of complex dynamic biochemical pathways. The proposed algorithm is a new variant of random drift particle swarm optimization (RDPSO), which is used to solve the above mentioned inverse problem and compared with other well known stochastic optimization methods. Two case studies on estimating the parameters of two nonlinear biochemical dynamic models have been taken as benchmarks, under both the noise-free and noisy simulation data scenarios. Conclusions The experimental results show that the novel variant of RDPSO algorithm is able to successfully solve the problem and obtain solutions of better quality than other global optimization methods used for finding the solution to the inverse problems in this study. PMID:25078435

  11. Transmitter antenna placement in indoor environments using particle swarm optimisation

    NASA Astrophysics Data System (ADS)

    Talepour, Zeinab; Tavakoli, Saeed; Ahmadi-Shokouh, Javad

    2013-07-01

    The aim of this article is to suitably locate the minimum number of transmitter antennas in a given indoor environment to achieve good propagation coverage. To calculate the electromagnetic field in various points of the environment, we develop a software engine, named ray-tracing engine (RTE), in Matlab. To achieve realistic calculations, all parameters of geometry and material of building are considered. Particle swarm optimisation is employed to determine good location of transmitters. Simulation results show that a full coverage is obtained through suitably locating three transmitters.

  12. Bluetooth Based Chaos Synchronization Using Particle Swarm Optimization and Its Applications to Image Encryption

    PubMed Central

    Yau, Her-Terng; Hung, Tzu-Hsiang; Hsieh, Chia-Chun

    2012-01-01

    This study used the complex dynamic characteristics of chaotic systems and Bluetooth to explore the topic of wireless chaotic communication secrecy and develop a communication security system. The PID controller for chaos synchronization control was applied, and the optimum parameters of this PID controller were obtained using a Particle Swarm Optimization (PSO) algorithm. Bluetooth was used to realize wireless transmissions, and a chaotic wireless communication security system was developed in the design concept of a chaotic communication security system. The experimental results show that this scheme can be used successfully in image encryption. PMID:22969355

  13. Classification of Motor Imagery EEG Signals with Support Vector Machines and Particle Swarm Optimization.

    PubMed

    Ma, Yuliang; Ding, Xiaohui; She, Qingshan; Luo, Zhizeng; Potter, Thomas; Zhang, Yingchun

    2016-01-01

    Support vector machines are powerful tools used to solve the small sample and nonlinear classification problems, but their ultimate classification performance depends heavily upon the selection of appropriate kernel and penalty parameters. In this study, we propose using a particle swarm optimization algorithm to optimize the selection of both the kernel and penalty parameters in order to improve the classification performance of support vector machines. The performance of the optimized classifier was evaluated with motor imagery EEG signals in terms of both classification and prediction. Results show that the optimized classifier can significantly improve the classification accuracy of motor imagery EEG signals. PMID:27313656

  14. Early Mission Design of Transfers to Halo Orbits via Particle Swarm Optimization

    NASA Astrophysics Data System (ADS)

    Abraham, Andrew J.; Spencer, David B.; Hart, Terry J.

    2016-06-01

    Particle Swarm Optimization (PSO) is used to prune the search space of a low-thrust trajectory transfer from a high-altitude, Earth orbit to a Lagrange point orbit in the Earth-Moon system. Unlike a gradient based approach, this evolutionary PSO algorithm is capable of avoiding undesirable local minima. The PSO method is extended to a "local" version and uses a two dimensional search space that is capable of reducing the computation run-time by an order of magnitude when compared with published work. A technique for choosing appropriate PSO parameters is demonstrated and an example of an optimized trajectory is discussed.

  15. Bluetooth based chaos synchronization using particle swarm optimization and its applications to image encryption.

    PubMed

    Yau, Her-Terng; Hung, Tzu-Hsiang; Hsieh, Chia-Chun

    2012-01-01

    This study used the complex dynamic characteristics of chaotic systems and Bluetooth to explore the topic of wireless chaotic communication secrecy and develop a communication security system. The PID controller for chaos synchronization control was applied, and the optimum parameters of this PID controller were obtained using a Particle Swarm Optimization (PSO) algorithm. Bluetooth was used to realize wireless transmissions, and a chaotic wireless communication security system was developed in the design concept of a chaotic communication security system. The experimental results show that this scheme can be used successfully in image encryption.

  16. Classification of Motor Imagery EEG Signals with Support Vector Machines and Particle Swarm Optimization

    PubMed Central

    Ma, Yuliang; Ding, Xiaohui; She, Qingshan; Luo, Zhizeng; Potter, Thomas; Zhang, Yingchun

    2016-01-01

    Support vector machines are powerful tools used to solve the small sample and nonlinear classification problems, but their ultimate classification performance depends heavily upon the selection of appropriate kernel and penalty parameters. In this study, we propose using a particle swarm optimization algorithm to optimize the selection of both the kernel and penalty parameters in order to improve the classification performance of support vector machines. The performance of the optimized classifier was evaluated with motor imagery EEG signals in terms of both classification and prediction. Results show that the optimized classifier can significantly improve the classification accuracy of motor imagery EEG signals. PMID:27313656

  17. Comparison of particle swarm optimization and simulated annealing for locating additional boreholes considering combined variance minimization

    NASA Astrophysics Data System (ADS)

    Soltani-Mohammadi, Saeed; Safa, Mohammad; Mokhtari, Hadi

    2016-10-01

    One of the most important stages in complementary exploration is optimal designing the additional drilling pattern or defining the optimum number and location of additional boreholes. Quite a lot research has been carried out in this regard in which for most of the proposed algorithms, kriging variance minimization as a criterion for uncertainty assessment is defined as objective function and the problem could be solved through optimization methods. Although kriging variance implementation is known to have many advantages in objective function definition, it is not sensitive to local variability. As a result, the only factors evaluated for locating the additional boreholes are initial data configuration and variogram model parameters and the effects of local variability are omitted. In this paper, with the goal of considering the local variability in boundaries uncertainty assessment, the application of combined variance is investigated to define the objective function. Thus in order to verify the applicability of the proposed objective function, it is used to locate the additional boreholes in Esfordi phosphate mine through the implementation of metaheuristic optimization methods such as simulated annealing and particle swarm optimization. Comparison of results from the proposed objective function and conventional methods indicates that the new changes imposed on the objective function has caused the algorithm output to be sensitive to the variations of grade, domain's boundaries and the thickness of mineralization domain. The comparison between the results of different optimization algorithms proved that for the presented case the application of particle swarm optimization is more appropriate than simulated annealing.

  18. Discrete Particle Swarm Optimization Routing Protocol for Wireless Sensor Networks with Multiple Mobile Sinks.

    PubMed

    Yang, Jin; Liu, Fagui; Cao, Jianneng; Wang, Liangming

    2016-01-01

    Mobile sinks can achieve load-balancing and energy-consumption balancing across the wireless sensor networks (WSNs). However, the frequent change of the paths between source nodes and the sinks caused by sink mobility introduces significant overhead in terms of energy and packet delays. To enhance network performance of WSNs with mobile sinks (MWSNs), we present an efficient routing strategy, which is formulated as an optimization problem and employs the particle swarm optimization algorithm (PSO) to build the optimal routing paths. However, the conventional PSO is insufficient to solve discrete routing optimization problems. Therefore, a novel greedy discrete particle swarm optimization with memory (GMDPSO) is put forward to address this problem. In the GMDPSO, particle's position and velocity of traditional PSO are redefined under discrete MWSNs scenario. Particle updating rule is also reconsidered based on the subnetwork topology of MWSNs. Besides, by improving the greedy forwarding routing, a greedy search strategy is designed to drive particles to find a better position quickly. Furthermore, searching history is memorized to accelerate convergence. Simulation results demonstrate that our new protocol significantly improves the robustness and adapts to rapid topological changes with multiple mobile sinks, while efficiently reducing the communication overhead and the energy consumption. PMID:27428971

  19. Discrete Particle Swarm Optimization Routing Protocol for Wireless Sensor Networks with Multiple Mobile Sinks.

    PubMed

    Yang, Jin; Liu, Fagui; Cao, Jianneng; Wang, Liangming

    2016-01-01

    Mobile sinks can achieve load-balancing and energy-consumption balancing across the wireless sensor networks (WSNs). However, the frequent change of the paths between source nodes and the sinks caused by sink mobility introduces significant overhead in terms of energy and packet delays. To enhance network performance of WSNs with mobile sinks (MWSNs), we present an efficient routing strategy, which is formulated as an optimization problem and employs the particle swarm optimization algorithm (PSO) to build the optimal routing paths. However, the conventional PSO is insufficient to solve discrete routing optimization problems. Therefore, a novel greedy discrete particle swarm optimization with memory (GMDPSO) is put forward to address this problem. In the GMDPSO, particle's position and velocity of traditional PSO are redefined under discrete MWSNs scenario. Particle updating rule is also reconsidered based on the subnetwork topology of MWSNs. Besides, by improving the greedy forwarding routing, a greedy search strategy is designed to drive particles to find a better position quickly. Furthermore, searching history is memorized to accelerate convergence. Simulation results demonstrate that our new protocol significantly improves the robustness and adapts to rapid topological changes with multiple mobile sinks, while efficiently reducing the communication overhead and the energy consumption.

  20. Joint inversion of seismic and flow data for reservoir parameter assessment using particle swarm optimization

    NASA Astrophysics Data System (ADS)

    Suman, A.; Mukerji, T.; Fernandez Martinez, J.

    2010-12-01

    Time lapse seismic data has begun to play an important role in reservoir characterization, management and monitoring. It can provide information on the dynamics of fluids in the reservoir based on the relation between variations of seismic signals and movement of hydrocarbons and changes in formation pressure. Reservoir monitoring by repeated seismic or time lapse surveys can help in reducing the uncertainties attached to reservoir models. In combination with geological and flow modeling as a part of history matching process it can provide better description of the reservoir and thus better reservoir forecasting. However joint inversion of seismic and flow data for reservoir parameter is highly non-linear and complex. Stochastic optimization based inversion has shown very good results in integration of time-lapse seismic and production data in reservoir history matching. In this paper we have used a family of particle swarm optimizers for inversion of semi-synthetic Norne field data set. We analyze the performance of the different PSO optimizers, both in terms of exploration and convergence rate. Finally we also show some promising and preliminary results of the application of differential evolution. All of the versions of PSO provide an acceptable match with the original synthetic model. The advantage of using global optimization method is that uncertainty can be assessed near the optimum point. To assess uncertainty near the optimum point we keep track of all particles over all iterations that have an objective function value below a selected cutoff. With these particles we plot the best, E-type and IQR (Inter quartile range) of porosity and permeability for each version of PSO. To compute uncertainty measures using a stochastic optimizer algorithm care has to be taken not to oversample the optimal point. We keep track of the evolution of the median distance between the global best in each of the iterations and the particles of the swarm. When this distance is

  1. Parameter Identification of Robot Manipulators: A Heuristic Particle Swarm Search Approach

    PubMed Central

    Yan, Danping; Lu, Yongzhong; Levy, David

    2015-01-01

    Parameter identification of robot manipulators is an indispensable pivotal process of achieving accurate dynamic robot models. Since these kinetic models are highly nonlinear, it is not easy to tackle the matter of identifying their parameters. To solve the difficulty effectively, we herewith present an intelligent approach, namely, a heuristic particle swarm optimization (PSO) algorithm, which we call the elitist learning strategy (ELS) and proportional integral derivative (PID) controller hybridized PSO approach (ELPIDSO). A specified PID controller is designed to improve particles’ local and global positions information together with ELS. Parameter identification of robot manipulators is conducted for performance evaluation of our proposed approach. Experimental results clearly indicate the following findings: Compared with standard PSO (SPSO) algorithm, ELPIDSO has improved a lot. It not only enhances the diversity of the swarm, but also features better search effectiveness and efficiency in solving practical optimization problems. Accordingly, ELPIDSO is superior to least squares (LS) method, genetic algorithm (GA), and SPSO algorithm in estimating the parameters of the kinetic models of robot manipulators. PMID:26039090

  2. Extended particle swarm optimisation method for folding protein on triangular lattice.

    PubMed

    Guo, Yuzhen; Wu, Zikai; Wang, Ying; Wang, Yong

    2016-02-01

    In this study, the authors studied the protein structure prediction problem by the two-dimensional hydrophobic-polar model on triangular lattice. Particularly the non-compact conformation was modelled to fold the amino acid sequence into a relatively larger triangular lattice, which is more biologically realistic and significant than the compact conformation. Then protein structure prediction problem was abstracted to match amino acids to lattice points. Mathematically, the problem was formulated as an integer programming and they transformed the biological problem into an optimisation problem. To solve this problem, classical particle swarm optimisation algorithm was extended by the single point adjustment strategy. Compared with square lattice, conformations on triangular lattice are more flexible in several benchmark examples. They further compared the authors' algorithm with hybrid of hill climbing and genetic algorithm. The results showed that their method was more effective in finding solution with lower energy and less running time.

  3. Multi-terminal pipe routing by Steiner minimal tree and particle swarm optimisation

    NASA Astrophysics Data System (ADS)

    Liu, Qiang; Wang, Chengen

    2012-08-01

    Computer-aided design of pipe routing is of fundamental importance for complex equipments' developments. In this article, non-rectilinear branch pipe routing with multiple terminals that can be formulated as a Euclidean Steiner Minimal Tree with Obstacles (ESMTO) problem is studied in the context of an aeroengine-integrated design engineering. Unlike the traditional methods that connect pipe terminals sequentially, this article presents a new branch pipe routing algorithm based on the Steiner tree theory. The article begins with a new algorithm for solving the ESMTO problem by using particle swarm optimisation (PSO), and then extends the method to the surface cases by using geodesics to meet the requirements of routing non-rectilinear pipes on the surfaces of aeroengines. Subsequently, the adaptive region strategy and the basic visibility graph method are adopted to increase the computation efficiency. Numeral computations show that the proposed routing algorithm can find satisfactory routing layouts while running in polynomial time.

  4. Extended particle swarm optimisation method for folding protein on triangular lattice.

    PubMed

    Guo, Yuzhen; Wu, Zikai; Wang, Ying; Wang, Yong

    2016-02-01

    In this study, the authors studied the protein structure prediction problem by the two-dimensional hydrophobic-polar model on triangular lattice. Particularly the non-compact conformation was modelled to fold the amino acid sequence into a relatively larger triangular lattice, which is more biologically realistic and significant than the compact conformation. Then protein structure prediction problem was abstracted to match amino acids to lattice points. Mathematically, the problem was formulated as an integer programming and they transformed the biological problem into an optimisation problem. To solve this problem, classical particle swarm optimisation algorithm was extended by the single point adjustment strategy. Compared with square lattice, conformations on triangular lattice are more flexible in several benchmark examples. They further compared the authors' algorithm with hybrid of hill climbing and genetic algorithm. The results showed that their method was more effective in finding solution with lower energy and less running time. PMID:26816397

  5. On-line energy management for HEV based on particle swarm optimization

    NASA Astrophysics Data System (ADS)

    Caux, S.; Wanderley-Honda, D.; Hissel, D.; Fadel, M.

    2011-05-01

    This study considers a Hybrid Electrical Vehicle supplied by a Fuel Cell stack and supercapacitors used as Storage Element. In such an application, real time energy management is of paramount importance in order to increase autonomy and be able to deal on-line with perturbed power demand. Many offline power flow optimization principles are available but online algorithms are preferred and should be derived for optimal management of the instantaneous power splitting between the different available power sources. Based on particle swarm optimization algorithm, this study defines the parameters tuning of such algorithm. The final power splitting allows not only recovering energy braking but also is robust to some disturbances occurring during the trip. The solution provides good-quality and high-robustness results in a certain class of mission profile and power disturbance.

  6. On the application of Particle Swarm Optimization strategies on Scholte-wave inversion

    NASA Astrophysics Data System (ADS)

    Wilken, D.; Rabbel, W.

    2012-07-01

    We investigate different aspects concerning the application of swarm intelligence optimization to the inversion of Scholte-wave phase-slowness frequency (p-f) spectra with respect to shear wave velocity structure. Besides human influence due to the dependence on a priori information for starting models and interpretation of p-f spectra as well as noise, the model resolution of the inversion problem is strongly influenced by the multimodality of the misfit function. We thus tested the efficiency of global, stochastic optimization approaches with focus on swarm intelligence methods that can explore the multiple minima of the misfit function. A comparison among different PSO schemes by applying them to synthetic Scholte-wave spectra led to a hybrid of Particle Swarm Optimization and Downhill Simplex providing the best resolution of inverted shear wave velocity depth models. The results showed a very low spread of best fitting solutions of 7 per cent in shear wave velocity and an average of 9 per cent for noisy synthetic data and a very good fit to the true synthetic model used for computation of the input data. To classify this method we also compared the probability of finding a good fit in synthetic spectra inversion with that of Evolutionary Algorithm, Simulated Annealing, Neighbourhood Algorithm and Artificial Bee Colony algorithm. Again the hybrid optimization scheme showed its predominance. The usage of stochastic algorithms furthermore allowed a new way of misfit definition in terms of dispersion curve slowness residuals making the inversion scheme independent on Scholte-wave mode identification and allowing joint inversion of fundamental mode and higher mode information. Finally we used the hybrid optimization scheme and the misfit calculation for the inversion of 2-D shear wave velocity profiles from two locations in the North- and Baltic Sea. The models show acceptable resolution and a very good structural correlation to high resolution reflection seismic

  7. Cat Swarm Optimization algorithm for optimal linear phase FIR filter design.

    PubMed

    Saha, Suman Kumar; Ghoshal, Sakti Prasad; Kar, Rajib; Mandal, Durbadal

    2013-11-01

    In this paper a new meta-heuristic search method, called Cat Swarm Optimization (CSO) algorithm is applied to determine the best optimal impulse response coefficients of FIR low pass, high pass, band pass and band stop filters, trying to meet the respective ideal frequency response characteristics. CSO is generated by observing the behaviour of cats and composed of two sub-models. In CSO, one can decide how many cats are used in the iteration. Every cat has its' own position composed of M dimensions, velocities for each dimension, a fitness value which represents the accommodation of the cat to the fitness function, and a flag to identify whether the cat is in seeking mode or tracing mode. The final solution would be the best position of one of the cats. CSO keeps the best solution until it reaches the end of the iteration. The results of the proposed CSO based approach have been compared to those of other well-known optimization methods such as Real Coded Genetic Algorithm (RGA), standard Particle Swarm Optimization (PSO) and Differential Evolution (DE). The CSO based results confirm the superiority of the proposed CSO for solving FIR filter design problems. The performances of the CSO based designed FIR filters have proven to be superior as compared to those obtained by RGA, conventional PSO and DE. The simulation results also demonstrate that the CSO is the best optimizer among other relevant techniques, not only in the convergence speed but also in the optimal performances of the designed filters.

  8. Discrete Particle Swarm Optimization Routing Protocol for Wireless Sensor Networks with Multiple Mobile Sinks

    PubMed Central

    Yang, Jin; Liu, Fagui; Cao, Jianneng; Wang, Liangming

    2016-01-01

    Mobile sinks can achieve load-balancing and energy-consumption balancing across the wireless sensor networks (WSNs). However, the frequent change of the paths between source nodes and the sinks caused by sink mobility introduces significant overhead in terms of energy and packet delays. To enhance network performance of WSNs with mobile sinks (MWSNs), we present an efficient routing strategy, which is formulated as an optimization problem and employs the particle swarm optimization algorithm (PSO) to build the optimal routing paths. However, the conventional PSO is insufficient to solve discrete routing optimization problems. Therefore, a novel greedy discrete particle swarm optimization with memory (GMDPSO) is put forward to address this problem. In the GMDPSO, particle’s position and velocity of traditional PSO are redefined under discrete MWSNs scenario. Particle updating rule is also reconsidered based on the subnetwork topology of MWSNs. Besides, by improving the greedy forwarding routing, a greedy search strategy is designed to drive particles to find a better position quickly. Furthermore, searching history is memorized to accelerate convergence. Simulation results demonstrate that our new protocol significantly improves the robustness and adapts to rapid topological changes with multiple mobile sinks, while efficiently reducing the communication overhead and the energy consumption. PMID:27428971

  9. QPSO-MD: A Quantum Behaved Particle Swarm Optimization for Consensus Pattern Identification

    NASA Astrophysics Data System (ADS)

    Meshoul, Souham; Al-Owaisheq, Tasneem

    Particle Swarm Optimization (PSO) has been successfully applied to a wide range of fields. The recent introduction of quantum mechanics principles into PSO has given rise to a Quantum behaviour PSO (QPSO) algorithm. This paper investigates its application into motif discovery, a challenging task in bioinformatics and molecular biology. Given a set of input DNA sequences, the proposed framework acts as a search process where a population of particles is depicted by a quantum behavior. Each particle represents a set of regulatory patterns from which a consensus pattern or motif model is derived. The corresponding fitness function is related to the total number of pairwise matches between nucleotides in the input sequences. Experiment results on synthetic and real data are very promising and prove the effectiveness of the proposed framework.

  10. Dynamic multi-swarm particle swarm optimizer using parallel PC cluster systems for global optimization of large-scale multimodal functions

    NASA Astrophysics Data System (ADS)

    Fan, Shu-Kai S.; Chang, Ju-Ming

    2010-05-01

    This article presents a novel parallel multi-swarm optimization (PMSO) algorithm with the aim of enhancing the search ability of standard single-swarm PSOs for global optimization of very large-scale multimodal functions. Different from the existing multi-swarm structures, the multiple swarms work in parallel, and the search space is partitioned evenly and dynamically assigned in a weighted manner via the roulette wheel selection (RWS) mechanism. This parallel, distributed framework of the PMSO algorithm is developed based on a master-slave paradigm, which is implemented on a cluster of PCs using message passing interface (MPI) for information interchange among swarms. The PMSO algorithm handles multiple swarms simultaneously and each swarm performs PSO operations of its own independently. In particular, one swarm is designated for global search and the others are for local search. The first part of the experimental comparison is made among the PMSO, standard PSO, and two state-of-the-art algorithms (CTSS and CLPSO) in terms of various un-rotated and rotated benchmark functions taken from the literature. In the second part, the proposed multi-swarm algorithm is tested on large-scale multimodal benchmark functions up to 300 dimensions. The results of the PMSO algorithm show great promise in solving high-dimensional problems.

  11. Robust electromagnetically guided endoscopic procedure using enhanced particle swarm optimization for multimodal information fusion

    SciTech Connect

    Luo, Xiongbiao E-mail: Ying.Wan@student.uts.edu.au; Wan, Ying E-mail: Ying.Wan@student.uts.edu.au; He, Xiangjian

    2015-04-15

    Purpose: Electromagnetically guided endoscopic procedure, which aims at accurately and robustly localizing the endoscope, involves multimodal sensory information during interventions. However, it still remains challenging in how to integrate these information for precise and stable endoscopic guidance. To tackle such a challenge, this paper proposes a new framework on the basis of an enhanced particle swarm optimization method to effectively fuse these information for accurate and continuous endoscope localization. Methods: The authors use the particle swarm optimization method, which is one of stochastic evolutionary computation algorithms, to effectively fuse the multimodal information including preoperative information (i.e., computed tomography images) as a frame of reference, endoscopic camera videos, and positional sensor measurements (i.e., electromagnetic sensor outputs). Since the evolutionary computation method usually limits its possible premature convergence and evolutionary factors, the authors introduce the current (endoscopic camera and electromagnetic sensor’s) observation to boost the particle swarm optimization and also adaptively update evolutionary parameters in accordance with spatial constraints and the current observation, resulting in advantageous performance in the enhanced algorithm. Results: The experimental results demonstrate that the authors’ proposed method provides a more accurate and robust endoscopic guidance framework than state-of-the-art methods. The average guidance accuracy of the authors’ framework was about 3.0 mm and 5.6° while the previous methods show at least 3.9 mm and 7.0°. The average position and orientation smoothness of their method was 1.0 mm and 1.6°, which is significantly better than the other methods at least with (2.0 mm and 2.6°). Additionally, the average visual quality of the endoscopic guidance was improved to 0.29. Conclusions: A robust electromagnetically guided endoscopy framework was

  12. A Triangle Mesh Standardization Method Based on Particle Swarm Optimization.

    PubMed

    Wang, Wuli; Duan, Liming; Bai, Yang; Wang, Haoyu; Shao, Hui; Zhong, Siyang

    2016-01-01

    To enhance the triangle quality of a reconstructed triangle mesh, a novel triangle mesh standardization method based on particle swarm optimization (PSO) is proposed. First, each vertex of the mesh and its first order vertices are fitted to a cubic curve surface by using least square method. Additionally, based on the condition that the local fitted surface is the searching region of PSO and the best average quality of the local triangles is the goal, the vertex position of the mesh is regulated. Finally, the threshold of the normal angle between the original vertex and regulated vertex is used to determine whether the vertex needs to be adjusted to preserve the detailed features of the mesh. Compared with existing methods, experimental results show that the proposed method can effectively improve the triangle quality of the mesh while preserving the geometric features and details of the original mesh. PMID:27509129

  13. A Triangle Mesh Standardization Method Based on Particle Swarm Optimization

    PubMed Central

    Duan, Liming; Bai, Yang; Wang, Haoyu; Shao, Hui; Zhong, Siyang

    2016-01-01

    To enhance the triangle quality of a reconstructed triangle mesh, a novel triangle mesh standardization method based on particle swarm optimization (PSO) is proposed. First, each vertex of the mesh and its first order vertices are fitted to a cubic curve surface by using least square method. Additionally, based on the condition that the local fitted surface is the searching region of PSO and the best average quality of the local triangles is the goal, the vertex position of the mesh is regulated. Finally, the threshold of the normal angle between the original vertex and regulated vertex is used to determine whether the vertex needs to be adjusted to preserve the detailed features of the mesh. Compared with existing methods, experimental results show that the proposed method can effectively improve the triangle quality of the mesh while preserving the geometric features and details of the original mesh. PMID:27509129

  14. Forecasting of DST index from auroral electrojet indices using time-delay neural network + particle swarm optimization

    NASA Astrophysics Data System (ADS)

    Lazzús, J. A.; López-Caraballo, C. H.; Rojas, P.; Salfate, I.; Rivera, M.; Palma-Chilla, L.

    2016-05-01

    In this study, an artificial neural network was optimized with particle swarm algorithm and trained to predict the geomagmetic DST index one hour ahead using the past values of DST and auroral electrojet indices. The results show that the proposed neural network model can be properly trained for predicting of DST(t + 1) with acceptable accuracy, and that the geomagnetic indices used have influential effects on the good training and predicting capabilities of the chosen network.

  15. hydroPSO: A Versatile Particle Swarm Optimisation R Package for Calibration of Environmental Models

    NASA Astrophysics Data System (ADS)

    Zambrano-Bigiarini, M.; Rojas, R.

    2012-04-01

    Particle Swarm Optimisation (PSO) is a recent and powerful population-based stochastic optimisation technique inspired by social behaviour of bird flocking, which shares similarities with other evolutionary techniques such as Genetic Algorithms (GA). In PSO, however, each individual of the population, known as particle in PSO terminology, adjusts its flying trajectory on the multi-dimensional search-space according to its own experience (best-known personal position) and the one of its neighbours in the swarm (best-known local position). PSO has recently received a surge of attention given its flexibility, ease of programming, low memory and CPU requirements, and efficiency. Despite these advantages, PSO may still get trapped into sub-optimal solutions, suffer from swarm explosion or premature convergence. Thus, the development of enhancements to the "canonical" PSO is an active area of research. To date, several modifications to the canonical PSO have been proposed in the literature, resulting into a large and dispersed collection of codes and algorithms which might well be used for similar if not identical purposes. In this work we present hydroPSO, a platform-independent R package implementing several enhancements to the canonical PSO that we consider of utmost importance to bring this technique to the attention of a broader community of scientists and practitioners. hydroPSO is model-independent, allowing the user to interface any model code with the calibration engine without having to invest considerable effort in customizing PSO to a new calibration problem. Some of the controlling options to fine-tune hydroPSO are: four alternative topologies, several types of inertia weight, time-variant acceleration coefficients, time-variant maximum velocity, regrouping of particles when premature convergence is detected, different types of boundary conditions and many others. Additionally, hydroPSO implements recent PSO variants such as: Improved Particle Swarm

  16. Optimal Control for a Parallel Hybrid Hydraulic Excavator Using Particle Swarm Optimization

    PubMed Central

    Wang, Dong-yun; Guan, Chen

    2013-01-01

    Optimal control using particle swarm optimization (PSO) is put forward in a parallel hybrid hydraulic excavator (PHHE). A power-train mathematical model of PHHE is illustrated along with the analysis of components' parameters. Then, the optimal control problem is addressed, and PSO algorithm is introduced to deal with this nonlinear optimal problem which contains lots of inequality/equality constraints. Then, the comparisons between the optimal control and rule-based one are made, and the results show that hybrids with the optimal control would increase fuel economy. Although PSO algorithm is off-line optimization, still it would bring performance benchmark for PHHE and also help have a deep insight into hybrid excavators. PMID:23818832

  17. A Bayesian interpretation of the particle swarm optimization and its kernel extension.

    PubMed

    Andras, Peter

    2012-01-01

    Particle swarm optimization is a popular method for solving difficult optimization problems. There have been attempts to formulate the method in formal probabilistic or stochastic terms (e.g. bare bones particle swarm) with the aim to achieve more generality and explain the practical behavior of the method. Here we present a Bayesian interpretation of the particle swarm optimization. This interpretation provides a formal framework for incorporation of prior knowledge about the problem that is being solved. Furthermore, it also allows to extend the particle optimization method through the use of kernel functions that represent the intermediary transformation of the data into a different space where the optimization problem is expected to be easier to be resolved-such transformation can be seen as a form of prior knowledge about the nature of the optimization problem. We derive from the general Bayesian formulation the commonly used particle swarm methods as particular cases.

  18. A Bayesian Interpretation of the Particle Swarm Optimization and Its Kernel Extension

    PubMed Central

    Andras, Peter

    2012-01-01

    Particle swarm optimization is a popular method for solving difficult optimization problems. There have been attempts to formulate the method in formal probabilistic or stochastic terms (e.g. bare bones particle swarm) with the aim to achieve more generality and explain the practical behavior of the method. Here we present a Bayesian interpretation of the particle swarm optimization. This interpretation provides a formal framework for incorporation of prior knowledge about the problem that is being solved. Furthermore, it also allows to extend the particle optimization method through the use of kernel functions that represent the intermediary transformation of the data into a different space where the optimization problem is expected to be easier to be resolved–such transformation can be seen as a form of prior knowledge about the nature of the optimization problem. We derive from the general Bayesian formulation the commonly used particle swarm methods as particular cases. PMID:23144937

  19. Prediction of Skin Sensitization with a Particle Swarm Optimized Support Vector Machine

    PubMed Central

    Yuan, Hua; Huang, Jianping; Cao, Chenzhong

    2009-01-01

    Skin sensitization is the most commonly reported occupational illness, causing much suffering to a wide range of people. Identification and labeling of environmental allergens is urgently required to protect people from skin sensitization. The guinea pig maximization test (GPMT) and murine local lymph node assay (LLNA) are the two most important in vivo models for identification of skin sensitizers. In order to reduce the number of animal tests, quantitative structure-activity relationships (QSARs) are strongly encouraged in the assessment of skin sensitization of chemicals. This paper has investigated the skin sensitization potential of 162 compounds with LLNA results and 92 compounds with GPMT results using a support vector machine. A particle swarm optimization algorithm was implemented for feature selection from a large number of molecular descriptors calculated by Dragon. For the LLNA data set, the classification accuracies are 95.37% and 88.89% for the training and the test sets, respectively. For the GPMT data set, the classification accuracies are 91.80% and 90.32% for the training and the test sets, respectively. The classification performances were greatly improved compared to those reported in the literature, indicating that the support vector machine optimized by particle swarm in this paper is competent for the identification of skin sensitizers. PMID:19742136

  20. A Hybrid Swarm Intelligence Algorithm for Intrusion Detection Using Significant Features.

    PubMed

    Amudha, P; Karthik, S; Sivakumari, S

    2015-01-01

    Intrusion detection has become a main part of network security due to the huge number of attacks which affects the computers. This is due to the extensive growth of internet connectivity and accessibility to information systems worldwide. To deal with this problem, in this paper a hybrid algorithm is proposed to integrate Modified Artificial Bee Colony (MABC) with Enhanced Particle Swarm Optimization (EPSO) to predict the intrusion detection problem. The algorithms are combined together to find out better optimization results and the classification accuracies are obtained by 10-fold cross-validation method. The purpose of this paper is to select the most relevant features that can represent the pattern of the network traffic and test its effect on the success of the proposed hybrid classification algorithm. To investigate the performance of the proposed method, intrusion detection KDDCup'99 benchmark dataset from the UCI Machine Learning repository is used. The performance of the proposed method is compared with the other machine learning algorithms and found to be significantly different. PMID:26221625

  1. A Hybrid Swarm Intelligence Algorithm for Intrusion Detection Using Significant Features

    PubMed Central

    Amudha, P.; Karthik, S.; Sivakumari, S.

    2015-01-01

    Intrusion detection has become a main part of network security due to the huge number of attacks which affects the computers. This is due to the extensive growth of internet connectivity and accessibility to information systems worldwide. To deal with this problem, in this paper a hybrid algorithm is proposed to integrate Modified Artificial Bee Colony (MABC) with Enhanced Particle Swarm Optimization (EPSO) to predict the intrusion detection problem. The algorithms are combined together to find out better optimization results and the classification accuracies are obtained by 10-fold cross-validation method. The purpose of this paper is to select the most relevant features that can represent the pattern of the network traffic and test its effect on the success of the proposed hybrid classification algorithm. To investigate the performance of the proposed method, intrusion detection KDDCup'99 benchmark dataset from the UCI Machine Learning repository is used. The performance of the proposed method is compared with the other machine learning algorithms and found to be significantly different. PMID:26221625

  2. Genetic Particle Swarm Optimization-Based Feature Selection for Very-High-Resolution Remotely Sensed Imagery Object Change Detection.

    PubMed

    Chen, Qiang; Chen, Yunhao; Jiang, Weiguo

    2016-07-30

    In the field of multiple features Object-Based Change Detection (OBCD) for very-high-resolution remotely sensed images, image objects have abundant features and feature selection affects the precision and efficiency of OBCD. Through object-based image analysis, this paper proposes a Genetic Particle Swarm Optimization (GPSO)-based feature selection algorithm to solve the optimization problem of feature selection in multiple features OBCD. We select the Ratio of Mean to Variance (RMV) as the fitness function of GPSO, and apply the proposed algorithm to the object-based hybrid multivariate alternative detection model. Two experiment cases on Worldview-2/3 images confirm that GPSO can significantly improve the speed of convergence, and effectively avoid the problem of premature convergence, relative to other feature selection algorithms. According to the accuracy evaluation of OBCD, GPSO is superior at overall accuracy (84.17% and 83.59%) and Kappa coefficient (0.6771 and 0.6314) than other algorithms. Moreover, the sensitivity analysis results show that the proposed algorithm is not easily influenced by the initial parameters, but the number of features to be selected and the size of the particle swarm would affect the algorithm. The comparison experiment results reveal that RMV is more suitable than other functions as the fitness function of GPSO-based feature selection algorithm.

  3. Genetic Particle Swarm Optimization-Based Feature Selection for Very-High-Resolution Remotely Sensed Imagery Object Change Detection.

    PubMed

    Chen, Qiang; Chen, Yunhao; Jiang, Weiguo

    2016-01-01

    In the field of multiple features Object-Based Change Detection (OBCD) for very-high-resolution remotely sensed images, image objects have abundant features and feature selection affects the precision and efficiency of OBCD. Through object-based image analysis, this paper proposes a Genetic Particle Swarm Optimization (GPSO)-based feature selection algorithm to solve the optimization problem of feature selection in multiple features OBCD. We select the Ratio of Mean to Variance (RMV) as the fitness function of GPSO, and apply the proposed algorithm to the object-based hybrid multivariate alternative detection model. Two experiment cases on Worldview-2/3 images confirm that GPSO can significantly improve the speed of convergence, and effectively avoid the problem of premature convergence, relative to other feature selection algorithms. According to the accuracy evaluation of OBCD, GPSO is superior at overall accuracy (84.17% and 83.59%) and Kappa coefficient (0.6771 and 0.6314) than other algorithms. Moreover, the sensitivity analysis results show that the proposed algorithm is not easily influenced by the initial parameters, but the number of features to be selected and the size of the particle swarm would affect the algorithm. The comparison experiment results reveal that RMV is more suitable than other functions as the fitness function of GPSO-based feature selection algorithm. PMID:27483285

  4. Genetic Particle Swarm Optimization–Based Feature Selection for Very-High-Resolution Remotely Sensed Imagery Object Change Detection

    PubMed Central

    Chen, Qiang; Chen, Yunhao; Jiang, Weiguo

    2016-01-01

    In the field of multiple features Object-Based Change Detection (OBCD) for very-high-resolution remotely sensed images, image objects have abundant features and feature selection affects the precision and efficiency of OBCD. Through object-based image analysis, this paper proposes a Genetic Particle Swarm Optimization (GPSO)-based feature selection algorithm to solve the optimization problem of feature selection in multiple features OBCD. We select the Ratio of Mean to Variance (RMV) as the fitness function of GPSO, and apply the proposed algorithm to the object-based hybrid multivariate alternative detection model. Two experiment cases on Worldview-2/3 images confirm that GPSO can significantly improve the speed of convergence, and effectively avoid the problem of premature convergence, relative to other feature selection algorithms. According to the accuracy evaluation of OBCD, GPSO is superior at overall accuracy (84.17% and 83.59%) and Kappa coefficient (0.6771 and 0.6314) than other algorithms. Moreover, the sensitivity analysis results show that the proposed algorithm is not easily influenced by the initial parameters, but the number of features to be selected and the size of the particle swarm would affect the algorithm. The comparison experiment results reveal that RMV is more suitable than other functions as the fitness function of GPSO-based feature selection algorithm. PMID:27483285

  5. The infrared spectral transmittance of Aspergillus niger spore aggregated particle swarm

    NASA Astrophysics Data System (ADS)

    Zhao, Xinying; Hu, Yihua; Gu, Youlin; Li, Le

    2015-10-01

    Microorganism aggregated particle swarm, which is quite an important composition of complex media environment, can be developed as a new kind of infrared functional materials. Current researches mainly focus on the optical properties of single microorganism particle. As for the swarm, especially the microorganism aggregated particle swarm, a more accurate simulation model should be proposed to calculate its extinction effect. At the same time, certain parameters deserve to be discussed, which helps to better develop the microorganism aggregated particle swarm as a new kind of infrared functional materials. In this paper, take Aspergillus Niger spore as an example. On the one hand, a new calculation model is established. Firstly, the cluster-cluster aggregation (CCA) model is used to simulate the structure of Aspergillus Niger spore aggregated particle. Secondly, the single scattering extinction parameters for Aspergillus Niger spore aggregated particle are calculated by using the discrete dipole approximation (DDA) method. Thirdly, the transmittance of Aspergillus Niger spore aggregated particle swarm is simulated by using Monte Carlo method. On the other hand, based on the model proposed above, what influences can wavelength causes has been studied, including the spectral distribution of scattering intensity of Aspergillus Niger spore aggregated particle and the infrared spectral transmittance of the aggregated particle swarm within the range of 8~14μm incident infrared wavelengths. Numerical results indicate that the scattering intensity of Aspergillus Niger spore aggregated particle reduces with the increase of incident wavelengths at each scattering angle. Scattering energy mainly concentrates on the scattering angle between 0~40°, forward scattering has an obvious effect. In addition, the infrared transmittance of Aspergillus Niger spore aggregated particle swarm goes up with the increase of incident wavelengths. However, some turning points of the trend

  6. Mutation-Based Artificial Fish Swarm Algorithm for Bound Constrained Global Optimization

    NASA Astrophysics Data System (ADS)

    Rocha, Ana Maria A. C.; Fernandes, Edite M. G. P.

    2011-09-01

    The herein presented mutation-based artificial fish swarm (AFS) algorithm includes mutation operators to prevent the algorithm to falling into local solutions, diversifying the search, and to accelerate convergence to the global optima. Three mutation strategies are introduced into the AFS algorithm to define the trial points that emerge from random, leaping and searching behaviors. Computational results show that the new algorithm outperforms other well-known global stochastic solution methods.

  7. Discrete particle swarm optimization for identifying community structures in signed social networks.

    PubMed

    Cai, Qing; Gong, Maoguo; Shen, Bo; Ma, Lijia; Jiao, Licheng

    2014-10-01

    Modern science of networks has facilitated us with enormous convenience to the understanding of complex systems. Community structure is believed to be one of the notable features of complex networks representing real complicated systems. Very often, uncovering community structures in networks can be regarded as an optimization problem, thus, many evolutionary algorithms based approaches have been put forward. Particle swarm optimization (PSO) is an artificial intelligent algorithm originated from social behavior such as birds flocking and fish schooling. PSO has been proved to be an effective optimization technique. However, PSO was originally designed for continuous optimization which confounds its applications to discrete contexts. In this paper, a novel discrete PSO algorithm is suggested for identifying community structures in signed networks. In the suggested method, particles' status has been redesigned in discrete form so as to make PSO proper for discrete scenarios, and particles' updating rules have been reformulated by making use of the topology of the signed network. Extensive experiments compared with three state-of-the-art approaches on both synthetic and real-world signed networks demonstrate that the proposed method is effective and promising. PMID:24856248

  8. Parameters identification of Van der Pol-Duffing oscillators via particle swarm optimization and differential evolution

    NASA Astrophysics Data System (ADS)

    Quaranta, Giuseppe; Monti, Giorgio; Marano, Giuseppe Carlo

    2010-10-01

    Many of the proposed approaches for non-linear systems control are developed under the assumption that all involved parameters are known in advance. Unfortunately, their estimation is not so simple because the nature of the non-linear behaviors is very complex in the most part of the cases. In view of this complication, parameters identification of non-linear oscillators has attracted increasing interests in various research fields: from a pure mathematical point-of-view, parameters identification can be formalized as a multi-dimensional optimization problem, typically over real bounded domains. In doing this, the use of the so-called non-classical methods based on soft computing theories seems to be promising because they do not require a priori information and the robustness of the identification against the noise contamination is satisfactory. However, further studies are required to evaluate the general effectiveness of these methodologies. In this sense, the paper addresses the consistency of two classes of soft computing based methods for the identification of Van der Pol-Duffing oscillators. A large numerical investigation has been conducted to evaluate the performances of six differential evolution algorithms (including a modified differential evolution algorithm proposed by the authors) and four swarm intelligence based algorithms (including a chaotic particle swarm optimization algorithm). Single well, double well and double-hump oscillators are identified and noisy system responses are considered in order to evaluate the robustness of the identification processes. The investigated soft computing techniques behave very well and thus they are suitable for practical applications.

  9. A Particle Swarm Optimization Variant with an Inner Variable Learning Strategy

    PubMed Central

    Pedrycz, Witold; Liu, Jin

    2014-01-01

    Although Particle Swarm Optimization (PSO) has demonstrated competitive performance in solving global optimization problems, it exhibits some limitations when dealing with optimization problems with high dimensionality and complex landscape. In this paper, we integrate some problem-oriented knowledge into the design of a certain PSO variant. The resulting novel PSO algorithm with an inner variable learning strategy (PSO-IVL) is particularly efficient for optimizing functions with symmetric variables. Symmetric variables of the optimized function have to satisfy a certain quantitative relation. Based on this knowledge, the inner variable learning (IVL) strategy helps the particle to inspect the relation among its inner variables, determine the exemplar variable for all other variables, and then make each variable learn from the exemplar variable in terms of their quantitative relations. In addition, we design a new trap detection and jumping out strategy to help particles escape from local optima. The trap detection operation is employed at the level of individual particles whereas the trap jumping out strategy is adaptive in its nature. Experimental simulations completed for some representative optimization functions demonstrate the excellent performance of PSO-IVL. The effectiveness of the PSO-IVL stresses a usefulness of augmenting evolutionary algorithms by problem-oriented domain knowledge. PMID:24587746

  10. PID controller design of nonlinear systems using an improved particle swarm optimization approach

    NASA Astrophysics Data System (ADS)

    Chang, Wei-Der; Shih, Shun-Peng

    2010-11-01

    In this paper, an improved particle swarm optimization is presented to search for the optimal PID controller gains for a class of nonlinear systems. The proposed algorithm is to modify the velocity formula of the general PSO systems in order for improving the searching efficiency. In the improved PSO-based nonlinear PID control system design, three PID control gains, i.e., the proportional gain Kp, integral gain Ki, and derivative gain Kd are required to form a parameter vector which is called a particle. It is the basic component of PSO systems and many such particles further constitute a population. To derive the optimal PID gains for nonlinear systems, two principle equations, the modified velocity updating and position updating equations, are employed to move the positions of all particles in the population. In the meanwhile, an objective function defined for PID controller optimization problems may be minimized. To validate the control performance of the proposed method, a typical nonlinear system control, the inverted pendulum tracking control, is illustrated. The results testify that the improved PSO algorithm can perform well in the nonlinear PID control system design.

  11. Stochastic Set-Based Particle Swarm Optimization Based on Local Exploration for Solving the Carpool Service Problem.

    PubMed

    Chou, Sheng-Kai; Jiau, Ming-Kai; Huang, Shih-Chia

    2016-08-01

    The growing ubiquity of vehicles has led to increased concerns about environmental issues. These concerns can be mitigated by implementing an effective carpool service. In an intelligent carpool system, an automated service process assists carpool participants in determining routes and matches. It is a discrete optimization problem that involves a system-wide condition as well as participants' expectations. In this paper, we solve the carpool service problem (CSP) to provide satisfactory ride matches. To this end, we developed a particle swarm carpool algorithm based on stochastic set-based particle swarm optimization (PSO). Our method introduces stochastic coding to augment traditional particles, and uses three terminologies to represent a particle: 1) particle position; 2) particle view; and 3) particle velocity. In this way, the set-based PSO (S-PSO) can be realized by local exploration. In the simulation and experiments, two kind of discrete PSOs-S-PSO and binary PSO (BPSO)-and a genetic algorithm (GA) are compared and examined using tested benchmarks that simulate a real-world metropolis. We observed that the S-PSO outperformed the BPSO and the GA thoroughly. Moreover, our method yielded the best result in a statistical test and successfully obtained numerical results for meeting the optimization objectives of the CSP.

  12. Perceptual Dominant Color Extraction by Multidimensional Particle Swarm Optimization

    NASA Astrophysics Data System (ADS)

    Kiranyaz, Serkan; Uhlmann (Eurasip Member), Stefan; Ince, Turker; Gabbouj, Moncef

    2010-12-01

    Color is the major source of information widely used in image analysis and content-based retrieval. Extracting dominant colors that are prominent in a visual scenery is of utmost importance since the human visual system primarily uses them for perception and similarity judgment. In this paper, we address dominant color extraction as a dynamic clustering problem and use techniques based on Particle Swarm Optimization (PSO) for finding optimal (number of) dominant colors in a given color space, distance metric and a proper validity index function. The first technique, so-called Multidimensional (MD) PSO can seek both positional and dimensional optima. Nevertheless, MD PSO is still susceptible to premature convergence due to lack of divergence. To address this problem we then apply Fractional Global Best Formation (FGBF) technique. In order to extract perceptually important colors and to further improve the discrimination factor for a better clustering performance, an efficient color distance metric, which uses a fuzzy model for computing color (dis-) similarities over HSV (or HSL) color space is proposed. The comparative evaluations against MPEG-7 dominant color descriptor show the superiority of the proposed technique.

  13. A Novel Hybrid Statistical Particle Swarm Optimization for Multimodal Functions and Frequency Control of Hybrid Wind-Solar System

    NASA Astrophysics Data System (ADS)

    Verma, Harish Kumar; Jain, Cheshta

    2016-09-01

    In this article, a hybrid algorithm of particle swarm optimization (PSO) with statistical parameter (HSPSO) is proposed. Basic PSO for shifted multimodal problems have low searching precision due to falling into a number of local minima. The proposed approach uses statistical characteristics to update the velocity of the particle to avoid local minima and help particles to search global optimum with improved convergence. The performance of the newly developed algorithm is verified using various standard multimodal, multivariable, shifted hybrid composition benchmark problems. Further, the comparative analysis of HSPSO with variants of PSO is tested to control frequency of hybrid renewable energy system which comprises solar system, wind system, diesel generator, aqua electrolyzer and ultra capacitor. A significant improvement in convergence characteristic of HSPSO algorithm over other variants of PSO is observed in solving benchmark optimization and renewable hybrid system problems.

  14. Design for sustainability of industrial symbiosis based on emergy and multi-objective particle swarm optimization.

    PubMed

    Ren, Jingzheng; Liang, Hanwei; Dong, Liang; Sun, Lu; Gao, Zhiqiu

    2016-08-15

    Industrial symbiosis provides novel and practical pathway to the design for the sustainability. Decision support tool for its verification is necessary for practitioners and policy makers, while to date, quantitative research is limited. The objective of this work is to present an innovative approach for supporting decision-making in the design for the sustainability with the implementation of industrial symbiosis in chemical complex. Through incorporating the emergy theory, the model is formulated as a multi-objective approach that can optimize both the economic benefit and sustainable performance of the integrated industrial system. A set of emergy based evaluation index are designed. Multi-objective Particle Swarm Algorithm is proposed to solve the model, and the decision-makers are allowed to choose the suitable solutions form the Pareto solutions. An illustrative case has been studied by the proposed method, a few of compromises between high profitability and high sustainability can be obtained for the decision-makers/stakeholders to make decision.

  15. Particle Swarm Optimization Method Based on Chaotic Local Search and Roulette Wheel Mechanism

    NASA Astrophysics Data System (ADS)

    Xia, Xiaohua

    Combining the particle swarm optimization (PSO) technique with the chaotic local search (CLS) and roulette wheel mechanism (RWM), an efficient optimization method solving the constrained nonlinear optimization problems is presented in this paper. PSO can be viewed as the global optimizer while the CLS and RWM are employed for the local search. Thus, the possibility of exploring a global minimum in problems with many local optima is increased. The search will continue until a termination criterion is satisfied. Benefit from the fast globally converging characteristics of PSO and the effective local search ability of CLS and RWM, the proposed method can obtain the global optimal results quickly which was tested for six benchmark optimization problems. And the improved performance comparing with the standard PSO and genetic algorithm (GA) testified its validity.

  16. Energy and operation management of a microgrid using particle swarm optimization

    NASA Astrophysics Data System (ADS)

    Radosavljević, Jordan; Jevtić, Miroljub; Klimenta, Dardan

    2016-05-01

    This article presents an efficient algorithm based on particle swarm optimization (PSO) for energy and operation management (EOM) of a microgrid including different distributed generation units and energy storage devices. The proposed approach employs PSO to minimize the total energy and operating cost of the microgrid via optimal adjustment of the control variables of the EOM, while satisfying various operating constraints. Owing to the stochastic nature of energy produced from renewable sources, i.e. wind turbines and photovoltaic systems, as well as load uncertainties and market prices, a probabilistic approach in the EOM is introduced. The proposed method is examined and tested on a typical grid-connected microgrid including fuel cell, gas-fired microturbine, wind turbine, photovoltaic and energy storage devices. The obtained results prove the efficiency of the proposed approach to solve the EOM of the microgrids.

  17. Infrared face recognition based on binary particle swarm optimization and SVM-wrapper model

    NASA Astrophysics Data System (ADS)

    Xie, Zhihua; Liu, Guodong

    2015-10-01

    Infrared facial imaging, being light- independent, and not vulnerable to facial skin, expressions and posture, can avoid or limit the drawbacks of face recognition in visible light. Robust feature selection and representation is a key issue for infrared face recognition research. This paper proposes a novel infrared face recognition method based on local binary pattern (LBP). LBP can improve the robust of infrared face recognition under different environment situations. How to make full use of the discriminant ability in LBP patterns is an important problem. A search algorithm combination binary particle swarm with SVM is used to find out the best discriminative subset in LBP features. Experimental results show that the proposed method outperforms traditional LBP based infrared face recognition methods. It can significantly improve the recognition performance of infrared face recognition.

  18. Log-linear model based behavior selection method for artificial fish swarm algorithm.

    PubMed

    Huang, Zhehuang; Chen, Yidong

    2015-01-01

    Artificial fish swarm algorithm (AFSA) is a population based optimization technique inspired by social behavior of fishes. In past several years, AFSA has been successfully applied in many research and application areas. The behavior of fishes has a crucial impact on the performance of AFSA, such as global exploration ability and convergence speed. How to construct and select behaviors of fishes are an important task. To solve these problems, an improved artificial fish swarm algorithm based on log-linear model is proposed and implemented in this paper. There are three main works. Firstly, we proposed a new behavior selection algorithm based on log-linear model which can enhance decision making ability of behavior selection. Secondly, adaptive movement behavior based on adaptive weight is presented, which can dynamically adjust according to the diversity of fishes. Finally, some new behaviors are defined and introduced into artificial fish swarm algorithm at the first time to improve global optimization capability. The experiments on high dimensional function optimization showed that the improved algorithm has more powerful global exploration ability and reasonable convergence speed compared with the standard artificial fish swarm algorithm. PMID:25691895

  19. Log-Linear Model Based Behavior Selection Method for Artificial Fish Swarm Algorithm

    PubMed Central

    Huang, Zhehuang; Chen, Yidong

    2015-01-01

    Artificial fish swarm algorithm (AFSA) is a population based optimization technique inspired by social behavior of fishes. In past several years, AFSA has been successfully applied in many research and application areas. The behavior of fishes has a crucial impact on the performance of AFSA, such as global exploration ability and convergence speed. How to construct and select behaviors of fishes are an important task. To solve these problems, an improved artificial fish swarm algorithm based on log-linear model is proposed and implemented in this paper. There are three main works. Firstly, we proposed a new behavior selection algorithm based on log-linear model which can enhance decision making ability of behavior selection. Secondly, adaptive movement behavior based on adaptive weight is presented, which can dynamically adjust according to the diversity of fishes. Finally, some new behaviors are defined and introduced into artificial fish swarm algorithm at the first time to improve global optimization capability. The experiments on high dimensional function optimization showed that the improved algorithm has more powerful global exploration ability and reasonable convergence speed compared with the standard artificial fish swarm algorithm. PMID:25691895

  20. Log-linear model based behavior selection method for artificial fish swarm algorithm.

    PubMed

    Huang, Zhehuang; Chen, Yidong

    2015-01-01

    Artificial fish swarm algorithm (AFSA) is a population based optimization technique inspired by social behavior of fishes. In past several years, AFSA has been successfully applied in many research and application areas. The behavior of fishes has a crucial impact on the performance of AFSA, such as global exploration ability and convergence speed. How to construct and select behaviors of fishes are an important task. To solve these problems, an improved artificial fish swarm algorithm based on log-linear model is proposed and implemented in this paper. There are three main works. Firstly, we proposed a new behavior selection algorithm based on log-linear model which can enhance decision making ability of behavior selection. Secondly, adaptive movement behavior based on adaptive weight is presented, which can dynamically adjust according to the diversity of fishes. Finally, some new behaviors are defined and introduced into artificial fish swarm algorithm at the first time to improve global optimization capability. The experiments on high dimensional function optimization showed that the improved algorithm has more powerful global exploration ability and reasonable convergence speed compared with the standard artificial fish swarm algorithm.

  1. Swarm intelligence algorithm for interconnect model order reduction with sub-block structure preserving

    NASA Astrophysics Data System (ADS)

    Wang, Xinsheng; Wang, Chenxu; Yu, Mingyan

    2016-07-01

    In this paper, we propose a generalised sub-block structure preservation interconnect model order reduction (MOR) technique based on the swarm intelligence method, that is, particle swarm optimisation (PSO). The swarm intelligence-based structure preservation MOR can be used for a standard model as a criterion for different structure preservation interconnect MOR methods. In the proposed technique, the PSO method is used for predicting the unknown elements of structure-preserving reduced-order modelling of interconnect circuits. The prediction is based on minimising the difference of transform function between the original full-order and desired reduced-order systems maintaining the full-order structure in the reduced-order model. The proposed swarm-intelligence-based structure-preserving MOR method is compared with published work on structure preservation MOR SPRIM techniques. Simulation and synthesis results verify the accuracy and validity of the new structure-preserving MOR technique.

  2. Delay induced instabilities in self-propelling swarming particles

    NASA Astrophysics Data System (ADS)

    Forgoston, Eric; Schwartz, Ira

    2008-03-01

    We consider a general model of self-propelling biological or artificial individuals interacting through a pairwise attractive force in a two-dimensional system in the presence of noise and communication time delay. Previous work has shown that a large enough noise intensity will cause a translating swarm of individuals to transition to a rotating swarm with a stationary center of mass. In this work, we use numerical simulations to show that with the addition of a time delay, the model possesses a transition that depends on the size of the coupling parameter. This transition is independent of the swarm state (traveling or rotating) and is characterized by the alignment of all of the individuals along with a swarm oscillation. By considering the mean field equations without noise, we show that the time delay induced transition is associated with a Hopf bifurcation. The analytical result yields good agreement with numerical computations of the value of the coupling parameter at the Hopf point.

  3. Mutation particle swarm optimization of the BP-PID controller for piezoelectric ceramics

    NASA Astrophysics Data System (ADS)

    Zheng, Huaqing; Jiang, Minlan

    2016-01-01

    PID control is the most common used method in industrial control because its structure is simple and it is easy to implement. PID controller has good control effect, now it has been widely used. However, PID method has a few limitations. The overshoot of the PID controller is very big. The adjustment time is long. When the parameters of controlled plant are changing over time, the parameters of controller could hardly change automatically to adjust to changing environment. Thus, it can't meet the demand of control quality in the process of controlling piezoelectric ceramic. In order to effectively control the piezoelectric ceramic and improve the control accuracy, this paper replaced the learning algorithm of the BP with the mutation particle swarm optimization algorithm(MPSO) on the process of the parameters setting of BP-PID. That designed a better self-adaptive controller which is combing the BP neural network based on mutation particle swarm optimization with the conventional PID control theory. This combination is called the MPSO-BP-PID. In the mechanism of the MPSO, the mutation operation is carried out with the fitness variance and the global best fitness value as the standard. That can overcome the precocious of the PSO and strengthen its global search ability. As a result, the MPSO-BP-PID can complete controlling the controlled plant with higher speed and accuracy. Therefore, the MPSO-BP-PID is applied to the piezoelectric ceramic. It can effectively overcome the hysteresis, nonlinearity of the piezoelectric ceramic. In the experiment, compared with BP-PID and PSO-BP-PID, it proved that MPSO is effective and the MPSO-BP-PID has stronger adaptability and robustness.

  4. On the performance of linear decreasing inertia weight particle swarm optimization for global optimization.

    PubMed

    Arasomwan, Martins Akugbe; Adewumi, Aderemi Oluyinka

    2013-01-01

    Linear decreasing inertia weight (LDIW) strategy was introduced to improve on the performance of the original particle swarm optimization (PSO). However, linear decreasing inertia weight PSO (LDIW-PSO) algorithm is known to have the shortcoming of premature convergence in solving complex (multipeak) optimization problems due to lack of enough momentum for particles to do exploitation as the algorithm approaches its terminal point. Researchers have tried to address this shortcoming by modifying LDIW-PSO or proposing new PSO variants. Some of these variants have been claimed to outperform LDIW-PSO. The major goal of this paper is to experimentally establish the fact that LDIW-PSO is very much efficient if its parameters are properly set. First, an experiment was conducted to acquire a percentage value of the search space limits to compute the particle velocity limits in LDIW-PSO based on commonly used benchmark global optimization problems. Second, using the experimentally obtained values, five well-known benchmark optimization problems were used to show the outstanding performance of LDIW-PSO over some of its competitors which have in the past claimed superiority over it. Two other recent PSO variants with different inertia weight strategies were also compared with LDIW-PSO with the latter outperforming both in the simulation experiments conducted. PMID:24324383

  5. A divide-and-conquer strategy with particle swarm optimization for the job shop scheduling problem

    NASA Astrophysics Data System (ADS)

    Zhang, Rui; Wu, Cheng

    2010-07-01

    An optimization algorithm based on the 'divide-and-conquer' methodology is proposed for solving large job shop scheduling problems with the objective of minimizing total weighted tardiness. The algorithm adopts a non-iterative framework. It first searches for a promising decomposition policy for the operation set by using a simulated annealing procedure in which the solutions are evaluated with reference to the upper bound and the lower bound of the final objective value. Subproblems are then constructed according to the output decomposition policy and each subproblem is related to a subset of operations from the original operation set. Subsequently, all these subproblems are sequentially solved by a particle swarm optimization algorithm, which leads directly to a feasible solution to the original large-scale scheduling problem. Numerical computational experiments are carried out for both randomly generated test problems and the real-world production data from a large speed-reducer factory in China. Results show that the proposed algorithm can achieve satisfactory solution quality within reasonable computational time for large-scale job shop scheduling problems.

  6. Comparison of swarm intelligence algorithms in atmospheric compensation for free space optical communication

    NASA Astrophysics Data System (ADS)

    Li, Zhaokun; Cao, Jingtai; Liu, Wei; Feng, Jianfeng; Zhao, Xiaohui

    2015-03-01

    We use conventional adaptive optical system to compensate atmospheric turbulence in free space optical (FSO) communication system under strong scintillation circumstances, undesired wave-front measurements based on Shark-Hartman sensor (SH). Since wavefront sensor-less adaptive optics is a feasible option, we propose several swarm intelligence algorithms to compensate the wavefront aberration from atmospheric interference in FSO and mainly discuss the algorithm principle, basic flows, and simulation result. The numerical simulation experiment and result analysis show that compared with SPGD algorithm, the proposed algorithms can effectively restrain wavefront aberration, and improve convergence rate of the algorithms and the coupling efficiency of receiver in large extent.

  7. Optimal sensor placement for large structures using the nearest neighbour index and a hybrid swarm intelligence algorithm

    NASA Astrophysics Data System (ADS)

    Lian, Jijian; He, Longjun; Ma, Bin; Li, Huokun; Peng, Wenxiang

    2013-09-01

    Research on optimal sensor placement (OSP) has become very important due to the need to obtain effective testing results with limited testing resources in health monitoring. In this study, a new methodology is proposed to select the best sensor locations for large structures. First, a novel fitness function derived from the nearest neighbour index is proposed to overcome the drawbacks of the effective independence method for OSP for large structures. This method maximizes the contribution of each sensor to modal observability and simultaneously avoids the redundancy of information between the selected degrees of freedom. A hybrid algorithm combining the improved discrete particle swarm optimization (DPSO) with the clonal selection algorithm is then implemented to optimize the proposed fitness function effectively. Finally, the proposed method is applied to an arch dam for performance verification. The results show that the proposed hybrid swarm intelligence algorithm outperforms a genetic algorithm with decimal two-dimension array encoding and DPSO in the capability of global optimization. The new fitness function is advantageous in terms of sensor distribution and ensuring a well-conditioned information matrix and orthogonality of modes, indicating that this method may be used to provide guidance for OSP in various large structures.

  8. Particle Swarm Optimization of Low-Thrust, Geocentric-to-Halo-Orbit Transfers

    NASA Astrophysics Data System (ADS)

    Abraham, Andrew J.

    Missions to Lagrange points are becoming increasingly popular amongst spacecraft mission planners. Lagrange points are locations in space where the gravity force from two bodies, and the centrifugal force acting on a third body, cancel. To date, all spacecraft that have visited a Lagrange point have done so using high-thrust, chemical propulsion. Due to the increasing availability of low-thrust (high efficiency) propulsive devices, and their increasing capability in terms of fuel efficiency and instantaneous thrust, it has now become possible for a spacecraft to reach a Lagrange point orbit without the aid of chemical propellant. While at any given time there are many paths for a low-thrust trajectory to take, only one is optimal. The traditional approach to spacecraft trajectory optimization utilizes some form of gradient-based algorithm. While these algorithms offer numerous advantages, they also have a few significant shortcomings. The three most significant shortcomings are: (1) the fact that an initial guess solution is required to initialize the algorithm, (2) the radius of convergence can be quite small and can allow the algorithm to become trapped in local minima, and (3) gradient information is not always assessable nor always trustworthy for a given problem. To avoid these problems, this dissertation is focused on optimizing a low-thrust transfer trajectory from a geocentric orbit to an Earth-Moon, L1, Lagrange point orbit using the method of Particle Swarm Optimization (PSO). The PSO method is an evolutionary heuristic that was originally written to model birds swarming to locate hidden food sources. This PSO method will enable the exploration of the invariant stable manifold of the target Lagrange point orbit in an effort to optimize the spacecraft's low-thrust trajectory. Examples of these optimized trajectories are presented and contrasted with those found using traditional, gradient-based approaches. In summary, the results of this dissertation find

  9. Purely hydrodynamic origin for swarming of swimming particles

    NASA Astrophysics Data System (ADS)

    Oyama, Norihiro; Molina, John Jairo; Yamamoto, Ryoichi

    2016-04-01

    Three-dimensional simulations with fully resolved hydrodynamics are performed to study the collective motion of model swimmers in bulk and confinement. Calculating the dynamic structure factor, we clarified that the swarming in bulk systems can be understood as a pseudoacoustic mode. Under confinement between flat parallel walls, this pseudoacoustic mode leads to a traveling wavelike motion. This swarming behavior is due purely to the hydrodynamic interactions between the swimmers and depends strongly on the type and strength of swimming (i.e., pusher or puller).

  10. Cooperative quantum-behaved particle swarm optimization with dynamic varying search areas and Lévy flight disturbance.

    PubMed

    Li, Desheng

    2014-01-01

    This paper proposes a novel variant of cooperative quantum-behaved particle swarm optimization (CQPSO) algorithm with two mechanisms to reduce the search space and avoid the stagnation, called CQPSO-DVSA-LFD. One mechanism is called Dynamic Varying Search Area (DVSA), which takes charge of limiting the ranges of particles' activity into a reduced area. On the other hand, in order to escape the local optima, Lévy flights are used to generate the stochastic disturbance in the movement of particles. To test the performance of CQPSO-DVSA-LFD, numerical experiments are conducted to compare the proposed algorithm with different variants of PSO. According to the experimental results, the proposed method performs better than other variants of PSO on both benchmark test functions and the combinatorial optimization issue, that is, the job-shop scheduling problem. PMID:24851085

  11. Nontoxic colloidal particles impede antibiotic resistance of swarming bacteria by disrupting collective motion and speed

    NASA Astrophysics Data System (ADS)

    Lu, Shengtao; Liu, Fang; Xing, Bengang; Yeow, Edwin K. L.

    2015-12-01

    A monolayer of swarming B. subtilis on semisolid agar is shown to display enhanced resistance against antibacterial drugs due to their collective behavior and motility. The dynamics of swarming motion, visualized in real time using time-lapse microscopy, prevents the bacteria from prolonged exposure to lethal drug concentrations. The elevated drug resistance is significantly reduced when the collective motion of bacteria is judiciously disrupted using nontoxic polystyrene colloidal particles immobilized on the agar surface. The colloidal particles block and hinder the motion of the cells, and force large swarming rafts to break up into smaller packs in order to maneuver across narrow spaces between densely packed particles. In this manner, cohesive rafts rapidly lose their collectivity, speed, and group dynamics, and the cells become vulnerable to the drugs. The antibiotic resistance capability of swarming B. subtilis is experimentally observed to be negatively correlated with the number density of colloidal particles on the engineered surface. This relationship is further tested using an improved self-propelled particle model that takes into account interparticle alignment and hard-core repulsion. This work has pertinent implications on the design of optimal methods to treat drug resistant bacteria commonly found in swarming colonies.

  12. Nontoxic colloidal particles impede antibiotic resistance of swarming bacteria by disrupting collective motion and speed.

    PubMed

    Lu, Shengtao; Liu, Fang; Xing, Bengang; Yeow, Edwin K L

    2015-12-01

    A monolayer of swarming B. subtilis on semisolid agar is shown to display enhanced resistance against antibacterial drugs due to their collective behavior and motility. The dynamics of swarming motion, visualized in real time using time-lapse microscopy, prevents the bacteria from prolonged exposure to lethal drug concentrations. The elevated drug resistance is significantly reduced when the collective motion of bacteria is judiciously disrupted using nontoxic polystyrene colloidal particles immobilized on the agar surface. The colloidal particles block and hinder the motion of the cells, and force large swarming rafts to break up into smaller packs in order to maneuver across narrow spaces between densely packed particles. In this manner, cohesive rafts rapidly lose their collectivity, speed, and group dynamics, and the cells become vulnerable to the drugs. The antibiotic resistance capability of swarming B. subtilis is experimentally observed to be negatively correlated with the number density of colloidal particles on the engineered surface. This relationship is further tested using an improved self-propelled particle model that takes into account interparticle alignment and hard-core repulsion. This work has pertinent implications on the design of optimal methods to treat drug resistant bacteria commonly found in swarming colonies.

  13. Particle Swarm Optimization for inverse modeling of solute transport in fractured gneiss aquifer.

    PubMed

    Abdelaziz, Ramadan; Zambrano-Bigiarini, Mauricio

    2014-08-01

    Particle Swarm Optimization (PSO) has received considerable attention as a global optimization technique from scientists of different disciplines around the world. In this article, we illustrate how to use PSO for inverse modeling of a coupled flow and transport groundwater model (MODFLOW2005-MT3DMS) in a fractured gneiss aquifer. In particular, the hydroPSO R package is used as optimization engine, because it has been specifically designed to calibrate environmental, hydrological and hydrogeological models. In addition, hydroPSO implements the latest Standard Particle Swarm Optimization algorithm (SPSO-2011), with an adaptive random topology and rotational invariance constituting the main advancements over previous PSO versions. A tracer test conducted in the experimental field at TU Bergakademie Freiberg (Germany) is used as case study. A double-porosity approach is used to simulate the solute transport in the fractured Gneiss aquifer. Tracer concentrations obtained with hydroPSO were in good agreement with its corresponding observations, as measured by a high value of the coefficient of determination and a low sum of squared residuals. Several graphical outputs automatically generated by hydroPSO provided useful insights to assess the quality of the calibration results. It was found that hydroPSO required a small number of model runs to reach the region of the global optimum, and it proved to be both an effective and efficient optimization technique to calibrate the movement of solute transport over time in a fractured aquifer. In addition, the parallel feature of hydroPSO allowed to reduce the total computation time used in the inverse modeling process up to an eighth of the total time required without using that feature. This work provides a first attempt to demonstrate the capability and versatility of hydroPSO to work as an optimizer of a coupled flow and transport model for contaminant migration.

  14. Particle Swarm Optimization for inverse modeling of solute transport in fractured gneiss aquifer

    NASA Astrophysics Data System (ADS)

    Abdelaziz, Ramadan; Zambrano-Bigiarini, Mauricio

    2014-08-01

    Particle Swarm Optimization (PSO) has received considerable attention as a global optimization technique from scientists of different disciplines around the world. In this article, we illustrate how to use PSO for inverse modeling of a coupled flow and transport groundwater model (MODFLOW2005-MT3DMS) in a fractured gneiss aquifer. In particular, the hydroPSO R package is used as optimization engine, because it has been specifically designed to calibrate environmental, hydrological and hydrogeological models. In addition, hydroPSO implements the latest Standard Particle Swarm Optimization algorithm (SPSO-2011), with an adaptive random topology and rotational invariance constituting the main advancements over previous PSO versions. A tracer test conducted in the experimental field at TU Bergakademie Freiberg (Germany) is used as case study. A double-porosity approach is used to simulate the solute transport in the fractured Gneiss aquifer. Tracer concentrations obtained with hydroPSO were in good agreement with its corresponding observations, as measured by a high value of the coefficient of determination and a low sum of squared residuals. Several graphical outputs automatically generated by hydroPSO provided useful insights to assess the quality of the calibration results. It was found that hydroPSO required a small number of model runs to reach the region of the global optimum, and it proved to be both an effective and efficient optimization technique to calibrate the movement of solute transport over time in a fractured aquifer. In addition, the parallel feature of hydroPSO allowed to reduce the total computation time used in the inverse modeling process up to an eighth of the total time required without using that feature. This work provides a first attempt to demonstrate the capability and versatility of hydroPSO to work as an optimizer of a coupled flow and transport model for contaminant migration.

  15. Parallel particle swarm optimization on a graphics processing unit with application to trajectory optimization

    NASA Astrophysics Data System (ADS)

    Wu, Q.; Xiong, F.; Wang, F.; Xiong, Y.

    2016-10-01

    In order to reduce the computational time, a fully parallel implementation of the particle swarm optimization (PSO) algorithm on a graphics processing unit (GPU) is presented. Instead of being executed on the central processing unit (CPU) sequentially, PSO is executed in parallel via the GPU on the compute unified device architecture (CUDA) platform. The processes of fitness evaluation, updating of velocity and position of all particles are all parallelized and introduced in detail. Comparative studies on the optimization of four benchmark functions and a trajectory optimization problem are conducted by running PSO on the GPU (GPU-PSO) and CPU (CPU-PSO). The impact of design dimension, number of particles and size of the thread-block in the GPU and their interactions on the computational time is investigated. The results show that the computational time of the developed GPU-PSO is much shorter than that of CPU-PSO, with comparable accuracy, which demonstrates the remarkable speed-up capability of GPU-PSO.

  16. Particle swarm-based structural optimization of laminated composite hydrokinetic turbine blades

    NASA Astrophysics Data System (ADS)

    Li, H.; Chandrashekhara, K.

    2015-09-01

    Composite blade manufacturing for hydrokinetic turbine application is quite complex and requires extensive optimization studies in terms of material selection, number of layers, stacking sequence, ply thickness and orientation. To avoid a repetitive trial-and-error method process, hydrokinetic turbine blade structural optimization using particle swarm optimization was proposed to perform detailed composite lay-up optimization. Layer numbers, ply thickness and ply orientations were optimized using standard particle swarm optimization to minimize the weight of the composite blade while satisfying failure evaluation. To address the discrete combinatorial optimization problem of blade stacking sequence, a novel permutation discrete particle swarm optimization model was also developed to maximize the out-of-plane load-carrying capability of the composite blade. A composite blade design with significant material saving and satisfactory performance was presented. The proposed methodology offers an alternative and efficient design solution to composite structural optimization which involves complex loading and multiple discrete and combinatorial design parameters.

  17. Parameters identification for photovoltaic module based on an improved artificial fish swarm algorithm.

    PubMed

    Han, Wei; Wang, Hong-Hua; Chen, Ling

    2014-01-01

    A precise mathematical model plays a pivotal role in the simulation, evaluation, and optimization of photovoltaic (PV) power systems. Different from the traditional linear model, the model of PV module has the features of nonlinearity and multiparameters. Since conventional methods are incapable of identifying the parameters of PV module, an excellent optimization algorithm is required. Artificial fish swarm algorithm (AFSA), originally inspired by the simulation of collective behavior of real fish swarms, is proposed to fast and accurately extract the parameters of PV module. In addition to the regular operation, a mutation operator (MO) is designed to enhance the searching performance of the algorithm. The feasibility of the proposed method is demonstrated by various parameters of PV module under different environmental conditions, and the testing results are compared with other studied methods in terms of final solutions and computational time. The simulation results show that the proposed method is capable of obtaining higher parameters identification precision. PMID:25243233

  18. Parameters identification for photovoltaic module based on an improved artificial fish swarm algorithm.

    PubMed

    Han, Wei; Wang, Hong-Hua; Chen, Ling

    2014-01-01

    A precise mathematical model plays a pivotal role in the simulation, evaluation, and optimization of photovoltaic (PV) power systems. Different from the traditional linear model, the model of PV module has the features of nonlinearity and multiparameters. Since conventional methods are incapable of identifying the parameters of PV module, an excellent optimization algorithm is required. Artificial fish swarm algorithm (AFSA), originally inspired by the simulation of collective behavior of real fish swarms, is proposed to fast and accurately extract the parameters of PV module. In addition to the regular operation, a mutation operator (MO) is designed to enhance the searching performance of the algorithm. The feasibility of the proposed method is demonstrated by various parameters of PV module under different environmental conditions, and the testing results are compared with other studied methods in terms of final solutions and computational time. The simulation results show that the proposed method is capable of obtaining higher parameters identification precision.

  19. Parameters Identification for Photovoltaic Module Based on an Improved Artificial Fish Swarm Algorithm

    PubMed Central

    Wang, Hong-Hua

    2014-01-01

    A precise mathematical model plays a pivotal role in the simulation, evaluation, and optimization of photovoltaic (PV) power systems. Different from the traditional linear model, the model of PV module has the features of nonlinearity and multiparameters. Since conventional methods are incapable of identifying the parameters of PV module, an excellent optimization algorithm is required. Artificial fish swarm algorithm (AFSA), originally inspired by the simulation of collective behavior of real fish swarms, is proposed to fast and accurately extract the parameters of PV module. In addition to the regular operation, a mutation operator (MO) is designed to enhance the searching performance of the algorithm. The feasibility of the proposed method is demonstrated by various parameters of PV module under different environmental conditions, and the testing results are compared with other studied methods in terms of final solutions and computational time. The simulation results show that the proposed method is capable of obtaining higher parameters identification precision. PMID:25243233

  20. Wavelet neural networks using particle swarm optimization training in modeling regional ionospheric total electron content

    NASA Astrophysics Data System (ADS)

    Ghaffari Razin, Mir Reza; Voosoghi, Behzad

    2016-11-01

    Wavelet neural networks (WNNs) are a new class of neural networks (NNs) that has been developed using a combined method of multi-layer artificial neural networks and wavelet analysis (WA). In this paper, WNNs is used for modeling and prediction of total electron content (TEC) of ionosphere with high spatial and temporal resolution. Generally, back-propagation (BP) algorithm is used to train the neural network. While this algorithm proves to be very effective and robust in training many types of network structures, it suffers from certain disadvantages such as easy entrapment in a local minimum and slow convergence. To improve the performance of WNN in training step, the adjustment of network weights using particle swarm optimization (PSO) was proposed. The results obtained in this paper were compared with standard NN (SNN) by BP training algorithm (SNN-BP), SNN by PSO training algorithm (SNN-PSO) and WNN by BP training algorithm (WNN-BP). For numerical experiments, observations collected at 36 GPS stations in 5 days of 2012 from Iranian permanent GPS network (IPGN) are used. The average minimum relative errors in 5 test stations for WNN-PSO, WNN-BP, SNN-BP and SNN-PSO compared with GPS TEC are 10.59%, 12.85%, 13.18%, 13.75% and average maximum relative errors are 14.70%, 17.30%, 18.53% and 20.83%, respectively. Comparison of diurnal predicted TEC values from the WNN-PSO, SNN-BP, SNN-PSO and WNN-BP models with GPS TEC revealed that the WNN-PSO provides more accurate predictions than the other methods in the test area.

  1. Particle Swarm Social Adaptive Model for Multi-Agent Based Insurgency Warfare Simulation

    SciTech Connect

    Cui, Xiaohui; Potok, Thomas E

    2009-12-01

    To better understand insurgent activities and asymmetric warfare, a social adaptive model for modeling multiple insurgent groups attacking multiple military and civilian targets is proposed and investigated. This report presents a pilot study using the particle swarm modeling, a widely used non-linear optimal tool to model the emergence of insurgency campaign. The objective of this research is to apply the particle swarm metaphor as a model of insurgent social adaptation for the dynamically changing environment and to provide insight and understanding of insurgency warfare. Our results show that unified leadership, strategic planning, and effective communication between insurgent groups are not the necessary requirements for insurgents to efficiently attain their objective.

  2. a Hybrid Approach of Neural Network with Particle Swarm Optimization for Tobacco Pests Prediction

    NASA Astrophysics Data System (ADS)

    Lv, Jiake; Wang, Xuan; Xie, Deti; Wei, Chaofu

    Forecasting pests emergence levels plays a significant role in regional crop planting and management. The accuracy, which is derived from the accuracy of the forecasting approach used, will determine the economics of the operation of the pests prediction. Conventional methods including time series, regression analysis or ARMA model entail exogenous input together with a number of assumptions. The use of neural networks has been shown to be a cost-effective technique. But their training, usually with back-propagation algorithm or other gradient algorithms, is featured with some drawbacks such as very slow convergence and easy entrapment in a local minimum. This paper presents a hybrid approach of neural network with particle swarm optimization for developing the accuracy of predictions. The approach is applied to forecast Alternaria alternate Keissl emergence level of the WuLong Country, one of the most important tobacco planting areas in Chongqing. Traditional ARMA model and BP neural network are investigated as comparison basis. The experimental results show that the proposed approach can achieve better prediction performance.

  3. Multi-objective flexible job-shop scheduling problem using modified discrete particle swarm optimization.

    PubMed

    Huang, Song; Tian, Na; Wang, Yan; Ji, Zhicheng

    2016-01-01

    Taking resource allocation into account, flexible job shop problem (FJSP) is a class of complex scheduling problem in manufacturing system. In order to utilize the machine resources rationally, multi-objective particle swarm optimization (MOPSO) integrating with variable neighborhood search is introduced to address FJSP efficiently. Firstly, the assignment rules (AL) and dispatching rules (DR) are provided to initialize the population. And then special discrete operators are designed to produce new individuals and earliest completion machine (ECM) is adopted in the disturbance operator to escape the optima. Secondly, personal-best archives (cognitive memories) and global-best archive (social memory), which are updated by the predefined non-dominated archive update strategy, are simultaneously designed to preserve non-dominated individuals and select personal-best positions and the global-best position. Finally, three neighborhoods are provided to search the neighborhoods of global-best archive for enhancing local search ability. The proposed algorithm is evaluated by using Kacem instances and Brdata instances, and a comparison with other approaches shows the effectiveness of the proposed algorithm for FJSP.

  4. Multi-objective flexible job-shop scheduling problem using modified discrete particle swarm optimization.

    PubMed

    Huang, Song; Tian, Na; Wang, Yan; Ji, Zhicheng

    2016-01-01

    Taking resource allocation into account, flexible job shop problem (FJSP) is a class of complex scheduling problem in manufacturing system. In order to utilize the machine resources rationally, multi-objective particle swarm optimization (MOPSO) integrating with variable neighborhood search is introduced to address FJSP efficiently. Firstly, the assignment rules (AL) and dispatching rules (DR) are provided to initialize the population. And then special discrete operators are designed to produce new individuals and earliest completion machine (ECM) is adopted in the disturbance operator to escape the optima. Secondly, personal-best archives (cognitive memories) and global-best archive (social memory), which are updated by the predefined non-dominated archive update strategy, are simultaneously designed to preserve non-dominated individuals and select personal-best positions and the global-best position. Finally, three neighborhoods are provided to search the neighborhoods of global-best archive for enhancing local search ability. The proposed algorithm is evaluated by using Kacem instances and Brdata instances, and a comparison with other approaches shows the effectiveness of the proposed algorithm for FJSP. PMID:27652008

  5. Enhancing speech recognition using improved particle swarm optimization based hidden Markov model.

    PubMed

    Selvaraj, Lokesh; Ganesan, Balakrishnan

    2014-01-01

    Enhancing speech recognition is the primary intention of this work. In this paper a novel speech recognition method based on vector quantization and improved particle swarm optimization (IPSO) is suggested. The suggested methodology contains four stages, namely, (i) denoising, (ii) feature mining (iii), vector quantization, and (iv) IPSO based hidden Markov model (HMM) technique (IP-HMM). At first, the speech signals are denoised using median filter. Next, characteristics such as peak, pitch spectrum, Mel frequency Cepstral coefficients (MFCC), mean, standard deviation, and minimum and maximum of the signal are extorted from the denoised signal. Following that, to accomplish the training process, the extracted characteristics are given to genetic algorithm based codebook generation in vector quantization. The initial populations are created by selecting random code vectors from the training set for the codebooks for the genetic algorithm process and IP-HMM helps in doing the recognition. At this point the creativeness will be done in terms of one of the genetic operation crossovers. The proposed speech recognition technique offers 97.14% accuracy. PMID:25478588

  6. Robotic U-shaped assembly line balancing using particle swarm optimization

    NASA Astrophysics Data System (ADS)

    Mukund Nilakantan, J.; Ponnambalam, S. G.

    2016-02-01

    Automation in an assembly line can be achieved using robots. In robotic U-shaped assembly line balancing (RUALB), robots are assigned to workstations to perform the assembly tasks on a U-shaped assembly line. The robots are expected to perform multiple tasks, because of their capabilities. U-shaped assembly line problems are derived from traditional assembly line problems and are relatively new. Tasks are assigned to the workstations when either all of their predecessors or all of their successors have already been assigned to workstations. The objective function considered in this article is to maximize the cycle time of the assembly line, which in turn helps to maximize the production rate of the assembly line. RUALB aims at the optimal assignment of tasks to the workstations and selection of the best fit robot to the workstations in a manner such that the cycle time is minimized. To solve this problem, a particle swarm optimization algorithm embedded with a heuristic allocation (consecutive) procedure is proposed. The consecutive heuristic is used to allocate the tasks to the workstation and to assign a best fit robot to that workstation. The proposed algorithm is evaluated using a wide variety of data sets. The results indicate that robotic U-shaped assembly lines perform better than robotic straight assembly lines in terms of cycle time.

  7. Multiobjective Particle Swarm Optimization for the optimal design of photovoltaic grid-connected systems

    SciTech Connect

    Kornelakis, Aris

    2010-12-15

    Particle Swarm Optimization (PSO) is a highly efficient evolutionary optimization algorithm. In this paper a multiobjective optimization algorithm based on PSO applied to the optimal design of photovoltaic grid-connected systems (PVGCSs) is presented. The proposed methodology intends to suggest the optimal number of system devices and the optimal PV module installation details, such that the economic and environmental benefits achieved during the system's operational lifetime period are both maximized. The objective function describing the economic benefit of the proposed optimization process is the lifetime system's total net profit which is calculated according to the method of the Net Present Value (NPV). The second objective function, which corresponds to the environmental benefit, equals to the pollutant gas emissions avoided due to the use of the PVGCS. The optimization's decision variables are the optimal number of the PV modules, the PV modules optimal tilt angle, the optimal placement of the PV modules within the available installation area and the optimal distribution of the PV modules among the DC/AC converters. (author)

  8. Enhancing Speech Recognition Using Improved Particle Swarm Optimization Based Hidden Markov Model

    PubMed Central

    Selvaraj, Lokesh; Ganesan, Balakrishnan

    2014-01-01

    Enhancing speech recognition is the primary intention of this work. In this paper a novel speech recognition method based on vector quantization and improved particle swarm optimization (IPSO) is suggested. The suggested methodology contains four stages, namely, (i) denoising, (ii) feature mining (iii), vector quantization, and (iv) IPSO based hidden Markov model (HMM) technique (IP-HMM). At first, the speech signals are denoised using median filter. Next, characteristics such as peak, pitch spectrum, Mel frequency Cepstral coefficients (MFCC), mean, standard deviation, and minimum and maximum of the signal are extorted from the denoised signal. Following that, to accomplish the training process, the extracted characteristics are given to genetic algorithm based codebook generation in vector quantization. The initial populations are created by selecting random code vectors from the training set for the codebooks for the genetic algorithm process and IP-HMM helps in doing the recognition. At this point the creativeness will be done in terms of one of the genetic operation crossovers. The proposed speech recognition technique offers 97.14% accuracy. PMID:25478588

  9. Automated Sperm Head Detection Using Intersecting Cortical Model Optimised by Particle Swarm Optimization

    PubMed Central

    Tan, Weng Chun; Mat Isa, Nor Ashidi

    2016-01-01

    In human sperm motility analysis, sperm segmentation plays an important role to determine the location of multiple sperms. To ensure an improved segmentation result, the Laplacian of Gaussian filter is implemented as a kernel in a pre-processing step before applying the image segmentation process to automatically segment and detect human spermatozoa. This study proposes an intersecting cortical model (ICM), which was derived from several visual cortex models, to segment the sperm head region. However, the proposed method suffered from parameter selection; thus, the ICM network is optimised using particle swarm optimization where feature mutual information is introduced as the new fitness function. The final results showed that the proposed method is more accurate and robust than four state-of-the-art segmentation methods. The proposed method resulted in rates of 98.14%, 98.82%, 86.46% and 99.81% in accuracy, sensitivity, specificity and precision, respectively, after testing with 1200 sperms. The proposed algorithm is expected to be implemented in analysing sperm motility because of the robustness and capability of this algorithm. PMID:27632581

  10. Chaos particle swarm optimization combined with circular median filtering for geophysical parameters retrieval from Windsat

    NASA Astrophysics Data System (ADS)

    Zhang, Lei; Wang, Zhenzhan; Shi, Hanqing; Long, Zhiyong; Du, Huadong

    2016-08-01

    This paper established a geophysical retrieval algorithm for sea surface wind vector, sea surface temperature, columnar atmospheric water vapor, and columnar cloud liquid water from WindSat, using the measured brightness temperatures and a matchup database. To retrieve the wind vector, a chaotic particle swarm approach was used to determine a set of possible wind vector solutions which minimize the difference between the forward model and the WindSat observations. An adjusted circular median filtering function was adopted to remove wind direction ambiguity. The validation of the wind speed, wind direction, sea surface temperature, columnar atmospheric water vapor, and columnar liquid cloud water indicates that this algorithm is feasible and reasonable and can be used to retrieve these atmospheric and oceanic parameters. Compared with moored buoy data, the RMS errors for wind speed and sea surface temperature were 0.92 m s-1 and 0.88°C, respectively. The RMS errors for columnar atmospheric water vapor and columnar liquid cloud water were 0.62 mm and 0.01 mm, respectively, compared with F17 SSMIS results. In addition, monthly average results indicated that these parameters are in good agreement with AMSR-E results. Wind direction retrieval was studied under various wind speed conditions and validated by comparing to the QuikSCAT measurements, and the RMS error was 13.3°. This paper offers a new approach to the study of ocean wind vector retrieval using a polarimetric microwave radiometer.

  11. Automated Sperm Head Detection Using Intersecting Cortical Model Optimised by Particle Swarm Optimization.

    PubMed

    Tan, Weng Chun; Mat Isa, Nor Ashidi

    2016-01-01

    In human sperm motility analysis, sperm segmentation plays an important role to determine the location of multiple sperms. To ensure an improved segmentation result, the Laplacian of Gaussian filter is implemented as a kernel in a pre-processing step before applying the image segmentation process to automatically segment and detect human spermatozoa. This study proposes an intersecting cortical model (ICM), which was derived from several visual cortex models, to segment the sperm head region. However, the proposed method suffered from parameter selection; thus, the ICM network is optimised using particle swarm optimization where feature mutual information is introduced as the new fitness function. The final results showed that the proposed method is more accurate and robust than four state-of-the-art segmentation methods. The proposed method resulted in rates of 98.14%, 98.82%, 86.46% and 99.81% in accuracy, sensitivity, specificity and precision, respectively, after testing with 1200 sperms. The proposed algorithm is expected to be implemented in analysing sperm motility because of the robustness and capability of this algorithm. PMID:27632581

  12. Particle swarm optimization of the stable structure of tetrahexahedral Pt-based bimetallic nanoparticles

    NASA Astrophysics Data System (ADS)

    Liu, Tun-Dong; Fan, Tian-E.; Shao, Gui-Fang; Zheng, Ji-Wen; Wen, Yu-Hua

    2014-08-01

    Bimetallic nanoparticles, enclosed by high-index facets, have great catalytic activity and selectivity owing to the synergy effects of high-index facets and the electronic structures of alloy. In this paper, a discrete particle swarm optimization algorithm was employed to systematically investigate the structural stability and features of tetrahexahedral Pt-based bimetallic nanoparticles with high-index facets. Different Pt/Ag, Pt/Cu, Pt/Pd atom ratios and particle sizes were considered in this work. The simulation results reveal that these alloy nanoparticles exhibit considerably different structural characteristics. Pt-Ag nanoparticles tend to form Pt-Ag core-shell structure. Pt-Cu nanoparticles are preferred to take multi-shell structure with Cu on the outer surface while Pt-Pd nanoparticles present a mixing structure in the interior and Pd-dominated surface. Atomic distribution and bonding characteristics were applied to further characterize the structural features of Pt-based nanoparticles. This study provides an important insight into the structural stability and features of Pt-based nanoparticles with different alloys.

  13. Swarm intelligence for atmospheric compensation in free space optical communication-Modified shuffled frog leaping algorithm

    NASA Astrophysics Data System (ADS)

    Li, Zhaokun; Cao, Jingtai; Zhao, Xiaohui; Liu, Wei

    2015-03-01

    A conventional adaptive optics (AO) system is widely used to compensate atmospheric turbulence in free space optical (FSO) communication systems, but wavefront measurements based on phase-conjugation principle are not desired under strong scintillation circumstances. In this study we propose a novel swarm intelligence optimization algorithm, which is called modified shuffled frog leaping algorithm (MSFL), to compensate the wavefront aberration. Simulation and experiments results show that MSFL algorithm performs well in the atmospheric compensation and it can increase the coupling efficiency in receiver terminal and significantly improve the performance of the FSO communication systems.

  14. Pareto optimal calibration of highly nonlinear reactive transport groundwater models using particle swarm optimization

    NASA Astrophysics Data System (ADS)

    Siade, A. J.; Prommer, H.; Welter, D.

    2014-12-01

    Groundwater management and remediation requires the implementation of numerical models in order to evaluate the potential anthropogenic impacts on aquifer systems. In many situations, the numerical model must, not only be able to simulate groundwater flow and transport, but also geochemical and biological processes. Each process being simulated carries with it a set of parameters that must be identified, along with differing potential sources of model-structure error. Various data types are often collected in the field and then used to calibrate the numerical model; however, these data types can represent very different processes and can subsequently be sensitive to the model parameters in extremely complex ways. Therefore, developing an appropriate weighting strategy to address the contributions of each data type to the overall least-squares objective function is not straightforward. This is further compounded by the presence of potential sources of model-structure errors that manifest themselves differently for each observation data type. Finally, reactive transport models are highly nonlinear, which can lead to convergence failure for algorithms operating on the assumption of local linearity. In this study, we propose a variation of the popular, particle swarm optimization algorithm to address trade-offs associated with the calibration of one data type over another. This method removes the need to specify weights between observation groups and instead, produces a multi-dimensional Pareto front that illustrates the trade-offs between data types. We use the PEST++ run manager, along with the standard PEST input/output structure, to implement parallel programming across multiple desktop computers using TCP/IP communications. This allows for very large swarms of particles without the need of a supercomputing facility. The method was applied to a case study in which modeling was used to gain insight into the mobilization of arsenic at a deepwell injection site

  15. A guidance and control algorithm for scent tracking micro-robotic vehicle swarms

    SciTech Connect

    Dohner, J.L.

    1998-03-01

    Cooperative micro-robotic scent tracking vehicles are designed to collectively sniff out locations of high scent concentrations in unknown, geometrically complex environments. These vehicles are programmed with guidance and control algorithms that allow inter cooperation among vehicles. In this paper a cooperative guidance and control algorithm for scent tracking micro-robotic vehicles is presented. This algorithm is comprised of a sensory compensation sub-algorithm using point source cancellation, a guidance sub-algorithm using gradient descent tracking, and a control sub-algorithm using proportional feedback. The concepts of social rank and point source cancellation are new concepts introduced within. Simulation results for cooperative vehicles swarms are given. Limitations are discussed.

  16. Coarse-grained variables for particle-based models: diffusion maps and animal swarming simulations

    NASA Astrophysics Data System (ADS)

    Liu, Ping; Safford, Hannah R.; Couzin, Iain D.; Kevrekidis, Ioannis G.

    2014-12-01

    As microscopic (e.g. atomistic, stochastic, agent-based, particle-based) simulations become increasingly prevalent in the modeling of complex systems, so does the need to systematically coarse-grain the information they provide. Before even starting to formulate relevant coarse-grained equations, we need to determine the right macroscopic observables—the right variables in terms of which emergent behavior will be described. This paper illustrates the use of data mining (and, in particular, diffusion maps, a nonlinear manifold learning technique) in coarse-graining the dynamics of a particle-based model of animal swarming. Our computational data-driven coarse-graining approach extracts two coarse (collective) variables from the detailed particle-based simulations, and helps formulate a low-dimensional stochastic differential equation in terms of these two collective variables; this allows the efficient quantification of the interplay of "informed" and "naive" individuals in the collective swarm dynamics. We also present a brief exploration of swarm breakup and use data-mining in an attempt to identify useful predictors for it. In our discussion of the scope and limitations of the approach we focus on the key step of selecting an informative metric, allowing us to usefully compare different particle swarm configurations.

  17. A novel artificial fish swarm algorithm for recalibration of fiber optic gyroscope error parameters.

    PubMed

    Gao, Yanbin; Guan, Lianwu; Wang, Tingjun; Sun, Yunlong

    2015-05-05

    The artificial fish swarm algorithm (AFSA) is one of the state-of-the-art swarm intelligent techniques, which is widely utilized for optimization purposes. Fiber optic gyroscope (FOG) error parameters such as scale factors, biases and misalignment errors are relatively unstable, especially with the environmental disturbances and the aging of fiber coils. These uncalibrated error parameters are the main reasons that the precision of FOG-based strapdown inertial navigation system (SINS) degraded. This research is mainly on the application of a novel artificial fish swarm algorithm (NAFSA) on FOG error coefficients recalibration/identification. First, the NAFSA avoided the demerits (e.g., lack of using artificial fishes' pervious experiences, lack of existing balance between exploration and exploitation, and high computational cost) of the standard AFSA during the optimization process. To solve these weak points, functional behaviors and the overall procedures of AFSA have been improved with some parameters eliminated and several supplementary parameters added. Second, a hybrid FOG error coefficients recalibration algorithm has been proposed based on NAFSA and Monte Carlo simulation (MCS) approaches. This combination leads to maximum utilization of the involved approaches for FOG error coefficients recalibration. After that, the NAFSA is verified with simulation and experiments and its priorities are compared with that of the conventional calibration method and optimal AFSA. Results demonstrate high efficiency of the NAFSA on FOG error coefficients recalibration.

  18. A Novel Artificial Fish Swarm Algorithm for Recalibration of Fiber Optic Gyroscope Error Parameters

    PubMed Central

    Gao, Yanbin; Guan, Lianwu; Wang, Tingjun; Sun, Yunlong

    2015-01-01

    The artificial fish swarm algorithm (AFSA) is one of the state-of-the-art swarm intelligent techniques, which is widely utilized for optimization purposes. Fiber optic gyroscope (FOG) error parameters such as scale factors, biases and misalignment errors are relatively unstable, especially with the environmental disturbances and the aging of fiber coils. These uncalibrated error parameters are the main reasons that the precision of FOG-based strapdown inertial navigation system (SINS) degraded. This research is mainly on the application of a novel artificial fish swarm algorithm (NAFSA) on FOG error coefficients recalibration/identification. First, the NAFSA avoided the demerits (e.g., lack of using artificial fishes’ pervious experiences, lack of existing balance between exploration and exploitation, and high computational cost) of the standard AFSA during the optimization process. To solve these weak points, functional behaviors and the overall procedures of AFSA have been improved with some parameters eliminated and several supplementary parameters added. Second, a hybrid FOG error coefficients recalibration algorithm has been proposed based on NAFSA and Monte Carlo simulation (MCS) approaches. This combination leads to maximum utilization of the involved approaches for FOG error coefficients recalibration. After that, the NAFSA is verified with simulation and experiments and its priorities are compared with that of the conventional calibration method and optimal AFSA. Results demonstrate high efficiency of the NAFSA on FOG error coefficients recalibration. PMID:25951339

  19. A novel artificial fish swarm algorithm for recalibration of fiber optic gyroscope error parameters.

    PubMed

    Gao, Yanbin; Guan, Lianwu; Wang, Tingjun; Sun, Yunlong

    2015-01-01

    The artificial fish swarm algorithm (AFSA) is one of the state-of-the-art swarm intelligent techniques, which is widely utilized for optimization purposes. Fiber optic gyroscope (FOG) error parameters such as scale factors, biases and misalignment errors are relatively unstable, especially with the environmental disturbances and the aging of fiber coils. These uncalibrated error parameters are the main reasons that the precision of FOG-based strapdown inertial navigation system (SINS) degraded. This research is mainly on the application of a novel artificial fish swarm algorithm (NAFSA) on FOG error coefficients recalibration/identification. First, the NAFSA avoided the demerits (e.g., lack of using artificial fishes' pervious experiences, lack of existing balance between exploration and exploitation, and high computational cost) of the standard AFSA during the optimization process. To solve these weak points, functional behaviors and the overall procedures of AFSA have been improved with some parameters eliminated and several supplementary parameters added. Second, a hybrid FOG error coefficients recalibration algorithm has been proposed based on NAFSA and Monte Carlo simulation (MCS) approaches. This combination leads to maximum utilization of the involved approaches for FOG error coefficients recalibration. After that, the NAFSA is verified with simulation and experiments and its priorities are compared with that of the conventional calibration method and optimal AFSA. Results demonstrate high efficiency of the NAFSA on FOG error coefficients recalibration. PMID:25951339

  20. Multi-modulus algorithm based on global artificial fish swarm intelligent optimization of DNA encoding sequences.

    PubMed

    Guo, Y C; Wang, H; Wu, H P; Zhang, M Q

    2015-12-21

    Aimed to address the defects of the large mean square error (MSE), and the slow convergence speed in equalizing the multi-modulus signals of the constant modulus algorithm (CMA), a multi-modulus algorithm (MMA) based on global artificial fish swarm (GAFS) intelligent optimization of DNA encoding sequences (GAFS-DNA-MMA) was proposed. To improve the convergence rate and reduce the MSE, this proposed algorithm adopted an encoding method based on DNA nucleotide chains to provide a possible solution to the problem. Furthermore, the GAFS algorithm, with its fast convergence and global search ability, was used to find the best sequence. The real and imaginary parts of the initial optimal weight vector of MMA were obtained through DNA coding of the best sequence. The simulation results show that the proposed algorithm has a faster convergence speed and smaller MSE in comparison with the CMA, the MMA, and the AFS-DNA-MMA.

  1. A new distributed systems scheduling algorithm: a swarm intelligence approach

    NASA Astrophysics Data System (ADS)

    Haghi Kashani, Mostafa; Sarvizadeh, Raheleh; Jameii, Mahdi

    2011-12-01

    The scheduling problem in distributed systems is known as an NP-complete problem, and methods based on heuristic or metaheuristic search have been proposed to obtain optimal and suboptimal solutions. The task scheduling is a key factor for distributed systems to gain better performance. In this paper, an efficient method based on memetic algorithm is developed to solve the problem of distributed systems scheduling. With regard to load balancing efficiently, Artificial Bee Colony (ABC) has been applied as local search in the proposed memetic algorithm. The proposed method has been compared to existing memetic-Based approach in which Learning Automata method has been used as local search. The results demonstrated that the proposed method outperform the above mentioned method in terms of communication cost.

  2. Automatic Calibration of a Semi-Distributed Hydrologic Model Using Particle Swarm Optimization

    NASA Astrophysics Data System (ADS)

    Bekele, E. G.; Nicklow, J. W.

    2005-12-01

    Hydrologic simulation models need to be calibrated and validated before using them for operational predictions. Spatially-distributed hydrologic models generally have a large number of parameters to capture the various physical characteristics of a hydrologic system. Manual calibration of such models is a very tedious and daunting task, and its success depends on the subjective assessment of a particular modeler, which includes knowledge of the basic approaches and interactions in the model. In order to alleviate these shortcomings, an automatic calibration model, which employs an evolutionary optimization technique known as Particle Swarm Optimizer (PSO) for parameter estimation, is developed. PSO is a heuristic search algorithm that is inspired by social behavior of bird flocking or fish schooling. The newly-developed calibration model is integrated to the U.S. Department of Agriculture's Soil and Water Assessment Tool (SWAT). SWAT is a physically-based, semi-distributed hydrologic model that was developed to predict the long term impacts of land management practices on water, sediment and agricultural chemical yields in large complex watersheds with varying soils, land use, and management conditions. SWAT was calibrated for streamflow and sediment concentration. The calibration process involves parameter specification, whereby sensitive model parameters are identified, and parameter estimation. In order to reduce the number of parameters to be calibrated, parameterization was performed. The methodology is applied to a demonstration watershed known as Big Creek, which is located in southern Illinois. Application results show the effectiveness of the approach and model predictions are significantly improved.

  3. Optimal multi-floor plant layout based on the mathematical programming and particle swarm optimization

    PubMed Central

    LEE, Chang Jun

    2015-01-01

    In the fields of researches associated with plant layout optimization, the main goal is to minimize the costs of pipelines and pumping between connecting equipment under various constraints. However, what is the lacking of considerations in previous researches is to transform various heuristics or safety regulations into mathematical equations. For example, proper safety distances between equipments have to be complied for preventing dangerous accidents on a complex plant. Moreover, most researches have handled single-floor plant. However, many multi-floor plants have been constructed for the last decade. Therefore, the proper algorithm handling various regulations and multi-floor plant should be developed. In this study, the Mixed Integer Non-Linear Programming (MINLP) problem including safety distances, maintenance spaces, etc. is suggested based on mathematical equations. The objective function is a summation of pipeline and pumping costs. Also, various safety and maintenance issues are transformed into inequality or equality constraints. However, it is really hard to solve this problem due to complex nonlinear constraints. Thus, it is impossible to use conventional MINLP solvers using derivatives of equations. In this study, the Particle Swarm Optimization (PSO) technique is employed. The ethylene oxide plant is illustrated to verify the efficacy of this study. PMID:26027708

  4. Binary particle swarm optimization for frequency band selection in motor imagery based brain-computer interfaces.

    PubMed

    Wei, Qingguo; Wei, Zhonghai

    2015-01-01

    A brain-computer interface (BCI) enables people suffering from affective neurological diseases to communicate with the external world. Common spatial pattern (CSP) is an effective algorithm for feature extraction in motor imagery based BCI systems. However, many studies have proved that the performance of CSP depends heavily on the frequency band of EEG signals used for the construction of covariance matrices. The use of different frequency bands to extract signal features may lead to different classification performances, which are determined by the discriminative and complementary information they contain. In this study, the broad frequency band (8-30 Hz) is divided into 10 sub-bands of band width 4 Hz and overlapping 2 Hz. Binary particle swarm optimization (BPSO) is used to find the best sub-band set to improve the performance of CSP and subsequent classification. Experimental results demonstrate that the proposed method achieved an average improvement of 6.91% in cross-validation accuracy when compared to broad band CSP.

  5. Electrochemical model parameter identification of a lithium-ion battery using particle swarm optimization method

    NASA Astrophysics Data System (ADS)

    Rahman, Md Ashiqur; Anwar, Sohel; Izadian, Afshin

    2016-03-01

    In this paper, a gradient-free optimization technique, namely particle swarm optimization (PSO) algorithm, is utilized to identify specific parameters of the electrochemical model of a Lithium-Ion battery with LiCoO2 cathode chemistry. Battery electrochemical model parameters are subject to change under severe or abusive operating conditions resulting in, for example, over-discharged battery, over-charged battery, etc. It is important for a battery management system to have these parameter changes fully captured in a bank of battery models that can be used to monitor battery conditions in real time. Here the PSO methodology has been successfully applied to identify four electrochemical model parameters that exhibit significant variations under severe operating conditions: solid phase diffusion coefficient at the positive electrode (cathode), solid phase diffusion coefficient at the negative electrode (anode), intercalation/de-intercalation reaction rate at the cathode, and intercalation/de-intercalation reaction rate at the anode. The identified model parameters were used to generate the respective battery models for both healthy and degraded batteries. These models were then validated by comparing the model output voltage with the experimental output voltage for the stated operating conditions. The identified Li-Ion battery electrochemical model parameters are within reasonable accuracy as evidenced by the experimental validation results.

  6. Optimal multi-floor plant layout based on the mathematical programming and particle swarm optimization.

    PubMed

    Lee, Chang Jun

    2015-01-01

    In the fields of researches associated with plant layout optimization, the main goal is to minimize the costs of pipelines and pumping between connecting equipment under various constraints. However, what is the lacking of considerations in previous researches is to transform various heuristics or safety regulations into mathematical equations. For example, proper safety distances between equipments have to be complied for preventing dangerous accidents on a complex plant. Moreover, most researches have handled single-floor plant. However, many multi-floor plants have been constructed for the last decade. Therefore, the proper algorithm handling various regulations and multi-floor plant should be developed. In this study, the Mixed Integer Non-Linear Programming (MINLP) problem including safety distances, maintenance spaces, etc. is suggested based on mathematical equations. The objective function is a summation of pipeline and pumping costs. Also, various safety and maintenance issues are transformed into inequality or equality constraints. However, it is really hard to solve this problem due to complex nonlinear constraints. Thus, it is impossible to use conventional MINLP solvers using derivatives of equations. In this study, the Particle Swarm Optimization (PSO) technique is employed. The ethylene oxide plant is illustrated to verify the efficacy of this study.

  7. Evacuation dynamic and exit optimization of a supermarket based on particle swarm optimization

    NASA Astrophysics Data System (ADS)

    Li, Lin; Yu, Zhonghai; Chen, Yang

    2014-12-01

    A modified particle swarm optimization algorithm is proposed in this paper to investigate the dynamic of pedestrian evacuation from a fire in a public building-a supermarket with multiple exits and configurations of counters. Two distinctive evacuation behaviours featured by the shortest-path strategy and the following-up strategy are simulated in the model, accounting for different categories of age and sex of the pedestrians along with the impact of the fire, including gases, heat and smoke. To examine the relationship among the progress of the overall evacuation and the layout and configuration of the site, a series of simulations are conducted in various settings: without a fire and with a fire at different locations. Those experiments reveal a general pattern of two-phase evacuation, i.e., a steep section and a flat section, in addition to the impact of the presence of multiple exits on the evacuation along with the geographic locations of the exits. For the study site, our simulations indicated the deficiency of the configuration and the current layout of this site in the process of evacuation and verified the availability of proposed solutions to resolve the deficiency. More specifically, for improvement of the effectiveness of the evacuation from the site, adding an exit between Exit 6 and Exit 7 and expanding the corridor at the right side of Exit 7 would significantly reduce the evacuation time.

  8. Hierarchical particle swarm optimizer for minimizing the non-convex potential energy of molecular structure.

    PubMed

    Cheung, Ngaam J; Shen, Hong-Bin

    2014-11-01

    The stable conformation of a molecule is greatly important to uncover the secret of its properties and functions. Generally, the conformation of a molecule will be the most stable when it is of the minimum potential energy. Accordingly, the determination of the conformation can be solved in the optimization framework. It is, however, not an easy task to achieve the only conformation with the lowest energy among all the potential ones because of the high complexity of the energy landscape and the exponential computation increasing with molecular size. In this paper, we develop a hierarchical and heterogeneous particle swarm optimizer (HHPSO) to deal with the problem in the minimization of the potential energy. The proposed method is evaluated over a scalable simplified molecular potential energy function with up to 200 degrees of freedom and a realistic energy function of pseudo-ethane molecule. The experimental results are compared with other six PSO variants and four genetic algorithms. The results show HHPSO is significantly better than the compared PSOs with p-value less than 0.01277 over molecular potential energy function.

  9. Performance analysis of a semiactive suspension system with particle swarm optimization and fuzzy logic control.

    PubMed

    Qazi, Abroon Jamal; de Silva, Clarence W; Khan, Afzal; Khan, Muhammad Tahir

    2014-01-01

    This paper uses a quarter model of an automobile having passive and semiactive suspension systems to develop a scheme for an optimal suspension controller. Semi-active suspension is preferred over passive and active suspensions with regard to optimum performance within the constraints of weight and operational cost. A fuzzy logic controller is incorporated into the semi-active suspension system. It is able to handle nonlinearities through the use of heuristic rules. Particle swarm optimization (PSO) is applied to determine the optimal gain parameters for the fuzzy logic controller, while maintaining within the normalized ranges of the controller inputs and output. The performance of resulting optimized system is compared with different systems that use various control algorithms, including a conventional passive system, choice options of feedback signals, and damping coefficient limits. Also, the optimized semi-active suspension system is evaluated for its performance in relation to variation in payload. Furthermore, the systems are compared with respect to the attributes of road handling and ride comfort. In all the simulation studies it is found that the optimized fuzzy logic controller surpasses the other types of control.

  10. Medical Dataset Classification: A Machine Learning Paradigm Integrating Particle Swarm Optimization with Extreme Learning Machine Classifier

    PubMed Central

    Subbulakshmi, C. V.; Deepa, S. N.

    2015-01-01

    Medical data classification is a prime data mining problem being discussed about for a decade that has attracted several researchers around the world. Most classifiers are designed so as to learn from the data itself using a training process, because complete expert knowledge to determine classifier parameters is impracticable. This paper proposes a hybrid methodology based on machine learning paradigm. This paradigm integrates the successful exploration mechanism called self-regulated learning capability of the particle swarm optimization (PSO) algorithm with the extreme learning machine (ELM) classifier. As a recent off-line learning method, ELM is a single-hidden layer feedforward neural network (FFNN), proved to be an excellent classifier with large number of hidden layer neurons. In this research, PSO is used to determine the optimum set of parameters for the ELM, thus reducing the number of hidden layer neurons, and it further improves the network generalization performance. The proposed method is experimented on five benchmarked datasets of the UCI Machine Learning Repository for handling medical dataset classification. Simulation results show that the proposed approach is able to achieve good generalization performance, compared to the results of other classifiers. PMID:26491713

  11. Performance Analysis of a Semiactive Suspension System with Particle Swarm Optimization and Fuzzy Logic Control

    PubMed Central

    Qazi, Abroon Jamal; de Silva, Clarence W.

    2014-01-01

    This paper uses a quarter model of an automobile having passive and semiactive suspension systems to develop a scheme for an optimal suspension controller. Semi-active suspension is preferred over passive and active suspensions with regard to optimum performance within the constraints of weight and operational cost. A fuzzy logic controller is incorporated into the semi-active suspension system. It is able to handle nonlinearities through the use of heuristic rules. Particle swarm optimization (PSO) is applied to determine the optimal gain parameters for the fuzzy logic controller, while maintaining within the normalized ranges of the controller inputs and output. The performance of resulting optimized system is compared with different systems that use various control algorithms, including a conventional passive system, choice options of feedback signals, and damping coefficient limits. Also, the optimized semi-active suspension system is evaluated for its performance in relation to variation in payload. Furthermore, the systems are compared with respect to the attributes of road handling and ride comfort. In all the simulation studies it is found that the optimized fuzzy logic controller surpasses the other types of control. PMID:24574868

  12. Design for sustainability of industrial symbiosis based on emergy and multi-objective particle swarm optimization.

    PubMed

    Ren, Jingzheng; Liang, Hanwei; Dong, Liang; Sun, Lu; Gao, Zhiqiu

    2016-08-15

    Industrial symbiosis provides novel and practical pathway to the design for the sustainability. Decision support tool for its verification is necessary for practitioners and policy makers, while to date, quantitative research is limited. The objective of this work is to present an innovative approach for supporting decision-making in the design for the sustainability with the implementation of industrial symbiosis in chemical complex. Through incorporating the emergy theory, the model is formulated as a multi-objective approach that can optimize both the economic benefit and sustainable performance of the integrated industrial system. A set of emergy based evaluation index are designed. Multi-objective Particle Swarm Algorithm is proposed to solve the model, and the decision-makers are allowed to choose the suitable solutions form the Pareto solutions. An illustrative case has been studied by the proposed method, a few of compromises between high profitability and high sustainability can be obtained for the decision-makers/stakeholders to make decision. PMID:27110990

  13. Adaptive impedance control of a hydraulic suspension system using particle swarm optimisation

    NASA Astrophysics Data System (ADS)

    Fateh, Mohammad Mehdi; Moradi Zirkohi, Majid

    2011-12-01

    This paper presents a novel active control approach for a hydraulic suspension system subject to road disturbances. A novel impedance model is used as a model reference in a particular robust adaptive control which is applied for the first time to the hydraulic suspension system. A scheme is introduced for selecting the impedance parameters. The impedance model prescribes a desired behaviour of the active suspension system in a wide range of different road conditions. Moreover, performance of the control system is improved by applying a particle swarm optimisation algorithm for optimising control design parameters. Design of the control system consists of two interior loops. The inner loop is a force control of the hydraulic actuator, while the outer loop is a robust model reference adaptive control (MRAC). This type of MRAC has been applied for uncertain linear systems. As another novelty, despite nonlinearity of the hydraulic actuator, the suspension system and the force loop together are presented as an uncertain linear system to the MRAC. The proposed control method is simulated on a quarter-car model. Simulation results show effectiveness of the method.

  14. Identification of inelastic parameters based on deep drawing forming operations using a global-local hybrid Particle Swarm approach

    NASA Astrophysics Data System (ADS)

    Vaz, Miguel; Luersen, Marco A.; Muñoz-Rojas, Pablo A.; Trentin, Robson G.

    2016-04-01

    Application of optimization techniques to the identification of inelastic material parameters has substantially increased in recent years. The complex stress-strain paths and high nonlinearity, typical of this class of problems, require the development of robust and efficient techniques for inverse problems able to account for an irregular topography of the fitness surface. Within this framework, this work investigates the application of the gradient-based Sequential Quadratic Programming method, of the Nelder-Mead downhill simplex algorithm, of Particle Swarm Optimization (PSO), and of a global-local PSO-Nelder-Mead hybrid scheme to the identification of inelastic parameters based on a deep drawing operation. The hybrid technique has shown to be the best strategy by combining the good PSO performance to approach the global minimum basin of attraction with the efficiency demonstrated by the Nelder-Mead algorithm to obtain the minimum itself.

  15. Distributed Bees Algorithm Parameters Optimization for a Cost Efficient Target Allocation in Swarms of Robots

    PubMed Central

    Jevtić, Aleksandar; Gutiérrez, Álvaro

    2011-01-01

    Swarms of robots can use their sensing abilities to explore unknown environments and deploy on sites of interest. In this task, a large number of robots is more effective than a single unit because of their ability to quickly cover the area. However, the coordination of large teams of robots is not an easy problem, especially when the resources for the deployment are limited. In this paper, the Distributed Bees Algorithm (DBA), previously proposed by the authors, is optimized and applied to distributed target allocation in swarms of robots. Improved target allocation in terms of deployment cost efficiency is achieved through optimization of the DBA’s control parameters by means of a Genetic Algorithm. Experimental results show that with the optimized set of parameters, the deployment cost measured as the average distance traveled by the robots is reduced. The cost-efficient deployment is in some cases achieved at the expense of increased robots’ distribution error. Nevertheless, the proposed approach allows the swarm to adapt to the operating conditions when available resources are scarce. PMID:22346677

  16. KANTS: a stigmergic ant algorithm for cluster analysis and swarm art.

    PubMed

    Fernandes, Carlos M; Mora, Antonio M; Merelo, Juan J; Rosa, Agostinho C

    2014-06-01

    KANTS is a swarm intelligence clustering algorithm inspired by the behavior of social insects. It uses stigmergy as a strategy for clustering large datasets and, as a result, displays a typical behavior of complex systems: self-organization and global patterns emerging from the local interaction of simple units. This paper introduces a simplified version of KANTS and describes recent experiments with the algorithm in the context of a contemporary artistic and scientific trend called swarm art, a type of generative art in which swarm intelligence systems are used to create artwork or ornamental objects. KANTS is used here for generating color drawings from the input data that represent real-world phenomena, such as electroencephalogram sleep data. However, the main proposal of this paper is an art project based on well-known abstract paintings, from which the chromatic values are extracted and used as input. Colors and shapes are therefore reorganized by KANTS, which generates its own interpretation of the original artworks. The project won the 2012 Evolutionary Art, Design, and Creativity Competition.

  17. A novel artificial fish swarm algorithm for solving large-scale reliability-redundancy application problem.

    PubMed

    He, Qiang; Hu, Xiangtao; Ren, Hong; Zhang, Hongqi

    2015-11-01

    A novel artificial fish swarm algorithm (NAFSA) is proposed for solving large-scale reliability-redundancy allocation problem (RAP). In NAFSA, the social behaviors of fish swarm are classified in three ways: foraging behavior, reproductive behavior, and random behavior. The foraging behavior designs two position-updating strategies. And, the selection and crossover operators are applied to define the reproductive ability of an artificial fish. For the random behavior, which is essentially a mutation strategy, the basic cloud generator is used as the mutation operator. Finally, numerical results of four benchmark problems and a large-scale RAP are reported and compared. NAFSA shows good performance in terms of computational accuracy and computational efficiency for large scale RAP. PMID:26474934

  18. A dynamic feedforward neural network based on gaussian particle swarm optimization and its application for predictive control.

    PubMed

    Han, Min; Fan, Jianchao; Wang, Jun

    2011-09-01

    A dynamic feedforward neural network (DFNN) is proposed for predictive control, whose adaptive parameters are adjusted by using Gaussian particle swarm optimization (GPSO) in the training process. Adaptive time-delay operators are added in the DFNN to improve its generalization for poorly known nonlinear dynamic systems with long time delays. Furthermore, GPSO adopts a chaotic map with Gaussian function to balance the exploration and exploitation capabilities of particles, which improves the computational efficiency without compromising the performance of the DFNN. The stability of the particle dynamics is analyzed, based on the robust stability theory, without any restrictive assumption. A stability condition for the GPSO+DFNN model is derived, which ensures a satisfactory global search and quick convergence, without the need for gradients. The particle velocity ranges could change adaptively during the optimization process. The results of a comparative study show that the performance of the proposed algorithm can compete with selected algorithms on benchmark problems. Additional simulation results demonstrate the effectiveness and accuracy of the proposed combination algorithm in identifying and controlling nonlinear systems with long time delays. PMID:21803682

  19. A swarm intelligence based memetic algorithm for task allocation in distributed systems

    NASA Astrophysics Data System (ADS)

    Sarvizadeh, Raheleh; Haghi Kashani, Mostafa

    2011-12-01

    This paper proposes a Swarm Intelligence based Memetic algorithm for Task Allocation and scheduling in distributed systems. The tasks scheduling in distributed systems is known as an NP-complete problem. Hence, many genetic algorithms have been proposed for searching optimal solutions from entire solution space. However, these existing approaches are going to scan the entire solution space without considering the techniques that can reduce the complexity of the optimization. Spending too much time for doing scheduling is considered the main shortcoming of these approaches. Therefore, in this paper memetic algorithm has been used to cope with this shortcoming. With regard to load balancing efficiently, Bee Colony Optimization (BCO) has been applied as local search in the proposed memetic algorithm. Extended experimental results demonstrated that the proposed method outperformed the existing GA-based method in terms of CPU utilization.

  20. A swarm intelligence based memetic algorithm for task allocation in distributed systems

    NASA Astrophysics Data System (ADS)

    Sarvizadeh, Raheleh; Haghi Kashani, Mostafa

    2012-01-01

    This paper proposes a Swarm Intelligence based Memetic algorithm for Task Allocation and scheduling in distributed systems. The tasks scheduling in distributed systems is known as an NP-complete problem. Hence, many genetic algorithms have been proposed for searching optimal solutions from entire solution space. However, these existing approaches are going to scan the entire solution space without considering the techniques that can reduce the complexity of the optimization. Spending too much time for doing scheduling is considered the main shortcoming of these approaches. Therefore, in this paper memetic algorithm has been used to cope with this shortcoming. With regard to load balancing efficiently, Bee Colony Optimization (BCO) has been applied as local search in the proposed memetic algorithm. Extended experimental results demonstrated that the proposed method outperformed the existing GA-based method in terms of CPU utilization.

  1. Sub-pixel flood inundation mapping from multispectral remotely sensed images based on discrete particle swarm optimization

    NASA Astrophysics Data System (ADS)

    Li, Linyi; Chen, Yun; Yu, Xin; Liu, Rui; Huang, Chang

    2015-03-01

    The study of flood inundation is significant to human life and social economy. Remote sensing technology has provided an effective way to study the spatial and temporal characteristics of inundation. Remotely sensed images with high temporal resolutions are widely used in mapping inundation. However, mixed pixels do exist due to their relatively low spatial resolutions. One of the most popular approaches to resolve this issue is sub-pixel mapping. In this paper, a novel discrete particle swarm optimization (DPSO) based sub-pixel flood inundation mapping (DPSO-SFIM) method is proposed to achieve an improved accuracy in mapping inundation at a sub-pixel scale. The evaluation criterion for sub-pixel inundation mapping is formulated. The DPSO-SFIM algorithm is developed, including particle discrete encoding, fitness function designing and swarm search strategy. The accuracy of DPSO-SFIM in mapping inundation at a sub-pixel scale was evaluated using Landsat ETM + images from study areas in Australia and China. The results show that DPSO-SFIM consistently outperformed the four traditional SFIM methods in these study areas. A sensitivity analysis of DPSO-SFIM was also carried out to evaluate its performances. It is hoped that the results of this study will enhance the application of medium-low spatial resolution images in inundation detection and mapping, and thereby support the ecological and environmental studies of river basins.

  2. A Chaotic Particle Swarm Optimization-Based Heuristic for Market-Oriented Task-Level Scheduling in Cloud Workflow Systems

    PubMed Central

    Li, Xuejun; Xu, Jia; Yang, Yun

    2015-01-01

    Cloud workflow system is a kind of platform service based on cloud computing. It facilitates the automation of workflow applications. Between cloud workflow system and its counterparts, market-oriented business model is one of the most prominent factors. The optimization of task-level scheduling in cloud workflow system is a hot topic. As the scheduling is a NP problem, Ant Colony Optimization (ACO) and Particle Swarm Optimization (PSO) have been proposed to optimize the cost. However, they have the characteristic of premature convergence in optimization process and therefore cannot effectively reduce the cost. To solve these problems, Chaotic Particle Swarm Optimization (CPSO) algorithm with chaotic sequence and adaptive inertia weight factor is applied to present the task-level scheduling. Chaotic sequence with high randomness improves the diversity of solutions, and its regularity assures a good global convergence. Adaptive inertia weight factor depends on the estimate value of cost. It makes the scheduling avoid premature convergence by properly balancing between global and local exploration. The experimental simulation shows that the cost obtained by our scheduling is always lower than the other two representative counterparts. PMID:26357510

  3. A Chaotic Particle Swarm Optimization-Based Heuristic for Market-Oriented Task-Level Scheduling in Cloud Workflow Systems.

    PubMed

    Li, Xuejun; Xu, Jia; Yang, Yun

    2015-01-01

    Cloud workflow system is a kind of platform service based on cloud computing. It facilitates the automation of workflow applications. Between cloud workflow system and its counterparts, market-oriented business model is one of the most prominent factors. The optimization of task-level scheduling in cloud workflow system is a hot topic. As the scheduling is a NP problem, Ant Colony Optimization (ACO) and Particle Swarm Optimization (PSO) have been proposed to optimize the cost. However, they have the characteristic of premature convergence in optimization process and therefore cannot effectively reduce the cost. To solve these problems, Chaotic Particle Swarm Optimization (CPSO) algorithm with chaotic sequence and adaptive inertia weight factor is applied to present the task-level scheduling. Chaotic sequence with high randomness improves the diversity of solutions, and its regularity assures a good global convergence. Adaptive inertia weight factor depends on the estimate value of cost. It makes the scheduling avoid premature convergence by properly balancing between global and local exploration. The experimental simulation shows that the cost obtained by our scheduling is always lower than the other two representative counterparts.

  4. Particle swarm optimization on low dimensional pose manifolds for monocular human pose estimation

    NASA Astrophysics Data System (ADS)

    Brauer, Jürgen; Hübner, Wolfgang; Arens, Michael

    2013-10-01

    Automatic assessment of situations with modern security and surveillance systems requires sophisticated discrimination capabilities. Therefore, action recognition, e.g. in terms of person-person or person-object interactions, is an essential core component of any surveillance system. A subclass of recent action recognition approaches are based on space time volumes, which are generated from trajectories of multiple anatomical landmarks like hands or shoulders. A general prerequisite of these methods is the robust estimation of the body pose, i.e. a simplified body model consisting of several anatomical landmarks. In this paper we address the problem of estimating 3D poses from monocular person image sequences. The first stage of our algorithm is the localization of body parts in the 2D image. For this, a part based object detection method is used, which in previous work has been shown to provide a sufficient basis for person detection and landmark estimation in a single step. The output of this processing step is a probability distribution for each landmark and image indicating possible locations of this landmark in image coordinates. The second stage of our algorithm searches for 3D pose estimates that best t to the 15 landmark probability distributions. For resolving ambiguities introduced by uncertainty in the locations of the landmarks, we perform an optimization within a Particle Swarm Optimization (PSO) framework, where each pose hypothesis is represented by a particle. Since the search in the high-dimensional 3D pose search space needs further guidance to deal with the inherently restricted 2D input information, we propose a new compact representation of motion sequences provided by motion capture databases. Poses of a motion sequence are embedded in a low-dimensional manifold. We represent each motion sequence by a compact representation referred to as pose splines using a small number of supporting point poses. The PSO algorithm can be extended to perform

  5. Obtaining Approximate Values of Exterior Orientation Elements of Multi-Intersection Images Using Particle Swarm Optimization

    NASA Astrophysics Data System (ADS)

    Li, X.; Li, S. W.

    2012-07-01

    In this paper, an efficient global optimization algorithm in the field of artificial intelligence, named Particle Swarm Optimization (PSO), is introduced into close range photogrammetric data processing. PSO can be applied to obtain the approximate values of exterior orientation elements under the condition that multi-intersection photography and a small portable plane control frame are used. PSO, put forward by an American social psychologist J. Kennedy and an electrical engineer R.C. Eberhart, is a stochastic global optimization method based on swarm intelligence, which was inspired by social behavior of bird flocking or fish schooling. The strategy of obtaining the approximate values of exterior orientation elements using PSO is as follows: in terms of image coordinate observed values and space coordinates of few control points, the equations of calculating the image coordinate residual errors can be given. The sum of absolute value of each image coordinate is minimized to be the objective function. The difference between image coordinate observed value and the image coordinate computed through collinear condition equation is defined as the image coordinate residual error. Firstly a gross area of exterior orientation elements is given, and then the adjustment of other parameters is made to get the particles fly in the gross area. After iterative computation for certain times, the satisfied approximate values of exterior orientation elements are obtained. By doing so, the procedures like positioning and measuring space control points in close range photogrammetry can be avoided. Obviously, this method can improve the surveying efficiency greatly and at the same time can decrease the surveying cost. And during such a process, only one small portable control frame with a couple of control points is employed, and there are no strict requirements for the space distribution of control points. In order to verify the effectiveness of this algorithm, two experiments are

  6. Adaptive Particle Swarm Optimizer with Varying Acceleration Coefficients for Finding the Most Stable Conformer of Small Molecules.

    PubMed

    Agrawal, Shikha; Silakari, Sanjay; Agrawal, Jitendra

    2015-11-01

    A novel parameter automation strategy for Particle Swarm Optimization called APSO (Adaptive PSO) is proposed. The algorithm is designed to efficiently control the local search and convergence to the global optimum solution. Parameters c1 controls the impact of the cognitive component on the particle trajectory and c2 controls the impact of the social component. Instead of fixing the value of c1 and c2 , this paper updates the value of these acceleration coefficients by considering time variation of evaluation function along with varying inertia weight factor in PSO. Here the maximum and minimum value of evaluation function is use to gradually decrease and increase the value of c1 and c2 respectively. Molecular energy minimization is one of the most challenging unsolved problems and it can be formulated as a global optimization problem. The aim of the present paper is to investigate the effect of newly developed APSO on the highly complex molecular potential energy function and to check the efficiency of the proposed algorithm to find the global minimum of the function under consideration. The proposed algorithm APSO is therefore applied in two cases: Firstly, for the minimization of a potential energy of small molecules with up to 100 degrees of freedom and finally for finding the global minimum energy conformation of 1,2,3-trichloro-1-flouro-propane molecule based on a realistic potential energy function. The computational results of all the cases show that the proposed method performs significantly better than the other algorithms. PMID:27491033

  7. Adaptive Particle Swarm Optimizer with Varying Acceleration Coefficients for Finding the Most Stable Conformer of Small Molecules.

    PubMed

    Agrawal, Shikha; Silakari, Sanjay; Agrawal, Jitendra

    2015-11-01

    A novel parameter automation strategy for Particle Swarm Optimization called APSO (Adaptive PSO) is proposed. The algorithm is designed to efficiently control the local search and convergence to the global optimum solution. Parameters c1 controls the impact of the cognitive component on the particle trajectory and c2 controls the impact of the social component. Instead of fixing the value of c1 and c2 , this paper updates the value of these acceleration coefficients by considering time variation of evaluation function along with varying inertia weight factor in PSO. Here the maximum and minimum value of evaluation function is use to gradually decrease and increase the value of c1 and c2 respectively. Molecular energy minimization is one of the most challenging unsolved problems and it can be formulated as a global optimization problem. The aim of the present paper is to investigate the effect of newly developed APSO on the highly complex molecular potential energy function and to check the efficiency of the proposed algorithm to find the global minimum of the function under consideration. The proposed algorithm APSO is therefore applied in two cases: Firstly, for the minimization of a potential energy of small molecules with up to 100 degrees of freedom and finally for finding the global minimum energy conformation of 1,2,3-trichloro-1-flouro-propane molecule based on a realistic potential energy function. The computational results of all the cases show that the proposed method performs significantly better than the other algorithms.

  8. Crop classification by forward neural network with adaptive chaotic particle swarm optimization.

    PubMed

    Zhang, Yudong; Wu, Lenan

    2011-01-01

    This paper proposes a hybrid crop classifier for polarimetric synthetic aperture radar (SAR) images. The feature sets consisted of span image, the H/A/α decomposition, and the gray-level co-occurrence matrix (GLCM) based texture features. Then, the features were reduced by principle component analysis (PCA). Finally, a two-hidden-layer forward neural network (NN) was constructed and trained by adaptive chaotic particle swarm optimization (ACPSO). K-fold cross validation was employed to enhance generation. The experimental results on Flevoland sites demonstrate the superiority of ACPSO to back-propagation (BP), adaptive BP (ABP), momentum BP (MBP), Particle Swarm Optimization (PSO), and Resilient back-propagation (RPROP) methods. Moreover, the computation time for each pixel is only 1.08 × 10(-7) s.

  9. A Fast Induction Motor Speed Estimation based on Hybrid Particle Swarm Optimization (HPSO)

    NASA Astrophysics Data System (ADS)

    Aryza, Solly; Abdallah, Ahmed N.; Khalidin, Zulkeflee bin; Lubis, Zulkarnain; Jie, Ma

    Intelligent control and estimation of power electronic systems by fuzzy logic and neural network techniques with fast torque and flux show tremendous promise in future. This paper proposed the application of Hybrid Particle Swarm Optimization (HPSO) for losses and operating cost minimization control in the induction motor drives. The main advantages of the proposed technique are; its simple structure and its straightforward maximization of induction motor efficiency and its operating cost for a given load torque. As will be demonstrated, Hybrid Particle Swarm Optimization (HPSO) is so efficient in finding the optimum operating machine's flux level. The results demonstrate the good quality and robustness in the system dynamic response and reduction in the steady-state and transient motor ripple torque.

  10. Deconvolution of complex spectra into components by the bee swarm algorithm

    NASA Astrophysics Data System (ADS)

    Yagfarov, R. R.; Sibgatullin, M. E.; Galimullin, D. Z.; Kamalova, D. I.; Salakhov, M. Kh

    2016-05-01

    The bee swarm algorithm is adapted for the solution of the problem of deconvolution of complex spectral contours into components. Comparison of biological concepts relating to the behaviour of bees in a colony and mathematical concepts relating to the quality of the obtained solutions is carried out (mean square error, random solutions in the each iteration). Model experiments, which have been realized on the example of a signal representing a sum of three Lorentz contours of various intensity and half-width, confirm the efficiency of the offered approach.

  11. Swarming behavior of gradient-responsive Brownian particles in a porous medium

    NASA Astrophysics Data System (ADS)

    Grančič, Peter; Štěpánek, František

    2012-07-01

    Active targeting by Brownian particles in a fluid-filled porous environment is investigated by computer simulation. The random motion of the particles is enhanced by diffusiophoresis with respect to concentration gradients of chemical signals released by the particles in the proximity of a target. The mathematical model, based on a combination of the Brownian dynamics method and a diffusion problem is formulated in terms of key parameters that include the particle diffusiophoretic mobility and the signaling threshold (the distance from the target at which the particles release their chemical signals). The results demonstrate that even a relatively simple chemical signaling scheme can lead to a complex collective behavior of the particles and can be a very efficient way of guiding a swarm of Brownian particles towards a target, similarly to the way colonies of living cells communicate via secondary messengers.

  12. Swarming behavior of gradient-responsive Brownian particles in a porous medium.

    PubMed

    Grančič, Peter; Štěpánek, František

    2012-07-01

    Active targeting by Brownian particles in a fluid-filled porous environment is investigated by computer simulation. The random motion of the particles is enhanced by diffusiophoresis with respect to concentration gradients of chemical signals released by the particles in the proximity of a target. The mathematical model, based on a combination of the Brownian dynamics method and a diffusion problem is formulated in terms of key parameters that include the particle diffusiophoretic mobility and the signaling threshold (the distance from the target at which the particles release their chemical signals). The results demonstrate that even a relatively simple chemical signaling scheme can lead to a complex collective behavior of the particles and can be a very efficient way of guiding a swarm of Brownian particles towards a target, similarly to the way colonies of living cells communicate via secondary messengers.

  13. Estimation of design sea ice thickness with maximum entropy distribution by particle swarm optimization method

    NASA Astrophysics Data System (ADS)

    Tao, Shanshan; Dong, Sheng; Wang, Zhifeng; Jiang, Wensheng

    2016-06-01

    The maximum entropy distribution, which consists of various recognized theoretical distributions, is a better curve to estimate the design thickness of sea ice. Method of moment and empirical curve fitting method are common-used parameter estimation methods for maximum entropy distribution. In this study, we propose to use the particle swarm optimization method as a new parameter estimation method for the maximum entropy distribution, which has the advantage to avoid deviation introduced by simplifications made in other methods. We conducted a case study to fit the hindcasted thickness of the sea ice in the Liaodong Bay of Bohai Sea using these three parameter-estimation methods for the maximum entropy distribution. All methods implemented in this study pass the K-S tests at 0.05 significant level. In terms of the average sum of deviation squares, the empirical curve fitting method provides the best fit for the original data, while the method of moment provides the worst. Among all three methods, the particle swarm optimization method predicts the largest thickness of the sea ice for a same return period. As a result, we recommend using the particle swarm optimization method for the maximum entropy distribution for offshore structures mainly influenced by the sea ice in winter, but using the empirical curve fitting method to reduce the cost in the design of temporary and economic buildings.

  14. Application of particle swarm optimization to parameter search in dynamical systems

    NASA Astrophysics Data System (ADS)

    Matsushita, Haruna; Saito, Toshimichi

    This paper proposes an application of the particle swarm optimization (PSO) to analysis of switched dynamical systems (SDS). This is the first application of PSO to bifurcation analysis. We consider the application to an example of the SDS which relates to a simplified model of photovoltaic systems such that the input is a single solar cell and is converted to the output via a boost converter. Our SDS includes a piecewise linear current-controlled voltage source that is a simplified model of the solar cell and the switching rule is a variant of peak-current-controlled switching. We derive two equations that give period-doubling bifurcation set and the maximum power point (MPP) for the parameter: they are objective of the analysis. The two equations are transformed into an multi objective problem (MOP) described by the hybrid fitness function consisting of two functions evaluating the validity of parameters and criteria. The proposed method permits increase (deteriorate) of some component below the criterion and the increase can help to exclude the bad component. This criteria effect helps an improvement of trade-off problems in existing MOP solvers. Furthermore, by using the piecewise exact solution and return map for the simulation, the MOP is described exactly and the PSO can find the precise (approximate) solution. From simulation results, we confirm that the PSO for the MOP can easily find the solution parameters although a standard numerical calculation needs huge calculation amount. The efficiency of the proposed algorithm is confirmed by measuring in terms of accuracy, computation amount and robustness.

  15. A Survey on GPU-Based Implementation of Swarm Intelligence Algorithms.

    PubMed

    Tan, Ying; Ding, Ke

    2016-09-01

    Inspired by the collective behavior of natural swarm, swarm intelligence algorithms (SIAs) have been developed and widely used for solving optimization problems. When applied to complex problems, a large number of fitness function evaluations are needed to obtain an acceptable solution. To tackle this vital issue, graphical processing units (GPUs) have been used to accelerate the optimization procedure of SIAs. Thanks to their inherent parallelism, SIAs are very suitable for parallel implementation under the GPU platform which have achieved a great success in recent years. This paper presents a comprehensive review of GPU-based parallel SIAs in accordance with a newly proposed taxonomy. Critical concerns for the efficient parallel implementation of SIAs are also described in detail. Moreover, novel criteria are also proposed to evaluate and compare the parallel implementation and algorithm performance universally. The rationality and practicability of the proposed optimization methodology and criteria are verified by careful case study. Finally, our opinions and perspectives on the trends and prospects on the relatively new research domain are also presented for future development. PMID:26571543

  16. Spatially and spectrally resolved particle swarm optimization for precise optical property estimation using diffuse-reflectance spectroscopy.

    PubMed

    Kholodtsova, Maria N; Daul, Christian; Loschenov, Victor B; Blondel, Walter C P M

    2016-06-13

    This paper presents a new approach to estimate optical properties (absorption and scattering coefficients µa and µs) of biological tissues from spatially-resolved spectroscopy measurements. A Particle Swarm Optimization (PSO)-based algorithm was implemented and firstly modified to deal with spatial and spectral resolutions of the data, and to solve the corresponding inverse problem. Secondly, the optimization was improved by fitting exponential decays to the two best points among all clusters of the "particles" randomly distributed all over the parameter space (µs, µa) of possible solutions. The consequent acceleration of all the groups of particles to the "best" curve leads to significant error decrease in the optical property estimation. The study analyzes the estimated optical property error as a function of the various PSO parameter combinations, and several performance criteria such as the cost-function error and the number of iterations in the algorithms proposed. The final one led to error values between ground truth and estimated values of µs and µa less than 6%. PMID:27410289

  17. Cancer Feature Selection and Classification Using a Binary Quantum-Behaved Particle Swarm Optimization and Support Vector Machine

    PubMed Central

    Sun, Jun; Liu, Li; Fan, Fangyun; Wu, Xiaojun

    2016-01-01

    This paper focuses on the feature gene selection for cancer classification, which employs an optimization algorithm to select a subset of the genes. We propose a binary quantum-behaved particle swarm optimization (BQPSO) for cancer feature gene selection, coupling support vector machine (SVM) for cancer classification. First, the proposed BQPSO algorithm is described, which is a discretized version of original QPSO for binary 0-1 optimization problems. Then, we present the principle and procedure for cancer feature gene selection and cancer classification based on BQPSO and SVM with leave-one-out cross validation (LOOCV). Finally, the BQPSO coupling SVM (BQPSO/SVM), binary PSO coupling SVM (BPSO/SVM), and genetic algorithm coupling SVM (GA/SVM) are tested for feature gene selection and cancer classification on five microarray data sets, namely, Leukemia, Prostate, Colon, Lung, and Lymphoma. The experimental results show that BQPSO/SVM has significant advantages in accuracy, robustness, and the number of feature genes selected compared with the other two algorithms. PMID:27642363

  18. Cancer Feature Selection and Classification Using a Binary Quantum-Behaved Particle Swarm Optimization and Support Vector Machine

    PubMed Central

    Sun, Jun; Liu, Li; Fan, Fangyun; Wu, Xiaojun

    2016-01-01

    This paper focuses on the feature gene selection for cancer classification, which employs an optimization algorithm to select a subset of the genes. We propose a binary quantum-behaved particle swarm optimization (BQPSO) for cancer feature gene selection, coupling support vector machine (SVM) for cancer classification. First, the proposed BQPSO algorithm is described, which is a discretized version of original QPSO for binary 0-1 optimization problems. Then, we present the principle and procedure for cancer feature gene selection and cancer classification based on BQPSO and SVM with leave-one-out cross validation (LOOCV). Finally, the BQPSO coupling SVM (BQPSO/SVM), binary PSO coupling SVM (BPSO/SVM), and genetic algorithm coupling SVM (GA/SVM) are tested for feature gene selection and cancer classification on five microarray data sets, namely, Leukemia, Prostate, Colon, Lung, and Lymphoma. The experimental results show that BQPSO/SVM has significant advantages in accuracy, robustness, and the number of feature genes selected compared with the other two algorithms.

  19. Cancer Feature Selection and Classification Using a Binary Quantum-Behaved Particle Swarm Optimization and Support Vector Machine.

    PubMed

    Xi, Maolong; Sun, Jun; Liu, Li; Fan, Fangyun; Wu, Xiaojun

    2016-01-01

    This paper focuses on the feature gene selection for cancer classification, which employs an optimization algorithm to select a subset of the genes. We propose a binary quantum-behaved particle swarm optimization (BQPSO) for cancer feature gene selection, coupling support vector machine (SVM) for cancer classification. First, the proposed BQPSO algorithm is described, which is a discretized version of original QPSO for binary 0-1 optimization problems. Then, we present the principle and procedure for cancer feature gene selection and cancer classification based on BQPSO and SVM with leave-one-out cross validation (LOOCV). Finally, the BQPSO coupling SVM (BQPSO/SVM), binary PSO coupling SVM (BPSO/SVM), and genetic algorithm coupling SVM (GA/SVM) are tested for feature gene selection and cancer classification on five microarray data sets, namely, Leukemia, Prostate, Colon, Lung, and Lymphoma. The experimental results show that BQPSO/SVM has significant advantages in accuracy, robustness, and the number of feature genes selected compared with the other two algorithms. PMID:27642363

  20. Thickness of the particle swarm in cosmic ray air showers

    NASA Technical Reports Server (NTRS)

    Linsley, J.

    1985-01-01

    The average dispersion in arrival time of air shower particles detected with a scintillator at an impact parameter r is described with accuracy 5-10% by the empirical formula sigma = Sigma sub to (1+r/r sub t) sup b, where Sigma sub to = 2.6 ns, r sub t = 30m and b = (1.94 + or - .08) (0.39 + or - .06) sec Theta, for r 2 km, 10 to the 8th power E 10 to the 11th power GeV, and Theta 60 deg. (E is the primary energy and theta is the zenith angle). The amount of fluctuation in sigma sub t due to fluctuations in the level of origin and shower development is less than 20%. These results provide a basis for estimating the impact parameters of very larger showers with data from very small detector arrays (mini-arrays). The energy of such showers can then be estimated from the local particle density. The formula also provides a basis for estimating the angular resolution of air shower array-telescopes.

  1. Cooperative search and rescue with artificial fishes based on fish-swarm algorithm for underwater wireless sensor networks.

    PubMed

    Zhao, Wei; Tang, Zhenmin; Yang, Yuwang; Wang, Lei; Lan, Shaohua

    2014-01-01

    This paper presents a searching control approach for cooperating mobile sensor networks. We use a density function to represent the frequency of distress signals issued by victims. The mobile nodes' moving in mission space is similar to the behaviors of fish-swarm in water. So, we take the mobile node as artificial fish node and define its operations by a probabilistic model over a limited range. A fish-swarm based algorithm is designed requiring local information at each fish node and maximizing the joint detection probabilities of distress signals. Optimization of formation is also considered for the searching control approach and is optimized by fish-swarm algorithm. Simulation results include two schemes: preset route and random walks, and it is showed that the control scheme has adaptive and effective properties. PMID:24741341

  2. Cooperative search and rescue with artificial fishes based on fish-swarm algorithm for underwater wireless sensor networks.

    PubMed

    Zhao, Wei; Tang, Zhenmin; Yang, Yuwang; Wang, Lei; Lan, Shaohua

    2014-01-01

    This paper presents a searching control approach for cooperating mobile sensor networks. We use a density function to represent the frequency of distress signals issued by victims. The mobile nodes' moving in mission space is similar to the behaviors of fish-swarm in water. So, we take the mobile node as artificial fish node and define its operations by a probabilistic model over a limited range. A fish-swarm based algorithm is designed requiring local information at each fish node and maximizing the joint detection probabilities of distress signals. Optimization of formation is also considered for the searching control approach and is optimized by fish-swarm algorithm. Simulation results include two schemes: preset route and random walks, and it is showed that the control scheme has adaptive and effective properties.

  3. Cooperative Search and Rescue with Artificial Fishes Based on Fish-Swarm Algorithm for Underwater Wireless Sensor Networks

    PubMed Central

    Zhao, Wei; Tang, Zhenmin; Yang, Yuwang; Wang, Lei; Lan, Shaohua

    2014-01-01

    This paper presents a searching control approach for cooperating mobile sensor networks. We use a density function to represent the frequency of distress signals issued by victims. The mobile nodes' moving in mission space is similar to the behaviors of fish-swarm in water. So, we take the mobile node as artificial fish node and define its operations by a probabilistic model over a limited range. A fish-swarm based algorithm is designed requiring local information at each fish node and maximizing the joint detection probabilities of distress signals. Optimization of formation is also considered for the searching control approach and is optimized by fish-swarm algorithm. Simulation results include two schemes: preset route and random walks, and it is showed that the control scheme has adaptive and effective properties. PMID:24741341

  4. Optimum selection of mechanism type for heavy manipulators based on particle swarm optimization method

    NASA Astrophysics Data System (ADS)

    Zhao, Yong; Chen, Genliang; Wang, Hao; Lin, Zhongqin

    2013-07-01

    The mechanism type plays a decisive role in the mechanical performance of robotic manipulators. Feasible mechanism types can be obtained by applying appropriate type synthesis theory, but there is still a lack of effective and efficient methods for the optimum selection among different types of mechanism candidates. This paper presents a new strategy for the purpose of optimum mechanism type selection based on the modified particle swarm optimization method. The concept of sub-swarm is introduced to represent the different mechanisms generated by the type synthesis, and a competitive mechanism is employed between the sub-swarms to reassign their population size according to the relative performances of the mechanism candidates to implement the optimization. Combining with a modular modeling approach for fast calculation of the performance index of the potential candidates, the proposed method is applied to determine the optimum mechanism type among the potential candidates for the desired manipulator. The effectiveness and efficiency of the proposed method is demonstrated through a case study on the optimum selection of mechanism type of a heavy manipulator where six feasible candidates are considered with force capability as the specific performance index. The optimization result shows that the fitness of the optimum mechanism type for the considered heavy manipulator can be up to 0.578 5. This research provides the instruction in optimum selection of mechanism types for robotic manipulators.

  5. Solving Single Machine Total Weighted Tardiness Problem with Unequal Release Date Using Neurohybrid Particle Swarm Optimization Approach

    PubMed Central

    Cakar, Tarik; Koker, Rasit

    2015-01-01

    A particle swarm optimization algorithm (PSO) has been used to solve the single machine total weighted tardiness problem (SMTWT) with unequal release date. To find the best solutions three different solution approaches have been used. To prepare subhybrid solution system, genetic algorithms (GA) and simulated annealing (SA) have been used. In the subhybrid system (GA and SA), GA obtains a solution in any stage, that solution is taken by SA and used as an initial solution. When SA finds better solution than this solution, it stops working and gives this solution to GA again. After GA finishes working the obtained solution is given to PSO. PSO searches for better solution than this solution. Later it again sends the obtained solution to GA. Three different solution systems worked together. Neurohybrid system uses PSO as the main optimizer and SA and GA have been used as local search tools. For each stage, local optimizers are used to perform exploitation to the best particle. In addition to local search tools, neurodominance rule (NDR) has been used to improve performance of last solution of hybrid-PSO system. NDR checked sequential jobs according to total weighted tardiness factor. All system is named as neurohybrid-PSO solution system. PMID:26221134

  6. Investigation on particle swarm optimisation for feature selection on high-dimensional data: local search and selection bias

    NASA Astrophysics Data System (ADS)

    Tran, Binh; Xue, Bing; Zhang, Mengjie; Nguyen, Su

    2016-07-01

    Feature selection is an essential step in classification tasks with a large number of features, such as in gene expression data. Recent research has shown that particle swarm optimisation (PSO) is a promising approach to feature selection. However, it also has potential limitation to get stuck into local optima, especially for gene selection problems with a huge search space. Therefore, we developed a PSO algorithm (PSO-LSRG) with a fast "local search" combined with a gbest resetting mechanism as a way to improve the performance of PSO for feature selection. Furthermore, since many existing PSO-based feature selection approaches on the gene expression data have feature selection bias, i.e. no unseen test data is used, 2 sets of experiments on 10 gene expression datasets were designed: with and without feature selection bias. As compared to standard PSO, PSO with gbest resetting only, and PSO with local search only, PSO-LSRG obtained a substantial dimensionality reduction and a significant improvement on the classification performance in both sets of experiments. PSO-LSRG outperforms the other three algorithms when feature selection bias exists. When there is no feature selection bias, PSO-LSRG selects the smallest number of features in all cases, but the classification performance is slightly worse in a few cases, which may be caused by the overfitting problem. This shows that feature selection bias should be avoided when designing a feature selection algorithm to ensure its generalisation ability on unseen data.

  7. A particle swarm model for estimating reliability and scheduling system maintenance

    NASA Astrophysics Data System (ADS)

    Puzis, Rami; Shirtz, Dov; Elovici, Yuval

    2016-05-01

    Modifying data and information system components may introduce new errors and deteriorate the reliability of the system. Reliability can be efficiently regained with reliability centred maintenance, which requires reliability estimation for maintenance scheduling. A variant of the particle swarm model is used to estimate reliability of systems implemented according to the model view controller paradigm. Simulations based on data collected from an online system of a large financial institute are used to compare three component-level maintenance policies. Results show that appropriately scheduled component-level maintenance greatly reduces the cost of upholding an acceptable level of reliability by reducing the need in system-wide maintenance.

  8. Accurate FDTD modelling for dispersive media using rational function and particle swarm optimisation

    NASA Astrophysics Data System (ADS)

    Chung, Haejun; Ha, Sang-Gyu; Choi, Jaehoon; Jung, Kyung-Young

    2015-07-01

    This article presents an accurate finite-difference time domain (FDTD) dispersive modelling suitable for complex dispersive media. A quadratic complex rational function (QCRF) is used to characterise their dispersive relations. To obtain accurate coefficients of QCRF, in this work, we use an analytical approach and a particle swarm optimisation (PSO) simultaneously. In specific, an analytical approach is used to obtain the QCRF matrix-solving equation and PSO is applied to adjust a weighting function of this equation. Numerical examples are used to illustrate the validity of the proposed FDTD dispersion model.

  9. Multi-Objective Bidding Strategy for Genco Using Non-Dominated Sorting Particle Swarm Optimization

    NASA Astrophysics Data System (ADS)

    Saksinchai, Apinat; Boonchuay, Chanwit; Ongsakul, Weerakorn

    2010-06-01

    This paper proposes a multi-objective bidding strategy for a generation company (GenCo) in uniform price spot market using non-dominated sorting particle swarm optimization (NSPSO). Instead of using a tradeoff technique, NSPSO is introduced to solve the multi-objective strategic bidding problem considering expected profit maximization and risk (profit variation) minimization. Monte Carlo simulation is employed to simulate rivals' bidding behavior. Test results indicate that the proposed approach can provide the efficient non-dominated solution front effectively. In addition, it can be used as a decision making tool for a GenCo compromising between expected profit and price risk in spot market.

  10. Finding common quadratic Lyapunov functions for switched linear systems using particle swarm optimisation

    NASA Astrophysics Data System (ADS)

    Ordóñez-Hurtado, R. H.; Duarte-Mermoud, M. A.

    2012-01-01

    It is undoubtedly important to be able to ensure the existence of a common quadratic Lyapunov function (CQLF) for a given switched system because this is proof of its asymptotic stability, but equally important is the ability to calculate it in order to obtain more specific information about the behaviour of the switched system under analysis. This article describes the development of a new methodology for calculating a CQLF based on particle swarm optimisation (PSO) once the existence of a CQLF has been assured. Several comparative analyses are presented to show the strengths and advantages of the proposed methodology.

  11. An Integer-Coded Chaotic Particle Swarm Optimization for Traveling Salesman Problem

    NASA Astrophysics Data System (ADS)

    Yue, Chen; Yan-Duo, Zhang; Jing, Lu; Hui, Tian

    Traveling Salesman Problem (TSP) is one of NP-hard combinatorial optimization problems, which will experience “combination explosion” when the problem goes beyond a certain size. Therefore, it has been a hot topic to search an effective solving method. The general mathematical model of TSP is discussed, and its permutation and combination based model is presented. Based on these, Integer-coded Chaotic Particle Swarm Optimization for solving TSP is proposed. Where, particle is encoded with integer; chaotic sequence is used to guide global search; and particle varies its positions via “flying”. With a typical 20-citys TSP as instance, the simulation experiment of comparing ICPSO with GA is carried out. Experimental results demonstrate that ICPSO is simple but effective, and better than GA at performance.

  12. Algorithm for Computing Particle/Surface Interactions

    NASA Technical Reports Server (NTRS)

    Hughes, David W.

    2009-01-01

    An algorithm has been devised for predicting the behaviors of sparsely spatially distributed particles impinging on a solid surface in a rarefied atmosphere. Under the stated conditions, prior particle-transport models in which (1) dense distributions of particles are treated as continuum fluids; or (2) sparse distributions of particles are considered to be suspended in and to diffuse through fluid streams are not valid.

  13. Energy-Aware Multipath Routing Scheme Based on Particle Swarm Optimization in Mobile Ad Hoc Networks.

    PubMed

    Robinson, Y Harold; Rajaram, M

    2015-01-01

    Mobile ad hoc network (MANET) is a collection of autonomous mobile nodes forming an ad hoc network without fixed infrastructure. Dynamic topology property of MANET may degrade the performance of the network. However, multipath selection is a great challenging task to improve the network lifetime. We proposed an energy-aware multipath routing scheme based on particle swarm optimization (EMPSO) that uses continuous time recurrent neural network (CTRNN) to solve optimization problems. CTRNN finds the optimal loop-free paths to solve link disjoint paths in a MANET. The CTRNN is used as an optimum path selection technique that produces a set of optimal paths between source and destination. In CTRNN, particle swarm optimization (PSO) method is primly used for training the RNN. The proposed scheme uses the reliability measures such as transmission cost, energy factor, and the optimal traffic ratio between source and destination to increase routing performance. In this scheme, optimal loop-free paths can be found using PSO to seek better link quality nodes in route discovery phase. PSO optimizes a problem by iteratively trying to get a better solution with regard to a measure of quality. The proposed scheme discovers multiple loop-free paths by using PSO technique. PMID:26819966

  14. Energy-Aware Multipath Routing Scheme Based on Particle Swarm Optimization in Mobile Ad Hoc Networks

    PubMed Central

    Robinson, Y. Harold; Rajaram, M.

    2015-01-01

    Mobile ad hoc network (MANET) is a collection of autonomous mobile nodes forming an ad hoc network without fixed infrastructure. Dynamic topology property of MANET may degrade the performance of the network. However, multipath selection is a great challenging task to improve the network lifetime. We proposed an energy-aware multipath routing scheme based on particle swarm optimization (EMPSO) that uses continuous time recurrent neural network (CTRNN) to solve optimization problems. CTRNN finds the optimal loop-free paths to solve link disjoint paths in a MANET. The CTRNN is used as an optimum path selection technique that produces a set of optimal paths between source and destination. In CTRNN, particle swarm optimization (PSO) method is primly used for training the RNN. The proposed scheme uses the reliability measures such as transmission cost, energy factor, and the optimal traffic ratio between source and destination to increase routing performance. In this scheme, optimal loop-free paths can be found using PSO to seek better link quality nodes in route discovery phase. PSO optimizes a problem by iteratively trying to get a better solution with regard to a measure of quality. The proposed scheme discovers multiple loop-free paths by using PSO technique. PMID:26819966

  15. Energy-Aware Multipath Routing Scheme Based on Particle Swarm Optimization in Mobile Ad Hoc Networks.

    PubMed

    Robinson, Y Harold; Rajaram, M

    2015-01-01

    Mobile ad hoc network (MANET) is a collection of autonomous mobile nodes forming an ad hoc network without fixed infrastructure. Dynamic topology property of MANET may degrade the performance of the network. However, multipath selection is a great challenging task to improve the network lifetime. We proposed an energy-aware multipath routing scheme based on particle swarm optimization (EMPSO) that uses continuous time recurrent neural network (CTRNN) to solve optimization problems. CTRNN finds the optimal loop-free paths to solve link disjoint paths in a MANET. The CTRNN is used as an optimum path selection technique that produces a set of optimal paths between source and destination. In CTRNN, particle swarm optimization (PSO) method is primly used for training the RNN. The proposed scheme uses the reliability measures such as transmission cost, energy factor, and the optimal traffic ratio between source and destination to increase routing performance. In this scheme, optimal loop-free paths can be found using PSO to seek better link quality nodes in route discovery phase. PSO optimizes a problem by iteratively trying to get a better solution with regard to a measure of quality. The proposed scheme discovers multiple loop-free paths by using PSO technique.

  16. Performance evaluation of different types of particle representation procedures of Particle Swarm Optimization in Job-shop Scheduling Problems

    NASA Astrophysics Data System (ADS)

    Izah Anuar, Nurul; Saptari, Adi

    2016-02-01

    This paper addresses the types of particle representation (encoding) procedures in a population-based stochastic optimization technique in solving scheduling problems known in the job-shop manufacturing environment. It intends to evaluate and compare the performance of different particle representation procedures in Particle Swarm Optimization (PSO) in the case of solving Job-shop Scheduling Problems (JSP). Particle representation procedures refer to the mapping between the particle position in PSO and the scheduling solution in JSP. It is an important step to be carried out so that each particle in PSO can represent a schedule in JSP. Three procedures such as Operation and Particle Position Sequence (OPPS), random keys representation and random-key encoding scheme are used in this study. These procedures have been tested on FT06 and FT10 benchmark problems available in the OR-Library, where the objective function is to minimize the makespan by the use of MATLAB software. Based on the experimental results, it is discovered that OPPS gives the best performance in solving both benchmark problems. The contribution of this paper is the fact that it demonstrates to the practitioners involved in complex scheduling problems that different particle representation procedures can have significant effects on the performance of PSO in solving JSP.

  17. An optimized watermarking scheme using an encrypted gyrator transform computer generated hologram based on particle swarm optimization.

    PubMed

    Li, Jianzhong

    2014-04-21

    In this paper, a novel secure optimal image watermarking scheme using an encrypted gyrator transform computer generated hologram (CGH) in the contourlet domain is presented. A new encrypted CGH technique, which is based on the gyrator transform, the random phase mask, the three-step phase-shifting interferometry and the Fibonacci transform, has been proposed to produce a hologram of a watermark first. With the huge key space of the encrypted CGH, the security strength of the watermarking system is enhanced. To achieve better imperceptibility, an improved quantization embedding algorithm is proposed to embed the encrypted CGH into the low frequency sub-band of the contourlet-transformed host image. In order to obtain the highest possible robustness without losing the imperceptibility, particle swarm optimization algorithm is employed to search the optimal embedding parameter of the watermarking system. In comparison with other method, the proposed watermarking scheme offers better performances for both imperceptibility and robustness. Experimental results demonstrate that the proposed image watermarking is not only secure and invisible, but also robust against a variety of attacks.

  18. An optimized watermarking scheme using an encrypted gyrator transform computer generated hologram based on particle swarm optimization.

    PubMed

    Li, Jianzhong

    2014-04-21

    In this paper, a novel secure optimal image watermarking scheme using an encrypted gyrator transform computer generated hologram (CGH) in the contourlet domain is presented. A new encrypted CGH technique, which is based on the gyrator transform, the random phase mask, the three-step phase-shifting interferometry and the Fibonacci transform, has been proposed to produce a hologram of a watermark first. With the huge key space of the encrypted CGH, the security strength of the watermarking system is enhanced. To achieve better imperceptibility, an improved quantization embedding algorithm is proposed to embed the encrypted CGH into the low frequency sub-band of the contourlet-transformed host image. In order to obtain the highest possible robustness without losing the imperceptibility, particle swarm optimization algorithm is employed to search the optimal embedding parameter of the watermarking system. In comparison with other method, the proposed watermarking scheme offers better performances for both imperceptibility and robustness. Experimental results demonstrate that the proposed image watermarking is not only secure and invisible, but also robust against a variety of attacks. PMID:24787882

  19. PSO Algorithm Particle Filters for Improving the Performance of Lane Detection and Tracking Systems in Difficult Roads

    PubMed Central

    Cheng, Wen-Chang

    2012-01-01

    In this paper we propose a robust lane detection and tracking method by combining particle filters with the particle swarm optimization method. This method mainly uses the particle filters to detect and track the local optimum of the lane model in the input image and then seeks the global optimal solution of the lane model by a particle swarm optimization method. The particle filter can effectively complete lane detection and tracking in complicated or variable lane environments. However, the result obtained is usually a local optimal system status rather than the global optimal system status. Thus, the particle swarm optimization method is used to further refine the global optimal system status in all system statuses. Since the particle swarm optimization method is a global optimization algorithm based on iterative computing, it can find the global optimal lane model by simulating the food finding way of fish school or insects under the mutual cooperation of all particles. In verification testing, the test environments included highways and ordinary roads as well as straight and curved lanes, uphill and downhill lanes, lane changes, etc. Our proposed method can complete the lane detection and tracking more accurately and effectively then existing options. PMID:23235453

  20. Asynchronous Event-Driven Particle Algorithms

    SciTech Connect

    Donev, A

    2007-02-28

    We present in a unifying way the main components of three examples of asynchronous event-driven algorithms for simulating physical systems of interacting particles. The first example, hard-particle molecular dynamics (MD), is well-known. We also present a recently-developed diffusion kinetic Monte Carlo (DKMC) algorithm, as well as a novel event-driven algorithm for Direct Simulation Monte Carlo (DSMC). Finally, we describe how to combine MD with DSMC in an event-driven framework, and discuss some promises and challenges for event-driven simulation of realistic physical systems.

  1. Asynchronous Event-Driven Particle Algorithms

    SciTech Connect

    Donev, A

    2007-08-30

    We present, in a unifying way, the main components of three asynchronous event-driven algorithms for simulating physical systems of interacting particles. The first example, hard-particle molecular dynamics (MD), is well-known. We also present a recently-developed diffusion kinetic Monte Carlo (DKMC) algorithm, as well as a novel stochastic molecular-dynamics algorithm that builds on the Direct Simulation Monte Carlo (DSMC). We explain how to effectively combine event-driven and classical time-driven handling, and discuss some promises and challenges for event-driven simulation of realistic physical systems.

  2. Computational methods of Gaussian Particle Swarm Optimization (GPSO) and Lagrange Multiplier on economic dispatch issues (case study on electrical system of Java-Bali IV area)

    NASA Astrophysics Data System (ADS)

    Komsiyah, S.

    2014-03-01

    The objective in this paper is about economic dispatch problem of electric power generation where scheduling the committed generating units outputs so as to meet the required load demand at minimum operating cost, while satisfying all units and system equality and inequality constraint. In the operating of electric power system, an economic planning problem is one of variables that its must be considered since economically planning will give more efficiency in operational cost. In this paper the economic dispatch problem which has non linear cost function solved by using swarm intelligent method is Gaussian Particle Swarm Optimization (GPSO) and Lagrange Multiplier. GPSO is a population-based stochastic algorithms which their moving inspired by swarm intelligent and probabilities theories. To analize its accuracy, the economic dispatch solution by GPSO method will be compared with Lagrange multiplier method. From the running test result the GPSO method give economically planning calculation which it better than Lagrange multiplier method and the GPSO method faster to getting error convergence. Therefore the GPSO method have better performance to getting global best solution than the Lagrange method.

  3. Integrative modeling and novel particle swarm-based optimal design of wind farms

    NASA Astrophysics Data System (ADS)

    Chowdhury, Souma

    To meet the energy needs of the future, while seeking to decrease our carbon footprint, a greater penetration of sustainable energy resources such as wind energy is necessary. However, a consistent growth of wind energy (especially in the wake of unfortunate policy changes and reported under-performance of existing projects) calls for a paradigm shift in wind power generation technologies. This dissertation develops a comprehensive methodology to explore, analyze and define the interactions between the key elements of wind farm development, and establish the foundation for designing high-performing wind farms. The primary contribution of this research is the effective quantification of the complex combined influence of wind turbine features, turbine placement, farm-land configuration, nameplate capacity, and wind resource variations on the energy output of the wind farm. A new Particle Swarm Optimization (PSO) algorithm, uniquely capable of preserving population diversity while addressing discrete variables, is also developed to provide powerful solutions towards optimizing wind farm configurations. In conventional wind farm design, the major elements that influence the farm performance are often addressed individually. The failure to fully capture the critical interactions among these factors introduces important inaccuracies in the projected farm performance and leads to suboptimal wind farm planning. In this dissertation, we develop the Unrestricted Wind Farm Layout Optimization (UWFLO) methodology to model and optimize the performance of wind farms. The UWFLO method obviates traditional assumptions regarding (i) turbine placement, (ii) turbine-wind flow interactions, (iii) variation of wind conditions, and (iv) types of turbines (single/multiple) to be installed. The allowance of multiple turbines, which demands complex modeling, is rare in the existing literature. The UWFLO method also significantly advances the state of the art in wind farm optimization by

  4. Multi-Sensor Detection with Particle Swarm Optimization for Time-Frequency Coded Cooperative WSNs Based on MC-CDMA for Underground Coal Mines.

    PubMed

    Xu, Jingjing; Yang, Wei; Zhang, Linyuan; Han, Ruisong; Shao, Xiaotao

    2015-08-27

    In this paper, a wireless sensor network (WSN) technology adapted to underground channel conditions is developed, which has important theoretical and practical value for safety monitoring in underground coal mines. According to the characteristics that the space, time and frequency resources of underground tunnel are open, it is proposed to constitute wireless sensor nodes based on multicarrier code division multiple access (MC-CDMA) to make full use of these resources. To improve the wireless transmission performance of source sensor nodes, it is also proposed to utilize cooperative sensors with good channel conditions from the sink node to assist source sensors with poor channel conditions. Moreover, the total power of the source sensor and its cooperative sensors is allocated on the basis of their channel conditions to increase the energy efficiency of the WSN. To solve the problem that multiple access interference (MAI) arises when multiple source sensors transmit monitoring information simultaneously, a kind of multi-sensor detection (MSD) algorithm with particle swarm optimization (PSO), namely D-PSO, is proposed for the time-frequency coded cooperative MC-CDMA WSN. Simulation results show that the average bit error rate (BER) performance of the proposed WSN in an underground coal mine is improved significantly by using wireless sensor nodes based on MC-CDMA, adopting time-frequency coded cooperative transmission and D-PSO algorithm with particle swarm optimization.

  5. Multi-Sensor Detection with Particle Swarm Optimization for Time-Frequency Coded Cooperative WSNs Based on MC-CDMA for Underground Coal Mines

    PubMed Central

    Xu, Jingjing; Yang, Wei; Zhang, Linyuan; Han, Ruisong; Shao, Xiaotao

    2015-01-01

    In this paper, a wireless sensor network (WSN) technology adapted to underground channel conditions is developed, which has important theoretical and practical value for safety monitoring in underground coal mines. According to the characteristics that the space, time and frequency resources of underground tunnel are open, it is proposed to constitute wireless sensor nodes based on multicarrier code division multiple access (MC-CDMA) to make full use of these resources. To improve the wireless transmission performance of source sensor nodes, it is also proposed to utilize cooperative sensors with good channel conditions from the sink node to assist source sensors with poor channel conditions. Moreover, the total power of the source sensor and its cooperative sensors is allocated on the basis of their channel conditions to increase the energy efficiency of the WSN. To solve the problem that multiple access interference (MAI) arises when multiple source sensors transmit monitoring information simultaneously, a kind of multi-sensor detection (MSD) algorithm with particle swarm optimization (PSO), namely D-PSO, is proposed for the time-frequency coded cooperative MC-CDMA WSN. Simulation results show that the average bit error rate (BER) performance of the proposed WSN in an underground coal mine is improved significantly by using wireless sensor nodes based on MC-CDMA, adopting time-frequency coded cooperative transmission and D-PSO algorithm with particle swarm optimization. PMID:26343660

  6. Multi-Sensor Detection with Particle Swarm Optimization for Time-Frequency Coded Cooperative WSNs Based on MC-CDMA for Underground Coal Mines.

    PubMed

    Xu, Jingjing; Yang, Wei; Zhang, Linyuan; Han, Ruisong; Shao, Xiaotao

    2015-01-01

    In this paper, a wireless sensor network (WSN) technology adapted to underground channel conditions is developed, which has important theoretical and practical value for safety monitoring in underground coal mines. According to the characteristics that the space, time and frequency resources of underground tunnel are open, it is proposed to constitute wireless sensor nodes based on multicarrier code division multiple access (MC-CDMA) to make full use of these resources. To improve the wireless transmission performance of source sensor nodes, it is also proposed to utilize cooperative sensors with good channel conditions from the sink node to assist source sensors with poor channel conditions. Moreover, the total power of the source sensor and its cooperative sensors is allocated on the basis of their channel conditions to increase the energy efficiency of the WSN. To solve the problem that multiple access interference (MAI) arises when multiple source sensors transmit monitoring information simultaneously, a kind of multi-sensor detection (MSD) algorithm with particle swarm optimization (PSO), namely D-PSO, is proposed for the time-frequency coded cooperative MC-CDMA WSN. Simulation results show that the average bit error rate (BER) performance of the proposed WSN in an underground coal mine is improved significantly by using wireless sensor nodes based on MC-CDMA, adopting time-frequency coded cooperative transmission and D-PSO algorithm with particle swarm optimization. PMID:26343660

  7. DOA estimation for local scattered CDMA signals by particle swarm optimization.

    PubMed

    Chang, Jhih-Chung

    2012-01-01

    This paper deals with the direction-of-arrival (DOA) estimation of local scattered code-division multiple access (CDMA) signals based on a particle swarm optimization (PSO) search. For conventional spectral searching estimators with local scattering, the searching complexity and estimating accuracy strictly depend on the number of search grids used during the search. In order to obtain high-resolution and accurate DOA estimation, a smaller grid size is needed. This is time consuming and it is unclear how to determine the required number of search grids. In this paper, a modified PSO is presented to reduce the required search grids for the conventional spectral searching estimator with the effects of local scattering. Finally, several computer simulations are provided for illustration and comparison.

  8. Particle swarm optimization-based radial basis function network for estimation of reference evapotranspiration

    NASA Astrophysics Data System (ADS)

    Petković, Dalibor; Gocic, Milan; Shamshirband, Shahaboddin; Qasem, Sultan Noman; Trajkovic, Slavisa

    2016-08-01

    Accurate estimation of the reference evapotranspiration (ET0) is important for the water resource planning and scheduling of irrigation systems. For this purpose, the radial basis function network with particle swarm optimization (RBFN-PSO) and radial basis function network with back propagation (RBFN-BP) were used in this investigation. The FAO-56 Penman-Monteith equation was used as reference equation to estimate ET0 for Serbia during the period of 1980-2010. The obtained simulation results confirmed the proposed models and were analyzed using the root mean-square error (RMSE), the mean absolute error (MAE), and the coefficient of determination ( R 2). The analysis showed that the RBFN-PSO had better statistical characteristics than RBFN-BP and can be helpful for the ET0 estimation.

  9. Particle swarm optimization method for the control of a fleet of Unmanned Aerial Vehicles

    NASA Astrophysics Data System (ADS)

    Belkadi, A.; Ciarletta, L.; Theilliol, D.

    2015-11-01

    This paper concerns a control approach of a fleet of Unmanned Aerial Vehicles (UAV) based on virtual leader. Among others, optimization methods are used to develop the virtual leader control approach, particularly the particle swarm optimization method (PSO). The goal is to find optimal positions at each instant of each UAV to guarantee the best performance of a given task by minimizing a predefined objective function. The UAVs are able to organize themselves on a 2D plane in a predefined architecture, following a mission led by a virtual leader and simultaneously avoiding collisions between various vehicles of the group. The global proposed method is independent from the model or the control of a particular UAV. The method is tested in simulation on a group of UAVs whose model is treated as a double integrator. Test results for the different cases are presented.

  10. Particle swarm optimization and its application in MEG source localization using single time sliced data

    NASA Astrophysics Data System (ADS)

    Lin, Juan; Liu, Chenglian; Guo, Yongning

    2014-10-01

    The estimation of neural active sources from the magnetoencephalography (MEG) data is a very critical issue for both clinical neurology and brain functions research. A widely accepted source-modeling technique for MEG involves calculating a set of equivalent current dipoles (ECDs). Depth in the brain is one of difficulties in MEG source localization. Particle swarm optimization(PSO) is widely used to solve various optimization problems. In this paper we discuss its ability and robustness to find the global optimum in different depths of the brain when using single equivalent current dipole (sECD) model and single time sliced data. The results show that PSO is an effective global optimization to MEG source localization when given one dipole in different depths.

  11. Estimating stellar effective temperatures and detected angular parameters using stochastic particle swarm optimization

    NASA Astrophysics Data System (ADS)

    Zhang, Chuan-Xin; Yuan, Yuan; Zhang, Hao-Wei; Shuai, Yong; Tan, He-Ping

    2016-09-01

    Considering features of stellar spectral radiation and sky surveys, we established a computational model for stellar effective temperatures, detected angular parameters and gray rates. Using known stellar flux data in some bands, we estimated stellar effective temperatures and detected angular parameters using stochastic particle swarm optimization (SPSO). We first verified the reliability of SPSO, and then determined reasonable parameters that produced highly accurate estimates under certain gray deviation levels. Finally, we calculated 177 860 stellar effective temperatures and detected angular parameters using data from the Midcourse Space Experiment (MSX) catalog. These derived stellar effective temperatures were accurate when we compared them to known values from literatures. This research makes full use of catalog data and presents an original technique for studying stellar characteristics. It proposes a novel method for calculating stellar effective temperatures and detecting angular parameters, and provides theoretical and practical data for finding information about radiation in any band.

  12. Accuracy and precisions of water quality parameters retrieved from particle swarm optimisation in a sub-tropical lake

    NASA Astrophysics Data System (ADS)

    Campbell, Glenn; Phinn, Stuart R.

    2009-09-01

    Optical remote sensing has been used to map and monitor water quality parameters such as the concentrations of hydrosols (chlorophyll and other pigments, total suspended material, and coloured dissolved organic matter). In the inversion / optimisation approach a forward model is used to simulate the water reflectance spectra from a set of parameters and the set that gives the closest match is selected as the solution. The accuracy of the hydrosol retrieval is dependent on an efficient search of the solution space and the reliability of the similarity measure. In this paper the Particle Swarm Optimisation (PSO) was used to search the solution space and seven similarity measures were trialled. The accuracy and precision of this method depends on the inherent noise in the spectral bands of the sensor being employed, as well as the radiometric corrections applied to images to calculate the subsurface reflectance. Using the Hydrolight® radiative transfer model and typical hydrosol concentrations from Lake Wivenhoe, Australia, MERIS reflectance spectra were simulated. The accuracy and precision of hydrosol concentrations derived from each similarity measure were evaluated after errors associated with the air-water interface correction, atmospheric correction and the IOP measurement were modelled and applied to the simulated reflectance spectra. The use of band specific empirically estimated values for the anisotropy value in the forward model improved the accuracy of hydrosol retrieval. The results of this study will be used to improve an algorithm for the remote sensing of water quality for freshwater impoundments.

  13. A Hybrid Method for Image Segmentation Based on Artificial Fish Swarm Algorithm and Fuzzy c-Means Clustering.

    PubMed

    Ma, Li; Li, Yang; Fan, Suohai; Fan, Runzhu

    2015-01-01

    Image segmentation plays an important role in medical image processing. Fuzzy c-means (FCM) clustering is one of the popular clustering algorithms for medical image segmentation. However, FCM has the problems of depending on initial clustering centers, falling into local optimal solution easily, and sensitivity to noise disturbance. To solve these problems, this paper proposes a hybrid artificial fish swarm algorithm (HAFSA). The proposed algorithm combines artificial fish swarm algorithm (AFSA) with FCM whose advantages of global optimization searching and parallel computing ability of AFSA are utilized to find a superior result. Meanwhile, Metropolis criterion and noise reduction mechanism are introduced to AFSA for enhancing the convergence rate and antinoise ability. The artificial grid graph and Magnetic Resonance Imaging (MRI) are used in the experiments, and the experimental results show that the proposed algorithm has stronger antinoise ability and higher precision. A number of evaluation indicators also demonstrate that the effect of HAFSA is more excellent than FCM and suppressed FCM (SFCM). PMID:26649068

  14. Neural Network Algorithm for Particle Loading

    SciTech Connect

    J. L. V. Lewandowski

    2003-04-25

    An artificial neural network algorithm for continuous minimization is developed and applied to the case of numerical particle loading. It is shown that higher-order moments of the probability distribution function can be efficiently renormalized using this technique. A general neural network for the renormalization of an arbitrary number of moments is given.

  15. The contribution of particle swarm optimization to three-dimensional slope stability analysis.

    PubMed

    Kalatehjari, Roohollah; Rashid, Ahmad Safuan A; Ali, Nazri; Hajihassani, Mohsen

    2014-01-01

    Over the last few years, particle swarm optimization (PSO) has been extensively applied in various geotechnical engineering including slope stability analysis. However, this contribution was limited to two-dimensional (2D) slope stability analysis. This paper applied PSO in three-dimensional (3D) slope stability problem to determine the critical slip surface (CSS) of soil slopes. A detailed description of adopted PSO was presented to provide a good basis for more contribution of this technique to the field of 3D slope stability problems. A general rotating ellipsoid shape was introduced as the specific particle for 3D slope stability analysis. A detailed sensitivity analysis was designed and performed to find the optimum values of parameters of PSO. Example problems were used to evaluate the applicability of PSO in determining the CSS of 3D slopes. The first example presented a comparison between the results of PSO and PLAXI-3D finite element software and the second example compared the ability of PSO to determine the CSS of 3D slopes with other optimization methods from the literature. The results demonstrated the efficiency and effectiveness of PSO in determining the CSS of 3D soil slopes. PMID:24991652

  16. Conformational sampling enhancement of replica exchange molecular dynamics simulations using swarm particle intelligence

    SciTech Connect

    Kamberaj, Hiqmet

    2015-09-28

    In this paper, we present a new method based on swarm particle social intelligence for use in replica exchange molecular dynamics simulations. In this method, the replicas (representing the different system configurations) are allowed communicating with each other through the individual and social knowledge, in additional to considering them as a collection of real particles interacting through the Newtonian forces. The new method is based on the modification of the equations of motion in such way that the replicas are driven towards the global energy minimum. The method was tested for the Lennard-Jones clusters of N = 4,  5, and 6 atoms. Our results showed that the new method is more efficient than the conventional replica exchange method under the same practical conditions. In particular, the new method performed better on optimizing the distribution of the replicas among the thermostats with time and, in addition, ergodic convergence is observed to be faster. We also introduce a weighted histogram analysis method allowing analyzing the data from simulations by combining data from all of the replicas and rigorously removing the inserted bias.

  17. The Contribution of Particle Swarm Optimization to Three-Dimensional Slope Stability Analysis

    PubMed Central

    A Rashid, Ahmad Safuan; Ali, Nazri

    2014-01-01

    Over the last few years, particle swarm optimization (PSO) has been extensively applied in various geotechnical engineering including slope stability analysis. However, this contribution was limited to two-dimensional (2D) slope stability analysis. This paper applied PSO in three-dimensional (3D) slope stability problem to determine the critical slip surface (CSS) of soil slopes. A detailed description of adopted PSO was presented to provide a good basis for more contribution of this technique to the field of 3D slope stability problems. A general rotating ellipsoid shape was introduced as the specific particle for 3D slope stability analysis. A detailed sensitivity analysis was designed and performed to find the optimum values of parameters of PSO. Example problems were used to evaluate the applicability of PSO in determining the CSS of 3D slopes. The first example presented a comparison between the results of PSO and PLAXI-3D finite element software and the second example compared the ability of PSO to determine the CSS of 3D slopes with other optimization methods from the literature. The results demonstrated the efficiency and effectiveness of PSO in determining the CSS of 3D soil slopes. PMID:24991652

  18. Conformational sampling enhancement of replica exchange molecular dynamics simulations using swarm particle intelligence

    NASA Astrophysics Data System (ADS)

    Kamberaj, Hiqmet

    2015-09-01

    In this paper, we present a new method based on swarm particle social intelligence for use in replica exchange molecular dynamics simulations. In this method, the replicas (representing the different system configurations) are allowed communicating with each other through the individual and social knowledge, in additional to considering them as a collection of real particles interacting through the Newtonian forces. The new method is based on the modification of the equations of motion in such way that the replicas are driven towards the global energy minimum. The method was tested for the Lennard-Jones clusters of N = 4, 5, and 6 atoms. Our results showed that the new method is more efficient than the conventional replica exchange method under the same practical conditions. In particular, the new method performed better on optimizing the distribution of the replicas among the thermostats with time and, in addition, ergodic convergence is observed to be faster. We also introduce a weighted histogram analysis method allowing analyzing the data from simulations by combining data from all of the replicas and rigorously removing the inserted bias.

  19. Partially linearized algorithms in gyrokinetic particle simulation

    SciTech Connect

    Dimits, A.M.; Lee, W.W.

    1990-10-01

    In this paper, particle simulation algorithms with time-varying weights for the gyrokinetic Vlasov-Poisson system have been developed. The primary purpose is to use them for the removal of the selected nonlinearities in the simulation of gradient-driven microturbulence so that the relative importance of the various nonlinear effects can be assessed. It is hoped that the use of these procedures will result in a better understanding of the transport mechanisms and scaling in tokamaks. Another application of these algorithms is for the improvement of the numerical properties of the simulation plasma. For instance, implementations of such algorithms (1) enable us to suppress the intrinsic numerical noise in the simulation, and (2) also make it possible to regulate the weights of the fast-moving particles and, in turn, to eliminate the associated high frequency oscillations. Examples of their application to drift-type instabilities in slab geometry are given. We note that the work reported here represents the first successful use of the weighted algorithms in particle codes for the nonlinear simulation of plasmas.

  20. NanoSWARM - A nano-satellite mission to measure particles and fields around the Moon

    NASA Astrophysics Data System (ADS)

    Garrick-Bethell, Ian; Russell, Christopher; Pieters, Carle; Weiss, Benjamin; Halekas, Jasper; Poppe, Andrew; Larson, Davin; Lawrence, David; Elphic, Richard; Hayne, Paul; Blakely, Richard; Kim, Khan-Hyuk; Choi, Young-Jun; Jin, Ho; Hemingway, Doug; Nayak, Michael; Puig-Suari, Jordi; Jaroux, Belgacem; Warwick, Steven

    2015-04-01

    The NanoSWARM mission concept uses a fleet of cubesats around the Moon to address a number of open problems in planetary science: 1) The mechanisms of space weathering, 2) The origins of planetary magnetism, 3) The origins, distributions, and migration processes of surface water on airless bodies, and 4) The physics of small-scale magnetospheres. To accomplish these goals, NanoSWARM targets scientifically rich features on the Moon known as swirls. Swirls are high-albedo features correlated with strong magnetic fields and low surface-water. NanoSWARM cubesats will make the first near-surface (<500 m altitude) measurements of solar wind flux and magnetic fields at swirls. NanoSWARM cubesats will also perform low-altitude neutron measurements to provide key constraints on the distribution of polar hydrogen concentrations, which are important volatile sinks in the lunar water cycle. To release its cubesats, NanoSWARM uses a high-heritage mother ship in a low altitude, polar, circular orbit. NanoSWARM's results will have direct applications to the geophysics, volatile distribution, and plasma physics of numerous other bodies, in particular asteroids and the terrestrial planets. The technologies and methods used by NanoSWARM will enable many new cubesat missions in the next decade, and expand the cubesat paradigm into deep space. NanoSWARM will be proposed as a NASA Discovery mission in early 2015.

  1. NanoSWARM: A Nano-satellite Mission to Measure Particles and Fields Around the Moon

    NASA Astrophysics Data System (ADS)

    Garrick-Bethell, I.

    2015-12-01

    The NanoSWARM mission concept uses a fleet of cubesats around the Moon to address a number of open problems in planetary science: 1) The mechanisms of space weathering, 2) The origins of planetary magnetism, 3) The origins, distributions, and migration processes of surface water on airless bodies, and 4) The physics of small-scale magnetospheres. To accomplish these goals, NanoSWARM targets scientifically rich features on the Moon known as swirls. Swirls are high-albedo features correlated with strong magnetic fields and low surface-water. NanoSWARM cubesats will make the first near-surface (<1 km altitude) measurements of solar wind flux and magnetic fields at swirls. NanoSWARM cubesats will also perform low-altitude neutron measurements to provide key constraints on the distribution of polar hydrogen concentrations, which are important volatile sinks in the lunar water cycle. To release its cubesats, NanoSWARM uses a high-heritage mother ship in a low altitude, polar, circular orbit. NanoSWARM's results will have direct applications to the geophysics, volatile distribution, and plasma physics of numerous other bodies, in particular asteroids and the terrestrial planets. The technologies and methods used by NanoSWARM will enable many new cubesat missions in the next decade. NanoSWARM was proposed as a NASA Discovery mission in February 2015.

  2. Python algorithms in particle tracking microrheology

    PubMed Central

    2012-01-01

    Background Particle tracking passive microrheology relates recorded trajectories of microbeads, embedded in soft samples, to the local mechanical properties of the sample. The method requires intensive numerical data processing and tools allowing control of the calculation errors. Results We report the development of a software package collecting functions and scripts written in Python for automated and manual data processing, to extract viscoelastic information about the sample using recorded particle trajectories. The resulting program package analyzes the fundamental diffusion characteristics of particle trajectories and calculates the frequency dependent complex shear modulus using methods published in the literature. In order to increase conversion accuracy, segmentwise, double step, range-adaptive fitting and dynamic sampling algorithms are introduced to interpolate the data in a splinelike manner. Conclusions The presented set of algorithms allows for flexible data processing for particle tracking microrheology. The package presents improved algorithms for mean square displacement estimation, controlling effects of frame loss during recording, and a novel numerical conversion method using segmentwise interpolation, decreasing the conversion error from about 100% to the order of 1%. PMID:23186362

  3. Trajectory planning of free-floating space robot using Particle Swarm Optimization (PSO)

    NASA Astrophysics Data System (ADS)

    Wang, Mingming; Luo, Jianjun; Walter, Ulrich

    2015-07-01

    This paper investigates the application of Particle Swarm Optimization (PSO) strategy to trajectory planning of the kinematically redundant space robot in free-floating mode. Due to the path dependent dynamic singularities, the volume of available workspace of the space robot is limited and enormous joint velocities are required when such singularities are met. In order to overcome this effect, the direct kinematics equations in conjunction with PSO are employed for trajectory planning of free-floating space robot. The joint trajectories are parametrized with the Bézier curve to simplify the calculation. Constrained PSO scheme with adaptive inertia weight is implemented to find the optimal solution of joint trajectories while specific objectives and imposed constraints are satisfied. The proposed method is not sensitive to the singularity issue due to the application of forward kinematic equations. Simulation results are presented for trajectory planning of 7 degree-of-freedom (DOF) redundant manipulator mounted on a free-floating spacecraft and demonstrate the effectiveness of the proposed method.

  4. Transformer Incipient Fault Prediction Using Combined Artificial Neural Network and Various Particle Swarm Optimisation Techniques

    PubMed Central

    2015-01-01

    It is important to predict the incipient fault in transformer oil accurately so that the maintenance of transformer oil can be performed correctly, reducing the cost of maintenance and minimise the error. Dissolved gas analysis (DGA) has been widely used to predict the incipient fault in power transformers. However, sometimes the existing DGA methods yield inaccurate prediction of the incipient fault in transformer oil because each method is only suitable for certain conditions. Many previous works have reported on the use of intelligence methods to predict the transformer faults. However, it is believed that the accuracy of the previously proposed methods can still be improved. Since artificial neural network (ANN) and particle swarm optimisation (PSO) techniques have never been used in the previously reported work, this work proposes a combination of ANN and various PSO techniques to predict the transformer incipient fault. The advantages of PSO are simplicity and easy implementation. The effectiveness of various PSO techniques in combination with ANN is validated by comparison with the results from the actual fault diagnosis, an existing diagnosis method and ANN alone. Comparison of the results from the proposed methods with the previously reported work was also performed to show the improvement of the proposed methods. It was found that the proposed ANN-Evolutionary PSO method yields the highest percentage of correct identification for transformer fault type than the existing diagnosis method and previously reported works. PMID:26103634

  5. Digital redesign of uncertain interval systems based on time-response resemblance via particle swarm optimization.

    PubMed

    Hsu, Chen-Chien; Lin, Geng-Yu

    2009-07-01

    In this paper, a particle swarm optimization (PSO) based approach is proposed to derive an optimal digital controller for redesigned digital systems having an interval plant based on time-response resemblance of the closed-loop systems. Because of difficulties in obtaining time-response envelopes for interval systems, the design problem is formulated as an optimization problem of a cost function in terms of aggregated deviation between the step responses corresponding to extremal energies of the redesigned digital system and those of their continuous counterpart. A proposed evolutionary framework incorporating three PSOs is subsequently presented to minimize the cost function to derive an optimal set of parameters for the digital controller, so that step response sequences corresponding to the extremal sequence energy of the redesigned digital system suitably approximate those of their continuous counterpart under the perturbation of the uncertain plant parameters. Computer simulations have shown that redesigned digital systems incorporating the PSO-derived digital controllers have better system performance than those using conventional open-loop discretization methods.

  6. A novel built-up spectral index developed by using multiobjective particle-swarm-optimization technique

    NASA Astrophysics Data System (ADS)

    Sameen, Maher Ibrahim; Pradhan, Biswajeet

    2016-06-01

    In this study, we propose a novel built-up spectral index which was developed by using particle-swarm-optimization (PSO) technique for Worldview-2 images. PSO was used to select the relevant bands from the eight (8) spectral bands of Worldview-2 image and then were used for index development. Multiobiective optimization was used to minimize the number of selected spectral bands and to maximize the classification accuracy. The results showed that the most important and relevant spectral bands among the eight (8) bands for built-up area extraction are band4 (yellow) and band7 (NIR1). Using those relevant spectral bands, the final spectral index was form ulated by developing a normalized band ratio. The validation of the classification result using the proposed spectral index showed that our novel spectral index performs well compared to the existing WV -BI index. The accuracy assessment showed that the new proposed spectral index could extract built-up areas from Worldview-2 image with an area under curve (AUC) of (0.76) indicating the effectiveness of the developed spectral index. Further improvement could be done by using several datasets during the index development process to ensure the transferability of the index to other datasets and study areas.

  7. Modified Sigmoid Function Based Gray Scale Image Contrast Enhancement Using Particle Swarm Optimization

    NASA Astrophysics Data System (ADS)

    Verma, Harish Kumar; Pal, Sandeep

    2016-06-01

    The main objective of an image enhancement is to improve eminence by maximizing the information content in the test image. Conventional contrast enhancement techniques either often fails to produce reasonable results for a broad variety of low-contrast and high contrast images, or cannot be automatically applied to different images, because they are parameters dependent. Hence this paper introduces a novel hybrid image enhancement approach by taking both the local and global information of an image. In the present work, sigmoid function is being modified on the basis of contrast of the images. The gray image enhancement problem is treated as nonlinear optimization problem with several constraints and solved by particle swarm optimization. The entropy and edge information is included in the objective function as quality measure of an image. The effectiveness of modified sigmoid function based enhancement over conventional methods namely linear contrast stretching, histogram equalization, and adaptive histogram equalization are better revealed by the enhanced images and further validated by statistical analysis of these images.

  8. Modeling dynamic urban growth using hybrid cellular automata and particle swarm optimization

    NASA Astrophysics Data System (ADS)

    Rabbani, Amirhosein; Aghababaee, Hossein; Rajabi, Mohammad A.

    2012-01-01

    Conventional raster-based cellular automata (CA) confront many difficulties because of cell size and neighborhood sensitivity. Alternatively, vector CA-based models are very complex and difficult to implement. We present a hybrid cellular automata (HCA) model as a combination of cellular structure and vector concept. The space is still defined by a set of cells, but rasterized spatial objects are also utilized in the structure of transition rules. Particle swarm optimization (PSO) is also used to calculate the urbanization probability of cells based on their distance from the development parameters. The proposed model is applied to Landsat satellite imagery of the city of Tehran, Iran with 28.5-m spatial resolution to simulate the urban growth from 1988 to 2010. Statistical comparison of the ground truth and the simulated image using a kappa coefficient shows an accuracy of 83.42% in comparison to the 81.13% accuracy for the conventional Geo-CA model. Moreover, decreasing the spatial resolution by a factor of one-fourth has reduced the accuracy of the HCA and Geo-CA models by 1.19% and 3.04%, respectively, which shows the lower scale sensitivity of the proposed model. The HCA model is developed to have the simplicity of cellular structure together with optimum features of vector models.

  9. Charging Guidance of Electric Taxis Based on Adaptive Particle Swarm Optimization

    PubMed Central

    Niu, Liyong; Zhang, Di

    2015-01-01

    Electric taxis are playing an important role in the application of electric vehicles. The actual operational data of electric taxis in Shenzhen, China, is analyzed, and, in allusion to the unbalanced time availability of the charging station equipment, the electric taxis charging guidance system is proposed basing on the charging station information and vehicle information. An electric taxis charging guidance model is established and guides the charging based on the positions of taxis and charging stations with adaptive mutation particle swarm optimization. The simulation is based on the actual data of Shenzhen charging stations, and the results show that electric taxis can be evenly distributed to the appropriate charging stations according to the charging pile numbers in charging stations after the charging guidance. The even distribution among the charging stations in the area will be achieved and the utilization of charging equipment will be improved, so the proposed charging guidance method is verified to be feasible. The improved utilization of charging equipment can save public charging infrastructure resources greatly. PMID:26236770

  10. A frozen Gaussian approximation-based multi-level particle swarm optimization for seismic inversion

    SciTech Connect

    Li, Jinglai; Lin, Guang; Yang, Xu

    2015-09-01

    In this paper, we propose a frozen Gaussian approximation (FGA)-based multi-level particle swarm optimization (MLPSO) method for seismic inversion of high-frequency wave data. The method addresses two challenges in it: First, the optimization problem is highly non-convex, which makes hard for gradient-based methods to reach global minima. This is tackled by MLPSO which can escape from undesired local minima. Second, the character of high-frequency of seismic waves requires a large number of grid points in direct computational methods, and thus renders an extremely high computational demand on the simulation of each sample in MLPSO. We overcome this difficulty by three steps: First, we use FGA to compute high-frequency wave propagation based on asymptotic analysis on phase plane; Then we design a constrained full waveform inversion problem to prevent the optimization search getting into regions of velocity where FGA is not accurate; Last, we solve the constrained optimization problem by MLPSO that employs FGA solvers with different fidelity. The performance of the proposed method is demonstrated by a two-dimensional full-waveform inversion example of the smoothed Marmousi model.

  11. Control of conducting polymer actuators without physical feedback: simulated feedback control approach with particle swarm optimization

    NASA Astrophysics Data System (ADS)

    Xiang, Xingcan; Mutlu, Rahim; Alici, Gursel; Li, Weihua

    2014-03-01

    Conducting polymer actuators have shown significant potential in articulating micro instruments, manipulation devices, and robotics. However, implementing a feedback control strategy to enhance their positioning ability and accuracy in any application requires a feedback sensor, which is extremely large in size compared to the size of the actuators. Therefore, this paper proposes a new sensorless control scheme without the use of a position feedback sensor. With the help of the system identification technique and particle swarm optimization, the control scheme, which we call the simulated feedback control system, showed a satisfactory command tracking performance for the conducting polymer actuator’s step and dynamic displacement responses, especially under a disturbance, without needing a physical feedback loop, but using a simulated feedback loop. The primary contribution of this study is to propose and experimentally evaluate the simulated feedback control scheme for a class of the conducting polymer actuators known as tri-layer polymer actuators, which can operate both in dry and wet media. This control approach can also be extended to other smart actuators or systems, for which the feedback control based on external sensing is impractical.

  12. Data processing of vertical scanning white-light interferometry based on particle swarm optimization

    NASA Astrophysics Data System (ADS)

    Hu, Jie; Cui, Changcai; Huang, Hui; Ye, Ruifang

    2013-01-01

    In order to precisely locate the position of zero optical path difference (ZOPD) between the measuring light beam and the reference light beam in Vertical Scanning White-light Interferometer and then realize accurate surface measurement, the Particle Swarm Optimization (PSO) was used to process the interferometry data captured by a CCD camera. The envelope line of series of intensities of every pixel was supposed to be approximated by a Gaussian curve first. Then its parameters were optimized to find the best Gaussian curve as well as the position of ZOPD by the PSO with an objective function which minimized the residual sum of squares between the measured data and theoretical fitting curve. Finally, the measured surface can be reconstructed according to a series of best positions of ZOPD obtained by the proposed method. The simulation data and sampled data of two standard samples with different kinds of reticles from repetitive test show that the PSO is suitable for precisely locating the ZOPD with low requirements of step sampling and a small amount of pictures. Therefore, without reducing the precision, the PSO can be used in data processing of the white-light interferometry system with relatively low requirements for stepping hardware.

  13. Charging Guidance of Electric Taxis Based on Adaptive Particle Swarm Optimization.

    PubMed

    Niu, Liyong; Zhang, Di

    2015-01-01

    Electric taxis are playing an important role in the application of electric vehicles. The actual operational data of electric taxis in Shenzhen, China, is analyzed, and, in allusion to the unbalanced time availability of the charging station equipment, the electric taxis charging guidance system is proposed basing on the charging station information and vehicle information. An electric taxis charging guidance model is established and guides the charging based on the positions of taxis and charging stations with adaptive mutation particle swarm optimization. The simulation is based on the actual data of Shenzhen charging stations, and the results show that electric taxis can be evenly distributed to the appropriate charging stations according to the charging pile numbers in charging stations after the charging guidance. The even distribution among the charging stations in the area will be achieved and the utilization of charging equipment will be improved, so the proposed charging guidance method is verified to be feasible. The improved utilization of charging equipment can save public charging infrastructure resources greatly.

  14. Particle swarm optimization-based continuous cellular automaton for the simulation of deep reactive ion etching

    NASA Astrophysics Data System (ADS)

    Li, Yuan; Gosálvez, Miguel A.; Pal, Prem; Sato, Kazuo; Xing, Yan

    2015-05-01

    We combine the particle swarm optimization (PSO) method and the continuous cellular automaton (CCA) in order to simulate deep reactive ion etching (DRIE), also known as the Bosch process. By considering a generic growth/etch process, the proposed PSO-CCA method provides a general, integrated procedure to optimize the parameter values of any given theoretical model conceived to describe the corresponding experiments, which are simulated by the CCA method. To stress the flexibility of the PSO-CCA method, two different theoretical models of the DRIE process are used, namely, the ballistic transport and reaction (BTR) model, and the reactant concentration (RC) model. DRIE experiments are designed and conducted to compare the simulation results with the experiments on different machines and process conditions. Previously reported experimental data are also considered to further test the flexibility of the proposed method. The agreement between the simulations and experiments strongly indicates that the PSO-CCA method can be used to adjust the theoretical parameters by using a limited amount of experimental data. The proposed method has the potential to be applied on the modeling and optimization of other growth/etch processes.

  15. Evaluating treatment of osteoporosis using particle swarm on a bone remodelling mathematical model.

    PubMed

    Chen, Andy B; Zhang, Ping; Yokota, Hiroki

    2013-12-01

    Bone loss in osteoporosis, commonly observed in postmenopausal women and the elderly, is caused by an imbalance in activities of bone-forming osteoblasts and bone-resorbing osteoclasts. To treat osteoporosis and increase bone mineral density (BMD), physical activities and drugs are often recommended. Complex systems dynamics prevent an intuitive prediction of treatment strategies, and little is known about an optimal sequence for the combinatorial use of available treatments. In this study, the authors built a mathematical model of bone remodelling and developed a treatment strategy for mechanical loading and salubrinal, a synthetic chemical agent that enhances bone formation and prevents bone resorption. The model formulated a temporal BMD change of a mouse's whole skeleton in response to ovariectomy, mechanical loading and administration of salubrinal. Particle swarm optimisation was employed to maximise a performance index (a function of BMD and treatment cost) to find an ideal sequence of treatment. The best treatment was found to start with mechanical loading followed by salubrinal. As treatment costs increased, the sequence started with no treatment and usage of salubrinal became scarce. The treatment strategy will depend on individual needs and costs, and the proposed model is expected to contribute to the development of personalised treatment strategies. PMID:24712100

  16. Automatic Parameter Tuning for the Morpheus Vehicle Using Particle Swarm Optimization

    NASA Technical Reports Server (NTRS)

    Birge, B.

    2013-01-01

    A high fidelity simulation using a PC based Trick framework has been developed for Johnson Space Center's Morpheus test bed flight vehicle. There is an iterative development loop of refining and testing the hardware, refining the software, comparing the software simulation to hardware performance and adjusting either or both the hardware and the simulation to extract the best performance from the hardware as well as the most realistic representation of the hardware from the software. A Particle Swarm Optimization (PSO) based technique has been developed that increases speed and accuracy of the iterative development cycle. Parameters in software can be automatically tuned to make the simulation match real world subsystem data from test flights. Special considerations for scale, linearity, discontinuities, can be all but ignored with this technique, allowing fast turnaround both for simulation tune up to match hardware changes as well as during the test and validation phase to help identify hardware issues. Software models with insufficient control authority to match hardware test data can be immediately identified and using this technique requires very little to no specialized knowledge of optimization, freeing model developers to concentrate on spacecraft engineering. Integration of the PSO into the Morpheus development cycle will be discussed as well as a case study highlighting the tool's effectiveness.

  17. Power and time slot allocation in cognitive relay networks using particle swarm optimization.

    PubMed

    Derakhshan-Barjoei, Pouya; Dadashzadeh, Gholamreza; Razzazi, Farbod; Razavizadeh, S Mohammad

    2013-01-01

    The two main problems in cognitive radio networks are power and time slot allocation problems which require a precise analysis and guarantee the quality of service in both the primary and secondary users. In this paper, these two problems are considered and a method is proposed to solve the resulting optimization problem. Our proposed method provides an improved performance in solving the constrained nonlinear multiobject optimization for the power control and beamforming in order to reach the maximum capacity and proper adaption of time slots, and as a result a new scheme for joint power and time slot allocation in cognitive relay networks is proposed. We adopt space diversity access as the secondary users access scheme and divide the time between multiple secondary users according to their contribution to primary user's transmission. Helping primary users provides more opportunities for secondary users to access the channel since the primary users can release the channel sooner. In contrast, primary network leases portion of channel access time to the secondary users for their transmission using particle swarm optimization (PSO). Numerical studies show good performance of the proposed scheme with a dynamic cost function in a nonstationary environment.

  18. An MR Brain Images Classifier System via Particle Swarm Optimization and Kernel Support Vector Machine

    PubMed Central

    Wang, Shuihua; Ji, Genlin; Dong, Zhengchao

    2013-01-01

    Automated abnormal brain detection is extremely of importance for clinical diagnosis. Over last decades numerous methods had been presented. In this paper, we proposed a novel hybrid system to classify a given MR brain image as either normal or abnormal. The proposed method first employed digital wavelet transform to extract features then used principal component analysis (PCA) to reduce the feature space. Afterwards, we constructed a kernel support vector machine (KSVM) with RBF kernel, using particle swarm optimization (PSO) to optimize the parameters C and σ. Fivefold cross-validation was utilized to avoid overfitting. In the experimental procedure, we created a 90 images dataset brain downloaded from Harvard Medical School website. The abnormal brain MR images consist of the following diseases: glioma, metastatic adenocarcinoma, metastatic bronchogenic carcinoma, meningioma, sarcoma, Alzheimer, Huntington, motor neuron disease, cerebral calcinosis, Pick's disease, Alzheimer plus visual agnosia, multiple sclerosis, AIDS dementia, Lyme encephalopathy, herpes encephalitis, Creutzfeld-Jakob disease, and cerebral toxoplasmosis. The 5-folded cross-validation classification results showed that our method achieved 97.78% classification accuracy, higher than 86.22% by BP-NN and 91.33% by RBF-NN. For the parameter selection, we compared PSO with those of random selection method. The results showed that the PSO is more effective to build optimal KSVM. PMID:24163610

  19. Power and Time Slot Allocation in Cognitive Relay Networks Using Particle Swarm Optimization

    PubMed Central

    Dadashzadeh, Gholamreza; Razzazi, Farbod; Razavizadeh, S. Mohammad

    2013-01-01

    The two main problems in cognitive radio networks are power and time slot allocation problems which require a precise analysis and guarantee the quality of service in both the primary and secondary users. In this paper, these two problems are considered and a method is proposed to solve the resulting optimization problem. Our proposed method provides an improved performance in solving the constrained nonlinear multiobject optimization for the power control and beamforming in order to reach the maximum capacity and proper adaption of time slots, and as a result a new scheme for joint power and time slot allocation in cognitive relay networks is proposed. We adopt space diversity access as the secondary users access scheme and divide the time between multiple secondary users according to their contribution to primary user's transmission. Helping primary users provides more opportunities for secondary users to access the channel since the primary users can release the channel sooner. In contrast, primary network leases portion of channel access time to the secondary users for their transmission using particle swarm optimization (PSO). Numerical studies show good performance of the proposed scheme with a dynamic cost function in a nonstationary environment. PMID:24228002

  20. Multiobjective Robust Design of the Double Wishbone Suspension System Based on Particle Swarm Optimization

    PubMed Central

    Lin, Yuqun

    2014-01-01

    The performance of the suspension system is one of the most important factors in the vehicle design. For the double wishbone suspension system, the conventional deterministic optimization does not consider any deviations of design parameters, so design sensitivity analysis and robust optimization design are proposed. In this study, the design parameters of the robust optimization are the positions of the key points, and the random factors are the uncertainties in manufacturing. A simplified model of the double wishbone suspension is established by software ADAMS. The sensitivity analysis is utilized to determine main design variables. Then, the simulation experiment is arranged and the Latin hypercube design is adopted to find the initial points. The Kriging model is employed for fitting the mean and variance of the quality characteristics according to the simulation results. Further, a particle swarm optimization method based on simple PSO is applied and the tradeoff between the mean and deviation of performance is made to solve the robust optimization problem of the double wishbone suspension system. PMID:24683334

  1. Charging Guidance of Electric Taxis Based on Adaptive Particle Swarm Optimization.

    PubMed

    Niu, Liyong; Zhang, Di

    2015-01-01

    Electric taxis are playing an important role in the application of electric vehicles. The actual operational data of electric taxis in Shenzhen, China, is analyzed, and, in allusion to the unbalanced time availability of the charging station equipment, the electric taxis charging guidance system is proposed basing on the charging station information and vehicle information. An electric taxis charging guidance model is established and guides the charging based on the positions of taxis and charging stations with adaptive mutation particle swarm optimization. The simulation is based on the actual data of Shenzhen charging stations, and the results show that electric taxis can be evenly distributed to the appropriate charging stations according to the charging pile numbers in charging stations after the charging guidance. The even distribution among the charging stations in the area will be achieved and the utilization of charging equipment will be improved, so the proposed charging guidance method is verified to be feasible. The improved utilization of charging equipment can save public charging infrastructure resources greatly. PMID:26236770

  2. Transformer Incipient Fault Prediction Using Combined Artificial Neural Network and Various Particle Swarm Optimisation Techniques.

    PubMed

    Illias, Hazlee Azil; Chai, Xin Rui; Abu Bakar, Ab Halim; Mokhlis, Hazlie

    2015-01-01

    It is important to predict the incipient fault in transformer oil accurately so that the maintenance of transformer oil can be performed correctly, reducing the cost of maintenance and minimise the error. Dissolved gas analysis (DGA) has been widely used to predict the incipient fault in power transformers. However, sometimes the existing DGA methods yield inaccurate prediction of the incipient fault in transformer oil because each method is only suitable for certain conditions. Many previous works have reported on the use of intelligence methods to predict the transformer faults. However, it is believed that the accuracy of the previously proposed methods can still be improved. Since artificial neural network (ANN) and particle swarm optimisation (PSO) techniques have never been used in the previously reported work, this work proposes a combination of ANN and various PSO techniques to predict the transformer incipient fault. The advantages of PSO are simplicity and easy implementation. The effectiveness of various PSO techniques in combination with ANN is validated by comparison with the results from the actual fault diagnosis, an existing diagnosis method and ANN alone. Comparison of the results from the proposed methods with the previously reported work was also performed to show the improvement of the proposed methods. It was found that the proposed ANN-Evolutionary PSO method yields the highest percentage of correct identification for transformer fault type than the existing diagnosis method and previously reported works.

  3. Swarms of UAVs and fighter aircraft

    SciTech Connect

    Trahan, M.W.; Wagner, J.S.; Stantz, K.M.; Gray, P.C.; Robinett, R.

    1998-11-01

    This paper describes a method of modeling swarms of UAVs and/or fighter aircraft using particle simulation concepts. Recent investigations into the use of genetic algorithms to design neural networks for the control of autonomous vehicles (i.e., robots) led to the examination of methods of simulating large collections of robots. This paper describes the successful implementation of a model of swarm dynamics using particle simulation concepts. Several examples of the complex behaviors achieved in a target/interceptor scenario are presented.

  4. TH-A-9A-02: BEST IN PHYSICS (THERAPY) - 4D IMRT Planning Using Highly- Parallelizable Particle Swarm Optimization

    SciTech Connect

    Modiri, A; Gu, X; Sawant, A

    2014-06-15

    Purpose: We present a particle swarm optimization (PSO)-based 4D IMRT planning technique designed for dynamic MLC tracking delivery to lung tumors. The key idea is to utilize the temporal dimension as an additional degree of freedom rather than a constraint in order to achieve improved sparing of organs at risk (OARs). Methods: The target and normal structures were manually contoured on each of the ten phases of a 4DCT scan acquired from a lung SBRT patient who exhibited 1.5cm tumor motion despite the use of abdominal compression. Corresponding ten IMRT plans were generated using the Eclipse treatment planning system. These plans served as initial guess solutions for the PSO algorithm. Fluence weights were optimized over the entire solution space i.e., 10 phases × 12 beams × 166 control points. The size of the solution space motivated our choice of PSO, which is a highly parallelizable stochastic global optimization technique that is well-suited for such large problems. A summed fluence map was created using an in-house B-spline deformable image registration. Each plan was compared with a corresponding, internal target volume (ITV)-based IMRT plan. Results: The PSO 4D IMRT plan yielded comparable PTV coverage and significantly higher dose—sparing for parallel and serial OARs compared to the ITV-based plan. The dose-sparing achieved via PSO-4DIMRT was: lung Dmean = 28%; lung V20 = 90%; spinal cord Dmax = 23%; esophagus Dmax = 31%; heart Dmax = 51%; heart Dmean = 64%. Conclusion: Truly 4D IMRT that uses the temporal dimension as an additional degree of freedom can achieve significant dose sparing of serial and parallel OARs. Given the large solution space, PSO represents an attractive, parallelizable tool to achieve globally optimal solutions for such problems. This work was supported through funding from the National Institutes of Health and Varian Medical Systems. Amit Sawant has research funding from Varian Medical Systems, VisionRT Ltd. and Elekta.

  5. Efficient Scheduling of Scientific Workflows with Energy Reduction Using Novel Discrete Particle Swarm Optimization and Dynamic Voltage Scaling for Computational Grids.

    PubMed

    Christobel, M; Tamil Selvi, S; Benedict, Shajulin

    2015-01-01

    One of the most significant and the topmost parameters in the real world computing environment is energy. Minimizing energy imposes benefits like reduction in power consumption, decrease in cooling rates of the computing processors, provision of a green environment, and so forth. In fact, computation time and energy are directly proportional to each other and the minimization of computation time may yield a cost effective energy consumption. Proficient scheduling of Bag-of-Tasks in the grid environment ravages in minimum computation time. In this paper, a novel discrete particle swarm optimization (DPSO) algorithm based on the particle's best position (pbDPSO) and global best position (gbDPSO) is adopted to find the global optimal solution for higher dimensions. This novel DPSO yields better schedule with minimum computation time compared to Earliest Deadline First (EDF) and First Come First Serve (FCFS) algorithms which comparably reduces energy. Other scheduling parameters, such as job completion ratio and lateness, are also calculated and compared with EDF and FCFS. An energy improvement of up to 28% was obtained when Makespan Conservative Energy Reduction (MCER) and Dynamic Voltage Scaling (DVS) were used in the proposed DPSO algorithm. PMID:26075296

  6. Efficient Scheduling of Scientific Workflows with Energy Reduction Using Novel Discrete Particle Swarm Optimization and Dynamic Voltage Scaling for Computational Grids

    PubMed Central

    Christobel, M.; Tamil Selvi, S.; Benedict, Shajulin

    2015-01-01

    One of the most significant and the topmost parameters in the real world computing environment is energy. Minimizing energy imposes benefits like reduction in power consumption, decrease in cooling rates of the computing processors, provision of a green environment, and so forth. In fact, computation time and energy are directly proportional to each other and the minimization of computation time may yield a cost effective energy consumption. Proficient scheduling of Bag-of-Tasks in the grid environment ravages in minimum computation time. In this paper, a novel discrete particle swarm optimization (DPSO) algorithm based on the particle's best position (pbDPSO) and global best position (gbDPSO) is adopted to find the global optimal solution for higher dimensions. This novel DPSO yields better schedule with minimum computation time compared to Earliest Deadline First (EDF) and First Come First Serve (FCFS) algorithms which comparably reduces energy. Other scheduling parameters, such as job completion ratio and lateness, are also calculated and compared with EDF and FCFS. An energy improvement of up to 28% was obtained when Makespan Conservative Energy Reduction (MCER) and Dynamic Voltage Scaling (DVS) were used in the proposed DPSO algorithm. PMID:26075296

  7. Efficient droplet router for digital microfluidic biochip using particle swarm optimizer

    NASA Astrophysics Data System (ADS)

    Pan, Indrajit; Samanta, Tuhina

    2013-01-01

    Digital Microfluidic Biochip has emerged as a revolutionary finding in the field of micro-electromechanical research. Different complex bioassays and pathological analysis are being efficiently performed on this miniaturized chip with negligible amount of sample specimens. Initially biochip was invented on continuous-fluid-flow mechanism but later it has evolved with more efficient concept of digital-fluid-flow. These second generation biochips are capable of serving more complex bioassays. This operational change in biochip technology emerged with the requirement of high end computer aided design needs for physical design automation. The change also paved new avenues of research to assist the proficient design automation. Droplet routing is one of those major aspects where it necessarily requires minimization of both routing completion time and total electrode usage. This task involves optimization of multiple associated parameters. In this paper we have proposed a particle swarm optimization based approach for droplet outing. The process mainly operates in two phases where initially we perform clustering of state space and classification of nets into designated clusters. This helps us to reduce solution space by redefining local sub optimal target in the interleaved space between source and global target of a net. In the next phase we resolve the concurrent routing issues of every sub optimal situation to generate final routing schedule. The method was applied on some standard test benches and hard test sets. Comparative analysis of experimental results shows good improvement on the aspect of unit cell usage, routing completion time and execution time over some well existing methods.

  8. Diesel Engine performance improvement in a 1-D engine model using Particle Swarm Optimization

    NASA Astrophysics Data System (ADS)

    Karra, Prashanth

    2015-12-01

    A particle swarm optimization (PSO) technique was implemented to improve the engine development and optimization process to simultaneously reduce emissions and improve the fuel efficiency. The optimization was performed on a 4-stroke 4-cylinder GT-Power based 1-D diesel engine model. To achieve the multi-objective optimization, a merit function was defined which included the parameters to be optimized: Nitrogen Oxides (NOx), Nonmethyl hydro carbons (NMHC), Carbon Monoxide (CO), Brake Specific Fuel Consumption (BSFC). EPA Tier 3 emissions standards for non-road diesel engines between 37 and 75 kW of output were chosen as targets for the optimization. The combustion parameters analyzed in this study include: Start of main Injection, Start of Pilot Injection, Pilot fuel quantity, Swirl, and Tumble. The PSO was found to be very effective in quickly arriving at a solution that met the target criteria as defined in the merit function. The optimization took around 40-50 runs to find the most favourable engine operating condition under the constraints specified in the optimization. In a favourable case with a high merit function values, the NOx+NMHC and CO values were reduced to as low as 2.9 and 0.014 g/kWh, respectively. The operating conditions at this point were: 10 ATDC Main SOI, -25 ATDC Pilot SOI, 0.25 mg of pilot fuel, 0.45 Swirl and 0.85 tumble. These results indicate that late main injections preceded by a close, small pilot injection are most favourable conditions at the operating condition tested.

  9. An Improved Cockroach Swarm Optimization

    PubMed Central

    Obagbuwa, I. C.; Adewumi, A. O.

    2014-01-01

    Hunger component is introduced to the existing cockroach swarm optimization (CSO) algorithm to improve its searching ability and population diversity. The original CSO was modelled with three components: chase-swarming, dispersion, and ruthless; additional hunger component which is modelled using partial differential equation (PDE) method is included in this paper. An improved cockroach swarm optimization (ICSO) is proposed in this paper. The performance of the proposed algorithm is tested on well known benchmarks and compared with the existing CSO, modified cockroach swarm optimization (MCSO), roach infestation optimization RIO, and hungry roach infestation optimization (HRIO). The comparison results show clearly that the proposed algorithm outperforms the existing algorithms. PMID:24959611

  10. Determination of fetal state from cardiotocogram using LS-SVM with particle swarm optimization and binary decision tree.

    PubMed

    Yılmaz, Ersen; Kılıkçıer, Cağlar

    2013-01-01

    We use least squares support vector machine (LS-SVM) utilizing a binary decision tree for classification of cardiotocogram to determine the fetal state. The parameters of LS-SVM are optimized by particle swarm optimization. The robustness of the method is examined by running 10-fold cross-validation. The performance of the method is evaluated in terms of overall classification accuracy. Additionally, receiver operation characteristic analysis and cobweb representation are presented in order to analyze and visualize the performance of the method. Experimental results demonstrate that the proposed method achieves a remarkable classification accuracy rate of 91.62%.

  11. Particle-particle, particle-scaling function algorithm for electrostatic problems in free boundary conditions.

    PubMed

    Neelov, Alexey; Ghasemi, S Alireza; Goedecker, Stefan

    2007-07-14

    An algorithm for fast calculation of the Coulombic forces and energies of point particles with free boundary conditions is proposed. Its calculation time scales as N log N for N particles. This novel method has lower crossover point with the full O(N(2)) direct summation than the fast multipole method. The forces obtained by our algorithm are analytical derivatives of the energy which guarantees energy conservation during a molecular dynamics simulation. Our algorithm is very simple. A version of the code parallelized with the Message Passing Interface can be downloaded under the GNU General Public License from the website of our group.

  12. Coulomb Collision Algorithms for Particle Codes

    NASA Astrophysics Data System (ADS)

    Cohen, Bruce

    2006-04-01

    This paper surveys some of the particle code algorithms used to model Coulomb collisions in fully ionized plasmas, e.g., pair-wise operators such as the Takizuka-Abe^1 scheme and extensions^2, Langevin equation collision operators^3,4, and partially linearized gyrokinetic collisions operators for strongly magnetized plasmas.^5,6,7 Some recent experience is reported.^8 Issues such as physics completeness, accuracy, and comparative algorithm performance are highlighted. 1. T. Takizuka and H. Abe, J. Comput. Phys. 25, 205 (1977). 2. K. Nanbu, Phys. Rev. E 55, 4642 (1997). 3. M.E. Jones, et al., J. Comp. Phys. 123, 169 (1996). 4. W.M. Manheimer, M. Lampe, and G. Joyce, et al., J. Comp. Phys. 138, 565 (1997). 5. X.Q. Xu and M.N. Rosenbluth, Phys. Fluids B 3, 627 (1991). 6. A.M. Dimits and B.I. Cohen, Phys. Rev. E 49, 709 (1994). 7. Z. Lin, W. M. Tang, and W. W. Lee, Phys.Plasmas 2, 2975 (August 1995). 8. B.I. Cohen, et al., ``Effects of ion-ion collisions and inhomogeneity in two-dimensional kinetic ion simulations of stimulated Brillouin backscattering,'' accepted for publication in Phys. Plasmas (2006).

  13. Variational Algorithms for Test Particle Trajectories

    NASA Astrophysics Data System (ADS)

    Ellison, C. Leland; Finn, John M.; Qin, Hong; Tang, William M.

    2015-11-01

    The theory of variational integration provides a novel framework for constructing conservative numerical methods for magnetized test particle dynamics. The retention of conservation laws in the numerical time advance captures the correct qualitative behavior of the long time dynamics. For modeling the Lorentz force system, new variational integrators have been developed that are both symplectic and electromagnetically gauge invariant. For guiding center test particle dynamics, discretization of the phase-space action principle yields multistep variational algorithms, in general. Obtaining the desired long-term numerical fidelity requires mitigation of the multistep method's parasitic modes or applying a discretization scheme that possesses a discrete degeneracy to yield a one-step method. Dissipative effects may be modeled using Lagrange-D'Alembert variational principles. Numerical results will be presented using a new numerical platform that interfaces with popular equilibrium codes and utilizes parallel hardware to achieve reduced times to solution. This work was supported by DOE Contract DE-AC02-09CH11466.

  14. Using a Combined Platform of Swarm Intelligence Algorithms and GIS to Provide Land Suitability Maps for Locating Cardiac Rehabilitation Defibrillators

    PubMed Central

    KAFFASH-CHARANDABI, Neda; SADEGHI-NIARAKI, Abolghasem; PARK, Dong-Kyun

    2015-01-01

    Background: Cardiac arrest is a condition in which the heart is completely stopped and is not pumping any blood. Although most cardiac arrest cases are reported from homes or hospitals, about 20% occur in public areas. Therefore, these areas need to be investigated in terms of cardiac arrest incidence so that places of high incidence can be identified and cardiac rehabilitation defibrillators installed there. Methods: In order to investigate a study area in Petersburg, Pennsylvania State, and to determine appropriate places for installing defibrillators with 5-year period data, swarm intelligence algorithms were used. Moreover, the location of the defibrillators was determined based on the following five evaluation criteria: land use, altitude of the area, economic conditions, distance from hospitals and approximate areas of reported cases of cardiac arrest for public places that were created in geospatial information system (GIS). Results: The A-P HADEL algorithm results were more precise about 27.36%. The validation results indicated a wider coverage of real values and the verification results confirmed the faster and more exact optimization of the cost function in the PSO method. Conclusion: The study findings emphasize the necessity of applying optimal optimization methods along with GIS and precise selection of criteria in the selection of optimal locations for installing medical facilities because the selected algorithm and criteria dramatically affect the final responses. Meanwhile, providing land suitability maps for installing facilities across hot and risky spots has the potential to save many lives. PMID:26587471

  15. Particle swarm optimization based feature enhancement and feature selection for improved emotion recognition in speech and glottal signals.

    PubMed

    Muthusamy, Hariharan; Polat, Kemal; Yaacob, Sazali

    2015-01-01

    In the recent years, many research works have been published using speech related features for speech emotion recognition, however, recent studies show that there is a strong correlation between emotional states and glottal features. In this work, Mel-frequency cepstralcoefficients (MFCCs), linear predictive cepstral coefficients (LPCCs), perceptual linear predictive (PLP) features, gammatone filter outputs, timbral texture features, stationary wavelet transform based timbral texture features and relative wavelet packet energy and entropy features were extracted from the emotional speech (ES) signals and its glottal waveforms(GW). Particle swarm optimization based clustering (PSOC) and wrapper based particle swarm optimization (WPSO) were proposed to enhance the discerning ability of the features and to select the discriminating features respectively. Three different emotional speech databases were utilized to gauge the proposed method. Extreme learning machine (ELM) was employed to classify the different types of emotions. Different experiments were conducted and the results show that the proposed method significantly improves the speech emotion recognition performance compared to previous works published in the literature.

  16. Particle Swarm Optimization Based Feature Enhancement and Feature Selection for Improved Emotion Recognition in Speech and Glottal Signals

    PubMed Central

    Muthusamy, Hariharan; Polat, Kemal; Yaacob, Sazali

    2015-01-01

    In the recent years, many research works have been published using speech related features for speech emotion recognition, however, recent studies show that there is a strong correlation between emotional states and glottal features. In this work, Mel-frequency cepstralcoefficients (MFCCs), linear predictive cepstral coefficients (LPCCs), perceptual linear predictive (PLP) features, gammatone filter outputs, timbral texture features, stationary wavelet transform based timbral texture features and relative wavelet packet energy and entropy features were extracted from the emotional speech (ES) signals and its glottal waveforms(GW). Particle swarm optimization based clustering (PSOC) and wrapper based particle swarm optimization (WPSO) were proposed to enhance the discerning ability of the features and to select the discriminating features respectively. Three different emotional speech databases were utilized to gauge the proposed method. Extreme learning machine (ELM) was employed to classify the different types of emotions. Different experiments were conducted and the results show that the proposed method significantly improves the speech emotion recognition performance compared to previous works published in the literature. PMID:25799141

  17. Interest rate next-day variation prediction based on hybrid feedforward neural network, particle swarm optimization, and multiresolution techniques

    NASA Astrophysics Data System (ADS)

    Lahmiri, Salim

    2016-02-01

    Multiresolution analysis techniques including continuous wavelet transform, empirical mode decomposition, and variational mode decomposition are tested in the context of interest rate next-day variation prediction. In particular, multiresolution analysis techniques are used to decompose interest rate actual variation and feedforward neural network for training and prediction. Particle swarm optimization technique is adopted to optimize its initial weights. For comparison purpose, autoregressive moving average model, random walk process and the naive model are used as main reference models. In order to show the feasibility of the presented hybrid models that combine multiresolution analysis techniques and feedforward neural network optimized by particle swarm optimization, we used a set of six illustrative interest rates; including Moody's seasoned Aaa corporate bond yield, Moody's seasoned Baa corporate bond yield, 3-Month, 6-Month and 1-Year treasury bills, and effective federal fund rate. The forecasting results show that all multiresolution-based prediction systems outperform the conventional reference models on the criteria of mean absolute error, mean absolute deviation, and root mean-squared error. Therefore, it is advantageous to adopt hybrid multiresolution techniques and soft computing models to forecast interest rate daily variations as they provide good forecasting performance.

  18. Multivariable wavelet finite element-based vibration model for quantitative crack identification by using particle swarm optimization

    NASA Astrophysics Data System (ADS)

    Zhang, Xingwu; Gao, Robert X.; Yan, Ruqiang; Chen, Xuefeng; Sun, Chuang; Yang, Zhibo

    2016-08-01

    Crack is one of the crucial causes of structural failure. A methodology for quantitative crack identification is proposed in this paper based on multivariable wavelet finite element method and particle swarm optimization. First, the structure with crack is modeled by multivariable wavelet finite element method (MWFEM) so that the vibration parameters of the first three natural frequencies in arbitrary crack conditions can be obtained, which is named as the forward problem. Second, the structure with crack is tested to obtain the vibration parameters of first three natural frequencies by modal testing and advanced vibration signal processing method. Then, the analyzed and measured first three natural frequencies are combined together to obtain the location and size of the crack by using particle swarm optimization. Compared with traditional wavelet finite element method, MWFEM method can achieve more accurate vibration analysis results because it interpolates all the solving variables at one time, which makes the MWFEM-based method to improve the accuracy in quantitative crack identification. In the end, the validity and superiority of the proposed method are verified by experiments of both cantilever beam and simply supported beam.

  19. [Application of near infrared spectroscopy combined with particle swarm optimization based least square support vactor machine to rapid quantitative analysis of Corni Fructus].

    PubMed

    Liu, Xue-song; Sun, Fen-fang; Jin, Ye; Wu, Yong-jiang; Gu, Zhi-xin; Zhu, Li; Yan, Dong-lan

    2015-12-01

    A novel method was developed for the rapid determination of multi-indicators in corni fructus by means of near infrared (NIR) spectroscopy. Particle swarm optimization (PSO) based least squares support vector machine was investigated to increase the levels of quality control. The calibration models of moisture, extractum, morroniside and loganin were established using the PSO-LS-SVM algorithm. The performance of PSO-LS-SVM models was compared with partial least squares regression (PLSR) and back propagation artificial neural network (BP-ANN). The calibration and validation results of PSO-LS-SVM were superior to both PLS and BP-ANN. For PSO-LS-SVM models, the correlation coefficients (r) of calibrations were all above 0.942. The optimal prediction results were also achieved by PSO-LS-SVM models with the RMSEP (root mean square error of prediction) and RSEP (relative standard errors of prediction) less than 1.176 and 15.5% respectively. The results suggest that PSO-LS-SVM algorithm has a good model performance and high prediction accuracy. NIR has a potential value for rapid determination of multi-indicators in Corni Fructus.

  20. [Application of near infrared spectroscopy combined with particle swarm optimization based least square support vactor machine to rapid quantitative analysis of Corni Fructus].

    PubMed

    Liu, Xue-song; Sun, Fen-fang; Jin, Ye; Wu, Yong-jiang; Gu, Zhi-xin; Zhu, Li; Yan, Dong-lan

    2015-12-01

    A novel method was developed for the rapid determination of multi-indicators in corni fructus by means of near infrared (NIR) spectroscopy. Particle swarm optimization (PSO) based least squares support vector machine was investigated to increase the levels of quality control. The calibration models of moisture, extractum, morroniside and loganin were established using the PSO-LS-SVM algorithm. The performance of PSO-LS-SVM models was compared with partial least squares regression (PLSR) and back propagation artificial neural network (BP-ANN). The calibration and validation results of PSO-LS-SVM were superior to both PLS and BP-ANN. For PSO-LS-SVM models, the correlation coefficients (r) of calibrations were all above 0.942. The optimal prediction results were also achieved by PSO-LS-SVM models with the RMSEP (root mean square error of prediction) and RSEP (relative standard errors of prediction) less than 1.176 and 15.5% respectively. The results suggest that PSO-LS-SVM algorithm has a good model performance and high prediction accuracy. NIR has a potential value for rapid determination of multi-indicators in Corni Fructus. PMID:27169290

  1. Simulation-based particle swarm optimization and mechanical validation of screw position and number for the fixation stability of a femoral locking compression plate.

    PubMed

    Lee, Chian-Her; Shih, Kao-Shang; Hsu, Ching-Chi; Cho, Tomas

    2014-01-01

    Locking compression plates (LCPs) have been used to fix femoral shaft fractures. Previous studies have attempted to identify the best LCP screw positions and numbers to achieve the fixation stability. However, the determined screw positions and numbers were mainly based on the surgeons' experiences. The aim of this study was to discover the best number and positions of LCP screws to achieve acceptable fixation stability. Three-dimensional numerical models of a fractured femur with the LCP were first developed. Then, the best screw position and number of LCPs were determined by using a simulation-based particle swarm optimization algorithm. Finally, the results of the numerical study were validated by conducting biomechanical tests. The results showed that the LCP with six locking screws resulted in the necessary fixation stability, and the best combination of positions of locking screws inserted into the LCP was 1-5-6-7-8-12 (three locking screws on either side of the bone fragment with two locking screws as close as practicable to the fracture site). In addition, the numerical models and algorithms developed in this study were validated by the biomechanical tests. Both the numerical and experimental results can provide clinical suggestions to surgeons and help them to understand the biomechanics of LCP systems.

  2. Underwater gas pipeline leakage source localization by distributed fiber-optic sensing based on particle swarm optimization tuning of the support vector machine.

    PubMed

    Huang, Yue; Wang, Qiang; Shi, Lilian; Yang, Qihua

    2016-01-10

    Accurate underwater gas pipeline leak localization requires particular attention due to the sensitivity of environmental conditions. Experiments were performed to analyze the localization performance of a distributed optical fiber sensing system based on the hybrid Sagnac and Mach-Zehnder interferometer. The traditional null frequency location method does not easily allow accurate location of the leakage points. To improve the positioning accuracy, the particle swarm optimization algorithm (PSO) tuning of the support vector machine (SVM) was used to predict the leakage points based on gathered leakage data. The PSO is able to optimize the SVM parameters. For the 10 km range chosen, the results show the PSO-SVM average absolute error of the leakage points predicted is 66 m. The prediction accuracy of leakage points is 98.25% by PSO tuning of the SVM processing. For 20 leakage test data points, the average absolute error of leakage point location is 124.8 m. The leakage position predicted by the PSO algorithm after optimization of the parameters is more accurate.

  3. Data-driven input variable selection for rainfall-runoff modeling using binary-coded particle swarm optimization and Extreme Learning Machines

    NASA Astrophysics Data System (ADS)

    Taormina, Riccardo; Chau, Kwok-Wing

    2015-10-01

    Selecting an adequate set of inputs is a critical step for successful data-driven streamflow prediction. In this study, we present a novel approach for Input Variable Selection (IVS) that employs Binary-coded discrete Fully Informed Particle Swarm optimization (BFIPS) and Extreme Learning Machines (ELM) to develop fast and accurate IVS algorithms. A scheme is employed to encode the subset of selected inputs and ELM specifications into the binary particles, which are evolved using single objective and multi-objective BFIPS optimization (MBFIPS). The performances of these ELM-based methods are assessed using the evaluation criteria and the datasets included in the comprehensive IVS evaluation framework proposed by Galelli et al. (2014). From a comparison with 4 major IVS techniques used in their original study it emerges that the proposed methods compare very well in terms of selection accuracy. The best performers were found to be (1) a MBFIPS-ELM algorithm based on the concurrent minimization of an error function and the number of selected inputs, and (2) a BFIPS-ELM algorithm based on the minimization of a variant of the Akaike Information Criterion (AIC). The first technique is arguably the most accurate overall, and is able to reach an almost perfect specification of the optimal input subset for a partially synthetic rainfall-runoff experiment devised for the Kentucky River basin. In addition, MBFIPS-ELM allows for the determination of the relative importance of the selected inputs. On the other hand, the BFIPS-ELM is found to consistently reach high accuracy scores while being considerably faster. By extrapolating the results obtained on the IVS test-bed, it can be concluded that the proposed techniques are particularly suited for rainfall-runoff modeling applications characterized by high nonlinearity in the catchment dynamics.

  4. Convergence analysis of particle swarm optimization (PSO) method on the with-in host dengue infection treatment model

    NASA Astrophysics Data System (ADS)

    Handayani, D.; Nuraini, N.; Tse, O.; Saragih, R.; Naiborhu, J.

    2016-04-01

    PSO is a computational optimization method motivated by the social behavior of organisms like bird flocking, fish schooling and human social relations. PSO is one of the most important swarm intelligence algorithms. In this study, we analyze the convergence of PSO when it is applied to with-in host dengue infection treatment model simulation in our early research. We used PSO method to construct the initial adjoin equation and to solve a control problem. Its properties of control input on the continuity of objective function and ability of adapting to the dynamic environment made us have to analyze the convergence of PSO. With the convergence analysis of PSO we will have some parameters that ensure the convergence result of numerical simulations on this model using PSO.

  5. Coordination of Swarmed Unmanned Ground Vehicles using Self Organization Mapping with Generic Algorithm

    NASA Astrophysics Data System (ADS)

    Pradhan, Shekhar

    2009-03-01

    The methodologies for path planning for individual UGVs have been well studied and modeled. The Simultaneous Localization and Mapping (SLAM) is an example of such study. However, there is no reliable method of communication among swarmed UGVs. The author along with other collaborators, Dr. Wei Cao of NASA Research Center and Dr. James Burghart of Cleveland State University, proposes a Master-slave approach for the coordinated management of UGVs using Neural Networks. SOM is used to work with GA to update the patterns of UGVs for coordination among themselves and with ground station(s). One (or more) UGV with advanced computational power and virtual link to other ground stations serves as the Master. SOM and GA reside on the Master as well as ground stations. All other UGVs behave as slaves. The individual UGVs conducts its own or grouped path planning. Using Matlab,, the prototype version of SOM and GA for swamed UGVs was simulated and tested with an advanced multi-UGV system. The author will present the results followed by the outlook for the future work.

  6. Comparative Study on Synthesizing Reconfigurable Time- Modulated Linear Arrays using Differential Evolution, Artificial Bee Colony and Particle Swarm Optimization

    NASA Astrophysics Data System (ADS)

    Mandal, S. K.; Singh, Harshavardhan; Mahanti, G. K.; Ghatak, Rowdra

    2014-10-01

    This paper presents a new technique based on optimization tools to design phase only, digitally controlled, reconfigurable antenna arrays through time modulation. In the proposed approach, the on-time durations of the time-modulated elements and the static amplitudes of the array elements are perturbed in such a way that the same on-time sequence and discrete values of static amplitudes for four bit digital attenuators produces either a pencil or a flat-top beam pattern, depending on the suitable discrete phase distributions of five bit digital phase shifters. In order to illustrate the technique, three optimization tools: differential evolution (DE), artificial bee colony (ABC), and particle swarm optimization (PSO) are employed and their performances are compared. The numerical results for a 20-element linear array are presented.

  7. Co-combustion of peanut hull and coal blends: Artificial neural networks modeling, particle swarm optimization and Monte Carlo simulation.

    PubMed

    Buyukada, Musa

    2016-09-01

    Co-combustion of coal and peanut hull (PH) were investigated using artificial neural networks (ANN), particle swarm optimization, and Monte Carlo simulation as a function of blend ratio, heating rate, and temperature. The best prediction was reached by ANN61 multi-layer perception model with a R(2) of 0.99994. Blend ratio of 90 to 10 (PH to coal, wt%), temperature of 305°C, and heating rate of 49°Cmin(-1) were determined as the optimum input values and yield of 87.4% was obtained under PSO optimized conditions. The validation experiments resulted in yields of 87.5%±0.2 after three replications. Monte Carlo simulations were used for the probabilistic assessments of stochastic variability and uncertainty associated with explanatory variables of co-combustion process. PMID:27243606

  8. Co-combustion of peanut hull and coal blends: Artificial neural networks modeling, particle swarm optimization and Monte Carlo simulation.

    PubMed

    Buyukada, Musa

    2016-09-01

    Co-combustion of coal and peanut hull (PH) were investigated using artificial neural networks (ANN), particle swarm optimization, and Monte Carlo simulation as a function of blend ratio, heating rate, and temperature. The best prediction was reached by ANN61 multi-layer perception model with a R(2) of 0.99994. Blend ratio of 90 to 10 (PH to coal, wt%), temperature of 305°C, and heating rate of 49°Cmin(-1) were determined as the optimum input values and yield of 87.4% was obtained under PSO optimized conditions. The validation experiments resulted in yields of 87.5%±0.2 after three replications. Monte Carlo simulations were used for the probabilistic assessments of stochastic variability and uncertainty associated with explanatory variables of co-combustion process.

  9. Weighted Flow Algorithms (WFA) for stochastic particle coagulation

    SciTech Connect

    DeVille, R.E.L.; Riemer, N.; West, M.

    2011-09-20

    Stochastic particle-resolved methods are a useful way to compute the time evolution of the multi-dimensional size distribution of atmospheric aerosol particles. An effective approach to improve the efficiency of such models is the use of weighted computational particles. Here we introduce particle weighting functions that are power laws in particle size to the recently-developed particle-resolved model PartMC-MOSAIC and present the mathematical formalism of these Weighted Flow Algorithms (WFA) for particle coagulation and growth. We apply this to an urban plume scenario that simulates a particle population undergoing emission of different particle types, dilution, coagulation and aerosol chemistry along a Lagrangian trajectory. We quantify the performance of the Weighted Flow Algorithm for number and mass-based quantities of relevance for atmospheric sciences applications.

  10. Fuzzy optimal swarm of autonomous aircrafts for target determination and convergence control system

    NASA Astrophysics Data System (ADS)

    Richards, Zach D.

    The thesis project proposes analytical and theoretical algorithms for a networked swarm of autonomous vehicles, such as those used in planet exploration, and to be used in target location determination and convergence, an algorithm of this type could be used in an Autonomous Stratospheric Aircraft (ASA), thus having the possibility of being used for the exploration of a planet as well as many other applications. Upon locating an unknown location of a specified target, the algorithm would then swarm and eventually converge upon the location. There are two similar, but fundamentally different algorithms proposed in this project. These algorithms are capable of locating and converging upon multiple targeted locations simultaneously. This project is inspired by the current thought of NASA in the search of life on Mars, which is "Follow the Water" [18], where the targeted location would be the targeted source of water. These algorithms make use of combining a modified Particle Swarm Optimization algorithm with fuzzy variables for increased intelligence.

  11. Concurrent Algorithm For Particle-In-Cell Simulations

    NASA Technical Reports Server (NTRS)

    Liewer, Paulett C.; Decyk, Viktor K.

    1990-01-01

    Separate decompositions used for particle-motion and field calculations. General Concurrent Particle-in-Cell (GCPIC) algorithm used to implement motions of individual plasma particles (ions and electrons) under influence of particle-in-cell (PIC) computer codes on concurrent processors. Simulates motions of individual plasma particles under influence of electromagnetic fields generated by particles themselves. Performed to study variety of nonlinear problems in plasma physics, including magnetic and inertial fusion, plasmas in outer space, propagation of electron and ion beams, free-electron lasers, and particle accelerators.

  12. A Combination of Geographically Weighted Regression, Particle Swarm Optimization and Support Vector Machine for Landslide Susceptibility Mapping: A Case Study at Wanzhou in the Three Gorges Area, China.

    PubMed

    Yu, Xianyu; Wang, Yi; Niu, Ruiqing; Hu, Youjian

    2016-05-11

    In this study, a novel coupling model for landslide susceptibility mapping is presented. In practice, environmental factors may have different impacts at a local scale in study areas. To provide better predictions, a geographically weighted regression (GWR) technique is firstly used in our method to segment study areas into a series of prediction regions with appropriate sizes. Meanwhile, a support vector machine (SVM) classifier is exploited in each prediction region for landslide susceptibility mapping. To further improve the prediction performance, the particle swarm optimization (PSO) algorithm is used in the prediction regions to obtain optimal parameters for the SVM classifier. To evaluate the prediction performance of our model, several SVM-based prediction models are utilized for comparison on a study area of the Wanzhou district in the Three Gorges Reservoir. Experimental results, based on three objective quantitative measures and visual qualitative evaluation, indicate that our model can achieve better prediction accuracies and is more effective for landslide susceptibility mapping. For instance, our model can achieve an overall prediction accuracy of 91.10%, which is 7.8%-19.1% higher than the traditional SVM-based models. In addition, the obtained landslide susceptibility map by our model can demonstrate an intensive correlation between the classified very high-susceptibility zone and the previously investigated landslides.

  13. A Combination of Geographically Weighted Regression, Particle Swarm Optimization and Support Vector Machine for Landslide Susceptibility Mapping: A Case Study at Wanzhou in the Three Gorges Area, China

    PubMed Central

    Yu, Xianyu; Wang, Yi; Niu, Ruiqing; Hu, Youjian

    2016-01-01

    In this study, a novel coupling model for landslide susceptibility mapping is presented. In practice, environmental factors may have different impacts at a local scale in study areas. To provide better predictions, a geographically weighted regression (GWR) technique is firstly used in our method to segment study areas into a series of prediction regions with appropriate sizes. Meanwhile, a support vector machine (SVM) classifier is exploited in each prediction region for landslide susceptibility mapping. To further improve the prediction performance, the particle swarm optimization (PSO) algorithm is used in the prediction regions to obtain optimal parameters for the SVM classifier. To evaluate the prediction performance of our model, several SVM-based prediction models are utilized for comparison on a study area of the Wanzhou district in the Three Gorges Reservoir. Experimental results, based on three objective quantitative measures and visual qualitative evaluation, indicate that our model can achieve better prediction accuracies and is more effective for landslide susceptibility mapping. For instance, our model can achieve an overall prediction accuracy of 91.10%, which is 7.8%–19.1% higher than the traditional SVM-based models. In addition, the obtained landslide susceptibility map by our model can demonstrate an intensive correlation between the classified very high-susceptibility zone and the previously investigated landslides. PMID:27187430

  14. A Combination of Geographically Weighted Regression, Particle Swarm Optimization and Support Vector Machine for Landslide Susceptibility Mapping: A Case Study at Wanzhou in the Three Gorges Area, China.

    PubMed

    Yu, Xianyu; Wang, Yi; Niu, Ruiqing; Hu, Youjian

    2016-01-01

    In this study, a novel coupling model for landslide susceptibility mapping is presented. In practice, environmental factors may have different impacts at a local scale in study areas. To provide better predictions, a geographically weighted regression (GWR) technique is firstly used in our method to segment study areas into a series of prediction regions with appropriate sizes. Meanwhile, a support vector machine (SVM) classifier is exploited in each prediction region for landslide susceptibility mapping. To further improve the prediction performance, the particle swarm optimization (PSO) algorithm is used in the prediction regions to obtain optimal parameters for the SVM classifier. To evaluate the prediction performance of our model, several SVM-based prediction models are utilized for comparison on a study area of the Wanzhou district in the Three Gorges Reservoir. Experimental results, based on three objective quantitative measures and visual qualitative evaluation, indicate that our model can achieve better prediction accuracies and is more effective for landslide susceptibility mapping. For instance, our model can achieve an overall prediction accuracy of 91.10%, which is 7.8%-19.1% higher than the traditional SVM-based models. In addition, the obtained landslide susceptibility map by our model can demonstrate an intensive correlation between the classified very high-susceptibility zone and the previously investigated landslides. PMID:27187430

  15. Note: An iterative algorithm to improve colloidal particle locating.

    PubMed

    Jensen, K E; Nakamura, N

    2016-06-01

    Confocal microscopy of colloids combined with digital image processing has become a powerful tool in soft matter physics and materials science. Together, these techniques enable locating and tracking of more than half a million individual colloidal particles at once. However, despite improvements in locating algorithms that improve position accuracy, it remains challenging to locate all particles in a densely packed, three dimensional colloid without erroneously identifying the same particle more than once. We present a simple iterative algorithm that mitigates both the "missed particle" and "double counting" problems while simultaneously reducing sensitivity to the specific choice of input parameters. It is also useful for analyzing images with spatially varying brightness in which a single set of input parameters is not appropriate for all particles. The algorithm is easy to implement and compatible with existing particle locating software.

  16. A Bayesian Adaptive Basis Algorithm for Single Particle Reconstruction

    PubMed Central

    Kucukelbir, Alp; Sigworth, Fred J.; Tagare, Hemant D.

    2012-01-01

    Traditional single particle reconstruction methods use either the Fourier or the delta function basis to represent the particle density map. This paper proposes a more flexible algorithm that adaptively chooses the basis based on the data. Because the basis adapts to the data, the reconstruction resolution and signal-to-noise ratio (SNR) is improved compared to a reconstruction with a fixed basis. Moreover, the algorithm automatically masks the particle, thereby separating it from the background. This eliminates the need for ad-hoc filtering or masking in the refinement loop. The algorithm is formulated in a Bayesian maximum-a-posteriori framework and uses an efficient optimization algorithm for the maximization. Evaluations using simulated and actual cryogenic electron microscopy data show resolution and SNR improvements as well as the effective masking of particle from background. PMID:22564910

  17. A detection algorithm for scale analysis of post-sunset low-latitude plasma depletions as observed by the Swarm constellation mission

    NASA Astrophysics Data System (ADS)

    Kervalishvili, Guram; Stolle, Claudia; Xiong, Chao

    2016-04-01

    ESA's constellation mission Swarm was successfully launched on 22 November 2013. The three satellites achieved their final constellation on 17 April 2014 and since then Swarm-A and Swarm-C orbiting the Earth at about 470 km (flying side-by-side) and Swarm-B at about 520 km altitude. The satellites carry instruments to monitor the F-region electron density with a sampling frequency of 2 Hz. This paper will present a detection algorithm for low-latitude post-sunset plasma bubbles (depletions), which uses local minima and maxima to detect depletions directly from electron density readings from Swarm. Our analyses were performed in the magnetic latitude (MLat) and local time (MLT) coordinate system. The detection procedure also captures the amplitude of depletion, which is called depth in the following. The width of a bubble corresponds to the length the satellite is located inside a depletion. We discuss the global distribution of depth and width of plasma bubbles and its seasonal and local time dependence for all three Swarm satellites from April 2015 through September 2015. As expected, on global average the bubble occurrence rate is highest for combined equinoxes (Mar, Apr, Sep, and Oct) and smallest for June solstice (May, Jun, Jul, and Aug). MLT distribution of the bubble occurrence number shows a sharp increase at about 19 MLT and decreases towards post-midnight hours. Interestingly, there is an inverse relation between depth and width of bubbles as function of MLT. This is true for all seasons and for all Swarm satellites. The bubble depth (width) is decreasing (increasing) from post-sunset to post-midnight for December solstice (Jan, Feb, Nov, and Dec) and combined equinoxes with about the same amplitude values for bubbles depth (width). Therefore we suggest that at post midnight when the depletions are less steep the structures of the depletions is broader than early after sunset. However for June solstice the depletions are less deep and the bubble depth and

  18. SU-E-T-259: Particle Swarm Optimization in Radial Dose Function Fitting for a Novel Iodine-125 Seed

    SciTech Connect

    Wu, X; Duan, J; Popple, R; Huang, M; Shen, S; Brezovich, I; Cardan, R; Benhabib, S

    2014-06-01

    Purpose: To determine the coefficients of bi- and tri-exponential functions for the best fit of radial dose functions of the new iodine brachytherapy source: Iodine-125 Seed AgX-100. Methods: The particle swarm optimization (PSO) method was used to search for the coefficients of the biand tri-exponential functions that yield the best fit to data published for a few selected radial distances from the source. The coefficients were encoded into particles, and these particles move through the search space by following their local and global best-known positions. In each generation, particles were evaluated through their fitness function and their positions were changed through their velocities. This procedure was repeated until the convergence criterion was met or the maximum generation was reached. All best particles were found in less than 1,500 generations. Results: For the I-125 seed AgX-100 considered as a point source, the maximum deviation from the published data is less than 2.9% for bi-exponential fitting function and 0.2% for tri-exponential fitting function. For its line source, the maximum deviation is less than 1.1% for bi-exponential fitting function and 0.08% for tri-exponential fitting function. Conclusion: PSO is a powerful method in searching coefficients for bi-exponential and tri-exponential fitting functions. The bi- and tri-exponential models of Iodine-125 seed AgX-100 point and line sources obtained with PSO optimization provide accurate analytical forms of the radial dose function. The tri-exponential fitting function is more accurate than the bi-exponential function.

  19. Heuristic optimization methods for run-time intensive models (Dynamically Dimensioned Search, Particle Swarm Optimization, GA) - a comparison of performance and parallel implementation using R

    NASA Astrophysics Data System (ADS)

    Francke, Till; Bronster, Axel; Shoemaker, Christine A.

    2010-05-01

    Calibrating complex hydrological models faces two major challenges: firstly, extended models, especially when spatially distributed, encompass a large number of parameters with different (and possibly a-priori unknown) sensitivity. Due to the usually rough surface of the objective function, this aggravates the risk of an algorithm to converge in a local optimum. Thus, gradient-based optimization methods are often bound to fail without a very good prior estimate. Secondly, despite growing computational power, it is not uncommon that models of large extent in space or time take several minutes to run, which severely restricts the total number of model evaluations under given computational and time resources. While various heuristic methods successfully address the first challenge, they tend to conflict with the second challenge due to the increased number of evaluations necessary. In that context we analyzed three methods (Dynamically Dimensioned Search / DDS, Particle Swarm Optimization / PSO, Genetic Algorithms /GA). We performed tests with common "synthetic" objective functions and a calibration of the hydrological model WASA-SED with different number of parameters. When looking at the reduction of the objective function within few (i.e.< 1000) evaluations, the methods generally perform in the order (best to worst) DDS-PSO-GA. Only at a larger number, GA can excel. To speed up optimization, we executed DDS and PSO as parallel applications, i.e. using multiple CPUs and/or computers. The parallelisation has been implemented in the ppso-package for the free computation environment R. Special focus has been laid onto the options to resume interrupted optimization runs and visualize progress.

  20. Swarm Robotics

    NASA Astrophysics Data System (ADS)

    Şahin, Erol; Girgin, Sertan; Bayindir, Levent; Turgut, Ali Emre

    Swarm robotics is a novel approach to the coordination of large numbers of robots and has emerged as the application of swarm intelligence to multi-robot systems. Different from other swarm intelligence studies, swarm robotics puts emphases on the physical embodiment of individuals and realistic interactions among the individuals and between the individuals and the environment. In this chapter, we present a brief review of this new approach. We first present its definition, discuss the main motivations behind the approach, as well as its distinguishing characteristics and major coordination mechanisms. Then we present a brief review of swarm robotics research along four axes; namely design, modelling and analysis, robots and problems.

  1. Magnetic field effects on spatial relaxation of swarm particles in the idealized steady-state Townsend experiment.

    PubMed

    Li, B; Robson, R E; White, R D

    2006-08-01

    The effect of a magnetic field at right angles to an electric field on spatial relaxation of a swarm of charged particles emitted by a plane source into a gas-the idealized steady-state Townsend experiment-is examined. The Boltzmann equation is solved using an adaptation of the "two-temperature" moment method, involving a Burnett function representation of the velocity distribution function, a technique which is valid for charged particles of arbitrary mass and is intrinsically of a "multiterm" nature. Results are presented for electrons in model and real gases, and are benchmarked against an exact analytical solution of the Boltzmann equation for a particular collision model. The application of a magnetic field significantly alters the relaxation profiles: in general, it can both enhance or retard spatial relaxation of transport properties. For methane gas, a multiterm analysis is essential to correctly account for the relaxation near the source, even though a two-term approximation may be sufficient when the magnetic field is sufficiently strong and hydrodynamic conditions dominate.

  2. Inverse 4D conformal planning for lung SBRT using particle swarm optimization.

    PubMed

    Modiri, A; Gu, X; Hagan, A; Bland, R; Iyengar, P; Timmerman, R; Sawant, A

    2016-08-21

    A critical aspect of highly potent regimens such as lung stereotactic body radiation therapy (SBRT) is to avoid collateral toxicity while achieving planning target volume (PTV) coverage. In this work, we describe four dimensional conformal radiotherapy using a highly parallelizable swarm intelligence-based stochastic optimization technique. Conventional lung CRT-SBRT uses a 4DCT to create an internal target volume and then, using forward-planning, generates a 3D conformal plan. In contrast, we investigate an inverse-planning strategy that uses 4DCT data to create a 4D conformal plan, which is optimized across the three spatial dimensions (3D) as well as time, as represented by the respiratory phase. The key idea is to use respiratory motion as an additional degree of freedom. We iteratively adjust fluence weights for all beam apertures across all respiratory phases considering OAR sparing, PTV coverage and delivery efficiency. To demonstrate proof-of-concept, five non-small-cell lung cancer SBRT patients were retrospectively studied. The 4D optimized plans achieved PTV coverage comparable to the corresponding clinically delivered plans while showing significantly superior OAR sparing ranging from 26% to 83% for D max heart, 10%-41% for D max esophagus, 31%-68% for D max spinal cord and 7%-32% for V 13 lung. PMID:27476472

  3. Inverse 4D conformal planning for lung SBRT using particle swarm optimization

    NASA Astrophysics Data System (ADS)

    Modiri, A.; Gu, X.; Hagan, A.; Bland, R.; Iyengar, P.; Timmerman, R.; Sawant, A.

    2016-08-01

    A critical aspect of highly potent regimens such as lung stereotactic body radiation therapy (SBRT) is to avoid collateral toxicity while achieving planning target volume (PTV) coverage. In this work, we describe four dimensional conformal radiotherapy using a highly parallelizable swarm intelligence-based stochastic optimization technique. Conventional lung CRT-SBRT uses a 4DCT to create an internal target volume and then, using forward-planning, generates a 3D conformal plan. In contrast, we investigate an inverse-planning strategy that uses 4DCT data to create a 4D conformal plan, which is optimized across the three spatial dimensions (3D) as well as time, as represented by the respiratory phase. The key idea is to use respiratory motion as an additional degree of freedom. We iteratively adjust fluence weights for all beam apertures across all respiratory phases considering OAR sparing, PTV coverage and delivery efficiency. To demonstrate proof-of-concept, five non-small-cell lung cancer SBRT patients were retrospectively studied. The 4D optimized plans achieved PTV coverage comparable to the corresponding clinically delivered plans while showing significantly superior OAR sparing ranging from 26% to 83% for D max heart, 10%–41% for D max esophagus, 31%–68% for D max spinal cord and 7%–32% for V 13 lung.

  4. Inverse 4D conformal planning for lung SBRT using particle swarm optimization.

    PubMed

    Modiri, A; Gu, X; Hagan, A; Bland, R; Iyengar, P; Timmerman, R; Sawant, A

    2016-08-21

    A critical aspect of highly potent regimens such as lung stereotactic body radiation therapy (SBRT) is to avoid collateral toxicity while achieving planning target volume (PTV) coverage. In this work, we describe four dimensional conformal radiotherapy using a highly parallelizable swarm intelligence-based stochastic optimization technique. Conventional lung CRT-SBRT uses a 4DCT to create an internal target volume and then, using forward-planning, generates a 3D conformal plan. In contrast, we investigate an inverse-planning strategy that uses 4DCT data to create a 4D conformal plan, which is optimized across the three spatial dimensions (3D) as well as time, as represented by the respiratory phase. The key idea is to use respiratory motion as an additional degree of freedom. We iteratively adjust fluence weights for all beam apertures across all respiratory phases considering OAR sparing, PTV coverage and delivery efficiency. To demonstrate proof-of-concept, five non-small-cell lung cancer SBRT patients were retrospectively studied. The 4D optimized plans achieved PTV coverage comparable to the corresponding clinically delivered plans while showing significantly superior OAR sparing ranging from 26% to 83% for D max heart, 10%-41% for D max esophagus, 31%-68% for D max spinal cord and 7%-32% for V 13 lung.

  5. Inverse 4D conformal planning for lung SBRT using particle swarm optimization

    NASA Astrophysics Data System (ADS)

    Modiri, A.; Gu, X.; Hagan, A.; Bland, R.; Iyengar, P.; Timmerman, R.; Sawant, A.

    2016-08-01

    A critical aspect of highly potent regimens such as lung stereotactic body radiation therapy (SBRT) is to avoid collateral toxicity while achieving planning target volume (PTV) coverage. In this work, we describe four dimensional conformal radiotherapy using a highly parallelizable swarm intelligence-based stochastic optimization technique. Conventional lung CRT-SBRT uses a 4DCT to create an internal target volume and then, using forward-planning, generates a 3D conformal plan. In contrast, we investigate an inverse-planning strategy that uses 4DCT data to create a 4D conformal plan, which is optimized across the three spatial dimensions (3D) as well as time, as represented by the respiratory phase. The key idea is to use respiratory motion as an additional degree of freedom. We iteratively adjust fluence weights for all beam apertures across all respiratory phases considering OAR sparing, PTV coverage and delivery efficiency. To demonstrate proof-of-concept, five non-small-cell lung cancer SBRT patients were retrospectively studied. The 4D optimized plans achieved PTV coverage comparable to the corresponding clinically delivered plans while showing significantly superior OAR sparing ranging from 26% to 83% for D max heart, 10%-41% for D max esophagus, 31%-68% for D max spinal cord and 7%-32% for V 13 lung.

  6. Swarm intelligence in bioinformatics: methods and implementations for discovering patterns of multiple sequences.

    PubMed

    Cui, Zhihua; Zhang, Yi

    2014-02-01

    As a promising and innovative research field, bioinformatics has attracted increasing attention recently. Beneath the enormous number of open problems in this field, one fundamental issue is about the accurate and efficient computational methodology that can deal with tremendous amounts of data. In this paper, we survey some applications of swarm intelligence to discover patterns of multiple sequences. To provide a deep insight, ant colony optimization, particle swarm optimization, artificial bee colony and artificial fish swarm algorithm are selected, and their applications to multiple sequence alignment and motif detecting problem are discussed.

  7. Self-Organizing Hierarchical Particle Swarm Optimization with Time-Varying Acceleration Coefficients for Economic Dispatch with Valve Point Effects and Multifuel Options

    NASA Astrophysics Data System (ADS)

    Polprasert, Jirawadee; Ongsakul, Weerakorn; Dieu, Vo Ngoc

    2011-06-01

    This paper proposes a self-organizing hierarchical particle swarm optimization (SPSO) with time-varying acceleration coefficients (TVAC) for solving economic dispatch (ED) problem with non-smooth functions including multiple fuel options (MFO) and valve-point loading effects (VPLE). The proposed SPSO with TVAC is the new approach optimizer and good performance for solving ED problems. It can handle the premature convergence of the problem by re-initialization of velocity whenever particles are stagnated in the search space. To properly control both local and global explorations of the swarm during the optimization process, the performance of TVAC is included. The proposed method is tested in different ED problems with non-smooth cost functions and the obtained results are compared to those from many other methods in the literature. The results have revealed that the proposed SPSO with TVAC is effective in finding higher quality solutions for non-smooth ED problems than many other methods.

  8. Crude oil price forecasting based on hybridizing wavelet multiple linear regression model, particle swarm optimization techniques, and principal component analysis.

    PubMed

    Shabri, Ani; Samsudin, Ruhaidah

    2014-01-01

    Crude oil prices do play significant role in the global economy and are a key input into option pricing formulas, portfolio allocation, and risk measurement. In this paper, a hybrid model integrating wavelet and multiple linear regressions (MLR) is proposed for crude oil price forecasting. In this model, Mallat wavelet transform is first selected to decompose an original time series into several subseries with different scale. Then, the principal component analysis (PCA) is used in processing subseries data in MLR for crude oil price forecasting. The particle swarm optimization (PSO) is used to adopt the optimal parameters of the MLR model. To assess the effectiveness of this model, daily crude oil market, West Texas Intermediate (WTI), has been used as the case study. Time series prediction capability performance of the WMLR model is compared with the MLR, ARIMA, and GARCH models using various statistics measures. The experimental results show that the proposed model outperforms the individual models in forecasting of the crude oil prices series.

  9. An implementation of particle swarm optimization to evaluate optimal under-voltage load shedding in competitive electricity markets

    NASA Astrophysics Data System (ADS)

    Hosseini-Bioki, M. M.; Rashidinejad, M.; Abdollahi, A.

    2013-11-01

    Load shedding is a crucial issue in power systems especially under restructured electricity environment. Market-driven load shedding in reregulated power systems associated with security as well as reliability is investigated in this paper. A technoeconomic multi-objective function is introduced to reveal an optimal load shedding scheme considering maximum social welfare. The proposed optimization problem includes maximum GENCOs and loads' profits as well as maximum loadability limit under normal and contingency conditions. Particle swarm optimization (PSO) as a heuristic optimization technique, is utilized to find an optimal load shedding scheme. In a market-driven structure, generators offer their bidding blocks while the dispatchable loads will bid their price-responsive demands. An independent system operator (ISO) derives a market clearing price (MCP) while rescheduling the amount of generating power in both pre-contingency and post-contingency conditions. The proposed methodology is developed on a 3-bus system and then is applied to a modified IEEE 30-bus test system. The obtained results show the effectiveness of the proposed methodology in implementing the optimal load shedding satisfying social welfare by maintaining voltage stability margin (VSM) through technoeconomic analyses.

  10. Crude oil price forecasting based on hybridizing wavelet multiple linear regression model, particle swarm optimization techniques, and principal component analysis.

    PubMed

    Shabri, Ani; Samsudin, Ruhaidah

    2014-01-01

    Crude oil prices do play significant role in the global economy and are a key input into option pricing formulas, portfolio allocation, and risk measurement. In this paper, a hybrid model integrating wavelet and multiple linear regressions (MLR) is proposed for crude oil price forecasting. In this model, Mallat wavelet transform is first selected to decompose an original time series into several subseries with different scale. Then, the principal component analysis (PCA) is used in processing subseries data in MLR for crude oil price forecasting. The particle swarm optimization (PSO) is used to adopt the optimal parameters of the MLR model. To assess the effectiveness of this model, daily crude oil market, West Texas Intermediate (WTI), has been used as the case study. Time series prediction capability performance of the WMLR model is compared with the MLR, ARIMA, and GARCH models using various statistics measures. The experimental results show that the proposed model outperforms the individual models in forecasting of the crude oil prices series. PMID:24895666

  11. Sound quality prediction of vehicle interior noise and mathematical modeling using a back propagation neural network (BPNN) based on particle swarm optimization (PSO)

    NASA Astrophysics Data System (ADS)

    Zhang, Enlai; Hou, Liang; Shen, Chao; Shi, Yingliang; Zhang, Yaxiang

    2016-01-01

    To better solve the complex non-linear problem between the subjective sound quality evaluation results and objective psychoacoustics parameters, a method for the prediction of the sound quality is put forward by using a back propagation neural network (BPNN) based on particle swarm optimization (PSO), which is optimizing the initial weights and thresholds of BP network neurons through the PSO. In order to verify the effectiveness and accuracy of this approach, the noise signals of the B-Class vehicles from the idle speed to 120 km h-1 measured by the artificial head, are taken as a target. In addition, this paper describes a subjective evaluation experiment on the sound quality annoyance inside the vehicles through a grade evaluation method, by which the annoyance of each sample is obtained. With the use of Artemis software, the main objective psychoacoustic parameters of each noise sample are calculated. These parameters include loudness, sharpness, roughness, fluctuation, tonality, articulation index (AI) and A-weighted sound pressure level. Furthermore, three evaluation models with the same artificial neural network (ANN) structure are built: the standard BPNN model, the genetic algorithm-back-propagation neural network (GA-BPNN) model and the PSO-back-propagation neural network (PSO-BPNN) model. After the network training and the evaluation prediction on the three models’ network based on experimental data, it proves that the PSO-BPNN method can achieve convergence more quickly and improve the prediction accuracy of sound quality, which can further lay a foundation for the control of the sound quality inside vehicles.

  12. Solving Fractional Programming Problems based on Swarm Intelligence

    NASA Astrophysics Data System (ADS)

    Raouf, Osama Abdel; Hezam, Ibrahim M.

    2014-04-01

    This paper presents a new approach to solve Fractional Programming Problems (FPPs) based on two different Swarm Intelligence (SI) algorithms. The two algorithms are: Particle Swarm Optimization, and Firefly Algorithm. The two algorithms are tested using several FPP benchmark examples and two selected industrial applications. The test aims to prove the capability of the SI algorithms to solve any type of FPPs. The solution results employing the SI algorithms are compared with a number of exact and metaheuristic solution methods used for handling FPPs. Swarm Intelligence can be denoted as an effective technique for solving linear or nonlinear, non-differentiable fractional objective functions. Problems with an optimal solution at a finite point and an unbounded constraint set, can be solved using the proposed approach. Numerical examples are given to show the feasibility, effectiveness, and robustness of the proposed algorithm. The results obtained using the two SI algorithms revealed the superiority of the proposed technique among others in computational time. A better accuracy was remarkably observed in the solution results of the industrial application problems.

  13. A backtracking algorithm that deals with particle filter degeneracy

    NASA Astrophysics Data System (ADS)

    Baarsma, Rein; Schmitz, Oliver; Karssenberg, Derek

    2016-04-01

    Particle filters are an excellent way to deal with stochastic models incorporating Bayesian data assimilation. While they are computationally demanding, the particle filter has no problem with nonlinearity and it accepts non-Gaussian observational data. In the geoscientific field it is this computational demand that creates a problem, since dynamic grid-based models are often already quite computationally demanding. As such it is of the utmost importance to keep the amount of samples in the filter as small as possible. Small sample populations often lead to filter degeneracy however, especially in models with high stochastic forcing. Filter degeneracy renders the sample population useless, as the population is no longer statistically informative. We have created an algorithm in an existing data assimilation framework that reacts to and deals with filter degeneracy based on Spiller et al. [2008]. During the Bayesian updating step of the standard particle filter, the algorithm tests the sample population for filter degeneracy. If filter degeneracy has occurred, the algorithm resets to the last time the filter did work correctly and recalculates the failed timespan of the filter with an increased sample population. The sample population is then reduced to its original size and the particle filter continues as normal. This algorithm was created in the PCRaster Python framework, an open source tool that enables spatio-temporal forward modelling in Python [Karssenberg et al., 2010] . The framework already contains several data assimilation algorithms, including a standard particle filter and a Kalman filter. The backtracking particle filter algorithm has been added to the framework, which will make it easy to implement in other research. The performance of the backtracking particle filter is tested against a standard particle filter using two models. The first is a simple nonlinear point model, and the second is a more complex geophysical model. The main testing

  14. Multi-scale textural feature extraction and particle swarm optimization based model selection for false positive reduction in mammography.

    PubMed

    Zyout, Imad; Czajkowska, Joanna; Grzegorzek, Marcin

    2015-12-01

    The high number of false positives and the resulting number of avoidable breast biopsies are the major problems faced by current mammography Computer Aided Detection (CAD) systems. False positive reduction is not only a requirement for mass but also for calcification CAD systems which are currently deployed for clinical use. This paper tackles two problems related to reducing the number of false positives in the detection of all lesions and masses, respectively. Firstly, textural patterns of breast tissue have been analyzed using several multi-scale textural descriptors based on wavelet and gray level co-occurrence matrix. The second problem addressed in this paper is the parameter selection and performance optimization. For this, we adopt a model selection procedure based on Particle Swarm Optimization (PSO) for selecting the most discriminative textural features and for strengthening the generalization capacity of the supervised learning stage based on a Support Vector Machine (SVM) classifier. For evaluating the proposed methods, two sets of suspicious mammogram regions have been used. The first one, obtained from Digital Database for Screening Mammography (DDSM), contains 1494 regions (1000 normal and 494 abnormal samples). The second set of suspicious regions was obtained from database of Mammographic Image Analysis Society (mini-MIAS) and contains 315 (207 normal and 108 abnormal) samples. Results from both datasets demonstrate the efficiency of using PSO based model selection for optimizing both classifier hyper-parameters and parameters, respectively. Furthermore, the obtained results indicate the promising performance of the proposed textural features and more specifically, those based on co-occurrence matrix of wavelet image representation technique. PMID:25795630

  15. Multi-scale textural feature extraction and particle swarm optimization based model selection for false positive reduction in mammography.

    PubMed

    Zyout, Imad; Czajkowska, Joanna; Grzegorzek, Marcin

    2015-12-01

    The high number of false positives and the resulting number of avoidable breast biopsies are the major problems faced by current mammography Computer Aided Detection (CAD) systems. False positive reduction is not only a requirement for mass but also for calcification CAD systems which are currently deployed for clinical use. This paper tackles two problems related to reducing the number of false positives in the detection of all lesions and masses, respectively. Firstly, textural patterns of breast tissue have been analyzed using several multi-scale textural descriptors based on wavelet and gray level co-occurrence matrix. The second problem addressed in this paper is the parameter selection and performance optimization. For this, we adopt a model selection procedure based on Particle Swarm Optimization (PSO) for selecting the most discriminative textural features and for strengthening the generalization capacity of the supervised learning stage based on a Support Vector Machine (SVM) classifier. For evaluating the proposed methods, two sets of suspicious mammogram regions have been used. The first one, obtained from Digital Database for Screening Mammography (DDSM), contains 1494 regions (1000 normal and 494 abnormal samples). The second set of suspicious regions was obtained from database of Mammographic Image Analysis Society (mini-MIAS) and contains 315 (207 normal and 108 abnormal) samples. Results from both datasets demonstrate the efficiency of using PSO based model selection for optimizing both classifier hyper-parameters and parameters, respectively. Furthermore, the obtained results indicate the promising performance of the proposed textural features and more specifically, those based on co-occurrence matrix of wavelet image representation technique.

  16. Foraging on the potential energy surface: a swarm intelligence-based optimizer for molecular geometry.

    PubMed

    Wehmeyer, Christoph; Falk von Rudorff, Guido; Wolf, Sebastian; Kabbe, Gabriel; Schärf, Daniel; Kühne, Thomas D; Sebastiani, Daniel

    2012-11-21

    We present a stochastic, swarm intelligence-based optimization algorithm for the prediction of global minima on potential energy surfaces of molecular cluster structures. Our optimization approach is a modification of the artificial bee colony (ABC) algorithm which is inspired by the foraging behavior of honey bees. We apply our modified ABC algorithm to the problem of global geometry optimization of molecular cluster structures and show its performance for clusters with 2-57 particles and different interatomic interaction potentials. PMID:23181297

  17. Foraging on the potential energy surface: A swarm intelligence-based optimizer for molecular geometry

    NASA Astrophysics Data System (ADS)

    Wehmeyer, Christoph; Falk von Rudorff, Guido; Wolf, Sebastian; Kabbe, Gabriel; Schärf, Daniel; Kühne, Thomas D.; Sebastiani, Daniel

    2012-11-01

    We present a stochastic, swarm intelligence-based optimization algorithm for the prediction of global minima on potential energy surfaces of molecular cluster structures. Our optimization approach is a modification of the artificial bee colony (ABC) algorithm which is inspired by the foraging behavior of honey bees. We apply our modified ABC algorithm to the problem of global geometry optimization of molecular cluster structures and show its performance for clusters with 2-57 particles and different interatomic interaction potentials.

  18. Particle recognition in microfluidic applications using a template matching algorithm

    NASA Astrophysics Data System (ADS)

    Girault, Mathias; Odaka, Masao; Kim, Hyonchol; Matsuura, Kenji; Terazono, Hideyuki; Yasuda, Kenji

    2016-06-01

    We herein examined the ability of a template matching algorithm to recognize particles with diameters ranging from 1 to 20 µm in a microfluidic channel. The algorithm consisted of measurements of the distance between the templates and the images captured with a high-speed camera in order to search for the presence of the desired particle. The results obtained indicated that the effects of blur and diffraction rings observed around the particle are important phenomena that limit the recognition of a target. Owing to the effects of diffraction rings, the distance between a template and an image is not exclusively linked to the position of the focus plane; it is also linked to the size of the particle being searched for. By using a set of three templates captured at different Z focuses and an 800× magnification, the template matching algorithm has the ability to recognize beads ranging in diameter from 1.7 to 20 µm with a resolution between 0.3 and 1 µm.

  19. Swarm intelligence optimization and its application in geophysical data inversion

    NASA Astrophysics Data System (ADS)

    Yuan, Sanyi; Wang, Shangxu; Tian, Nan

    2009-06-01

    The inversions of complex geophysical data always solve multi-parameter, nonlinear, and multimodal optimization problems. Searching for the optimal inversion solutions is similar to the social behavior observed in swarms such as birds and ants when searching for food. In this article, first the particle swarm optimization algorithm was described in detail, and ant colony algorithm improved. Then the methods were applied to three different kinds of geophysical inversion problems: (1) a linear problem which is sensitive to noise, (2) a synchronous inversion of linear and nonlinear problems, and (3) a nonlinear problem. The results validate their feasibility and efficiency. Compared with the conventional genetic algorithm and simulated annealing, they have the advantages of higher convergence speed and accuracy. Compared with the quasi-Newton method and Levenberg-Marquardt method, they work better with the ability to overcome the locally optimal solutions.

  20. Long Swarms and Short Swarms

    NASA Astrophysics Data System (ADS)

    McNutt, S. R.

    2011-12-01

    Many earthquake swarms at volcanoes last several months, then have a sharp uptick in rate in the hours before eruption. Examples include 2006 Augustine, 8.5 months then 10 hours; 1992 Spurr, 10 months then 4 hours; 1994 Rabaul, ~1 year then 27 hours; 2008 Kasatochi, 6 weeks then 2 days; and 2011 Puyuehue Cordon Caulle, 5 weeks then 2 days. For the well studied Augustine case, broadband data showed that very long period (VLP) energy accompanied 221 of 722 located earthquakes in the 10 hours before the first explosive eruption on 11 January 2006. This was revealed by low-pass filtering and the period of the VLP signal was 50 sec. The Augustine broadband stations were campaign instruments at distances of 2-3 km from the vent. No similar VLP energy has been found in events during the 8.5 month long swarm. Okmok volcano had a short swarm only lasting 5 hours prior to its 12 July 2008 eruption. Low-pass filtering of data from broadband station OKSO, 10 km from the vent, showed that 23 of 42 located events had VLP energy with a period of 30-40 sec. Events from Kasatochi volcano were scanned on station ATKA. Here the broadband station is much farther away at 88 km but the earthquakes in the short swarm 7 August 2008 were much larger with many M>3 events. The station suffered data gaps so only a few hours of data were scanned but numerous events were observed with VLP energy starting just after the P phase. Low-pass filtering showed VLP energy with a period of 10-12 sec. No VLP energy has been found in events of the preceding 6 week long swarm. These observations at three different volcanoes suggest that the short swarms represent a different process than the long swarms. The long swarms likely reflect pressure increases in the surrounding country rock caused by increasing magma pressure. The short swarms in contrast, appear to represent discrete pulses of magma injection at shallow depths. For all three volcanoes the earthquakes looked like typical volcano-tectonic (VT

  1. An hourglass control algorithm for Lagrangian Smooth Particle Hydrodynamics

    NASA Astrophysics Data System (ADS)

    Ganzenmüller, Georg C.

    2015-04-01

    This paper presents a stabilization scheme which addresses the rank-deficiency problem in meshless collocation methods for solid mechanics. Specifically, Smooth-Particle Hydrodynamics (SPH) in the Total Lagrangian formalism is considered. This method is rank-deficient in the sense that the SPH approximation of the deformation gradient is not unique with respect to the positions of the integration points. The non-uniqueness can result in the formation of zero-energy modes. If undetected, these modes can grow and completely dominate the solution. Here, an algorithm is introduced, which effectively suppresses these modes in a fashion similar to hour-glass control mechanisms in Finite-Element methods. Simulations utilizing this control algorithm result exhibit much improved stability, accuracy, and error convergence properties. In contrast to an alternative method which eliminates zero-energy modes, namely the use of additional integration points, the here presented algorithm is easy to implement and computationally very efficient.

  2. Particle filtering algorithm for tracking multiple road-constrained targets

    NASA Astrophysics Data System (ADS)

    Agate, Craig S.; Sullivan, Kevin J.

    2003-08-01

    We propose a particle filtering algorithm for tracking multiple ground targets in a road-constrained environment through the use of GMTI radar measurements. Particle filters approximate the probability density function (PDF) of a target's state by a set of discrete points in the state space. The particle filter implements the step of propagating the target dynamics by simulating them. Thus, the dynamic model is not limited to that of a linear model with Gaussian noise, and the state space is not limited to linear vector spaces. Indeed, the road network is a subset (not even a vector space) of R2. Constraining the target to lie on the road leads to adhoc approaches for the standard Kalman filter. However, since the particle filter simulates the dynamics, it is able to simply sample points in the road network. Furthermore, while the target dynamics are modeled with a parasitic acceleration, a non-Gaussian discrete random variable noise process is used to simulate the target going through an intersection and choosing the next segment in the road network on which to travel. The algorithm is implemented in the SLAMEM simulation (an extensive simulation which models roads, terrain, sensors and vehicles using GVS). Tracking results from the simulation are presented.

  3. On improving the algorithm efficiency in the particle-particle force calculations

    NASA Astrophysics Data System (ADS)

    Kozynchenko, Alexander I.; Kozynchenko, Sergey A.

    2016-09-01

    The problem of calculating inter-particle forces in the particle-particle (PP) simulation models takes an important place in scientific computing. Such simulation models are used in diverse scientific applications arising in astrophysics, plasma physics, particle accelerators, etc., where the long-range forces are considered. The inverse-square laws such as Coulomb's law of electrostatic forces and Newton's law of universal gravitation are the examples of laws pertaining to the long-range forces. The standard naïve PP method outlined, for example, by Hockney and Eastwood [1] is straightforward, processing all pairs of particles in a double nested loop. The PP algorithm provides the best accuracy of all possible methods, but its computational complexity is O (Np2), where Np is a total number of particles involved. Too low efficiency of the PP algorithm seems to be the challenging issue in some cases where the high accuracy is required. An example can be taken from the charged particle beam dynamics where, under computing the own space charge of the beam, so-called macro-particles are used (see e.g., Humphries Jr. [2], Kozynchenko and Svistunov [3]).

  4. A Food Chain Algorithm for Capacitated Vehicle Routing Problem with Recycling in Reverse Logistics

    NASA Astrophysics Data System (ADS)

    Song, Qiang; Gao, Xuexia; Santos, Emmanuel T.

    2015-12-01

    This paper introduces the capacitated vehicle routing problem with recycling in reverse logistics, and designs a food chain algorithm for it. Some illustrative examples are selected to conduct simulation and comparison. Numerical results show that the performance of the food chain algorithm is better than the genetic algorithm, particle swarm optimization as well as quantum evolutionary algorithm.

  5. An improved algorithm for tracking multiple, freely moving particles in a Positron Emission Particle Tracking system

    NASA Astrophysics Data System (ADS)

    Yang, Z.; Fryer, P. J.; Bakalis, S.; Fan, X.; Parker, D. J.; Seville, J. P. K.

    2007-07-01

    Positron Emission Particle Tracking (PEPT) is a powerful technique and capable of following a single tracer accurately and non-invasively in flow and mixing processes. It has been recently extended to observe the rotation of a large particle via tracking three small positron-emitting tracers mounted, with fixed separation distances, on the surface. The Multiple-Positron Emission Particle Tracking technique has been successfully used to study the rotational and translational behaviours of a large particle in a multiphase flow; however, it was not capable of following multiple freely moving particles. This paper presents an improved Multiple-Positron Emission Particle Tracking technique that is able to track more than one particle without constraint in separation distance between the particles. It consists of an improved algorithm for location calculation, particle identification and time reconstruction. The information obtained can be used to understand the interactions and relative motions of particles with different sizes, densities and material textures in multiphase systems, and is particularly useful in pharmaceutical, chemical and metallurgical engineering studies.

  6. Deploying swarm intelligence in medical imaging identifying metastasis, micro-calcifications and brain image segmentation.

    PubMed

    al-Rifaie, Mohammad Majid; Aber, Ahmed; Hemanth, Duraiswamy Jude

    2015-12-01

    This study proposes an umbrella deployment of swarm intelligence algorithm, such as stochastic diffusion search for medical imaging applications. After summarising the results of some previous works which shows how the algorithm assists in the identification of metastasis in bone scans and microcalcifications on mammographs, for the first time, the use of the algorithm in assessing the CT images of the aorta is demonstrated along with its performance in detecting the nasogastric tube in chest X-ray. The swarm intelligence algorithm presented in this study is adapted to address these particular tasks and its functionality is investigated by running the swarms on sample CT images and X-rays whose status have been determined by senior radiologists. In addition, a hybrid swarm intelligence-learning vector quantisation (LVQ) approach is proposed in the context of magnetic resonance (MR) brain image segmentation. The particle swarm optimisation is used to train the LVQ which eliminates the iteration-dependent nature of LVQ. The proposed methodology is used to detect the tumour regions in the abnormal MR brain images. PMID:26577158

  7. A local adaptive discretization algorithm for Smoothed Particle Hydrodynamics

    NASA Astrophysics Data System (ADS)

    Spreng, Fabian; Schnabel, Dirk; Mueller, Alexandra; Eberhard, Peter

    2014-06-01

    In this paper, an extension to the Smoothed Particle Hydrodynamics (SPH) method is proposed that allows for an adaptation of the discretization level of a simulated continuum at runtime. By combining a local adaptive refinement technique with a newly developed coarsening algorithm, one is able to improve the accuracy of the simulation results while reducing the required computational cost at the same time. For this purpose, the number of particles is, on the one hand, adaptively increased in critical areas of a simulation model. Typically, these are areas that show a relatively low particle density and high gradients in stress or temperature. On the other hand, the number of SPH particles is decreased for domains with a high particle density and low gradients. Besides a brief introduction to the basic principle of the SPH discretization method, the extensions to the original formulation providing such a local adaptive refinement and coarsening of the modeled structure are presented in this paper. After having introduced its theoretical background, the applicability of the enhanced formulation, as well as the benefit gained from the adaptive model discretization, is demonstrated in the context of four different simulation scenarios focusing on solid continua. While presenting the results found for these examples, several properties of the proposed adaptive technique are discussed, e.g. the conservation of momentum as well as the existing correlation between the chosen refinement and coarsening patterns and the observed quality of the results.

  8. Swarm Intelligence in Text Document Clustering

    SciTech Connect

    Cui, Xiaohui; Potok, Thomas E

    2008-01-01

    Social animals or insects in nature often exhibit a form of emergent collective behavior. The research field that attempts to design algorithms or distributed problem-solving devices inspired by the collective behavior of social insect colonies is called Swarm Intelligence. Compared to the traditional algorithms, the swarm algorithms are usually flexible, robust, decentralized and self-organized. These characters make the swarm algorithms suitable for solving complex problems, such as document collection clustering. The major challenge of today's information society is being overwhelmed with information on any topic they are searching for. Fast and high-quality document clustering algorithms play an important role in helping users to effectively navigate, summarize, and organize the overwhelmed information. In this chapter, we introduce three nature inspired swarm intelligence clustering approaches for document clustering analysis. These clustering algorithms use stochastic and heuristic principles discovered from observing bird flocks, fish schools and ant food forage.

  9. A complexity-performance-balanced multiuser detector based on artificial fish swarm algorithm for DS-UWB systems in the AWGN and multipath environments

    NASA Astrophysics Data System (ADS)

    Yin, Zhendong; Zong, Zhiyuan; Sun, Hongjian; Wu, Zhilu; Yang, Zhutian

    2012-12-01

    In this article, an efficient multiuser detector based on the artificial fish swarm algorithm (AFSA-MUD) is proposed and investigated for direct-sequence ultrawideband systems under different channels: the additive white Gaussian noise channel and the IEEE 802.15.3a multipath channel. From the literature review, the issues that the computational complexity of classical optimum multiuser detection (OMD) rises exponentially with the number of users and the bit error rate (BER) performance of other sub-optimal multiuser detectors is not satisfactory, still need to be solved. This proposed method can make a good tradeoff between complexity and performance through the various behaviors of artificial fishes in the simplified Euclidean solution space, which is constructed by the solutions of some sub-optimal multiuser detectors. Here, these sub-optimal detectors are minimum mean square error detector, decorrelating detector, and successive interference cancellation detector. As a result of this novel scheme, the convergence speed of AFSA-MUD is greatly accelerated and the number of iterations is also significantly reduced. The experimental results demonstrate that the BER performance and the near-far effect resistance of this proposed algorithm are quite close to those of OMD, while its computational complexity is much lower than the traditional OMD. Moreover, as the number of active users increases, the BER performance of AFSA-MUD is almost the same as that of OMD.

  10. Particle Communication and Domain Neighbor Coupling: Scalable Domain Decomposed Algorithms for Monte Carlo Particle Transport

    SciTech Connect

    O'Brien, M. J.; Brantley, P. S.

    2015-01-20

    In order to run Monte Carlo particle transport calculations on new supercomputers with hundreds of thousands or millions of processors, care must be taken to implement scalable algorithms. This means that the algorithms must continue to perform well as the processor count increases. In this paper, we examine the scalability of:(1) globally resolving the particle locations on the correct processor, (2) deciding that particle streaming communication has finished, and (3) efficiently coupling neighbor domains together with different replication levels. We have run domain decomposed Monte Carlo particle transport on up to 221 = 2,097,152 MPI processes on the IBM BG/Q Sequoia supercomputer and observed scalable results that agree with our theoretical predictions. These calculations were carefully constructed to have the same amount of work on every processor, i.e. the calculation is already load balanced. We also examine load imbalanced calculations where each domain’s replication level is proportional to its particle workload. In this case we show how to efficiently couple together adjacent domains to maintain within workgroup load balance and minimize memory usage.

  11. Dynamics of pattern formation in bacterial swarms

    NASA Astrophysics Data System (ADS)

    Steager, Edward B.; Kim, Chang-Beom; Kim, Min Jun

    2008-07-01

    To gain a more thorough understanding of the dynamics of swarming bacteria, a nonlabeled cell tracking algorithm was used to study the velocity field of flagellated bacteria, Serratia marcescens, swarming on a soft agar plate. The average velocities for local regions regularly arranged over the entire flow field were investigated. The velocity field of the bacteria typically featured the combination of curvilinear translation and vortex modes. They repeated these patterns for short periods of time, forming several groups and dissipating. To further investigate the flow patterns generated by the collective motion of the swarming bacteria, the velocity field on the swarm was spatially correlated. The highest velocities and correlation lengths have been found to occur in the region from 0.5to1mm from the swarm edge, followed by a steady decline as distance from the edge increases, and a sudden decrease in motion typically occurs between 2 and 4mm from the swarm edge.

  12. Particle filter-based track before detect algorithms

    NASA Astrophysics Data System (ADS)

    Boers, Yvo; Driessen, Hans

    2003-12-01

    In this paper we will give a general system setup, that allows the formulation of a wide range of Track Before Detect (TBD) problems. A general basic particle filter algorithm for this system is also provided. TBD is a technique, where tracks are produced directly on the basis of raw (radar) measurements, e.g. power or IQ data, without intermediate processing and decision making. The advantage over classical tracking is that the full information is integrated over time, this leads to a better detection and tracking performance, especially for weak targets. In this paper we look at the filtering and the detection aspect of TBD. We will formulate a detection result, that allows the user to implement any optimal detector in terms of the weights of a running particle filter. We will give a theoretical as well as a numerical (experimental) justification for this. Furthermore, we show that the TBD setup, that is chosen in this paper, allows a straightforward extension to the multi-target case. This easy extension is also due to the fact that the implementation of the solution is by means of a particle filter.

  13. Particle filter-based track before detect algorithms

    NASA Astrophysics Data System (ADS)

    Boers, Yvo; Driessen, Hans

    2004-01-01

    In this paper we will give a general system setup, that allows the formulation of a wide range of Track Before Detect (TBD) problems. A general basic particle filter algorithm for this system is also provided. TBD is a technique, where tracks are produced directly on the basis of raw (radar) measurements, e.g. power or IQ data, without intermediate processing and decision making. The advantage over classical tracking is that the full information is integrated over time, this leads to a better detection and tracking performance, especially for weak targets. In this paper we look at the filtering and the detection aspect of TBD. We will formulate a detection result, that allows the user to implement any optimal detector in terms of the weights of a running particle filter. We will give a theoretical as well as a numerical (experimental) justification for this. Furthermore, we show that the TBD setup, that is chosen in this paper, allows a straightforward extension to the multi-target case. This easy extension is also due to the fact that the implementation of the solution is by means of a particle filter.

  14. Fuzzy forecasting based on two-factors second-order fuzzy-trend logical relationship groups and particle swarm optimization techniques.

    PubMed

    Chen, Shyi-Ming; Manalu, Gandhi Maruli Tua; Pan, Jeng-Shyang; Liu, Hsiang-Chuan

    2013-06-01

    In this paper, we present a new method for fuzzy forecasting based on two-factors second-order fuzzy-trend logical relationship groups and particle swarm optimization (PSO) techniques. First, we fuzzify the historical training data of the main factor and the secondary factor, respectively, to form two-factors second-order fuzzy logical relationships. Then, we group the two-factors second-order fuzzy logical relationships into two-factors second-order fuzzy-trend logical relationship groups. Then, we obtain the optimal weighting vector for each fuzzy-trend logical relationship group by using PSO techniques to perform the forecasting. We also apply the proposed method to forecast the Taiwan Stock Exchange Capitalization Weighted Stock Index and the NTD/USD exchange rates. The experimental results show that the proposed method gets better forecasting performance than the existing methods.

  15. Binary particle swarm optimized 2  ×  2 power splitters in a standard foundry silicon photonic platform.

    PubMed

    Mak, Jason C C; Sideris, Constantine; Jeong, Junho; Hajimiri, Ali; Poon, Joyce K S

    2016-08-15

    Compact power splitters designed ab initio using binary particle swarm optimization in a 2D mesh for a standard foundry silicon photonic platform are studied. Designs with a 4.8  μm×4.8  μm footprint composed of 200  nm×200  nm and 100  nm×100  nm cells are demonstrated. Despite not respecting design rules, the design with the smaller cells had lower insertion losses and broader bandwidth and showed consistent behavior across the wafer. Deviations between design and experiments point to the need for further investigations of the minimum feature dimensions. PMID:27519110

  16. Time-delayed autosynchronous swarm control.

    PubMed

    Biggs, James D; Bennet, Derek J; Dadzie, S Kokou

    2012-01-01

    In this paper a general Morse potential model of self-propelling particles is considered in the presence of a time-delayed term and a spring potential. It is shown that the emergent swarm behavior is dependent on the delay term and weights of the time-delayed function, which can be set to induce a stationary swarm, a rotating swarm with uniform translation, and a rotating swarm with a stationary center of mass. An analysis of the mean field equations shows that without a spring potential the motion of the center of mass is determined explicitly by a multivalued function. For a nonzero spring potential the swarm converges to a vortex formation about a stationary center of mass, except at discrete bifurcation points where the center of mass will periodically trace an ellipse. The analytical results defining the behavior of the center of mass are shown to correspond with the numerical swarm simulations. PMID:22400623

  17. Time-delayed autosynchronous swarm control

    NASA Astrophysics Data System (ADS)

    Biggs, James D.; Bennet, Derek J.; Dadzie, S. Kokou

    2012-01-01

    In this paper a general Morse potential model of self-propelling particles is considered in the presence of a time-delayed term and a spring potential. It is shown that the emergent swarm behavior is dependent on the delay term and weights of the time-delayed function, which can be set to induce a stationary swarm, a rotating swarm with uniform translation, and a rotating swarm with a stationary center of mass. An analysis of the mean field equations shows that without a spring potential the motion of the center of mass is determined explicitly by a multivalued function. For a nonzero spring potential the swarm converges to a vortex formation about a stationary center of mass, except at discrete bifurcation points where the center of mass will periodically trace an ellipse. The analytical results defining the behavior of the center of mass are shown to correspond with the numerical swarm simulations.

  18. Modified Landweber algorithm for robust particle sizing by using Fraunhofer diffraction.

    PubMed

    Xu, Lijun; Wei, Tianxiao; Zhou, Jiayi; Cao, Zhang

    2014-09-20

    In this paper, a robust modified Landweber algorithm was proposed to retrieve the particle size distributions from Fraunhofer diffraction. Three typical particle size distributions, i.e., Rosin-Rammler, lognormal, and bimodal normal distributions for particles ranging from 4.8 to 96 μm, were employed to verify the performance of the algorithm. To show its merits, the proposed algorithm was compared with the Tikhonov regularization algorithm and the ℓ1-norm-based algorithm. Simulation results showed that, for noise-free data, both the modified Landweber algorithm and the ℓ1-norm-based algorithm were better than the Tikhonov regularization algorithm in terms of accuracy. When the data was noise-contaminated, the modified Landweber algorithm was superior to the other two algorithms in both accuracy and speed. An experimental setup was also established and the results validated the feasibility and effectiveness of the proposed method.

  19. Accelerated algorithm for computing the motion of solid particles suspended in fluid.

    PubMed

    Ding, E J

    2009-08-01

    A fast algorithm for computing the motion of solid particles suspended in fluid is presented. The motion of solid particles suspended in Stokes flow can be calculated without fully calculating the fluid motion. When the steady-state simulation is sufficient, this algorithm can greatly accelerate the simulation of solid particle suspension in Stokes flow.

  20. An Integrated Centroid Finding and Particle Overlap Decomposition Algorithm for Stereo Imaging Velocimetry

    NASA Technical Reports Server (NTRS)

    McDowell, Mark

    2004-01-01

    An integrated algorithm for decomposing overlapping particle images (multi-particle objects) along with determining each object s constituent particle centroid(s) has been developed using image analysis techniques. The centroid finding algorithm uses a modified eight-direction search method for finding the perimeter of any enclosed object. The centroid is calculated using the intensity-weighted center of mass of the object. The overlap decomposition algorithm further analyzes the object data and breaks it down into its constituent particle centroid(s). This is accomplished with an artificial neural network, feature based technique and provides an efficient way of decomposing overlapping particles. Combining the centroid finding and overlap decomposition routines into a single algorithm allows us to accurately predict the error associated with finding the centroid(s) of particles in our experiments. This algorithm has been tested using real, simulated, and synthetic data and the results are presented and discussed.

  1. A general concurrent algorithm for plasma particle-in-cell simulation codes

    NASA Technical Reports Server (NTRS)

    Liewer, Paulett C.; Decyk, Viktor K.

    1989-01-01

    The general concurrent particle-in-cell (GCPIC) algorithm has been used to implement an electrostatic particle-in-cell code on a 32-node hypercube parallel computer. The GCPIC algorithm decomposes the PIC code by dividing the particle simulation physical domain into subdomains that are equal in number to the number of processors; all subdomains will accordingly possess approximately equal numbers of particles. The portion of the code which updates particle positions and velocities is nearly 100 percent efficient when the number of particles increases linearly with that of hypercube processors.

  2. Honey Bees Inspired Optimization Method: The Bees Algorithm.

    PubMed

    Yuce, Baris; Packianather, Michael S; Mastrocinque, Ernesto; Pham, Duc Truong; Lambiase, Alfredo

    2013-01-01

    Optimization algorithms are search methods where the goal is to find an optimal solution to a problem, in order to satisfy one or more objective functions, possibly subject to a set of constraints. Studies of social animals and social insects have resulted in a number of computational models of swarm intelligence. Within these swarms their collective behavior is usually very complex. The collective behavior of a swarm of social organisms emerges from the behaviors of the individuals of that swarm. Researchers have developed computational optimization methods based on biology such as Genetic Algorithms, Particle Swarm Optimization, and Ant Colony. The aim of this paper is to describe an optimization algorithm called the Bees Algorithm, inspired from the natural foraging behavior of honey bees, to find the optimal solution. The algorithm performs both an exploitative neighborhood search combined with random explorative search. In this paper, after an explanation of the natural foraging behavior of honey bees, the basic Bees Algorithm and its improved versions are described and are implemented in order to optimize several benchmark functions, and the results are compared with those obtained with different optimization algorithms. The results show that the Bees Algorithm offering some advantage over other optimization methods according to the nature of the problem. PMID:26462528

  3. Honey Bees Inspired Optimization Method: The Bees Algorithm.

    PubMed

    Yuce, Baris; Packianather, Michael S; Mastrocinque, Ernesto; Pham, Duc Truong; Lambiase, Alfredo

    2013-11-06

    Optimization algorithms are search methods where the goal is to find an optimal solution to a problem, in order to satisfy one or more objective functions, possibly subject to a set of constraints. Studies of social animals and social insects have resulted in a number of computational models of swarm intelligence. Within these swarms their collective behavior is usually very complex. The collective behavior of a swarm of social organisms emerges from the behaviors of the individuals of that swarm. Researchers have developed computational optimization methods based on biology such as Genetic Algorithms, Particle Swarm Optimization, and Ant Colony. The aim of this paper is to describe an optimization algorithm called the Bees Algorithm, inspired from the natural foraging behavior of honey bees, to find the optimal solution. The algorithm performs both an exploitative neighborhood search combined with random explorative search. In this paper, after an explanation of the natural foraging behavior of honey bees, the basic Bees Algorithm and its improved versions are described and are implemented in order to optimize several benchmark functions, and the results are compared with those obtained with different optimization algorithms. The results show that the Bees Algorithm offering some advantage over other optimization methods according to the nature of the problem.

  4. Alignment algorithms and per-particle CTF correction for single particle cryo-electron tomography.

    PubMed

    Galaz-Montoya, Jesús G; Hecksel, Corey W; Baldwin, Philip R; Wang, Eryu; Weaver, Scott C; Schmid, Michael F; Ludtke, Steven J; Chiu, Wah

    2016-06-01

    Single particle cryo-electron tomography (cryoSPT) extracts features from cryo-electron tomograms, followed by 3D classification, alignment and averaging to generate improved 3D density maps of such features. Robust methods to correct for the contrast transfer function (CTF) of the electron microscope are necessary for cryoSPT to reach its resolution potential. Many factors can make CTF correction for cryoSPT challenging, such as lack of eucentricity of the specimen stage, inherent low dose per image, specimen charging, beam-induced specimen motions, and defocus gradients resulting both from specimen tilting and from unpredictable ice thickness variations. Current CTF correction methods for cryoET make at least one of the following assumptions: that the defocus at the center of the image is the same across the images of a tiltseries, that the particles all lie at the same Z-height in the embedding ice, and/or that the specimen, the cryo-electron microscopy (cryoEM) grid and/or the carbon support are flat. These experimental conditions are not always met. We have developed a CTF correction algorithm for cryoSPT without making any of the aforementioned assumptions. We also introduce speed and accuracy improvements and a higher degree of automation to the subtomogram averaging algorithms available in EMAN2. Using motion-corrected images of isolated virus particles as a benchmark specimen, recorded with a DE20 direct detection camera, we show that our CTF correction and subtomogram alignment routines can yield subtomogram averages close to 4/5 Nyquist frequency of the detector under our experimental conditions. PMID:27016284

  5. Alignment algorithms and per-particle CTF correction for single particle cryo-electron tomography.

    PubMed

    Galaz-Montoya, Jesús G; Hecksel, Corey W; Baldwin, Philip R; Wang, Eryu; Weaver, Scott C; Schmid, Michael F; Ludtke, Steven J; Chiu, Wah

    2016-06-01

    Single particle cryo-electron tomography (cryoSPT) extracts features from cryo-electron tomograms, followed by 3D classification, alignment and averaging to generate improved 3D density maps of such features. Robust methods to correct for the contrast transfer function (CTF) of the electron microscope are necessary for cryoSPT to reach its resolution potential. Many factors can make CTF correction for cryoSPT challenging, such as lack of eucentricity of the specimen stage, inherent low dose per image, specimen charging, beam-induced specimen motions, and defocus gradients resulting both from specimen tilting and from unpredictable ice thickness variations. Current CTF correction methods for cryoET make at least one of the following assumptions: that the defocus at the center of the image is the same across the images of a tiltseries, that the particles all lie at the same Z-height in the embedding ice, and/or that the specimen, the cryo-electron microscopy (cryoEM) grid and/or the carbon support are flat. These experimental conditions are not always met. We have developed a CTF correction algorithm for cryoSPT without making any of the aforementioned assumptions. We also introduce speed and accuracy improvements and a higher degree of automation to the subtomogram averaging algorithms available in EMAN2. Using motion-corrected images of isolated virus particles as a benchmark specimen, recorded with a DE20 direct detection camera, we show that our CTF correction and subtomogram alignment routines can yield subtomogram averages close to 4/5 Nyquist frequency of the detector under our experimental conditions.

  6. Basic firefly algorithm for document clustering

    NASA Astrophysics Data System (ADS)

    Mohammed, Athraa Jasim; Yusof, Yuhanis; Husni, Husniza

    2015-12-01

    The Document clustering plays significant role in Information Retrieval (IR) where it organizes documents prior to the retrieval process. To date, various clustering algorithms have been proposed and this includes the K-means and Particle Swarm Optimization. Even though these algorithms have been widely applied in many disciplines due to its simplicity, such an approach tends to be trapped in a local minimum during its search for an optimal solution. To address the shortcoming, this paper proposes a Basic Firefly (Basic FA) algorithm to cluster text documents. The algorithm employs the Average Distance to Document Centroid (ADDC) as the objective function of the search. Experiments utilizing the proposed algorithm were conducted on the 20Newsgroups benchmark dataset. Results demonstrate that the Basic FA generates a more robust and compact clusters than the ones produced by K-means and Particle Swarm Optimization (PSO).

  7. A Multipopulation PSO Based Memetic Algorithm for Permutation Flow Shop Scheduling

    PubMed Central

    Liu, Ruochen; Ma, Chenlin; Ma, Wenping; Li, Yangyang

    2013-01-01

    The permutation flow shop scheduling problem (PFSSP) is part of production scheduling, which belongs to the hardest combinatorial optimization problem. In this paper, a multipopulation particle swarm optimization (PSO) based memetic algorithm (MPSOMA) is proposed in this paper. In the proposed algorithm, the whole particle swarm population is divided into three subpopulations in which each particle evolves itself by the standard PSO and then updates each subpopulation by using different local search schemes such as variable neighborhood search (VNS) and individual improvement scheme (IIS). Then, the best particle of each subpopulation is selected to construct a probabilistic model by using estimation of distribution algorithm (EDA) and three particles are sampled from the probabilistic model to update the worst individual in each subpopulation. The best particle in the entire particle swarm is used to update the global optimal solution. The proposed MPSOMA is compared with two recently proposed algorithms, namely, PSO based memetic algorithm (PSOMA) and hybrid particle swarm optimization with estimation of distribution algorithm (PSOEDA), on 29 well-known PFFSPs taken from OR-library, and the experimental results show that it is an effective approach for the PFFSP. PMID:24453841

  8. Robot Swarms

    NASA Technical Reports Server (NTRS)

    Morring, Frank, Jr.

    2005-01-01

    Engineers and interns at this NASA field center are building the prototype of a robotic rover that could go where no wheeled rover has gone before-into the dark cold craters at the lunar poles and across the Moon s rugged highlands-like a walking tetrahedron. With NASA pushing to meet President Bush's new exploration objectives, the robots taking shape here today could be on the Moon in a decade. In the longer term, the concept could lead to shape-shifting robot swarms designed to explore distant planetary surfaces in advance of humans. "If you look at all of NASA s projections of the future, anyone s projections of the space program, they re all rigid-body architecture," says Steven Curtis, principal investigator on the effort. "This is not rigid-body. The whole key here is flexibility and reconfigurability with a capital R."

  9. Swarm Verification

    NASA Technical Reports Server (NTRS)

    Holzmann, Gerard J.; Joshi, Rajeev; Groce, Alex

    2008-01-01

    Reportedly, supercomputer designer Seymour Cray once said that he would sooner use two strong oxen to plow a field than a thousand chickens. Although this is undoubtedly wise when it comes to plowing a field, it is not so clear for other types of tasks. Model checking problems are of the proverbial "search the needle in a haystack" type. Such problems can often be parallelized easily. Alas, none of the usual divide and conquer methods can be used to parallelize the working of a model checker. Given that it has become easier than ever to gain access to large numbers of computers to perform even routine tasks it is becoming more and more attractive to find alternate ways to use these resources to speed up model checking tasks. This paper describes one such method, called swarm verification.

  10. Firefly as a novel swarm intelligence variable selection method in spectroscopy.

    PubMed

    Goodarzi, Mohammad; dos Santos Coelho, Leandro

    2014-12-10

    A critical step in multivariate calibration is wavelength selection, which is used to build models with better prediction performance when applied to spectral data. Up to now, many feature selection techniques have been developed. Among all different types of feature selection techniques, those based on swarm intelligence optimization methodologies are more interesting since they are usually simulated based on animal and insect life behavior to, e.g., find the shortest path between a food source and their nests. This decision is made by a crowd, leading to a more robust model with less falling in local minima during the optimization cycle. This paper represents a novel feature selection approach to the selection of spectroscopic data, leading to more robust calibration models. The performance of the firefly algorithm, a swarm intelligence paradigm, was evaluated and compared with genetic algorithm and particle swarm optimization. All three techniques were coupled with partial least squares (PLS) and applied to three spectroscopic data sets. They demonstrate improved prediction results in comparison to when only a PLS model was built using all wavelengths. Results show that firefly algorithm as a novel swarm paradigm leads to a lower number of selected wavelengths while the prediction performance of built PLS stays the same.

  11. Firefly as a novel swarm intelligence variable selection method in spectroscopy.

    PubMed

    Goodarzi, Mohammad; dos Santos Coelho, Leandro

    2014-12-10

    A critical step in multivariate calibration is wavelength selection, which is used to build models with better prediction performance when applied to spectral data. Up to now, many feature selection techniques have been developed. Among all different types of feature selection techniques, those based on swarm intelligence optimization methodologies are more interesting since they are usually simulated based on animal and insect life behavior to, e.g., find the shortest path between a food source and their nests. This decision is made by a crowd, leading to a more robust model with less falling in local minima during the optimization cycle. This paper represents a novel feature selection approach to the selection of spectroscopic data, leading to more robust calibration models. The performance of the firefly algorithm, a swarm intelligence paradigm, was evaluated and compared with genetic algorithm and particle swarm optimization. All three techniques were coupled with partial least squares (PLS) and applied to three spectroscopic data sets. They demonstrate improved prediction results in comparison to when only a PLS model was built using all wavelengths. Results show that firefly algorithm as a novel swarm paradigm leads to a lower number of selected wavelengths while the prediction performance of built PLS stays the same. PMID:25441875

  12. Swarm Intelligence Optimization and Its Applications

    NASA Astrophysics Data System (ADS)

    Ding, Caichang; Lu, Lu; Liu, Yuanchao; Peng, Wenxiu

    Swarm Intelligence is a computational and behavioral metaphor for solving distributed problems inspired from biological examples provided by social insects such as ants, termites, bees, and wasps and by swarm, herd, flock, and shoal phenomena in vertebrates such as fish shoals and bird flocks. An example of successful research direction in Swarm Intelligence is ant colony optimization (ACO), which focuses on combinatorial optimization problems. Ant algorithms can be viewed as multi-agent systems (ant colony), where agents (individual ants) solve required tasks through cooperation in the same way that ants create complex social behavior from the combined efforts of individuals.

  13. Hybrid support vector regression and autoregressive integrated moving average models improved by particle swarm optimization for property crime rates forecasting with economic indicators.

    PubMed

    Alwee, Razana; Shamsuddin, Siti Mariyam Hj; Sallehuddin, Roselina

    2013-01-01

    Crimes forecasting is an important area in the field of criminology. Linear models, such as regression and econometric models, are commonly applied in crime forecasting. However, in real crimes data, it is common that the data consists of both linear and nonlinear components. A single model may not be sufficient to identify all the characteristics of the data. The purpose of this study is to introduce a hybrid model that combines support vector regression (SVR) and autoregressive integrated moving average (ARIMA) to be applied in crime rates forecasting. SVR is very robust with small training data and high-dimensional problem. Meanwhile, ARIMA has the ability to model several types of time series. However, the accuracy of the SVR model depends on values of its parameters, while ARIMA is not robust to be applied to small data sets. Therefore, to overcome this problem, particle swarm optimization is used to estimate the parameters of the SVR and ARIMA models. The proposed hybrid model is used to forecast the property crime rates of the United State based on economic indicators. The experimental results show that the proposed hybrid model is able to produce more accurate forecasting results as compared to the individual models.

  14. Displacement Back Analysis for a High Slope of the Dagangshan Hydroelectric Power Station Based on BP Neural Network and Particle Swarm Optimization

    PubMed Central

    Liang, Zhengzhao; Gong, Bin; Tang, Chunan; Zhang, Yongbin; Ma, Tianhui

    2014-01-01

    The right bank high slope of the Dagangshan Hydroelectric Power Station is located in complicated geological conditions with deep fractures and unloading cracks. How to obtain the mechanical parameters and then evaluate the safety of the slope are the key problems. This paper presented a displacement back analysis for the slope using an artificial neural network model (ANN) and particle swarm optimization model (PSO). A numerical model was established to simulate the displacement increment results, acquiring training data for the artificial neural network model. The backpropagation ANN model was used to establish a mapping function between the mechanical parameters and the monitoring displacements. The PSO model was applied to initialize the weights and thresholds of the backpropagation (BP) network model and determine suitable values of the mechanical parameters. Then the elastic moduli of the rock masses were obtained according to the monitoring displacement data at different excavation stages, and the BP neural network model was proved to be valid by comparing the measured displacements, the displacements predicted by the BP neural network model, and the numerical simulation using the back-analyzed parameters. The proposed model is useful for rock mechanical parameters determination and instability investigation of rock slopes. PMID:25140345

  15. Hybrid Support Vector Regression and Autoregressive Integrated Moving Average Models Improved by Particle Swarm Optimization for Property Crime Rates Forecasting with Economic Indicators

    PubMed Central

    Alwee, Razana; Hj Shamsuddin, Siti Mariyam; Sallehuddin, Roselina

    2013-01-01

    Crimes forecasting is an important area in the field of criminology. Linear models, such as regression and econometric models, are commonly applied in crime forecasting. However, in real crimes data, it is common that the data consists of both linear and nonlinear components. A single model may not be sufficient to identify all the characteristics of the data. The purpose of this study is to introduce a hybrid model that combines support vector regression (SVR) and autoregressive integrated moving average (ARIMA) to be applied in crime rates forecasting. SVR is very robust with small training data and high-dimensional problem. Meanwhile, ARIMA has the ability to model several types of time series. However, the accuracy of the SVR model depends on values of its parameters, while ARIMA is not robust to be applied to small data sets. Therefore, to overcome this problem, particle swarm optimization is used to estimate the parameters of the SVR and ARIMA models. The proposed hybrid model is used to forecast the property crime rates of the United State based on economic indicators. The experimental results show that the proposed hybrid model is able to produce more accurate forecasting results as compared to the individual models. PMID:23766729

  16. Hybrid support vector regression and autoregressive integrated moving average models improved by particle swarm optimization for property crime rates forecasting with economic indicators.

    PubMed

    Alwee, Razana; Shamsuddin, Siti Mariyam Hj; Sallehuddin, Roselina

    2013-01-01

    Crimes forecasting is an important area in the field of criminology. Linear models, such as regression and econometric models, are commonly applied in crime forecasting. However, in real crimes data, it is common that the data consists of both linear and nonlinear components. A single model may not be sufficient to identify all the characteristics of the data. The purpose of this study is to introduce a hybrid model that combines support vector regression (SVR) and autoregressive integrated moving average (ARIMA) to be applied in crime rates forecasting. SVR is very robust with small training data and high-dimensional problem. Meanwhile, ARIMA has the ability to model several types of time series. However, the accuracy of the SVR model depends on values of its parameters, while ARIMA is not robust to be applied to small data sets. Therefore, to overcome this problem, particle swarm optimization is used to estimate the parameters of the SVR and ARIMA models. The proposed hybrid model is used to forecast the property crime rates of the United State based on economic indicators. The experimental results show that the proposed hybrid model is able to produce more accurate forecasting results as compared to the individual models. PMID:23766729

  17. Optimal design of HTS magnets for a modular toroid-type 2.5 MJ SMES using multi-grouped particle swarm optimization

    NASA Astrophysics Data System (ADS)

    Lee, S. Y.; Kwak, S. Y.; Seo, J. H.; Lee, S. Y.; Park, S. H.; Kim, W. S.; Lee, J. K.; Bae, J. H.; Kim, S. H.; Sim, K. D.; Seong, K. C.; Jung, H. K.; Choi, K.; Hahn, S.

    2009-10-01

    Superconducting magnetic energy storage (SMES) is one of the promising power system applications of superconducting technology and has been actively researched and developed worldwide. Generally, there are three types of SMES-solenoid, multiple solenoid, and toroid. Among these types, toroid type seems to require more wires than solenoid type and multiple solenoid type at the same operating current. However toroid type reduces normal field in the wire and stray field dramatically because magnetic field is confined inside the coil. So, the total length of wire in the toroid type can be reduced in comparison with that in the solenoid type by increasing operating current. In this paper, a 2.5 MJ class SMES with HTS magnets of single solenoid, multiple solenoid and modular toroid type were optimized using a recently developed multi-modal optimization technique named multi-grouped particle swarm optimization (MGPSO). The objective of the optimization was to minimize the total length of HTS superconductor wires satisfying some equality and inequality constraints. The stored energy and constraints were calculated using 3D magnetic field analysis techniques and an automatic tetrahedral mesh generator. Optimized results were verified by 3D finite element method (FEM).

  18. A SoC for studying multi-agent software/algorithms on a real swarm of mm 3-sized microrobots

    NASA Astrophysics Data System (ADS)

    Casanova, R.; Diéguez, A.; Arbat, A.; Sanuy, A.; Alonso, O.; Canals, J.; Puig, M.; Samitier, J.

    2007-05-01

    This paper presents a System On Chip (SoC) designed specifically to control a mm 3- sized microrobot called I-SWARM. The robot is intended to be part of a colony of 1000 I-SWARM robots for studying swarm behavior in real time and in a real swarm. The SoC offers a well-suited hardware platform to run multi-agent systems software. It is composed of an 8051 microcontroller with 2 kB of data memory and 8 kB of program memory. The processor is provided with specific hardware modules for controlling the locomotion unit, the communications and the vibrating contact sensor of the robot. These modules perform basic tasks as movements or communications so the 8051 can focus on processing data and taking decisions. With these capabilities, the robot is able to avoiding collisions with other members of the swarm, performing cooperative tasks, sharing information and executing specialized tasks. The SoC has been fabricated with a 0.13 μm ultra low power CMOS process of STMicroelectronics and consumes less than 1 mW.

  19. Computer Visualization of Many-Particle Quantum Dynamics

    SciTech Connect

    Ozhigov, A. Y.

    2009-03-10

    In this paper I show the importance of computer visualization in researching of many-particle quantum dynamics. Such a visualization becomes an indispensable illustrative tool for understanding the behavior of dynamic swarm-based quantum systems. It is also an important component of the corresponding simulation framework, and can simplify the studies of underlying algorithms for multi-particle quantum systems.

  20. Computer Visualization of Many-Particle Quantum Dynamics

    NASA Astrophysics Data System (ADS)

    Ozhigov, A. Y.

    2009-03-01

    In this paper I show the importance of computer visualization in researching of many-particle quantum dynamics. Such a visualization becomes an indispensable illustrative tool for understanding the behavior of dynamic swarm-based quantum systems. It is also an important component of the corresponding simulation framework, and can simplify the studies of underlying algorithms for multi-particle quantum systems.

  1. An efficient algorithm for function optimization: modified stem cells algorithm

    NASA Astrophysics Data System (ADS)

    Taherdangkoo, Mohammad; Paziresh, Mahsa; Yazdi, Mehran; Bagheri, Mohammad

    2013-03-01

    In this paper, we propose an optimization algorithm based on the intelligent behavior of stem cell swarms in reproduction and self-organization. Optimization algorithms, such as the Genetic Algorithm (GA), Particle Swarm Optimization (PSO) algorithm, Ant Colony Optimization (ACO) algorithm and Artificial Bee Colony (ABC) algorithm, can give solutions to linear and non-linear problems near to the optimum for many applications; however, in some case, they can suffer from becoming trapped in local optima. The Stem Cells Algorithm (SCA) is an optimization algorithm inspired by the natural behavior of stem cells in evolving themselves into new and improved cells. The SCA avoids the local optima problem successfully. In this paper, we have made small changes in the implementation of this algorithm to obtain improved performance over previous versions. Using a series of benchmark functions, we assess the performance of the proposed algorithm and compare it with that of the other aforementioned optimization algorithms. The obtained results prove the superiority of the Modified Stem Cells Algorithm (MSCA).

  2. Ballistic target tracking algorithm based on improved particle filtering

    NASA Astrophysics Data System (ADS)

    Ning, Xiao-lei; Chen, Zhan-qi; Li, Xiao-yang

    2015-10-01

    Tracking ballistic re-entry target is a typical nonlinear filtering problem. In order to track the ballistic re-entry target in the nonlinear and non-Gaussian complex environment, a novel chaos map particle filter (CMPF) is used to estimate the target state. CMPF has better performance in application to estimate the state and parameter of nonlinear and non-Gassuian system. The Monte Carlo simulation results show that, this method can effectively solve particle degeneracy and particle impoverishment problem by improving the efficiency of particle sampling to obtain the better particles to part in estimation. Meanwhile CMPF can improve the state estimation precision and convergence velocity compared with EKF, UKF and the ordinary particle filter.

  3. Collective motion with anticipation: Flocking, spinning, and swarming

    NASA Astrophysics Data System (ADS)

    Morin, Alexandre; Caussin, Jean-Baptiste; Eloy, Christophe; Bartolo, Denis

    2015-01-01

    We investigate the collective dynamics of self-propelled particles able to probe and anticipate the orientation of their neighbors. We show that a simple anticipation strategy hinders the emergence of homogeneous flocking patterns. Yet anticipation promotes two other forms of self-organization: collective spinning and swarming. In the spinning phase, all particles follow synchronous circular orbits, while in the swarming phase, the population condensates into a single compact swarm that cruises coherently without requiring any cohesive interactions. We quantitatively characterize and rationalize these phases of polar active matter and discuss potential applications to the design of swarming robots.

  4. Predicting patchy particle crystals: variable box shape simulations and evolutionary algorithms.

    PubMed

    Bianchi, Emanuela; Doppelbauer, Günther; Filion, Laura; Dijkstra, Marjolein; Kahl, Gerhard

    2012-06-01

    We consider several patchy particle models that have been proposed in literature and we investigate their candidate crystal structures in a systematic way. We compare two different algorithms for predicting crystal structures: (i) an approach based on Monte Carlo simulations in the isobaric-isothermal ensemble and (ii) an optimization technique based on ideas of evolutionary algorithms. We show that the two methods are equally successful and provide consistent results on crystalline phases of patchy particle systems. PMID:22697525

  5. Application of orthogonal array technique and particle swarm optimization approach in surface roughness modification when face milling AISI1045 steel parts

    NASA Astrophysics Data System (ADS)

    Azadi Moghaddam, Masoud; Kolahan, Farhad

    2016-12-01

    Face milling is an important and common machining operation because of its versatility and capability to produce various surfaces. Face milling is a machining process of removing material by the relative motion between a work piece and rotating cutter with multiple cutting edges. It is an interrupted cutting operation in which the teeth of the milling cutter enter and exit the work piece during each revolution. This paper is concerned with the experimental and numerical study of face milling of AISI1045. The proposed approach is based on statistical analysis on the experimental data gathered using Taguchi design matrix. Surface roughness is the most important performance characteristics of the face milling process. In this study the effect of input face milling process parameters on surface roughness of AISI1045 steel milled parts have been studied. The input parameters are cutting speed ( v), feed rate ( f z ) and depth of cut ( a p ). The experimental data are gathered using Taguchi L9 design matrix. In order to establish the relations between the input and the output parameters, various regression functions have been fitted on the data based on output characteristics. The significance of the process parameters on the quality characteristics of the process was also evaluated quantitatively using the analysis of variance method. Then, statistical analysis and validation experiments have been carried out to compare and select the best and most fitted models. In the last section of this research, mathematical model has been developed for surface roughness prediction using particle swarm optimization (PSO) on the basis of experimental results. The model developed for optimization has been validated by confirmation experiments. It has been found that the predicted roughness using PSO is in good agreement with the actual surface roughness.

  6. Reconstructing the flight kinematics of swarming and mating in wild mosquitoes

    PubMed Central

    Butail, Sachit; Manoukis, Nicholas; Diallo, Moussa; Ribeiro, José M.; Lehmann, Tovi; Paley, Derek A.

    2012-01-01

    We describe a novel tracking system for reconstructing three-dimensional tracks of individual mosquitoes in wild swarms and present the results of validating the system by filming swarms and mating events of the malaria mosquito Anopheles gambiae in Mali. The tracking system is designed to address noisy, low frame-rate (25 frames per second) video streams from a stereo camera system. Because flying A. gambiae move at 1–4 m s−1, they appear as faded streaks in the images or sometimes do not appear at all. We provide an adaptive algorithm to search for missing streaks and a likelihood function that uses streak endpoints to extract velocity information. A modified multi-hypothesis tracker probabilistically addresses occlusions and a particle filter estimates the trajectories. The output of the tracking algorithm is a set of track segments with an average length of 0.6–1 s. The segments are verified and combined under human supervision to create individual tracks up to the duration of the video (90 s). We evaluate tracking performance using an established metric for multi-target tracking and validate the accuracy using independent stereo measurements of a single swarm. Three-dimensional reconstructions of A. gambiae swarming and mating events are presented. PMID:22628212

  7. A Linac Simulation Code for Macro-Particles Tracking and Steering Algorithm Implementation

    SciTech Connect

    sun, yipeng

    2012-05-03

    In this paper, a linac simulation code written in Fortran90 is presented and several simulation examples are given. This code is optimized to implement linac alignment and steering algorithms, and evaluate the accelerator errors such as RF phase and acceleration gradient, quadrupole and BPM misalignment. It can track a single particle or a bunch of particles through normal linear accelerator elements such as quadrupole, RF cavity, dipole corrector and drift space. One-to-one steering algorithm and a global alignment (steering) algorithm are implemented in this code.

  8. rpSPH: a novel smoothed particle hydrodynamics algorithm

    NASA Astrophysics Data System (ADS)

    Abel, Tom

    2011-05-01

    We suggest a novel discretization of the momentum equation for smoothed particle hydrodynamics (SPH) and show that it significantly improves the accuracy of the obtained solutions. Our new formulation which we refer to as relative pressure SPH, rpSPH, evaluates the pressure force with respect to the local pressure. It respects Newton's first law of motion and applies forces to particles only when there is a net force acting upon them. This is in contrast to standard SPH which explicitly uses Newton's third law of motion continuously applying equal but opposite forces between particles. rpSPH does not show the unphysical particle noise, the clumping or banding instability, unphysical surface tension and unphysical scattering of different mass particles found for standard SPH. At the same time, it uses fewer computational operations and only changes a single line in existing SPH codes. We demonstrate its performance on isobaric uniform density distributions, uniform density shearing flows, the Kelvin-Helmholtz and Rayleigh-Taylor instabilities, the Sod shock tube, the Sedov-Taylor blast wave and a cosmological integration of the Santa Barbara galaxy cluster formation test. rpSPH is an improvement in these cases. The improvements come at the cost of giving up exact momentum conservation of the scheme. Consequently, one can also obtain unphysical solutions particularly at low resolutions.

  9. Explicit symplectic algorithms based on generating functions for charged particle dynamics.

    PubMed

    Zhang, Ruili; Qin, Hong; Tang, Yifa; Liu, Jian; He, Yang; Xiao, Jianyuan

    2016-07-01

    Dynamics of a charged particle in the canonical coordinates is a Hamiltonian system, and the well-known symplectic algorithm has been regarded as the de facto method for numerical integration of Hamiltonian systems due to its long-term accuracy and fidelity. For long-term simulations with high efficiency, explicit symplectic algorithms are desirable. However, it is generally believed that explicit symplectic algorithms are only available for sum-separable Hamiltonians, and this restriction limits the application of explicit symplectic algorithms to charged particle dynamics. To overcome this difficulty, we combine the familiar sum-split method and a generating function method to construct second- and third-order explicit symplectic algorithms for dynamics of charged particle. The generating function method is designed to generate explicit symplectic algorithms for product-separable Hamiltonian with form of H(x,p)=p_{i}f(x) or H(x,p)=x_{i}g(p). Applied to the simulations of charged particle dynamics, the explicit symplectic algorithms based on generating functions demonstrate superiorities in conservation and efficiency. PMID:27575228

  10. Explicit symplectic algorithms based on generating functions for charged particle dynamics

    NASA Astrophysics Data System (ADS)

    Zhang, Ruili; Qin, Hong; Tang, Yifa; Liu, Jian; He, Yang; Xiao, Jianyuan

    2016-07-01

    Dynamics of a charged particle in the canonical coordinates is a Hamiltonian system, and the well-known symplectic algorithm has been regarded as the de facto method for numerical integration of Hamiltonian systems due to its long-term accuracy and fidelity. For long-term simulations with high efficiency, explicit symplectic algorithms are desirable. However, it is generally believed that explicit symplectic algorithms are only available for sum-separable Hamiltonians, and this restriction limits the application of explicit symplectic algorithms to charged particle dynamics. To overcome this difficulty, we combine the familiar sum-split method and a generating function method to construct second- and third-order explicit symplectic algorithms for dynamics of charged particle. The generating function method is designed to generate explicit symplectic algorithms for product-separable Hamiltonian with form of H (x ,p ) =pif (x ) or H (x ,p ) =xig (p ) . Applied to the simulations of charged particle dynamics, the explicit symplectic algorithms based on generating functions demonstrate superiorities in conservation and efficiency.

  11. PSO algorithm enhanced with Lozi Chaotic Map - Tuning experiment

    SciTech Connect

    Pluhacek, Michal; Senkerik, Roman; Zelinka, Ivan

    2015-03-10

    In this paper it is investigated the effect of tuning of control parameters of the Lozi Chaotic Map employed as a chaotic pseudo-random number generator for the particle swarm optimization algorithm. Three different benchmark functions are selected from the IEEE CEC 2013 competition benchmark set. The Lozi map is extensively tuned and the performance of PSO is evaluated.

  12. Hybrid Algorithms for Fuzzy Reverse Supply Chain Network Design

    PubMed Central

    Che, Z. H.; Chiang, Tzu-An; Kuo, Y. C.

    2014-01-01

    In consideration of capacity constraints, fuzzy defect ratio, and fuzzy transport loss ratio, this paper attempted to establish an optimized decision model for production planning and distribution of a multiphase, multiproduct reverse supply chain, which addresses defects returned to original manufacturers, and in addition, develops hybrid algorithms such as Particle Swarm Optimization-Genetic Algorithm (PSO-GA), Genetic Algorithm-Simulated Annealing (GA-SA), and Particle Swarm Optimization-Simulated Annealing (PSO-SA) for solving the optimized model. During a case study of a multi-phase, multi-product reverse supply chain network, this paper explained the suitability of the optimized decision model and the applicability of the algorithms. Finally, the hybrid algorithms showed excellent solving capability when compared with original GA and PSO methods. PMID:24892057

  13. Hybrid algorithms for fuzzy reverse supply chain network design.

    PubMed

    Che, Z H; Chiang, Tzu-An; Kuo, Y C; Cui, Zhihua

    2014-01-01

    In consideration of capacity constraints, fuzzy defect ratio, and fuzzy transport loss ratio, this paper attempted to establish an optimized decision model for production planning and distribution of a multiphase, multiproduct reverse supply chain, which addresses defects returned to original manufacturers, and in addition, develops hybrid algorithms such as Particle Swarm Optimization-Genetic Algorithm (PSO-GA), Genetic Algorithm-Simulated Annealing (GA-SA), and Particle Swarm Optimization-Simulated Annealing (PSO-SA) for solving the optimized model. During a case study of a multi-phase, multi-product reverse supply chain network, this paper explained the suitability of the optimized decision model and the applicability of the algorithms. Finally, the hybrid algorithms showed excellent solving capability when compared with original GA and PSO methods. PMID:24892057

  14. Hybrid algorithms for fuzzy reverse supply chain network design.

    PubMed

    Che, Z H; Chiang, Tzu-An; Kuo, Y C; Cui, Zhihua

    2014-01-01

    In consideration of capacity constraints, fuzzy defect ratio, and fuzzy transport loss ratio, this paper attempted to establish an optimized decision model for production planning and distribution of a multiphase, multiproduct reverse supply chain, which addresses defects returned to original manufacturers, and in addition, develops hybrid algorithms such as Particle Swarm Optimization-Genetic Algorithm (PSO-GA), Genetic Algorithm-Simulated Annealing (GA-SA), and Particle Swarm Optimization-Simulated Annealing (PSO-SA) for solving the optimized model. During a case study of a multi-phase, multi-product reverse supply chain network, this paper explained the suitability of the optimized decision model and the applicability of the algorithms. Finally, the hybrid algorithms showed excellent solving capability when compared with original GA and PSO methods.

  15. Modified particle filtering algorithm for single acoustic vector sensor DOA tracking.

    PubMed

    Li, Xinbo; Sun, Haixin; Jiang, Liangxu; Shi, Yaowu; Wu, Yue

    2015-01-01

    The conventional direction of arrival (DOA) estimation algorithm with static sources assumption usually estimates the source angles of two adjacent moments independently and the correlation of the moments is not considered. In this article, we focus on the DOA estimation of moving sources and a modified particle filtering (MPF) algorithm is proposed with state space model of single acoustic vector sensor. Although the particle filtering (PF) algorithm has been introduced for acoustic vector sensor applications, it is not suitable for the case that one dimension angle of source is estimated with large deviation, the two dimension angles (pitch angle and azimuth angle) cannot be simultaneously employed to update the state through resampling processing of PF algorithm. To solve the problems mentioned above, the MPF algorithm is proposed in which the state estimation of previous moment is introduced to the particle sampling of present moment to improve the importance function. Moreover, the independent relationship of pitch angle and azimuth angle is considered and the two dimension angles are sampled and evaluated, respectively. Then, the MUSIC spectrum function is used as the "likehood" function of the MPF algorithm, and the modified PF-MUSIC (MPF-MUSIC) algorithm is proposed to improve the root mean square error (RMSE) and the probability of convergence. The theoretical analysis and the simulation results validate the effectiveness and feasibility of the two proposed algorithms.

  16. Modified Particle Filtering Algorithm for Single Acoustic Vector Sensor DOA Tracking

    PubMed Central

    Li, Xinbo; Sun, Haixin; Jiang, Liangxu; Shi, Yaowu; Wu, Yue

    2015-01-01

    The conventional direction of arrival (DOA) estimation algorithm with static sources assumption usually estimates the source angles of two adjacent moments independently and the correlation of the moments is not considered. In this article, we focus on the DOA estimation of moving sources and a modified particle filtering (MPF) algorithm is proposed with state space model of single acoustic vector sensor. Although the particle filtering (PF) algorithm has been introduced for acoustic vector sensor applications, it is not suitable for the case that one dimension angle of source is estimated with large deviation, the two dimension angles (pitch angle and azimuth angle) cannot be simultaneously employed to update the state through resampling processing of PF algorithm. To solve the problems mentioned above, the MPF algorithm is proposed in which the state estimation of previous moment is introduced to the particle sampling of present moment to improve the importance function. Moreover, the independent relationship of pitch angle and azimuth angle is considered and the two dimension angles are sampled and evaluated, respectively. Then, the MUSIC spectrum function is used as the “likehood” function of the MPF algorithm, and the modified PF-MUSIC (MPF-MUSIC) algorithm is proposed to improve the root mean square error (RMSE) and the probability of convergence. The theoretical analysis and the simulation results validate the effectiveness and feasibility of the two proposed algorithms. PMID:26501280

  17. Monte Carlo Particle Transport: Algorithm and Performance Overview

    SciTech Connect

    Gentile, N; Procassini, R; Scott, H

    2005-06-02

    Monte Carlo methods are frequently used for neutron and radiation transport. These methods have several advantages, such as relative ease of programming and dealing with complex meshes. Disadvantages include long run times and statistical noise. Monte Carlo photon transport calculations also often suffer from inaccuracies in matter temperature due to the lack of implicitness. In this paper we discuss the Monte Carlo algorithm as it is applied to neutron and photon transport, detail the differences between neutron and photon Monte Carlo, and give an overview of the ways the numerical method has been modified to deal with issues that arise in photon Monte Carlo simulations.

  18. Identification and Characterization of Earthquake Swarms in Southern California

    NASA Astrophysics Data System (ADS)

    Shearer, P. M.; Zhang, Q.

    2015-12-01

    Earthquake swarms are space-time clusters of seismicity that cannot easily be explained by typical aftershock behavior, and are likely triggered by external processes such as fluid migration and/or slow slip. However, swarm properties are not fully understood and how much swarm occurrence is related to the tectonic environment (e.g., heat flow, stressing rate) or source characteristics (e.g., focal mechanism, stress drop) is unclear. Systematic study of large numbers of swarms and their source properties should help to resolve these issues, but is hampered by the challenge of identifying swarms at a range of spatiotemporal scales from a large earthquake catalog. We have developed a new method to search for clusters by comparing the number of neighboring events to the background events in scalable space/time windows, similar to the idea of STA/LTA algorithms, and then discriminating swarms from aftershock clustering. We first apply this method to the San Jacinto Fault Zone (SJFZ) and find ten times more swarms than a previous study using fixed spatiotemporal windows. The most striking spatial pattern of our identified swarm events is a higher fraction of swarms at the northern and southern ends of the SJFZ than its central segment, which correlates with an increased proportion of normal faulting earthquakes. We then apply our method to search the entire southern California catalog of 433,737 events with M ≥ 1 from 1981 to 2014. Preliminary results indicate that swarms are heterogeneously distributed in space and time, but that higher swarm rates are generally found in regions of normal faulting. We will explore other swarm properties, such as event stress drops, spatial migration behavior, distribution of moment release, and relation to foreshock sequences in order to better understand the driving physical mechanisms of swarms and improve earthquake forecasts.

  19. RB Particle Filter Time Synchronization Algorithm Based on the DPM Model

    PubMed Central

    Guo, Chunsheng; Shen, Jia; Sun, Yao; Ying, Na

    2015-01-01

    Time synchronization is essential for node localization, target tracking, data fusion, and various other Wireless Sensor Network (WSN) applications. To improve the estimation accuracy of continuous clock offset and skew of mobile nodes in WSNs, we propose a novel time synchronization algorithm, the Rao-Blackwellised (RB) particle filter time synchronization algorithm based on the Dirichlet process mixture (DPM) model. In a state-space equation with a linear substructure, state variables are divided into linear and non-linear variables by the RB particle filter algorithm. These two variables can be estimated using Kalman filter and particle filter, respectively, which improves the computational efficiency more so than if only the particle filter was used. In addition, the DPM model is used to describe the distribution of non-deterministic delays and to automatically adjust the number of Gaussian mixture model components based on the observational data. This improves the estimation accuracy of clock offset and skew, which allows achieving the time synchronization. The time synchronization performance of this algorithm is also validated by computer simulations and experimental measurements. The results show that the proposed algorithm has a higher time synchronization precision than traditional time synchronization algorithms. PMID:26404291

  20. RB Particle Filter Time Synchronization Algorithm Based on the DPM Model.

    PubMed

    Guo, Chunsheng; Shen, Jia; Sun, Yao; Ying, Na

    2015-01-01

    Time synchronization is essential for node localization, target tracking, data fusion, and various other Wireless Sensor Network (WSN) applications. To improve the estimation accuracy of continuous clock offset and skew of mobile nodes in WSNs, we propose a novel time synchronization algorithm, the Rao-Blackwellised (RB) particle filter time synchronization algorithm based on the Dirichlet process mixture (DPM) model. In a state-space equation with a linear substructure, state variables are divided into linear and non-linear variables by the RB particle filter algorithm. These two variables can be estimated using Kalman filter and particle filter, respectively, which improves the computational efficiency more so than if only the particle filter was used. In addition, the DPM model is used to describe the distribution of non-deterministic delays and to automatically adjust the number of Gaussian mixture model components based on the observational data. This improves the estimation accuracy of clock offset and skew, which allows achieving the time synchronization. The time synchronization performance of this algorithm is also validated by computer simulations and experimental measurements. The results show that the proposed algorithm has a higher time synchronization precision than traditional time synchronization algorithms. PMID:26404291