NASA Astrophysics Data System (ADS)
Fan, Shu-Kai S.; Chang, Ju-Ming; Chuang, Yu-Chiang
2015-06-01
Most real-world optimization problems involve the optimization task of more than a single objective function and, therefore, require a great amount of computational effort as the solution procedure is designed to anchor multiple compromised optimal solutions. Abundant multi-objective evolutionary algorithms (MOEAs) for multi-objective optimization have appeared in the literature over the past two decades. In this article, a new proposal by means of particle swarm optimization is addressed for solving multi-objective optimization problems. The proposed algorithm is constructed based on the concept of Pareto dominance, taking both the diversified search and empirical movement strategies into account. The proposed particle swarm MOEA with these two strategies is thus dubbed the empirical-movement diversified-search multi-objective particle swarm optimizer (EMDS-MOPSO). Its performance is assessed in terms of a suite of standard benchmark functions taken from the literature and compared to other four state-of-the-art MOEAs. The computational results demonstrate that the proposed algorithm shows great promise in solving multi-objective optimization problems.
Automatic Clustering Using Multi-objective Particle Swarm and Simulated Annealing
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
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
Application of particle swarm optimization for improving the identification of image objects
NASA Astrophysics Data System (ADS)
Chiu, Nan-Hsing; Pu, Chang-En; Lin, Pei-Da; Wang, Shu-Shian
2012-04-01
Flight safety is very important issue for aviation industries. Analyzing the flight accidents on the basis of 2-dimensional image is hardly to illustrate the complex injuries of passengers in the flight cabin. However, how to illustrate the flight accident is a challenge from 2-dimensional space to 3-dimensional space. This study proposes a particle swarm optimization approach for improving the identification of objects from 2-dimensional image. The recognition results provide the information for building 3-dimensional systems for flight accident investigators. The experiments also show that it is a feasible approach for improving the identification of image objects.
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.
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.
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
Particle swarm optimized multi-objective histogram equalization for image enhancement
NASA Astrophysics Data System (ADS)
Shanmugavadivu, P.; Balasubramanian, K.
2014-04-01
Histogram Equalization (HE) is a simple and effective technique for enhancing the contrast of the input image. However, it fails to preserve the brightness while enhancing the contrast due to the abrupt mean shift during the process of equalization. Many HE based methods have been developed to overcome the problem of mean shift. But, they suffered from over-enhancement. In this paper, a multi-objective HE model has been proposed in order to enhance the contrast as well as to preserve the brightness. The central idea of this technique is to first segment the histogram of the input image into two using Otsu's threshold. A set of optimized weighing constraints are formulated and applied on both the sub-images. Then, the sub-images are equalized independently and their union produces the contrast enhanced, brightness preserved output image. Here, Particle Swarm Optimization (PSO) is employed to find the optimal constraints. This technique is proved to have an edge over the other contemporary methods in terms of entropy and contrast improvement index.
NASA Astrophysics Data System (ADS)
Huang, Rong-Hwa; Yang, Chang-Lin; Hsu, Chun-Ting
2015-12-01
Flow shop production system - compared to other economically important production systems - is popular in real manufacturing environments. This study focuses on the flow shop with multiprocessor scheduling problem (FSMP), and develops an improved particle swarm optimisation heuristic to solve it. Additionally, this study designs an integer programming model to perform effectiveness and robustness testing on the proposed heuristic. Experimental results demonstrate a 10% to 50% improvement in the effectiveness of the proposed heuristic in small-scale problem tests, and a 10% to 40% improvement in the robustness of the heuristic in large-scale problem tests, indicating extremely satisfactory performance.
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
A hybrid multi-objective particle swarm algorithm for a mixed-model assembly line sequencing problem
NASA Astrophysics Data System (ADS)
Rahimi-Vahed, A. R.; Mirghorbani, S. M.; Rabbani, M.
2007-12-01
Mixed-model assembly line sequencing is one of the most important strategic problems in the field of production management where diversified customers' demands exist. In this article, three major goals are considered: (i) total utility work, (ii) total production rate variation and (iii) total setup cost. Due to the complexity of the problem, a hybrid multi-objective algorithm based on particle swarm optimization (PSO) and tabu search (TS) is devised to obtain the locally Pareto-optimal frontier where simultaneous minimization of the above-mentioned objectives is desired. In order to validate the performance of the proposed algorithm in terms of solution quality and diversity level, the algorithm is applied to various test problems and its reliability, based on different comparison metrics, is compared with three prominent multi-objective genetic algorithms, PS-NC GA, NSGA-II and SPEA-II. The computational results show that the proposed hybrid algorithm significantly outperforms existing genetic algorithms in large-sized 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.
Improving Vector Evaluated Particle Swarm Optimisation by Incorporating Nondominated Solutions
Lim, Kian Sheng; Ibrahim, Zuwairie; Buyamin, Salinda; Ahmad, Anita; Naim, Faradila; Ghazali, Kamarul Hawari; Mokhtar, Norrima
2013-01-01
The Vector Evaluated Particle Swarm Optimisation algorithm is widely used to solve multiobjective optimisation problems. This algorithm optimises one objective using a swarm of particles where their movements are guided by the best solution found by another swarm. However, the best solution of a swarm is only updated when a newly generated solution has better fitness than the best solution at the objective function optimised by that swarm, yielding poor solutions for the multiobjective optimisation problems. Thus, an improved Vector Evaluated Particle Swarm Optimisation algorithm is introduced by incorporating the nondominated solutions as the guidance for a swarm rather than using the best solution from another swarm. In this paper, the performance of improved Vector Evaluated Particle Swarm Optimisation algorithm is investigated using performance measures such as the number of nondominated solutions found, the generational distance, the spread, and the hypervolume. The results suggest that the improved Vector Evaluated Particle Swarm Optimisation algorithm has impressive performance compared with the conventional Vector Evaluated Particle Swarm Optimisation algorithm. PMID:23737718
Particle Swarm Optimization with Double Learning Patterns
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
Particle Swarm Optimization with Double Learning Patterns.
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
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
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
Selectively-informed particle swarm optimization.
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
Selectively-informed particle swarm optimization
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
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.
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
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
Liu, Yaolin; Wang, Hua; Ji, Yingli; Liu, Zhongqiu; Zhao, Xiang
2012-01-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
Cui, Xiaohui; Potok, Thomas E
2007-01-01
A swarm based social adaptive model is proposed to model multiple insurgent groups?strategy searching in a dynamic changed environment. This report presents a pilot study on 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 dynamic environment and to provide insight and understanding of insurgent group strategic adaptation.
Incremental social learning in particle swarms.
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
Lagrange Interpolation Learning Particle Swarm Optimization.
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
Unit Commitment by Adaptive Particle Swarm Optimization
NASA Astrophysics Data System (ADS)
Saber, Ahmed Yousuf; Senjyu, Tomonobu; Miyagi, Tsukasa; Urasaki, Naomitsu; Funabashi, Toshihisa
This paper presents an Adaptive Particle Swarm Optimization (APSO) for Unit Commitment (UC) problem. APSO reliably and accurately tracks a continuously changing solution. By analyzing the social model of standard PSO for the UC problem of variable size and load demand, adaptive criteria are applied on PSO parameters and the global best particle (knowledge) based on the diversity of fitness. In this proposed method, PSO parameters are automatically adjusted using Gaussian modification. To increase the knowledge, the global best particle is updated instead of a fixed one in each generation. To avoid the method to be frozen, idle particles are reset. The real velocity is digitized (0/1) by a logistic function for binary UC. Finally, the benchmark data and methods are used to show the effectiveness of the proposed method.
Particle Swarm Based Collective Searching Model for Adaptive Environment
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.
Particle Swarm Based Collective Searching Model for Adaptive Environment
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.
Multiswarm Particle Swarm Optimization with Transfer of the Best Particle
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
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.
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.
NASA Astrophysics Data System (ADS)
Huang, Xiaobiao; Safranek, James
2014-09-01
Nonlinear dynamics optimization is carried out for a low emittance upgrade lattice of SPEAR3 in order to improve its dynamic aperture and Touschek lifetime. Two multi-objective optimization algorithms, a genetic algorithm and a particle swarm algorithm, are used for this study. The performance of the two algorithms are compared. The result shows that the particle swarm algorithm converges significantly faster to similar or better solutions than the genetic algorithm and it does not require seeding of good solutions in the initial population. These advantages of the particle swarm algorithm may make it more suitable for many accelerator optimization applications.
Particle swarm optimization with recombination and dynamic linkage discovery.
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
Bifurcating Particle Swarms in Smooth-Walled Fractures
NASA Astrophysics Data System (ADS)
Pyrak-Nolte, L. J.; Sun, H.
2010-12-01
Particle swarms can occur naturally or from industrial processes where small liquid drops containing thousands to millions of micron-size to colloidal-size particles are released over time from seepage or leaks into fractured rock. The behavior of these particle swarms as they fall under gravity are affected by particle interactions as well as interactions with the walls of the fractures. In this paper, we present experimental results on the effect of fractures on the cohesiveness of the swarm and the formation of bifurcation structures as they fall under gravity and interact with the fracture walls. A transparent cubic sample (100 mm x 100 mm x 100 mm) containing a synthetic fracture with uniform aperture distributions was optically imaged to quantify the effect of confinement within fractures on particle swarm formation, swarm velocity, and swarm geometry. A fracture with a uniform aperture distribution was fabricated from two polished rectangular prisms of acrylic. A series of experiments were performed to determine how swarm movement and geometry are affected as the walls of the fracture are brought closer together from 50 mm to 1 mm. During the experiments, the fracture was fully saturated with water. We created the swarms using two different particle sizes in dilute suspension (~ 1.0% by mass). The particles were 3 micron diameter fluorescent polymer beads and 25 micron diameter soda-lime glass beads. Experiments were performed using swarms that ranged in size from 5 µl to 60 µl. The swarm behavior was imaged using an optical fluorescent imaging system composed of a CCD camera illuminated by a 100 mW diode-pumped doubled YAG laser. As a swarm falls in an open-tank of water, it forms a torroidal shape that is stable as long as no ambient or background currents exist in the water tank. When a swarm is released into a fracture with an aperture less than 5 mm, the swarm forms the torroidal shape but it is distorted because of the presence of the walls. The
Lagrange Interpolation Learning Particle Swarm Optimization
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
Chaotic Particle Swarm Optimization with Mutation for Classification
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
Chaotic particle swarm optimization with mutation for classification.
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
Quantum-Behaved Particle Swarm Optimization with Chaotic Search
NASA Astrophysics Data System (ADS)
Yang, Kaiqiao; Nomura, Hirosato
The chaotic search is introduced into Quantum-behaved Particle Swarm Optimization (QPSO) to increase the diversity of the swarm in the latter period of the search, so as to help the system escape from local optima. Taking full advantages of the characteristics of ergodicity and randomicity of chaotic variables, the chaotic search is carried out in the neighborhoods of the particles which are trapped into local optima. The experimental results on test functions show that QPSO with chaotic search outperforms the Particle Swarm Optimization (PSO) and QPSO.
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
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
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
Isolated particle swarm optimization with particle migration and global best adoption
NASA Astrophysics Data System (ADS)
Tsai, Hsing-Chih; Tyan, Yaw-Yauan; Wu, Yun-Wu; Lin, Yong-Huang
2012-12-01
Isolated particle swarm optimization (IPSO) segregates particles into several sub-swarms in order to improve the ability of the global optimization. In this study, particle migration and global best adoption (gbest adoption) are used to improve IPSO. Particle migration allows particles to travel among sub-swarms, based on the fitness of the sub-swarms. The use of gbest adoption allows sub-swarms to peep at the gbest proportionally or probably after a certain number of iterations, i.e. gbest replacing, and gbest sharing, respectively. Three well-known benchmark functions are utilized to determine the parameter settings of the IPSO. Then, 13 benchmark functions are used to study the performance of the designed IPSO. Computational experience demonstrates that the designed IPSO is superior to the original version of particle swarm optimization (PSO) in terms of the accuracy and stability of the results, when isolation phenomenon, particle migration and gbest sharing are involved.
Composite Particle Swarm Optimizer With Historical Memory for Function Optimization.
Li, Jie; Zhang, JunQi; Jiang, ChangJun; Zhou, MengChu
2015-10-01
Particle swarm optimization (PSO) algorithm is a population-based stochastic optimization technique. It is characterized by the collaborative search in which each particle is attracted toward the global best position (gbest) in the swarm and its own best position (pbest). However, all of particles' historical promising pbests in PSO are lost except their current pbests. In order to solve this problem, this paper proposes a novel composite PSO algorithm, called historical memory-based PSO (HMPSO), which uses an estimation of distribution algorithm to estimate and preserve the distribution information of particles' historical promising pbests. Each particle has three candidate positions, which are generated from the historical memory, particles' current pbests, and the swarm's gbest. Then the best candidate position is adopted. Experiments on 28 CEC2013 benchmark functions demonstrate the superiority of HMPSO over other algorithms. PMID:26390177
Improving Vector Evaluated Particle Swarm Optimisation Using Multiple Nondominated Leaders
Lim, Kian Sheng; Buyamin, Salinda; Ahmad, Anita; Shapiai, Mohd Ibrahim; Naim, Faradila; Mubin, Marizan; Kim, Dong Hwa
2014-01-01
The vector evaluated particle swarm optimisation (VEPSO) algorithm was previously improved by incorporating nondominated solutions for solving multiobjective optimisation problems. However, the obtained solutions did not converge close to the Pareto front and also did not distribute evenly over the Pareto front. Therefore, in this study, the concept of multiple nondominated leaders is incorporated to further improve the VEPSO algorithm. Hence, multiple nondominated solutions that are best at a respective objective function are used to guide particles in finding optimal solutions. The improved VEPSO is measured by the number of nondominated solutions found, generational distance, spread, and hypervolume. The results from the conducted experiments show that the proposed VEPSO significantly improved the existing VEPSO algorithms. PMID:24883386
A Novel Particle Swarm Optimization Algorithm for Global Optimization
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
A Novel Particle Swarm Optimization Algorithm for Global Optimization.
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
Particle Swarm Social Adaptive Model for Multi-Agent Based Insurgency Warfare Simulation
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.
Binary Particle Swarm Optimization based Biclustering of Web Usage Data
NASA Astrophysics Data System (ADS)
Rathipriya, R.; Thangavel, K.; Bagyamani, J.
2011-07-01
Web mining is the nontrivial process to discover valid, novel, potentially useful knowledge from web data using the data mining techniques or methods. It may give information that is useful for improving the services offered by web portals and information access and retrieval tools. With the rapid development of biclustering, more researchers have applied the biclustering technique to different fields in recent years. When biclustering approach is applied to the web usage data it automatically captures the hidden browsing patterns from it in the form of biclusters. In this work, swarm intelligent technique is combined with biclustering approach to propose an algorithm called Binary Particle Swarm Optimization (BPSO) based Biclustering for Web Usage Data. The main objective of this algorithm is to retrieve the global optimal bicluster from the web usage data. These biclusters contain relationships between web users and web pages which are useful for the E-Commerce applications like web advertising and marketing. Experiments are conducted on real dataset to prove the efficiency of the proposed algorithms.
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
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
Application of Particle Swarm Optimization Algorithm in the Heating System Planning Problem
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
Particle Swarm Social Model for Group Social Learning in Adaptive Environment
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.
A multiobjective memetic algorithm based on particle swarm optimization.
Liu, Dasheng; Tan, K C; Goh, C K; Ho, W K
2007-02-01
In this paper, a new memetic algorithm (MA) for multiobjective (MO) optimization is proposed, which combines the global search ability of particle swarm optimization with a synchronous local search heuristic for directed local fine-tuning. A new particle updating strategy is proposed based upon the concept of fuzzy global-best to deal with the problem of premature convergence and diversity maintenance within the swarm. The proposed features are examined to show their individual and combined effects in MO optimization. The comparative study shows the effectiveness of the proposed MA, which produces solution sets that are highly competitive in terms of convergence, diversity, and distribution. PMID:17278557
Automatized Parameterization of DFTB Using Particle Swarm Optimization.
Chou, Chien-Pin; Nishimura, Yoshifumi; Fan, Chin-Chai; Mazur, Grzegorz; Irle, Stephan; Witek, Henryk A
2016-01-12
We present a novel density-functional tight-binding (DFTB) parametrization toolkit developed to optimize the parameters of various DFTB models in a fully automatized fashion. The main features of the algorithm, based on the particle swarm optimization technique, are discussed, and a number of initial pilot applications of the developed methodology to molecular and solid systems are presented. PMID:26587758
NASA Astrophysics Data System (ADS)
Nicknam, Ahmad; Hosseini, A.; Jamnani, H. Hamidi; Barkhordari, M. A.
2013-12-01
This paper presents a technique to reproduce compatible seismograms involving permanent displacement effects at sites close to the fault source. A multi-objective evolutionary algorithm is used to minimize the differences between the response spectra and multi-tapered power spectral densities corresponding to the recorded and simulated waveforms. The multi-taper method is used to reduce the spectral leakage that is inherent in the Fourier transformed form of waveforms, leading to a reduction of variance in power spectral amplitudes, thus permitting the calibration of the two sets of data. The technique is implemented using the 1998-Fandoqa (Iran) earthquake data and the results are compared with the actual observed data. Additionally, a comparison is made with a SAR interferometry study leading to fair agreement with the reported dislocation along the main fault. The simulation procedure and results are discussed and assessed concluding that, although the technique may be associated with uncertainties, it can still be used to reproduce waveforms at near source sites that include permanent dislocation, and can be used for seismic performance evaluation of structures in the region under study.
A Synchronous-Asynchronous Particle Swarm Optimisation Algorithm
Ab Aziz, Nor Azlina; Mubin, Marizan; Mohamad, Mohd Saberi; Ab Aziz, Kamarulzaman
2014-01-01
In the original particle swarm optimisation (PSO) algorithm, the particles' velocities and positions are updated after the whole swarm performance is evaluated. This algorithm is also known as synchronous PSO (S-PSO). The strength of this update method is in the exploitation of the information. Asynchronous update PSO (A-PSO) has been proposed as an alternative to S-PSO. A particle in A-PSO updates its velocity and position as soon as its own performance has been evaluated. Hence, particles are updated using partial information, leading to stronger exploration. In this paper, we attempt to improve PSO by merging both update methods to utilise the strengths of both methods. The proposed synchronous-asynchronous PSO (SA-PSO) algorithm divides the particles into smaller groups. The best member of a group and the swarm's best are chosen to lead the search. Members within a group are updated synchronously, while the groups themselves are asynchronously updated. Five well-known unimodal functions, four multimodal functions, and a real world optimisation problem are used to study the performance of SA-PSO, which is compared with the performances of S-PSO and A-PSO. The results are statistically analysed and show that the proposed SA-PSO has performed consistently well. PMID:25121109
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
Support Vector Machine Based on Adaptive Acceleration Particle Swarm Optimization
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
Support vector machine based on adaptive acceleration particle swarm optimization.
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
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.
Application of particle swarm techniques in sensor network configuration
NASA Astrophysics Data System (ADS)
Tillett, Jason; Yang, Shanchieh J.; Rao, Raghuveer; Sahin, Ferat
2005-05-01
A decentralized version of particle swarm optimization called the distributed particle swarm optimization (DPSO) approach is formulated and applied to the generation of sensor network configurations or topologies so that the deleterious effects of hidden nodes and asymmetric links on the performance of wireless sensor networks are minimized. Three different topology generation schemes, COMPOW, Cone-Based and the DPSO--based schemes are examined using ns-2. Simulations are executed by varying the node density and traffic rates. Results contrasting heterogeneous vs. homogeneous power reveal that an important metric for a sensor network topology may involve consideration of hidden nodes and asymmetric links, and demonstrate the effect of spatial reuse on the potency of topology generators.
Particle Swarm Imaging (PSIM) - Innovative Gamma-Ray Assay - 13497
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)
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.
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.
Designing Artificial Neural Networks Using Particle Swarm Optimization Algorithms
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
Designing Artificial Neural Networks Using Particle Swarm Optimization Algorithms.
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
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.
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.
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
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.
Optimal Pid Tuning for Power System Stabilizers Using Adaptive Particle Swarm Optimization Technique
NASA Astrophysics Data System (ADS)
Oonsivilai, Anant; Marungsri, Boonruang
2008-10-01
An application of the intelligent search technique to find optimal parameters of power system stabilizer (PSS) considering proportional-integral-derivative controller (PID) for a single-machine infinite-bus system is presented. Also, an efficient intelligent search technique, adaptive particle swarm optimization (APSO), is engaged to express usefulness of the intelligent search techniques in tuning of the PID—PSS parameters. Improve damping frequency of system is optimized by minimizing an objective function with adaptive particle swarm optimization. At the same operating point, the PID—PSS parameters are also tuned by the Ziegler-Nichols method. The performance of proposed controller compared to the conventional Ziegler-Nichols PID tuning controller. The results reveal superior effectiveness of the proposed APSO based PID controller.
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.
GRAVITATIONAL LENS MODELING WITH GENETIC ALGORITHMS AND PARTICLE SWARM OPTIMIZERS
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.
Thermal design of an electric motor using Particle Swarm Optimization
NASA Astrophysics Data System (ADS)
Jandaud, P.-O.; Harmand, S.; Fakes, M.
2012-11-01
In this paper, flow inside an electric machine called starter-alternator is studied parametrically with CFD in order to be used by a thermal lumped model coupled to an optimization algorithm using Particle Swarm Optimization (PSO). In a first case, the geometrical parameters are symmetric allowing us to model only one side of the machine. The optimized thermal results are not conclusive. In a second case, all the parameters are independent. In this case, the flow is strongly influenced by the dissymmetry. Optimization results are this time a clear improvement compared to the original machine.
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
Parameter Identification of Chaotic Systems by a Novel Dual Particle Swarm Optimization
NASA Astrophysics Data System (ADS)
Jiang, Yunxiang; Lau, Francis C. M.; Wang, Shiyuan; Tse, Chi K.
In this paper, we propose a dual particle swarm optimization (PSO) algorithm for parameter identification of chaotic systems. We also consider altering the search range of individual particles adaptively according to their objective function value. We consider both noiseless and noisy channels between the original system and the estimation system. Finally, we verify the effectiveness of the proposed dual PSO method by estimating the parameters of the Lorenz system using two different data acquisition schemes. Simulation results show that the proposed method always outperforms the traditional PSO algorithm.
NASA Astrophysics Data System (ADS)
Kar, Subhajit; Sharma, Kaushik Das
2010-10-01
System identification is a ubiquitous necessity for successful applications in various fields. The area of system identification can be characterized by a small number of leading principles, e.g. to look for sustainable descriptions by proper decisions in the triangle of model complexity, information contents in the data, and effective validation. Particle Swarm Optimization (PSO) is a stochastic, population-based optimization algorithm and many variants of PSO have been developed since, including constrained, multi objective, and discrete or combinatorial versions and applications have been developed using PSO in many fields. The basic PSO algorithm implicitly utilizes a fully connected neighborhood topology. However, local neighborhood models have also been proposed for PSO long ago, where each particle has access to the information corresponding to its immediate neighbors, according to a certain swarm topology. In this local neighborhood model of PSO, particles have information only of their own and their nearest neighbors' bests, rather than that of the entire population of the swarm. In the present work basic PSO method and two of its local neighborhood variants are utilized for determining the optimal parameters of a dc motor. The result obtain from the simulation study demonstrate the usefulness of the proposed methodology.
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.
Swarm intelligence for multi-objective optimization of synthesis gas production
NASA Astrophysics Data System (ADS)
Ganesan, T.; Vasant, P.; Elamvazuthi, I.; Ku Shaari, Ku Zilati
2012-11-01
In the chemical industry, the production of methanol, ammonia, hydrogen and higher hydrocarbons require synthesis gas (or syn gas). The main three syn gas production methods are carbon dioxide reforming (CRM), steam reforming (SRM) and partial-oxidation of methane (POM). In this work, multi-objective (MO) optimization of the combined CRM and POM was carried out. The empirical model and the MO problem formulation for this combined process were obtained from previous works. The central objectives considered in this problem are methane conversion, carbon monoxide selectivity and the hydrogen to carbon monoxide ratio. The MO nature of the problem was tackled using the Normal Boundary Intersection (NBI) method. Two techniques (Gravitational Search Algorithm (GSA) and Particle Swarm Optimization (PSO)) were then applied in conjunction with the NBI method. The performance of the two algorithms and the quality of the solutions were gauged by using two performance metrics. Comparative studies and results analysis were then carried out on the optimization results.
Parallel global optimization with the particle swarm algorithm
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
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
Particle Swarm Inspired Underwater Sensor Self-Deployment
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
Particle swarm inspired underwater sensor self-deployment.
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
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.
Electronic enclosure design using distributed particle swarm optimization
NASA Astrophysics Data System (ADS)
Scriven, Ian; Lu, Junwei; Lewis, Andrew
2013-02-01
This article proposes a method for designing electromagnetic compatibility shielding enclosures using a peer-to-peer based distributed optimization system based on a modified particle swarm optimization algorithm. This optimization system is used to obtain optimal solutions to a shielding enclosure design problem efficiently with respect to both electromagnetic shielding efficiency and thermal performance. During the optimization procedure it becomes evident that optimization algorithms and computational models must be properly matched in order to achieve efficient operation. The proposed system is designed to be tolerant of faults and resource heterogeneity, and as such would find use in environments where large-scale computing resources are not available, such as smaller engineering companies, where it would allow computer-aided design by optimization using existing resources with little to no financial outlay.
Solving constrained optimization problems with hybrid particle swarm optimization
NASA Astrophysics Data System (ADS)
Zahara, Erwie; Hu, Chia-Hsin
2008-11-01
Constrained optimization problems (COPs) are very important in that they frequently appear in the real world. A COP, in which both the function and constraints may be nonlinear, consists of the optimization of a function subject to constraints. Constraint handling is one of the major concerns when solving COPs with particle swarm optimization (PSO) combined with the Nelder-Mead simplex search method (NM-PSO). This article proposes embedded constraint handling methods, which include the gradient repair method and constraint fitness priority-based ranking method, as a special operator in NM-PSO for dealing with constraints. Experiments using 13 benchmark problems are explained and the NM-PSO results are compared with the best known solutions reported in the literature. Comparison with three different meta-heuristics demonstrates that NM-PSO with the embedded constraint operator is extremely effective and efficient at locating optimal solutions.
Order-2 Stability Analysis of Particle Swarm Optimization.
Liu, Qunfeng
2015-01-01
Several stability analyses and stable regions of particle swarm optimization (PSO) have been proposed before. The assumption of stagnation and different definitions of stability are adopted in these analyses. In this paper, the order-2 stability of PSO is analyzed based on a weak stagnation assumption. A new definition of stability is proposed and an order-2 stable region is obtained. Several existing stable analyses for canonical PSO are compared, especially their definitions of stability and the corresponding stable regions. It is shown that the classical stagnation assumption is too strict and not necessary. Moreover, among all these definitions of stability, it is shown that our definition requires the weakest conditions, and additional conditions bring no benefit. Finally, numerical experiments are reported to show that the obtained stable region is meaningful. A new parameter combination of PSO is also shown to be good, even better than some known best parameter combinations. PMID:24738856
Generalized Particle Swarm Algorithm for HCR Gearing Geometry Optimization
NASA Astrophysics Data System (ADS)
Kuzmanović, Siniša; Vereš, Miroslav; Rackov, Milan
2012-12-01
A Triangle Mesh Standardization Method Based on Particle Swarm Optimization
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
Thermal and athermal three-dimensional swarms of self-propelled particles.
Nguyen, Nguyen H P; Jankowski, Eric; Glotzer, Sharon C
2012-07-01
Swarms of self-propelled particles exhibit complex behavior that can arise from simple models, with large changes in swarm behavior resulting from small changes in model parameters. We investigate the steady-state swarms formed by self-propelled Morse particles in three dimensions using molecular dynamics simulations optimized for graphics processing units. We find a variety of swarms of different overall shape assemble spontaneously and that for certain Morse potential parameters at most two competing structures are observed. We report a rich "phase diagram" of athermal swarm structures observed across a broad range of interaction parameters. Unlike the structures formed in equilibrium self-assembly, we find that the probability of forming a self-propelled swarm can be biased by the choice of initial conditions. We investigate how thermal noise influences swarm formation and demonstrate ways it can be exploited to reconfigure one swarm into another. Our findings validate and extend previous observations of self-propelled Morse swarms and highlight open questions for predictive theories of nonequilibrium self-assembly. PMID:23005397
NASA Astrophysics Data System (ADS)
Mao, Jiandong; Li, Jinxuan
2015-10-01
Particle size distribution is essential for describing direct and indirect radiation of aerosols. Because the relationship between the aerosol size distribution and optical thickness (AOT) is an ill-posed Fredholm integral equation of the first type, the traditional techniques for determining such size distributions, such as the Phillips-Twomey regularization method, are often ambiguous. Here, we use an approach based on an improved particle swarm optimization algorithm (IPSO) to retrieve aerosol size distribution. Using AOT data measured by a CE318 sun photometer in Yinchuan, we compared the aerosol size distributions retrieved using a simple genetic algorithm, a basic particle swarm optimization algorithm and the IPSO. Aerosol size distributions for different weather conditions were analyzed, including sunny, dusty and hazy conditions. Our results show that the IPSO-based inversion method retrieved aerosol size distributions under all weather conditions, showing great potential for similar size distribution inversions.
Pixelated source optimization for optical lithography via particle swarm optimization
NASA Astrophysics Data System (ADS)
Wang, Lei; Li, Sikun; Wang, Xiangzhao; Yan, Guanyong; Yang, Chaoxing
2016-01-01
Source optimization is one of the key techniques for achieving higher resolution without increasing the complexity of mask design. An efficient source optimization approach is proposed on the basis of particle swarm optimization. The pixelated sources are encoded into particles, which are evaluated by using the pattern error as the fitness function. Afterward, the optimization is implemented by updating the velocities and positions of these particles. This approach is demonstrated using three mask patterns, including a periodic array of contact holes, a vertical line/space design, and a complicated pattern. The pattern errors are reduced by 69.6%, 51.5%, and 40.3%, respectively. Compared with the source optimization approach via genetic algorithm, the proposed approach leads to faster convergence while improving the image quality at the same time. Compared with the source optimization approach via gradient descent method, the proposed approach does not need the calculation of gradients, and it has a strong adaptation to various lithographic models, fitness functions, and resist models. The robustness of the proposed approach to initial sources is also verified.
NASA Astrophysics Data System (ADS)
Sarkar, Soham; Das, Swagatam
In recent years particle swarm optimization emerges as one of the most efficient global optimization tools. In this paper, a hybrid particle swarm with differential evolution operator, termed DEPSO, is applied for the synthesis of linear array geometry. Here, the minimum side lobe level and null control, both are obtained by optimizing the spacing between the array elements by this technique. Moreover, a statistical comparison is also provided to establish its performance against the results obtained by Genetic Algorithm (GA), classical Particle Swarm Optimization (PSO), Tabu Search Algorithm (TSA), Differential Evolution (DE) and Memetic Algorithm (MA).
Improved Particle Swarm Optimization for Global Optimization of Unimodal and Multimodal Functions
NASA Astrophysics Data System (ADS)
Basu, Mousumi
2015-07-01
Particle swarm optimization (PSO) performs well for small dimensional and less complicated problems but fails to locate global minima for complex multi-minima functions. This paper proposes an improved particle swarm optimization (IPSO) which introduces Gaussian random variables in velocity term. This improves search efficiency and guarantees a high probability of obtaining the global optimum without significantly impairing the speed of convergence and the simplicity of the structure of particle swarm optimization. The algorithm is experimentally validated on 17 benchmark functions and the results demonstrate good performance of the IPSO in solving unimodal and multimodal problems. Its high performance is verified by comparing with two popular PSO variants.
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
Particle swarm optimization algorithm based low cost magnetometer calibration
NASA Astrophysics Data System (ADS)
Ali, A. S.; Siddharth, S., Syed, Z., El-Sheimy, N.
2011-12-01
Inertial Navigation Systems (INS) consist of accelerometers, gyroscopes and a microprocessor provide inertial digital data from which position and orientation is obtained by integrating the specific forces and rotation rates. In addition to the accelerometers and gyroscopes, magnetometers can be used to derive the absolute user heading based on Earth's magnetic field. Unfortunately, the measurements of the magnetic field obtained with low cost sensors are corrupted by several errors including manufacturing defects and external electro-magnetic fields. Consequently, proper calibration of the magnetometer is required to achieve high accuracy heading measurements. In this paper, a Particle Swarm Optimization (PSO) based calibration algorithm is presented to estimate the values of the bias and scale factor of low cost magnetometer. The main advantage of this technique is the use of the artificial intelligence which does not need any error modeling or awareness of the nonlinearity. The estimated bias and scale factor errors from the proposed algorithm improve the heading accuracy and the results are also statistically significant. Also, it can help in the development of the Pedestrian Navigation Devices (PNDs) when combined with the INS and GPS/Wi-Fi especially in the indoor environments
A Novel Flexible Inertia Weight Particle Swarm Optimization Algorithm.
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
Augmented Lagrangian Particle Swarm Optimization in Mechanism Design
NASA Astrophysics Data System (ADS)
Sedlaczek, Kai; Eberhard, Peter
The problem of optimizing nonlinear multibody systems is in general nonlinear and nonconvex. This is especially true for the dimensional synthesis process of rigid body mechanisms, where often only local solutions might be found with gradient-based optimization methods. An attractive alternative for solving such multimodal optimization problems is the Particle Swarm Optimization (PSO) algorithm. This stochastic solution technique allows a derivative-free search for a global solution without the need for any initial design. In this work, we present an extension to the basic PSO algorithm in order to solve the problem of dimensional synthesis with nonlinear equality and inequality constraints. It utilizes the Augmented Lagrange Multiplier Method in combination with an advanced non-stationary penalty function approach that does not rely on excessively large penalty factors for sufficiently accurate solutions. Although the PSO method is even able to solve nonsmooth and discrete problems, this augmented algorithm can additionally calculate accurate Lagrange multiplier estimates for differentiable formulations, which are helpful in the analysis process of the optimization results. We demonstrate this method and show its very promising applicability to the constrained dimensional synthesis process of rigid body mechanisms.
Particle swarm optimization with scale-free interactions.
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
Particle Swarm Optimization with Scale-Free Interactions
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
A Novel Flexible Inertia Weight Particle Swarm Optimization Algorithm
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
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. PMID:21905841
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
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.
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.
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
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
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.
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.
NASA Astrophysics Data System (ADS)
Rocha, M. C.; Saraiva, J. T.
2012-10-01
The basic objective of Transmission Expansion Planning (TEP) is to schedule a number of transmission projects along an extended planning horizon minimizing the network construction and operational costs while satisfying the requirement of delivering power safely and reliably to load centres along the horizon. This principle is quite simple, but the complexity of the problem and the impact on society transforms TEP on a challenging issue. This paper describes a new approach to solve the dynamic TEP problem, based on an improved discrete integer version of the Evolutionary Particle Swarm Optimization (EPSO) meta-heuristic algorithm. The paper includes sections describing in detail the EPSO enhanced approach, the mathematical formulation of the TEP problem, including the objective function and the constraints, and a section devoted to the application of the developed approach to this problem. Finally, the use of the developed approach is illustrated using a case study based on the IEEE 24 bus 38 branch test system.
NASA Astrophysics Data System (ADS)
Kela, K. B.; Arya, L. D.
2014-09-01
This paper describes a methodology for determination of optimum failure rate and repair time for each section of a radial distribution system. An objective function in terms of reliability indices and their target values is selected. These indices depend mainly on failure rate and repair time of a section present in a distribution network. A cost is associated with the modification of failure rate and repair time. Hence the objective function is optimized subject to failure rate and repair time of each section of the distribution network considering the total budget allocated to achieve the task. The problem has been solved using differential evolution and bare bones particle swarm optimization. The algorithm has been implemented on a sample radial distribution system.
Evaluation of a Particle Swarm Algorithm For Biomechanical Optimization
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
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.
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).
Ruiz-Cruz, Riemann; Sanchez, Edgar N; Ornelas-Tellez, Fernando; Loukianov, Alexander G; Harley, Ronald G
2013-12-01
In this paper, the authors propose a particle swarm optimization (PSO) for a discrete-time inverse optimal control scheme of a doubly fed induction generator (DFIG). For the inverse optimal scheme, a control Lyapunov function (CLF) is proposed to obtain an inverse optimal control law in order to achieve trajectory tracking. A posteriori, it is established that this control law minimizes a meaningful cost function. The CLFs depend on matrix selection in order to achieve the control objectives; this matrix is determined by two mechanisms: initially, fixed parameters are proposed for this matrix by a trial-and-error method and then by using the PSO algorithm. The inverse optimal control scheme is illustrated via simulations for the DFIG, including the comparison between both mechanisms. PMID:24273145
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
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
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.
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.
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
Parameter estimation for chaotic systems with a Drift Particle Swarm Optimization method
NASA Astrophysics Data System (ADS)
Sun, Jun; Zhao, Ji; Wu, Xiaojun; Fang, Wei; Cai, Yujie; Xu, Wenbo
2010-06-01
Inspired by the motion of electrons in metal conductors in an electric field, we propose a variant of Particle Swarm Optimization (PSO), called Drift Particle Swarm Optimization (DPSO) algorithm, and apply it in estimating the unknown parameters of chaotic dynamic systems. The principle and procedure of DPSO are presented, and the algorithm is used to identify Lorenz system and Chen system. The experiment results show that for the given parameter configurations, DPSO can identify the parameters of the systems accurately and effectively, and it may be a promising tool for chaotic system identification as well as other numerical optimization problems in physics.
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.
NASA Astrophysics Data System (ADS)
Arya, Rajesh; Purey, Pradeep
2015-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.
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. PMID:26890944
NASA Astrophysics Data System (ADS)
Petrovic, Z. Lj; Suvakov, M.; Nikitovic, Z.; Dujko, S.; Sasic, O.; Jovanovic, J.; Malovic, G.; Stojanovic, V.
2007-02-01
In this review we discuss the current status of the physics of charged particle swarms, mainly electrons. The whole field is analysed mainly through its relationship to plasma modelling and illustrated by some recent examples developed mainly by our group. The measurements of the swarm coefficients and the availability of the data are briefly discussed. More time is devoted to the development of complete electron molecule cross section sets along with recent examples such as NO, CF4 and HBr. We extend the discussion to the availability of ion and fast neutral data and how swarm experiments may serve to provide new data. As a point where new insight into the kinetics of charge particle transport is provided, the role of kinetic phenomena is discussed and recent examples are listed. We focus here on giving two examples on how non-conservative processes make dramatic effects in transport, the negative absolute mobility and the negative differential conductivity for positrons in argon. Finally we discuss the applicability of swarm data in plasma modelling and the relationship to other fields where swarm experiments and analysis make significant contributions. Based on the general invited lecture presented by the first author at ESCAMPIG 2006 at Lecce in Italy.
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.
Convective diffusion and adsorption in a swarm of spheroidal particles
Coutelieris, F.A.; Burganos, V.N.; Payatakes, A.C.
1995-05-01
The problem of mass transfer from a Newtonian fluid to a swarm of spheroidal adsorbers under creeping flow conditions is considered using the spheroid-in-cell model to represent the swarm. The flow field within the fluid envelope for the Kuwabara type of boundary conditions is obtained from the analytical solution of Dassios et al. (1994). The complete convective diffusion equation is used to describe mass transport within the envelope so that moderate and strong diffusion terms can be taken into account. A new set of boundary conditions is used that respects mass flux and concentration continuity across the outer surface of the cell and maximizes the applicability of the spheroid-in-cell model in the convection-to-diffusion transition regime. The resulting elliptic problem in two dimensions is solved numerically. Results for the upstream and downstream concentration profiles reveal that tangential diffusion is very significant and should not be neglected for moderate and low Peclet number values. Also, the classical Levich-type of formulation, which is theoretically valid for very weak diffusional terms only, can in practice be modified to predict with fair accuracy the overall Sherwood number and the adsorption efficiency of prolate and oblate spheroids-in-cell even in moderate Peclet number cases.
Pini, Giovanni; Brutschy, Arne; Scheidler, Alexander; Dorigo, Marco; Birattari, Mauro
2014-01-01
We study task partitioning in the context of swarm robotics. Task partitioning is the decomposition of a task into subtasks that can be tackled by different workers. We focus on the case in which a task is partitioned into a sequence of subtasks that must be executed in a certain order. This implies that the subtasks must interface with each other, and that the output of a subtask is used as input for the subtask that follows. A distinction can be made between task partitioning with direct transfer and with indirect transfer. We focus our study on the first case: The output of a subtask is directly transferred from an individual working on that subtask to an individual working on the subtask that follows. As a test bed for our study, we use a swarm of robots performing foraging. The robots have to harvest objects from a source, situated in an unknown location, and transport them to a home location. When a robot finds the source, it memorizes its position and uses dead reckoning to return there. Dead reckoning is appealing in robotics, since it is a cheap localization method and it does not require any additional external infrastructure. However, dead reckoning leads to errors that grow in time if not corrected periodically. We compare a foraging strategy that does not make use of task partitioning with one that does. We show that cooperation through task partitioning can be used to limit the effect of dead reckoning errors. This results in improved capability of locating the object source and in increased performance of the swarm. We use the implemented system as a test bed to study benefits and costs of task partitioning with direct transfer. We implement the system with real robots, demonstrating the feasibility of our approach in a foraging scenario. PMID:24730767
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.
Pseudo-gradient based particle swarm optimization for nonconvex economic dispatch
NASA Astrophysics Data System (ADS)
Vo, Dieu N.; Schegner, Peter; Ongsakul, Weerakorn
2012-11-01
This paper proposes a pseudo-gradient based particle swarm optimization (PGPSO) method for solving nonconvex economic dispatch (ED) including valve point effects, multiple fuels and prohibited operating zones. The proposed PGPSO is based on the self-organizing hierarchical particle swarm optimizer with time-varying acceleration coefficients (HPSO-TVAC) with position of particles guided by a pseudo-gradient. The pseudo-gradient here is to determine an appropriate direction for the particles during their movement so that they can quickly move to an optimal solution. The proposed method has been tested on several systems and the obtained results are compared to those from many other methods available in the literature. Test results have indicated that the proposed method can obtain less expensive total costs than many others in a faster computing manner, especially for the large-scale problems. Therefore, the proposed PGPSO is favorable for online implementation in the practical ED problems.
A Lyapunov-Based Extension to Particle Swarm Dynamics for Continuous Function Optimization
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
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
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.
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.
NASA Astrophysics Data System (ADS)
Ghosh, Pradipta; Zafar, Hamim
Linear antenna array design is one of the most important electromagnetic optimization problems of current interest. This paper describes the synthesis method of linear array geometry with minimum side lobe level and null control by the Dynamic Multi-Swarm Particle Swarm Optimizer with Local Search (DMSPSO) which optimizes the spacing between the elements of the linear array to produce a radiation pattern with minimum side lobe level and null placement control. The results of the DMSPSO algorithm have been shown to meet or beat the results obtained using other state-of-the-art metaheuristics like the Genetic Algorithm (GA),General Particle Swarm Optimization (PSO), Memetic Algorithms (MA), and Tabu Search (TS) in a statistically meaningful way. Three design examples are presented that illustrate the use of the DMSPSO algorithm, and the optimization goal in each example is easily achieved.
NASA Astrophysics Data System (ADS)
Shao, Gui-Fang; Wang, Ting-Na; Liu, Tun-Dong; Chen, Jun-Ren; Zheng, Ji-Wen; Wen, Yu-Hua
2015-01-01
Pt-Pd alloy nanoparticles, as potential catalyst candidates for new-energy resources such as fuel cells and lithium ion batteries owing to their excellent reactivity and selectivity, have aroused growing attention in the past years. Since structure determines physical and chemical properties of nanoparticles, the development of a reliable method for searching the stable structures of Pt-Pd alloy nanoparticles has become of increasing importance to exploring the origination of their properties. In this article, we have employed the particle swarm optimization algorithm to investigate the stable structures of alloy nanoparticles with fixed shape and atomic proportion. An improved discrete particle swarm optimization algorithm has been proposed and the corresponding scheme has been presented. Subsequently, the swap operator and swap sequence have been applied to reduce the probability of premature convergence to the local optima. Furthermore, the parameters of the exchange probability and the 'particle' size have also been considered in this article. Finally, tetrahexahedral Pt-Pd alloy nanoparticles has been used to test the effectiveness of the proposed method. The calculated results verify that the improved particle swarm optimization algorithm has superior convergence and stability compared with the traditional one.
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
The Study of Intelligent Vehicle Navigation Path Based on Behavior Coordination of Particle Swarm.
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
The Study of Intelligent Vehicle Navigation Path Based on Behavior Coordination of Particle Swarm
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
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.
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.
Crop Classification by Forward Neural Network with Adaptive Chaotic Particle Swarm Optimization
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. PMID:22163872
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.
NASA Astrophysics Data System (ADS)
Fukuyama, Yoshikazu
This paper compares particle swarm optimization (PSO) techniques for a reactive power allocation planning problem in power systems. The problem can be formulated as a mixed-integer nonlinear optimization problem (MINLP). The PSO based methods determines a reactive power allocation strategy with continuous and discrete state variables such as automatic voltage regulator (AVR) operating values of electric power generators, tap positions of on-load tap changer (OLTC) of transformers, and the number of reactive power compensation equipment. Namely, this paper investigates applicability of PSO techniques to one of the practical MINLPs in power systems. Four variations of PSO: PSO with inertia weight approach (IWA), PSO with constriction factor approach (CFA), hybrid particle swarm optimization (HPSO) with IWA, and HPSO with CFA are compared. The four methods are applied to the standard IEEE14 bus system and a practical 112 bus system.
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.
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.
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
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
Tang, Jingtian; Cao, Yang; Xiao, Jiaying; Guo, Qulian
2014-06-01
Due to individual differences of the depth of anaesthesia (DOA) controlled objects, the drawbacks of monitoring index, the traditional PID controller of anesthesia depth could not meet the demands of nonlinear control. However, the adjustments of the rules of DOA fuzzy control often rely on personal experience and, therefore, it could not achieve the satisfactory control effects. The present research established a fuzzy closed-loop control system which takes the cerebral state index (CSI) value as a feedback controlled variable, and it also adopts the particle swarm optimization (PSO) to optimize the fuzzy control rule and membership functions between the change of CSI and propofol infusion rate. The system sets the CSI targets at 40 and 30 through the system simulation, and it also adds some Gaussian noise to imitate clinical disturbance. Experimental results indicated that this system could reach the set CSI point accurately, rapidly and stably, with no obvious perturbation in the presence of noise. The fuzzy controller based on CSI which has been optimized by PSO has better stability and robustness in the DOA closed loop control system. PMID:25219229
Swarming visual sensor network for real-time multiple object tracking
NASA Astrophysics Data System (ADS)
Baranov, Yuri P.; Yarishev, Sergey N.; Medvedev, Roman V.
2016-04-01
Position control of multiple objects is one of the most actual problems in various technology areas. For example, in construction area this problem is represented as multi-point deformation control of bearing constructions in order to prevent collapse, in mining - deformation control of lining constructions, in rescue operations - potential victims and sources of ignition location, in transport - traffic control and traffic violations detection, in robotics -traffic control for organized group of robots and many other problems in different areas. Usage of stationary devices for solving these problems is inappropriately due to complex and variable geometry of control areas. In these cases self-organized systems of moving visual sensors is the best solution. This paper presents a concept of scalable visual sensor network with swarm architecture for multiple object pose estimation and real-time tracking. In this article recent developments of distributed measuring systems were reviewed with consequent investigation of advantages and disadvantages of existing systems, whereupon theoretical principles of design of swarming visual sensor network (SVSN) were declared. To measure object coordinates in the world coordinate system using TV-camera intrinsic (focal length, pixel size, principal point position, distortion) and extrinsic (rotation matrix, translation vector) calibration parameters were needed to be determined. Robust camera calibration was a too resource-intensive task for using moving camera. In this situation position of the camera is usually estimated using a visual mark with known parameters. All measurements were performed in markcentered coordinate systems. In this article a general adaptive algorithm of coordinate conversion of devices with various intrinsic parameters was developed. Various network topologies were reviewed. Minimum error in objet tracking was realized by finding the shortest path between object of tracking and bearing sensor, which set
Optimal design of plate-fin heat exchangers by particle swarm optimization
NASA Astrophysics Data System (ADS)
Yousefi, M.; Darus, A. N.
2011-12-01
This study explores the application of Particle Swarm Optimization (PSO) for optimization of a cross-flow plate fin heat exchanger. Minimization total annual cost is the target of optimization. Seven design parameters, namely, heat exchanger length at hot and cold sides, fin height, fin frequency, fin thickness, fin-strip length and number of hot side layers are selected as optimization variables. A case study from the literature proves the effectiveness of the proposed algorithm in case of achieving more accurate results.
NASA Astrophysics Data System (ADS)
Chen, Zhao-Jiang; Zhang, Shu-Yi
2010-02-01
A new hybrid inversion method for depth profiling reconstruction of thermal conductivities of inhomogeneous solids is proposed based on multilayer quadrupole formalism of thermal waves, particle swarm optimization and sequential quadratic programming. The reconstruction simulations for several thermal conductivity profiles are performed to evaluate the applicability of the method. The numerical simulations demonstrate that the precision and insensitivity to noise of the inversion method are very satisfactory.
Swarming behavior of gradient-responsive Brownian particles in a porous medium.
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. PMID:23005461
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.
Chang, Pei-Chann; Lin, Jyun-Jie; Liu, Chen-Hao
2012-09-01
In this research, a hybrid model is developed by integrating a case-based reasoning approach and a particle swarm optimization model for medical data classification. Two data sets from UCI Machine Learning Repository, i.e., Liver Disorders Data Set and Breast Cancer Wisconsin (Diagnosis), are employed for benchmark test. Initially a case-based reasoning method is applied to preprocess the data set thus a weight vector for each feature is derived. A particle swarm optimization model is then applied to construct a decision-making system for diseases identified. The PSO algorithm starts by partitioning the data set into a relatively large number of clusters to reduce the effects of initial conditions and then reducing the number of clusters into two. The average forecasting accuracy for breast cancer of CBRPSO model is 97.4% and for liver disorders is 76.8%. The proposed case-based particle swarm optimization model is able to produce more accurate and comprehensible results for medical experts in medical diagnosis. PMID:21194784
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.
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.
SwarmPS: rapid, semi-automated single particle selection software.
Woolford, David; Ericksson, Geoffery; Rothnagel, Rosalba; Muller, David; Landsberg, Michael J; Pantelic, Radosav S; McDowall, Alasdair; Pailthorpe, Bernard; Young, Paul R; Hankamer, Ben; Banks, Jasmine
2007-01-01
Single particle analysis (SPA) coupled with high-resolution electron cryo-microscopy is emerging as a powerful technique for the structure determination of membrane protein complexes and soluble macromolecular assemblies. Current estimates suggest that approximately 10(4)-10(5) particle projections are required to attain a 3A resolution 3D reconstruction (symmetry dependent). Selecting this number of molecular projections differing in size, shape and symmetry is a rate-limiting step for the automation of 3D image reconstruction. Here, we present Swarm(PS), a feature rich GUI based software package to manage large scale, semi-automated particle picking projects. The software provides cross-correlation and edge-detection algorithms. Algorithm-specific parameters are transparently and automatically determined through user interaction with the image, rather than by trial and error. Other features include multiple image handling (approximately 10(2)), local and global particle selection options, interactive image freezing, automatic particle centering, and full manual override to correct false positives and negatives. Swarm(PS) is user friendly, flexible, extensible, fast, and capable of exporting boxed out projection images, or particle coordinates, compatible with downstream image processing suites. PMID:16774837
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.
Multi-Robot, Multi-Target Particle Swarm Optimization Search in Noisy Wireless Environments
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.
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
Han, Wenhua; Xu, Jun; Wang, Ping; Tian, Guiyun
2014-01-01
In this paper, efficient managing particle swarm optimization (EMPSO) for high dimension problem is proposed to estimate defect profile from magnetic flux leakage (MFL) signal. In the proposed EMPSO, in order to strengthen exchange of information among particles, particle pair model was built. For more efficient searching when facing different landscapes of problems, velocity updating scheme including three velocity updating models was also proposed. In addition, for more chances to search optimum solution out, automatic particle selection for re-initialization was implemented. The optimization results of six benchmark functions show EMPSO performs well when optimizing 100-D problems. The defect simulation results demonstrate that the inversing technique based on EMPSO outperforms the one based on self-learning particle swarm optimizer (SLPSO), and the estimated profiles are still close to the desired profiles with the presence of low noise in MFL signal. The results estimated from real MFL signal by EMPSO-based inversing technique also indicate that the algorithm is capable of providing an accurate solution of the defect profile with real signal. Both the simulation results and experiment results show the computing time of the EMPSO-based inversing technique is reduced by 20%-30% than that of the SLPSO-based inversing technique. PMID:24926693
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.
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.
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.
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
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.
NASA Astrophysics Data System (ADS)
Ma, Yanfang; Xu, Jiuping
2015-06-01
This article puts forward a cloud theory-based particle swarm optimization (CTPSO) algorithm for solving a variant of the vehicle routing problem, namely a multiple decision maker vehicle routing problem with fuzzy random time windows (MDVRPFRTW). A new mathematical model is developed for the proposed problem in which fuzzy random theory is used to describe the time windows and bi-level programming is applied to describe the relationship between the multiple decision makers. To solve the problem, a cloud theory-based particle swarm optimization (CTPSO) is proposed. More specifically, this approach makes improvements in initialization, inertia weight and particle updates to overcome the shortcomings of the basic particle swarm optimization (PSO). Parameter tests and results analysis are presented to highlight the performance of the optimization method, and comparison of the algorithm with the basic PSO and the genetic algorithm demonstrates its efficiency.
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
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.
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-03-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.
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.
A Modified Particle Swarm Optimization Technique for Finding Optimal Designs for Mixture Models.
Wong, Weng Kee; Chen, Ray-Bing; Huang, Chien-Chih; Wang, Weichung
2015-01-01
Particle Swarm Optimization (PSO) is a meta-heuristic algorithm that has been shown to be successful in solving a wide variety of real and complicated optimization problems in engineering and computer science. This paper introduces a projection based PSO technique, named ProjPSO, to efficiently find different types of optimal designs, or nearly optimal designs, for mixture models with and without constraints on the components, and also for related models, like the log contrast models. We also compare the modified PSO performance with Fedorov's algorithm, a popular algorithm used to generate optimal designs, Cocktail algorithm, and the recent algorithm proposed by [1]. PMID:26091237
A Modified Particle Swarm Optimization Technique for Finding Optimal Designs for Mixture Models
Wong, Weng Kee; Chen, Ray-Bing; Huang, Chien-Chih; Wang, Weichung
2015-01-01
Particle Swarm Optimization (PSO) is a meta-heuristic algorithm that has been shown to be successful in solving a wide variety of real and complicated optimization problems in engineering and computer science. This paper introduces a projection based PSO technique, named ProjPSO, to efficiently find different types of optimal designs, or nearly optimal designs, for mixture models with and without constraints on the components, and also for related models, like the log contrast models. We also compare the modified PSO performance with Fedorov's algorithm, a popular algorithm used to generate optimal designs, Cocktail algorithm, and the recent algorithm proposed by [1]. PMID:26091237
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
Approach to analytically minimize the LCD moiré by image-based particle swarm optimization.
Tsai, Yu-Lin; Tien, Chung-Hao
2015-10-01
In this paper, we proposed a methodology to optimize the parametric window of a liquid crystal display (LCD) system, whose visual performance was deteriorated by the pixel moiré arising in between multiple periodic structures. Conventional analysis and minimization of moiré patterns are limited by few parameters. With the proposed image-based particle swarm optimization (PSO), we enable a multivariable optimization at the same time. A series of experiments was conducted to validate the methodology. Due to its versatility, the proposed technique will certainly have a promising impact on the fast optimization in LCD design with more complex configuration. PMID:26479663
Using Animal Instincts to Design Efficient Biomedical Studies via Particle Swarm Optimization
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
Evolutionary artificial neural networks by multi-dimensional particle swarm optimization.
Kiranyaz, Serkan; Ince, Turker; Yildirim, Alper; Gabbouj, Moncef
2009-12-01
In this paper, we propose a novel technique for the automatic design of Artificial Neural Networks (ANNs) by evolving to the optimal network configuration(s) within an architecture space. It is entirely based on a multi-dimensional Particle Swarm Optimization (MD PSO) technique, which re-forms the native structure of swarm particles in such a way that they can make inter-dimensional passes with a dedicated dimensional PSO process. Therefore, in a multidimensional search space where the optimum dimension is unknown, swarm particles can seek both positional and dimensional optima. This eventually removes the necessity of setting a fixed dimension a priori, which is a common drawback for the family of swarm optimizers. With the proper encoding of the network configurations and parameters into particles, MD PSO can then seek the positional optimum in the error space and the dimensional optimum in the architecture space. The optimum dimension converged at the end of a MD PSO process corresponds to a unique ANN configuration where the network parameters (connections, weights and biases) can then be resolved from the positional optimum reached on that dimension. In addition to this, the proposed technique generates a ranked list of network configurations, from the best to the worst. This is indeed a crucial piece of information, indicating what potential configurations can be alternatives to the best one, and which configurations should not be used at all for a particular problem. In this study, the architecture space is defined over feed-forward, fully-connected ANNs so as to use the conventional techniques such as back-propagation and some other evolutionary methods in this field. The proposed technique is applied over the most challenging synthetic problems to test its optimality on evolving networks and over the benchmark problems to test its generalization capability as well as to make comparative evaluations with the several competing techniques. The experimental
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
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.
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.
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
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
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
NASA Astrophysics Data System (ADS)
Wang, Deguang; Han, Baochang; Huang, Ming
Computer forensics is the technology of applying computer technology to access, investigate and analysis the evidence of computer crime. It mainly include the process of determine and obtain digital evidence, analyze and take data, file and submit result. And the data analysis is the key link of computer forensics. As the complexity of real data and the characteristics of fuzzy, evidence analysis has been difficult to obtain the desired results. This paper applies fuzzy c-means clustering algorithm based on particle swarm optimization (FCMP) in computer forensics, and it can be more satisfactory results.
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.
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
NASA Astrophysics Data System (ADS)
Xu, Guan; Lu, Xue; Li, Xiaotao; Su, Jian; Tian, Guangdong; Sun, Lina
2015-02-01
The size character, which represents the relationship of the size variables of a binocular vision model, is studied to determine the optimal structure of the measurement system. An optimal objective function is constructed to minimize the system area. The optimal solution with the constraint of the virtual baseline distance is obtained from the particle swarm optimization (PSO) algorithm. A case study shows that when the virtual baseline is 1300 mm, the optimal parameters are: the real baseline distance is 600 mm, the bottom distance between the two smaller mirrors is 120 mm, the distance from a smaller mirror to the camera is 600 mm, the distance from a larger mirror to the camera is 700 mm, the angle between the smaller mirror and baseline is 15°, the angle between the large mirror and baseline is 30°, larger mirror is 500 mm long, then the optimal system area is 0.838 m2.
NASA Astrophysics Data System (ADS)
Delkhosh, Mojtaba; Saadat Foumani, Mahmoud
2013-05-01
The aim of this research is the optimisation of full-toroidal continuously variable transmission (CVT) in conjunction with the fixed ratio (FR) mechanism, while the optimisation objective is to minimise fuel consumption (FC) of the vehicle in the new European driving cycle. After the dynamic analysis of the power train, a computer model is developed to simulate contact between CVT elements and consequently calculate its efficiency. Then an algorithm is presented to calculate FC of the vehicle in the driving cycle. Then, an optimisation using particle swarm optimisation on the CVT geometry and FR mechanism (which is embedded between CVT and final drive) is carried out to minimise FC. It is found that by utilisation of the optimised CVT; FC will be about 11% and 8% lower, compared with the application of a five-speed manual transmission and conventional CVT, respectively. Finally, effects of the roller tilt angle and oil temperature on the FC are investigated.
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.
NASA Astrophysics Data System (ADS)
Guo, Weian; Li, Wuzhao; Zhang, Qun; Wang, Lei; Wu, Qidi; Ren, Hongliang
2014-11-01
In evolutionary algorithms, elites are crucial to maintain good features in solutions. However, too many elites can make the evolutionary process stagnate and cannot enhance the performance. This article employs particle swarm optimization (PSO) and biogeography-based optimization (BBO) to propose a hybrid algorithm termed biogeography-based particle swarm optimization (BPSO) which could make a large number of elites effective in searching optima. In this algorithm, the whole population is split into several subgroups; BBO is employed to search within each subgroup and PSO for the global search. Since not all the population is used in PSO, this structure overcomes the premature convergence in the original PSO. Time complexity analysis shows that the novel algorithm does not increase the time consumption. Fourteen numerical benchmarks and four engineering problems with constraints are used to test the BPSO. To better deal with constraints, a fuzzy strategy for the number of elites is investigated. The simulation results validate the feasibility and effectiveness of the proposed algorithm.
Hybrid Bacterial Foraging and Particle Swarm Optimization for detecting Bundle Branch Block.
Kora, Padmavathi; Kalva, Sri Ramakrishna
2015-01-01
Abnormal cardiac beat identification is a key process in the detection of heart diseases. Our present study describes a procedure for the detection of left and right bundle branch block (LBBB and RBBB) Electrocardiogram (ECG) patterns. The electrical impulses that control the cardiac beat face difficulty in moving inside the heart. This problem is termed as bundle branch block (BBB). BBB makes it harder for the heart to pump blood effectively through the heart circulatory system. ECG feature extraction is a key process in detecting heart ailments. Our present study comes up with a hybrid method combining two heuristic optimization methods: Bacterial Forging Optimization (BFO) and Particle Swarm Optimization (PSO) for the feature selection of ECG signals. One of the major controlling forces of BFO algorithm is the chemotactic movement of a bacterium that models a test solution. The chemotaxis process of the BFO depends on random search directions which may lead to a delay in achieving the global optimum solution. The hybrid technique: Bacterial Forging-Particle Swarm Optimization (BFPSO) incorporates the concepts from BFO and PSO and it creates individuals in a new generation. This BFPSO method performs local search through the chemotactic movement of BFO and the global search over the entire search domain is accomplished by a PSO operator. The BFPSO feature values are given as the input for the Levenberg-Marquardt Neural Network classifier. PMID:26361582
Energy-Aware Multipath Routing Scheme Based on Particle Swarm Optimization in Mobile Ad Hoc Networks
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
NASA Astrophysics Data System (ADS)
Pekşen, Ertan; Yas, Türker; Kıyak, Alper
2014-09-01
We examine the one-dimensional direct current method in anisotropic earth formation. We derive an analytic expression of a simple, two-layered anisotropic earth model. Further, we also consider a horizontally layered anisotropic earth response with respect to the digital filter method, which yields a quasi-analytic solution over anisotropic media. These analytic and quasi-analytic solutions are useful tests for numerical codes. A two-dimensional finite difference earth model in anisotropic media is presented in order to generate a synthetic data set for a simple one-dimensional earth. Further, we propose a particle swarm optimization method for estimating the model parameters of a layered anisotropic earth model such as horizontal and vertical resistivities, and thickness. The particle swarm optimization is a naturally inspired meta-heuristic algorithm. The proposed method finds model parameters quite successfully based on synthetic and field data. However, adding 5 % Gaussian noise to the synthetic data increases the ambiguity of the value of the model parameters. For this reason, the results should be controlled by a number of statistical tests. In this study, we use probability density function within 95 % confidence interval, parameter variation of each iteration and frequency distribution of the model parameters to reduce the ambiguity. The result is promising and the proposed method can be used for evaluating one-dimensional direct current data in anisotropic media.
Liu, Chengyu; Zhuang, Tao; Zhao, Lina; Chang, Faliang; Liu, Changchun; Wei, Shoushui; Li, Qiqiang; Zheng, Dingchang
2014-01-01
Changes of arterial pressure waveform characteristics have been accepted as risk indicators of cardiovascular diseases. Waveform modelling using Gaussian functions has been used to decompose arterial pressure pulses into different numbers of subwaves and hence quantify waveform characteristics. However, the fitting accuracy and computation efficiency of current modelling approaches need to be improved. This study aimed to develop a novel two-stage particle swarm optimizer (TSPSO) to determine optimal parameters of Gaussian functions. The evaluation was performed on carotid and radial artery pressure waveforms (CAPW and RAPW) which were simultaneously recorded from twenty normal volunteers. The fitting accuracy and calculation efficiency of our TSPSO were compared with three published optimization methods: the Nelder-Mead, the modified PSO (MPSO), and the dynamic multiswarm particle swarm optimizer (DMS-PSO). The results showed that TSPSO achieved the best fitting accuracy with a mean absolute error (MAE) of 1.1% for CAPW and 1.0% for RAPW, in comparison with 4.2% and 4.1% for Nelder-Mead, 2.0% and 1.9% for MPSO, and 1.2% and 1.1% for DMS-PSO. In addition, to achieve target MAE of 2.0%, the computation time of TSPSO was only 1.5 s, which was only 20% and 30% of that for MPSO and DMS-PSO, respectively. PMID:24967415
Zhuang, Tao; Zhao, Lina; Chang, Faliang; Liu, Changchun; Wei, Shoushui; Li, Qiqiang
2014-01-01
Changes of arterial pressure waveform characteristics have been accepted as risk indicators of cardiovascular diseases. Waveform modelling using Gaussian functions has been used to decompose arterial pressure pulses into different numbers of subwaves and hence quantify waveform characteristics. However, the fitting accuracy and computation efficiency of current modelling approaches need to be improved. This study aimed to develop a novel two-stage particle swarm optimizer (TSPSO) to determine optimal parameters of Gaussian functions. The evaluation was performed on carotid and radial artery pressure waveforms (CAPW and RAPW) which were simultaneously recorded from twenty normal volunteers. The fitting accuracy and calculation efficiency of our TSPSO were compared with three published optimization methods: the Nelder-Mead, the modified PSO (MPSO), and the dynamic multiswarm particle swarm optimizer (DMS-PSO). The results showed that TSPSO achieved the best fitting accuracy with a mean absolute error (MAE) of 1.1% for CAPW and 1.0% for RAPW, in comparison with 4.2% and 4.1% for Nelder-Mead, 2.0% and 1.9% for MPSO, and 1.2% and 1.1% for DMS-PSO. In addition, to achieve target MAE of 2.0%, the computation time of TSPSO was only 1.5 s, which was only 20% and 30% of that for MPSO and DMS-PSO, respectively. PMID:24967415
Adam, Asrul; Shapiai, Mohd Ibrahim; Tumari, Mohd Zaidi Mohd; Mohamad, Mohd Saberi; Mubin, Marizan
2014-01-01
Electroencephalogram (EEG) signal peak detection is widely used in clinical applications. The peak point can be detected using several approaches, including time, frequency, time-frequency, and nonlinear domains depending on various peak features from several models. However, there is no study that provides the importance of every peak feature in contributing to a good and generalized model. In this study, feature selection and classifier parameters estimation based on particle swarm optimization (PSO) are proposed as a framework for peak detection on EEG signals in time domain analysis. Two versions of PSO are used in the study: (1) standard PSO and (2) random asynchronous particle swarm optimization (RA-PSO). The proposed framework tries to find the best combination of all the available features that offers good peak detection and a high classification rate from the results in the conducted experiments. The evaluation results indicate that the accuracy of the peak detection can be improved up to 99.90% and 98.59% for training and testing, respectively, as compared to the framework without feature selection adaptation. Additionally, the proposed framework based on RA-PSO offers a better and reliable classification rate as compared to standard PSO as it produces low variance model. PMID:25243236
Adam, Asrul; Mohd Tumari, Mohd Zaidi; Mohamad, Mohd Saberi
2014-01-01
Electroencephalogram (EEG) signal peak detection is widely used in clinical applications. The peak point can be detected using several approaches, including time, frequency, time-frequency, and nonlinear domains depending on various peak features from several models. However, there is no study that provides the importance of every peak feature in contributing to a good and generalized model. In this study, feature selection and classifier parameters estimation based on particle swarm optimization (PSO) are proposed as a framework for peak detection on EEG signals in time domain analysis. Two versions of PSO are used in the study: (1) standard PSO and (2) random asynchronous particle swarm optimization (RA-PSO). The proposed framework tries to find the best combination of all the available features that offers good peak detection and a high classification rate from the results in the conducted experiments. The evaluation results indicate that the accuracy of the peak detection can be improved up to 99.90% and 98.59% for training and testing, respectively, as compared to the framework without feature selection adaptation. Additionally, the proposed framework based on RA-PSO offers a better and reliable classification rate as compared to standard PSO as it produces low variance model. PMID:25243236
Parameter identification of robot manipulators: a heuristic particle swarm search approach.
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
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
Biochemical systems identification by a random drift particle swarm optimization approach
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
Cedeño, Walter; Agrafiotis, Dimitris K
2003-01-01
We describe the application of particle swarms for the development of quantitative structure-activity relationship (QSAR) models based on k-nearest neighbor and kernel regression. Particle swarms is a population-based stochastic search method based on the principles of social interaction. Each individual explores the feature space guided by its previous success and that of its neighbors. Success is measured using leave-one-out (LOO) cross validation on the resulting model as determined by k-nearest neighbor kernel regression. The technique is shown to compare favorably to simulated annealing using three classical data sets from the QSAR literature. PMID:13677491
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
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
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
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
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
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
Parameter Identification of Robot Manipulators: A Heuristic Particle Swarm Search Approach
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
NASA Astrophysics Data System (ADS)
Saada, Mohamed M.; Arafa, Mustafa H.; Nassef, Ashraf O.
2013-06-01
The use of vibration-based techniques in damage identification has recently received considerable attention in many engineering disciplines. While various damage indicators have been proposed in the literature, those relying only on changes in the natural frequencies are quite appealing since these quantities can conveniently be acquired. Nevertheless, the use of natural frequencies in damage identification is faced with many obstacles, including insensitivity and non-uniqueness issues. The aim of this article is to develop a viable damage identification scheme based only on changes in the natural frequencies and to attempt to overcome the challenges typically encountered. The proposed methodology relies on building a finite element model (FEM) of the structure under investigation. An improved particle swarm optimization algorithm is proposed to facilitate updating the FEM in accordance with experimentally determined natural frequencies in order to predict the damage location and extent. The method is tested on beam structures and was shown to be an effective tool for damage identification.
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.
Design Optimization of Pin Fin Geometry Using Particle Swarm Optimization Algorithm
Hamadneh, Nawaf; Khan, Waqar A.; Sathasivam, Saratha; Ong, Hong Choon
2013-01-01
Particle swarm optimization (PSO) is employed to investigate the overall performance of a pin fin.The following study will examine the effect of governing parameters on overall thermal/fluid performance associated with different fin geometries, including, rectangular plate fins as well as square, circular, and elliptical pin fins. The idea of entropy generation minimization, EGM is employed to combine the effects of thermal resistance and pressure drop within the heat sink. A general dimensionless expression for the entropy generation rate is obtained by considering a control volume around the pin fin including base plate and applying the conservations equations for mass and energy with the entropy balance. Selected fin geometries are examined for the heat transfer, fluid friction, and the minimum entropy generation rate corresponding to different parameters including axis ratio, aspect ratio, and Reynolds number. The results clearly indicate that the preferred fin profile is very dependent on these parameters. PMID:23741525
Application of Particle Swarm Optimization Algorithm for Better Nano-Devices
NASA Astrophysics Data System (ADS)
Singh, Nameirakpam Basanta; Deb, Sanjoy; Mishra, Guru P.; Sarkar, Samir Kumar; Sarkar, Subir Kumar
Particle swarm optimization, an intelligent soft computing tool is employed to determine the optimized system parameters of GaAs quantum well for better high frequency performance under hot electron condition at room temperature. The energy loss through LO phonon and momentum loss through LO phonon, deformation acoustic phonon and ionized impurity (both background and remote) are incorporated in the present calculations. For a typical dc biasing field, it is possible to predict the optimum values of system parameters like lattice temperature, well width and two-dimensional carrier concentration for realizing a particular high frequency response characterised by well defined cut-off frequency. Such optimization will make feasible the fabrication of a variety of new quantum devices with desired characteristics.
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.
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.
NASA Astrophysics Data System (ADS)
Chang, Yau-Zen; Hou, Jung-Fu; Tsao, Yi Hsiang; Lee, Shih-Tseng
2011-09-01
This paper proposes a scheme for finding the correspondence between uniformly spaced locations on the images of human face captured from different viewpoints at the same instant. The correspondence is dedicated for 3D reconstruction to be used in the registration procedure for neurosurgery where the exposure to projectors must be seriously restricted. The approach utilizes structured light to enhance patterns on the images and is initialized with the scale-invariant feature transform (SIFT). Successive locations are found according to spatial order using a parallel version of the particle swarm optimization algorithm. Furthermore, false locations are singled out for correction by searching for outliers from fitted curves. Case studies show that the scheme is able to correctly generate 456 evenly spaced 3D coordinate points in 23 seconds from a single shot of projected human face using a PC with 2.66 GHz Intel Q9400 CPU and 4GB RAM.
Application of quantum-behaved particle swarm optimization to motor imagery EEG classification.
Hsu, Wei-Yen
2013-12-01
In this study, we propose a recognition system for single-trial analysis of motor imagery (MI) electroencephalogram (EEG) data. Applying event-related brain potential (ERP) data acquired from the sensorimotor cortices, the system chiefly consists of automatic artifact elimination, feature extraction, feature selection and classification. In addition to the use of independent component analysis, a similarity measure is proposed to further remove the electrooculographic (EOG) artifacts automatically. Several potential features, such as wavelet-fractal features, are then extracted for subsequent classification. Next, quantum-behaved particle swarm optimization (QPSO) is used to select features from the feature combination. Finally, selected sub-features are classified by support vector machine (SVM). Compared with without artifact elimination, feature selection using a genetic algorithm (GA) and feature classification with Fisher's linear discriminant (FLD) on MI data from two data sets for eight subjects, the results indicate that the proposed method is promising in brain-computer interface (BCI) applications. PMID:24156669
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.
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.
NASA Astrophysics Data System (ADS)
Wu, Qi
2010-03-01
Demand forecasts play a crucial role in supply chain management. The future demand for a certain product is the basis for the respective replenishment systems. Aiming at demand series with small samples, seasonal character, nonlinearity, randomicity and fuzziness, the existing support vector kernel does not approach the random curve of the sales time series in the space (quadratic continuous integral space). In this paper, we present a hybrid intelligent system combining the wavelet kernel support vector machine and particle swarm optimization for demand forecasting. The results of application in car sale series forecasting show that the forecasting approach based on the hybrid PSOWv-SVM model is effective and feasible, the comparison between the method proposed in this paper and other ones is also given, which proves that this method is, for the discussed example, better than hybrid PSOv-SVM and other traditional methods.
Fitting of interatomic potentials without forces: A parallel particle swarm optimization algorithm
NASA Astrophysics Data System (ADS)
González, Diego; Davis, Sergio
2014-12-01
We present a methodology for fitting interatomic potentials to ab initio data, using the particle swarm optimization (PSO) algorithm, needing only a set of positions and energies as input. The prediction error of energies associated with the fitted parameters can be close to 1 meV/atom or lower, for reference energies having a standard deviation of about 0.5 eV/atom. We tested our method by fitting a Sutton-Chen potential for copper from ab initio data, which is able to recover structural and dynamical properties, and obtain a better agreement of the predicted melting point versus the experimental value, as compared to the prediction of the standard Sutton-Chen parameters.
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.
Multiple R&D Projects Scheduling Optimization with Improved Particle Swarm Algorithm
Liu, Mengqi; Shan, Miyuan; Wu, Juan
2014-01-01
For most enterprises, in order to win the initiative in the fierce competition of market, a key step is to improve their R&D ability to meet the various demands of customers more timely and less costly. This paper discusses the features of multiple R&D environments in large make-to-order enterprises under constrained human resource and budget, and puts forward a multi-project scheduling model during a certain period. Furthermore, we make some improvements to existed particle swarm algorithm and apply the one developed here to the resource-constrained multi-project scheduling model for a simulation experiment. Simultaneously, the feasibility of model and the validity of algorithm are proved in the experiment. PMID:25032232
Chen, Shyi-Ming; Hsin, Wen-Chyuan
2015-07-01
In this paper, we propose a new weighted fuzzy interpolative reasoning method for sparse fuzzy rule-based systems based on the slopes of fuzzy sets. We also propose a particle swarm optimization (PSO)-based weights-learning algorithm to automatically learn the optimal weights of the antecedent variables of fuzzy rules for weighted fuzzy interpolative reasoning. We apply the proposed weighted fuzzy interpolative reasoning method using the proposed PSO-based weights-learning algorithm to deal with the computer activity prediction problem, the multivariate regression problems, and the time series prediction problems. The experimental results show that the proposed weighted fuzzy interpolative reasoning method using the proposed PSO-based weights-learning algorithm outperforms the existing methods for dealing with the computer activity prediction problem, the multivariate regression problems, and the time series prediction problems. PMID:25204003
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.
DOA estimation for local scattered CDMA signals by particle swarm optimization.
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. PMID:22737004
Extended particle swarm optimisation method for folding protein on triangular lattice.
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
NASA Astrophysics Data System (ADS)
Petković, Dalibor; Gocic, Milan; Shamshirband, Shahaboddin; Qasem, Sultan Noman; Trajkovic, Slavisa
2015-06-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.
Joint inversion of TEM and DC in roadway advanced detection based on particle swarm optimization
NASA Astrophysics Data System (ADS)
Cheng, Jiulong; Li, Fei; Peng, Suping; Sun, Xiaoyun; Zheng, Jing; Jia, Jizhe
2015-12-01
Transient electromagnetic method (TEM)and direct current method (DC)are two key widely applied methods for practical roadway detection, but both have their limitations. To take the advantage of each method, a synchronous nonlinear joint inversion method is proposed based on TEM and DC by using particle swarm optimization (PSO)algorithm. Firstly, a model with double low resistance anomaly and interference is constructed to test the performance of the method. Then the independent inversion and joint inversion are calculated by using the model built above. It is demonstrated that the joint inversion helped in improving the interpretation of the data to get better results. It is because that the suppression of interference and separation of the resistivity anomalies ahead and the back of the roadway working face using the proposed method. Finally, the proposed method was successfully used in a coalmine in Huainan coalfield in east China to demonstrate its practical usefulness.
Solving initial and boundary value problems using learning automata particle swarm optimization
NASA Astrophysics Data System (ADS)
Nemati, Kourosh; Mariyam Shamsuddin, Siti; Darus, Maslina
2015-05-01
In this article, the particle swarm optimization (PSO) algorithm is modified to use the learning automata (LA) technique for solving initial and boundary value problems. A constrained problem is converted into an unconstrained problem using a penalty method to define an appropriate fitness function, which is optimized using the LA-PSO method. This method analyses a large number of candidate solutions of the unconstrained problem with the LA-PSO algorithm to minimize an error measure, which quantifies how well a candidate solution satisfies the governing ordinary differential equations (ODEs) or partial differential equations (PDEs) and the boundary conditions. This approach is very capable of solving linear and nonlinear ODEs, systems of ordinary differential equations, and linear and nonlinear PDEs. The computational efficiency and accuracy of the PSO algorithm combined with the LA technique for solving initial and boundary value problems were improved. Numerical results demonstrate the high accuracy and efficiency of the proposed method.
NASA Astrophysics Data System (ADS)
Yang, Yue; Wen, Jian; Chen, Xiaofei
2015-07-01
In this paper, we apply particle swarm optimization (PSO), an artificial intelligence technique, to velocity calibration in microseismic monitoring. We ran simulations with four 1-D layered velocity models and three different initial model ranges. The results using the basic PSO algorithm were reliable and accurate for simple models, but unsuccessful for complex models. We propose the staged shrinkage strategy (SSS) for the PSO algorithm. The SSS-PSO algorithm produced robust inversion results and had a fast convergence rate. We investigated the effects of PSO's velocity clamping factor in terms of the algorithm reliability and computational efficiency. The velocity clamping factor had little impact on the reliability and efficiency of basic PSO, whereas it had a large effect on the efficiency of SSS-PSO. Reassuringly, SSS-PSO exhibits marginal reliability fluctuations, which suggests that it can be confidently implemented.
Enhanced fuzzy-connective-based hierarchical aggregation network using particle swarm optimization
NASA Astrophysics Data System (ADS)
Wang, Fang-Fang; Su, Chao-Ton
2014-11-01
The fuzzy-connective-based aggregation network is similar to the human decision-making process. It is capable of aggregating and propagating degrees of satisfaction of a set of criteria in a hierarchical manner. Its interpreting ability and transparency make it especially desirable. To enhance its effectiveness and further applicability, a learning approach is successfully developed based on particle swarm optimization to determine the weights and parameters of the connectives in the network. By experimenting on eight datasets with different characteristics and conducting further statistical tests, it has been found to outperform the gradient- and genetic algorithm-based learning approaches proposed in the literature; furthermore, it is capable of generating more accurate estimates. The present approach retains the original benefits of fuzzy-connective-based aggregation networks and is widely applicable. The characteristics of the learning approaches are also discussed and summarized, providing better understanding of the similarities and differences among these three approaches.
Design optimization of pin fin geometry using particle swarm optimization algorithm.
Hamadneh, Nawaf; Khan, Waqar A; Sathasivam, Saratha; Ong, Hong Choon
2013-01-01
Particle swarm optimization (PSO) is employed to investigate the overall performance of a pin fin.The following study will examine the effect of governing parameters on overall thermal/fluid performance associated with different fin geometries, including, rectangular plate fins as well as square, circular, and elliptical pin fins. The idea of entropy generation minimization, EGM is employed to combine the effects of thermal resistance and pressure drop within the heat sink. A general dimensionless expression for the entropy generation rate is obtained by considering a control volume around the pin fin including base plate and applying the conservations equations for mass and energy with the entropy balance. Selected fin geometries are examined for the heat transfer, fluid friction, and the minimum entropy generation rate corresponding to different parameters including axis ratio, aspect ratio, and Reynolds number. The results clearly indicate that the preferred fin profile is very dependent on these parameters. PMID:23741525
A particle swarm optimization variant with an inner variable learning strategy.
Wu, Guohua; Pedrycz, Witold; Ma, Manhao; Qiu, Dishan; Li, Haifeng; 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
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.
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.
Particle Swarm Optimization for inverse modeling of solute transport in fractured gneiss aquifer.
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. PMID:25035936
Discrete particle swarm optimization for identifying community structures in signed social networks.
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
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
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.
Objective comparison of particle tracking methods.
Chenouard, Nicolas; Smal, Ihor; de Chaumont, Fabrice; Maška, Martin; Sbalzarini, Ivo F; Gong, Yuanhao; Cardinale, Janick; Carthel, Craig; Coraluppi, Stefano; Winter, Mark; Cohen, Andrew R; Godinez, William J; Rohr, Karl; Kalaidzidis, Yannis; Liang, Liang; Duncan, James; Shen, Hongying; Xu, Yingke; Magnusson, Klas E G; Jaldén, Joakim; Blau, Helen M; Paul-Gilloteaux, Perrine; Roudot, Philippe; Kervrann, Charles; Waharte, François; Tinevez, Jean-Yves; Shorte, Spencer L; Willemse, Joost; Celler, Katherine; van Wezel, Gilles P; Dan, Han-Wei; Tsai, Yuh-Show; Ortiz de Solórzano, Carlos; Olivo-Marin, Jean-Christophe; Meijering, Erik
2014-03-01
Particle tracking is of key importance for quantitative analysis of intracellular dynamic processes from time-lapse microscopy image data. Because manually detecting and following large numbers of individual particles is not feasible, automated computational methods have been developed for these tasks by many groups. Aiming to perform an objective comparison of methods, we gathered the community and organized an open competition in which participating teams applied their own methods independently to a commonly defined data set including diverse scenarios. Performance was assessed using commonly defined measures. Although no single method performed best across all scenarios, the results revealed clear differences between the various approaches, leading to notable practical conclusions for users and developers. PMID:24441936
Objective comparison of particle tracking methods
Chenouard, Nicolas; Smal, Ihor; de Chaumont, Fabrice; Maška, Martin; Sbalzarini, Ivo F.; Gong, Yuanhao; Cardinale, Janick; Carthel, Craig; Coraluppi, Stefano; Winter, Mark; Cohen, Andrew R.; Godinez, William J.; Rohr, Karl; Kalaidzidis, Yannis; Liang, Liang; Duncan, James; Shen, Hongying; Xu, Yingke; Magnusson, Klas E. G.; Jaldén, Joakim; Blau, Helen M.; Paul-Gilloteaux, Perrine; Roudot, Philippe; Kervrann, Charles; Waharte, François; Tinevez, Jean-Yves; Shorte, Spencer L.; Willemse, Joost; Celler, Katherine; van Wezel, Gilles P.; Dan, Han-Wei; Tsai, Yuh-Show; de Solórzano, Carlos Ortiz; Olivo-Marin, Jean-Christophe; Meijering, Erik
2014-01-01
Particle tracking is of key importance for quantitative analysis of intracellular dynamic processes from time-lapse microscopy image data. Since manually detecting and following large numbers of individual particles is not feasible, automated computational methods have been developed for these tasks by many groups. Aiming to perform an objective comparison of methods, we gathered the community and organized, for the first time, an open competition, in which participating teams applied their own methods independently to a commonly defined data set including diverse scenarios. Performance was assessed using commonly defined measures. Although no single method performed best across all scenarios, the results revealed clear differences between the various approaches, leading to important practical conclusions for users and developers. PMID:24441936
Optimization of the Infrastructure of Reinforced Concrete Reservoirs by a Particle Swarm Algorithm
NASA Astrophysics Data System (ADS)
Kia, Saeed; Sebt, Mohammad Hassan; Shahhosseini, Vahid
2015-03-01
Optimization techniques may be effective in finding the best modeling and shapes for reinforced concrete reservoirs (RCR) to improve their durability and mechanical behavior, particularly for avoiding or reducing the bending moments in these structures. RCRs are one of the major structures applied for reserving fluids to be used in drinking water networks. Usually, these structures have fixed shapes which are designed and calculated based on input discharges, the conditions of the structure's topology, and geotechnical locations with various combinations of static and dynamic loads. In this research, the elements of reservoir walls are first typed according to the performance analyzed; then the range of the membrane based on the thickness and the minimum and maximum cross sections of the bar used are determined in each element. This is done by considering the variable constraints, which are estimated by the maximum stress capacity. In the next phase, based on the reservoir analysis and using the algorithm of the PARIS connector, the related information is combined with the code for the PSO algorithm, i.e., an algorithm for a swarming search, to determine the optimum thickness of the cross sections for the reservoir membrane's elements and the optimum cross section of the bar used. Based on very complex mathematical linear models for the correct embedding and angles related to achain of peripheral strengthening membranes, which optimize the vibration of the structure, a mutual relation is selected between the modeling software and the code for a particle swarm optimization algorithm. Finally, the comparative weight of the concrete reservoir optimized by the peripheral strengthening membrane is analyzed using common methods. This analysis shows a 19% decrease in the bar's weight, a 20% decrease in the concrete's weight, and a minimum 13% saving in construction costs according to the items of a checklist for a concrete reservoir at 10,000 m3.
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
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
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
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.
The contribution of particle swarm optimization to three-dimensional slope stability analysis.
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
The Contribution of Particle Swarm Optimization to Three-Dimensional Slope Stability Analysis
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