A Fast Parameter Setting Strategy for Particle Swarm Optimization and Its Application in Urban Water Distribution Network Optimal Design
|
|
- Stephany West
- 5 years ago
- Views:
Transcription
1 A Fast Parameter Setting Strategy for Particle Swarm Optimization and Its Application in Urban Water Distribution Network Optimal Design Xuewei Q!!, Khaled Rashee!!, Ke L!!, Walter Potte!! 1. College of Engineering, University of Georgia, Athens, 36, USA. Department of Computer Science, University of Georgia, Athens, 36, USA 3. Institute of Artificial Intelligence, University of Georgia, Athens, 36, USA Abstract-Parameter setting is very essential for the application of particle swarm optimization (PSO), especially the acceleration coefficients. In this paper, we propose a fast estimation strategy of optimal parameter setting for PSO, in which an estimation distribution algorithm (EDA) is used to co-evolve the acceleration coefficients (!! and!! ). The proposed algorithm is validated on two numerical optimization problems and then applied to the urban water distribution network optimization problem. The experimental results show that both of these two parameters converge to a fixed value respectively and the achieved values for!! and!! are consistent as the results of parameter tuning.pso with the estimated optimal parameters could achieve the best solution on benchmark example and also outperform other methods in terms of reliability and efficiency. Keywords: Particle Swarm Optimization, Parameter control, Estimation Distribution Algorithm, Water Distribution Network. 1 Introduction Particle Swarm Optimization is a population based optimization method inspired by the collective behavior of a bird flock, which was developed by Eberhart and Kennedy[3] in It is an effective swarm intelligence technique for solving optimization problems. It has shown great potential and perspective for solving various optimization problems [4,5,6,7,8]. A crucial aspect of improving the performance of PSO is parameter setting [9]. PSO can only perform effectively under good parameter settings. There are two primary approaches of setting parameters [1]: parameter tuning and parameter control. Parameter tuning identifies the optimal parameter settings by repeatedly running using different combinations of parameter values. However, this cumbersome method usually takes much time and effort, and relies on luck as exhaustive search of the parameter space is prohibitively expensive. Another more popular approach is parameter control. In this approach, the parameters are not fixed, but changed during the course of the evolutionary process. There are two main approaches of parameter control [1]: adaptive parameter control and selfadaptive parameter control. In adaptive parameter control, the parameter values are adaptively adjusted by heuristic rules based on feedback from previous parameter changes [11]. In this approach, defining the meaning of feedback is a key issue. In general, we often use the current stage of the search, the performance of operators and/or the diversity of the population as the guiding information. Adaptive parameter control is common for PSO and has shown effectiveness in solving various problems in the past [3,1,13]. In self-adaptive parameter control, the parameters and the solutions to the optimization problem evolve together. Self-adaptive parameter control has been used in genetic algorithms in which the parameters are encoded within the chromosomes and evolve with the problem (object) variables [14,15,16,17]. Adopting self-adaptive parameter control in PSO has recently raised much interest [18], which embeds the parameters within the evolution variables. In this way, the parameters are self-adaptively controlled. Optimal design of water distribution networks (WDN) aims to select a set of pipes (with different diameters) to form a network which satisfies all the hydraulic requirements and also has the minimal total cost, which is also called Pipe Sizing. In the past three decades, a variety of optimization methods have been proposed for the pipe sizing problem. In the past few years, PSO was introduced to optimize WDN. [19] applied a conventional discrete PSO to this problem for the first time in 8. Shortly afterwards, a diversity enriched PSO variant was proposed [] to address the premature convergence problem and the performance was improved compared to the conventional PSO. Montalvo et al. [18] improved the performance of PSO further on this WDN optimization problem by introducing a parameter self-adaptive strategy.
2 Methodologies.1 Estimation of distribution algorithm Estimation of distribution algorithms (EDAs) is population based evolutionary algorithm. During the iteration process, EDAs try to estimate the probability distribution by using good individuals to construct a probabilistic model, which is then used to predict the promising positions and generate new individuals of the next generation around that region. The details of implementation of EDA are given in algorithm 1: Algorithm 1 The EDA algorithm 1: P<= Initialize the population : Evaluate the initial population 3: While iter_number Max_iterations do 4: P! <= Select the top s individuals from p 5: M<= estimate a new Model from P! 6: P! <= Sample n individuals from M 7: Evaluate P! 8: P<= Select n individuals from P U P! 9: iter_number =iter_number +1 1: end While A very simple model assumes that each of the coefficients follows a simple Gaussian distribution when the parameters are approaching the global optimal settings. Hence, in each iteration of EDA, the top individuals in the population are used to estimate the mean and standard deviation of the distribution of the best parameter settings. On the next iteration, a new population is generated by sampling according to the estimated distribution.. Particle swarm optimization In the population of PSO, each particle holds the following information: particle s current positionx!, particle s current velocity: v!, the best position that the particle has ever found so far Pbest! and the best position that the entire swarm has ever found: gbest! In PSO, each particle updates its position according to the following equations:!!!!"!!! =w!!"! +!!!!! (!"#$%!" -!!"! )+!!!!! (!"#$%!" -!!"! ) (1)!!"!!! =!!"! +!!"!!! () Where j denotes the index of the dimension, i denotes the number of particles, w is the inertia weight and t is the iteration number, r! and r! are two random numbers uniformly distributed in the range [,1] and finally c! and c! are the acceleration factors. After all the particles are updated, the Pbest! and gbest! are also updated if better positions are found. Acceleration coefficients ( c! and c! )are most influential to the performance of the algorithm. Much previous research has shown that for different problems, the optimal settings of c! and c! are different. Therefore, designing an efficient parameter setting strategy for acceleration coefficients has been an active research area in PSO domain..3parameter co-evolving strategy In our proposed parameter estimation strategy, there are two iterative loops which run simultaneously. The first loop is PSO which tries to find the optimal solution for the specific problem; the second loop (coevolving loop) is the EDA which tries to optimize the parameter settings (c! and c! ) online for each individual in PSO loop. In PSO population, each individual is a candidate solution for the specific optimization problem. In EDA population, each individual is a pair of values for c! and c!. The population size for both PSO and EDA loop are the same and one individual in PSO corresponds to one individual in EDA population respectively. Each individual in PSO is updated based on (1) only using the corresponding pair of c! and c! in EDA poplation. Each individual in EDA population is updated every generation (see Algorithm ). But this update is only implemented every M (1-1) generations in PSO loop, which means the parameter values for each individual in PSO keeps unchanged during every M consecutive PSO loop interactions. The fitness used in EDA loop is the progress of the particle under the corresponding parameter settings in PSO loop during M consecutive generations. Therefore, the values of c! and c! in EDA loop will hopefully converge to the best combination under which the corresponding particle in PSO could achieve the biggest progress in M consecutive generations. There is a assumption behind is that a good setting of parameters for the most recent iterations (e.g. past M iterations) will also be good (at least not worse) for the immediate future iterations. The complete pseudo code is given in following Algorithm 3. Algorithm Updating process in EDA Loop 1: t is the generation index of PSO loop; :!!! is the ith individual in!!"# at generation t; 3:!!! is the ith individual in!!"# at generation t; 4: N is populations size; 5: While i N do 6: f(!!! )=!(!!! )-f(!!!!! ); 7: i=i+1; 8: End While; 9: Rank!!"# according to fitness (decsending); 1: Select the top individuals from!!"# ; 11: Estimate the mean and standard deviation for each dimension; 1: Sample N individuals by the estimated distribution; 13: Update all the individuals in!!"# with the sample.
3 Algorithm 3 Parameter co-evolving algorithm 1: t is the generation index of PSO loop; : N is populations size of both!!"# and!!"# ; 3: Initialize the population for PSO:!!"# ; 4: Initialize the population for EDA:!!"# ; 5: Evaluate the each individual in population!!"# ; 6:While iter_number Max_iterations do 7: Update all the individuals in!!"# according to 8: (1)and (); 9: If (iter_number)mod(m)= 1: Update all the individuals in!!"# 11: according to Algorihtm ; 1: End if ; 13:End While. Furthermore, in the 3D plot of the results of parameter tuning, there is an obvious basin which means three are more than one pair of good parameter settings and all the settings located in the basin can be regarded as optimal or near optimal settings. The estimated results are found to be located in the basin area. Therefore, we can say all the estimated results are generally consistent with the results of fine tuning. 3 Validation The proposed method is validated on two different numerical optimization problems. The estimated optimal parameter settings (c1 andc! ) obtained by the proposed algorithm on these problems are compared with the values found by a fine parameter tuning. Ackly s function and Restringing s function are selected in this experiment due to their very rough landscapes with large numbers of local minima which makes any search algorithm vulnerable to being trapped in a local minimum. They are also usually used as benchmark problems for evaluating proposed new optimization algorithms. We use the functions with 3 dimensions and set c1 and c in the range of [, 5] which is normally the range of acceleration coefficients in the literature. 3.1 Parameter fine tuning A fine tuning experiment was conducted to identify the optimal combination of the parameters c! and c!. The best combinations for c! and c! were found to be [.8, 1.8] for Ackley s function and [1., 1.6] for Ratrigin s function. Actually, from the 3D scatter plot in Figure 1, we can see that good c! and c! combination is not just one point, but rather a region in the basin. In other words, there is a family of c! and c! combinations which could help the PSO algorithm perform best. 3. Parameter estimation For each of the function, the proposed parameter coevolving strategy is used to estimate the best parameter setting. The average values for c! and c! of 3 runs are taken as the estimated result. From Figures and 3 below, we can see that, for one particle, the c! and c! converged to almost fixed values at the end of the search process. Also from Figure 4, it is clear that for all the particles tracked, c! and c! converged to the same or nearly the same values respectively. Table 1 shows both fine-tuned and estimated best combination of c! and c! for each problem. The differences of between them are all less than 8%. a. Ackley s function b. Rastrigin s function Figure 1. Parameter tuning results for two numerical optimization problems Table 1. Fine tuned and estimated parameters parameter Tuned results s Ackley s function Rastrigin s function C!.8 1. C! Estimated results and difference Ackley s function Rastrigin s function C! (+7.7%) (-6.6%) C! 1.76 (-4.3%) (-7.4%)
4 Figure 4. Track of c1 and c of 1 particles in one run (Ackley s function) Figure. Track of c1 and c of one particle in one run (Ackley s function) 3.3 Benefits of fast estimation strategy For most practical optimization problems, especially for engineering design optimization problems, exhaustive parameter tuning is very costly and probably intractable due to the resource limits (time and experimental cost). However, by using this fast parameter estimation strategy, an optimal parameter setting (or near optimal) can be identified in a very short time. Table shows the time consumed by the two methods on different problems. Table. Time consumption by two different methods on different problems Problem Tuning Estimation Time reduced Ackley s function Rastrigin s 5 runs (37.5 hours) 5 runs (3 hours) 1 runs (1 minutes) 1 runs (8 minutes) 99.5% 99.5% 4 Optimization of WDN A water distribution system (WDN) is a network of components (e.g. pipes, pumps, valves, tanks, etc.) that transport water from a source (e.g. reservoir, treatment plant, tank, etc.) to the consumers (e.g. domestic, commercial, and industrial users). The WDN optimization problem here attempts to optimize its pipeline by selecting the lowest cost combination of appropriate pipe sizes such that the criteria of demands and other hydraulic constraints are satisfied. Figure 3. Track of c1 and c of one particle in one run (Rastrigin s function) A free hydraulic solver EPANET. ( is used to conduct the hydraulic calculations. In the proposed optimization algorithm, one candidate solution (one particle) is a set of diameters for all the pipes in the water distribution network. The input for the hydraulic simulator
5 (EPANET.) is one candidate solution (diameter set) and its output is the actual head pressure of each node in the network. With these head pressures, the fitness of the solution is calculated. Thus the major task for the hydraulic solver is to compute the fitness of each potential design. A flowchart is given in Figure 5. NO Start Initialize population Current generation Generation update Next generation i=n? Yes stop Hydraulic simulation (EPANET.) Calculate fitness (Cost+Penalty) Figure 5. General flowchart of optimization for WDN 4.1 Benchmark network In this paper, the proposed algorithm is applied to solve a benchmark network from the literature known as the Hanoi network. The Hanoi network (Figure 6), presented by Fujiwara and Khang [1], requires the optimal design of 34 pipes, allowing a minimum hydraulic head of 3 meters for all its 3 nodes, by means of 6 available diameters. The size of the solution space is therefore 6!". It serves as a prototype of a medium sized network for the evaluation of optimization algorithms. 4. Experimental settings In addition to the two acceleration coefficients to be estimated by the proposed approach, there are two other important parameters need to be set. For the sake of comparing with previous work, we set all other parameters the same with that in the peer methods: inertia weight is set to be.8. The boundary for the updated velocity (see Equation (1)) which is used to constrain the velocity of each particle to the range of [-V!"#, V!"# ], is set to be 5%, because the appropriate range for V!"# is between 4% and 1% of the variable range, based on the findings by [18]. 4.3 Results & discussion PSO with this parameter setting, PSO is implemented for 3 times on Hanoi network to estimate the optimal parameter settings for this engineering design problem. As we can see from Figure 7, in each single run, there is a clear convergence of both c1 and c values during the coevolution process. The average values of parameters in every implementation are recoded and the results of all 3 runs are displayed in Figure 8. We can see that all the average values are close, which means the estimated results are consistent throughout the experiments. The final average parameter values of the 3 runs are shown in Table 3, which is used as the estimated optimal parameter setting in the subsequent experiments. Table 3. Estimated results for Hanoi network Parameters Mean value Standard Deviation c! c! Estimated C1 values Estimated C values Figure 6. Hanoi Network [1] Figure 7, Track of Estimated C1 and C values for 1 particles
6 Figure 8. Estimated C1 and C values for Hanoi network With the estimated optimal parameter settings: c1= , c=.576, we run the PSO for 3 times on the Hanoi network and the results are summarized in Table 4 below. An extensive comparison previous work from the literature is made. PSO with the estimated optimal parameter settings could achieve the best known minimal cost which is 6.811(unit cost). Although the best minimal cost known in the literature is only achieved once out of 3 runs, the reliability and efficiency are better than other methods (Table 4). The reliability of an optimization method could be measured by the average performance achieved by the proposed algorithm in a certain number of runs. Herein, we use the average minimal cost as the indicator of reliability. We know from Table 4 that the proposed algorithm achieves the smallest average cost compared to the other methods which were also able to achieve the best minimal cost. Efficiency is also compared. It is measured by the average number of fitness calls used by the algorithm to achieve the best solution since in most engineering applications, fitness evaluation is the most time consuming part of the optimization algorithm. Obviously, our method achieves the best efficiency, which is almost 4 times better than other methods. Fitness track of 5 runs is shown in Figure 9, from which a very fast convergence process can be observed. Another important observation from this figure is that all the 5 search processes converged after around 1 iterations. This might indicate that we could achieve a very good (usually not optimal result) result with a very small number of fitness evaluations (around,). This is a clear advantage over all other methods. From a practical point of view, an early almost-optimal solution may be preferred to a very late optimal solution when the cost of time is taken into consideration. On the other hand, it also suggests that premature convergence problem is present, which is a common problem with the application of PSOs. Several researchers have proposed methods to address this problem with no conclusive solution. The major task for our proposed estimation method is to help the PSO obtain a very good parameter setting in a very short time, but it is not able to tackle the premature convergence problem, so more work is required to further improve the performance of PSO. Table 4. Minimal cost for the Hanoi networks Methods Minimal cost (x1! $) Average (x1! $) Average NO. of Fitness evaluations GA[] 6.93 GA[3] 6.18 GA[4] ACO[5] PSO[19] , PSO[] , PSO[18] 6.81 >6.97* 8, This work , *no specific number was given in the paper, but the authors compared their results in this paper with the results of their previous paper and found the average minimal costs are worse than previous work Figure 9. Fitness track of 5 runs optimal parameters 5 Conclusions and future work In this work, a fast parameter estimation strategy for PSO is proposed to estimate the optimal acceleration parameter settings. Self-adaptive control and co-evolution strategies are used together for the parameter estimation of PSO in the proposed method. The tests on two numerical optimization problems show that the estimated optimal parameter settings are consistent with the optimal parameter settings achieved by parameter tuning. PSO with the estimated parameters is able to identify the best known cost for the benchmark example on the WDN optimization problem. The algorithm performs better than other methods in the literature in terms of reliability and efficiency. The proposed parameter estimation strategy is promising and may perform better when combined with a premature convergence elimination strategy. The major contributions of the work presented in this paper are as follows: (1) A novel fast parameter estimation strategy to replace the inefficient conventional parameter tuning method for PSO is proposed And(), a new optimization method with PSO is proposed for the optimization of water distribution networks. Our future work will focus on the following topics: (1) to extend the proposed fast parameter estimation strategy for PSO to other Evolutionary Algorithms where there is a need
7 for parameter tuning. And () to apply the proposed algorithm to the design optimization of larger water distribution networks design or other practical engineering design and/or optimization problems. 6 References [1] Bonabeau E, Dorigo M, Theraulaz G. Swarm Intelligence: from natural to artificial systems. Oxford University Press, New York [] Kennedy J., Eberhart R.C., Shi Y. Swarm Intelligence. Morgan Kaufmann, San Francisco 1. [3] Eberhart R.C., Kennedy J. A new optimizer using particle swarm theory. In: 6th International Symposium on Micromachine and Human Science,Nagoya, Japan, pp [4] Dong Y., Tang J., Xu B., Wang D. An application of swarm optimization to nonlinear programming. Computers & Mathematics with Applications 49(11 1) [5] Chau K.W. Particle swarm optimization training algorithm for ANNs in stage prediction of Shing Mun River. Journal of Hydrology. 39(3 4), [6] Liao C.J., Tseng C.T., Luarn P. A discrete version of particle swarm optimization for flowshop scheduling problems. Computers and Operations Research. 34 (1), [7] Izquierdo J., Montalvo I., Pe rez R., Fuertes V. Design optimization of wastewater collection networks by PSO. Computers & Mathematics with Applications56 (3), [8] Izquierdo J., Montalvo I., Pe rez-garcı a R., Fuertes V.S.. Forecasting pedestrian evacuation times by using swarm intelligence. Physica A: Statistical Mechanics and its Applications 388 (7), [9] Ueno G., Yasuda K., Iwasaki N. Robust adaptive particle swarm optimization. IEEE International Conference on Systems, Man and Cybernetics, 4, [1] Eiben A.E., Hinterding R., Michalewicz Z. Parameter control in evolutionary algorithms. IEEE Transactions on Evolutionary Computation [11] Yen G.G., Lu H. Dynamic multi-objective evolutionary algorithm: Adaptive cell-based rank and density estimation. IEEE Transactions on Evolutionary Computation 7(3), [1] Arumugam M.S., Rao M.V.C.. On the improved performances of the particle swarm optimization algorithms with adaptive parameters, cross-over operators and root mean square (RMS) variants for computing optimal control of a class of hybrid systems. Applied Soft Computing. 8 (1), [13] Ratnaweera A., Halgamuge S.K., Watson H.C.. Selforganizing hierarchical particle swarm optimizer with timevarying acceleration coefficients. IEEE Transactions on Evolutionary Computation 8 (3), [14 ] Brest J., Greiner S., Boskovic B., Mernik M., Zumer V. 6. Self-adapting control parameters in differential evolution: A comparative study on numerical benchmark problems. IEEE Transactions on Evolutionary Computation. 1(6), [15] Angeline P.J. Two self-adaptive crossover operators for genetic programming. Advances in Genetic Programming. MIT Press, [16] Krasnogor N., and Gustafson S. A study on the use of self-generation in memetic algorithms. Natural Computing: An International Journal 3 (1), [17] Haupt R.L., Werner D.H.. Genetic Algorithms in Electromagnetics. John Wiley & Sons, New Jersey. 7. [18] Montalvo I., Izquierdo J., Pe rez-garcı a R., Herrera M.. Improved performance of PSO with self-adaptive parameters for computing the optimal design of Water Supply Systems Engineering applications of artificial intelligence. 3(5), [19] Idel Montalvo, Joaquin Izquierdo, Rafael Perez- Garcia, Michael M. Tung, Particle Swarm Optimization applied to the design of water supply systems. Computers and Mathematics with Applications 56, , 8a. [] Idel Montalvo, Joaquin Izquierdo, A diversity enriched variant of discrete PSO applied to the design of Water Distribution Networks. Engineering Applications 4(7), ,8b. [1] Fujiwara, O., and Khang, D. B., Correction to a twophase decomposition method for optimal design of looped water distribution networks. Water Resour.Res., 7(5), []Matı as,a.s.," Disen oderedesdedistribucio ndeag acontemplandola fiabilidad Polite cnica devalencia.tesis doctoral. 6. [3] Wu, Z.Y., Simpson, A.R., Competent geneticevolutionary optimization of water distribution systems. Journal of Computing in Civil Engineering 15 (), [4] Savic, D.A., Walters, G.A., Genetic algorithms for least-cost design of water distribution networks. Journal of Water Resources Planning and Management 13 (), [5] Zecchin, A.C., Simpson, A.R., Maier, H.R., Nixon,J.B., Parametric study for an ant algorithm applied to water distribution system optimization. IEEE Transactions on Evolutionary Computation 9(), ,5
Argha Roy* Dept. of CSE Netaji Subhash Engg. College West Bengal, India.
Volume 3, Issue 3, March 2013 ISSN: 2277 128X International Journal of Advanced Research in Computer Science and Software Engineering Research Paper Available online at: www.ijarcsse.com Training Artificial
More informationHandling Multi Objectives of with Multi Objective Dynamic Particle Swarm Optimization
Handling Multi Objectives of with Multi Objective Dynamic Particle Swarm Optimization Richa Agnihotri #1, Dr. Shikha Agrawal #1, Dr. Rajeev Pandey #1 # Department of Computer Science Engineering, UIT,
More informationIMPROVING THE PARTICLE SWARM OPTIMIZATION ALGORITHM USING THE SIMPLEX METHOD AT LATE STAGE
IMPROVING THE PARTICLE SWARM OPTIMIZATION ALGORITHM USING THE SIMPLEX METHOD AT LATE STAGE Fang Wang, and Yuhui Qiu Intelligent Software and Software Engineering Laboratory, Southwest-China Normal University,
More informationModified Particle Swarm Optimization
Modified Particle Swarm Optimization Swati Agrawal 1, R.P. Shimpi 2 1 Aerospace Engineering Department, IIT Bombay, Mumbai, India, swati.agrawal@iitb.ac.in 2 Aerospace Engineering Department, IIT Bombay,
More informationOPTIMAL DESIGN OF WATER DISTRIBUTION SYSTEMS BY A COMBINATION OF STOCHASTIC ALGORITHMS AND MATHEMATICAL PROGRAMMING
2008/4 PAGES 1 7 RECEIVED 18. 5. 2008 ACCEPTED 4. 11. 2008 M. ČISTÝ, Z. BAJTEK OPTIMAL DESIGN OF WATER DISTRIBUTION SYSTEMS BY A COMBINATION OF STOCHASTIC ALGORITHMS AND MATHEMATICAL PROGRAMMING ABSTRACT
More informationInternational Journal of Digital Application & Contemporary research Website: (Volume 1, Issue 7, February 2013)
Performance Analysis of GA and PSO over Economic Load Dispatch Problem Sakshi Rajpoot sakshirajpoot1988@gmail.com Dr. Sandeep Bhongade sandeepbhongade@rediffmail.com Abstract Economic Load dispatch problem
More informationGA is the most popular population based heuristic algorithm since it was developed by Holland in 1975 [1]. This algorithm runs faster and requires les
Chaotic Crossover Operator on Genetic Algorithm Hüseyin Demirci Computer Engineering, Sakarya University, Sakarya, 54187, Turkey Ahmet Turan Özcerit Computer Engineering, Sakarya University, Sakarya, 54187,
More informationCHAPTER 6 ORTHOGONAL PARTICLE SWARM OPTIMIZATION
131 CHAPTER 6 ORTHOGONAL PARTICLE SWARM OPTIMIZATION 6.1 INTRODUCTION The Orthogonal arrays are helpful in guiding the heuristic algorithms to obtain a good solution when applied to NP-hard problems. This
More informationPARTICLE SWARM OPTIMIZATION (PSO)
PARTICLE SWARM OPTIMIZATION (PSO) J. Kennedy and R. Eberhart, Particle Swarm Optimization. Proceedings of the Fourth IEEE Int. Conference on Neural Networks, 1995. A population based optimization technique
More informationTraffic Signal Control Based On Fuzzy Artificial Neural Networks With Particle Swarm Optimization
Traffic Signal Control Based On Fuzzy Artificial Neural Networks With Particle Swarm Optimization J.Venkatesh 1, B.Chiranjeevulu 2 1 PG Student, Dept. of ECE, Viswanadha Institute of Technology And Management,
More informationResearch Article Path Planning Using a Hybrid Evolutionary Algorithm Based on Tree Structure Encoding
e Scientific World Journal, Article ID 746260, 8 pages http://dx.doi.org/10.1155/2014/746260 Research Article Path Planning Using a Hybrid Evolutionary Algorithm Based on Tree Structure Encoding Ming-Yi
More informationUsing Genetic Algorithms to optimize ACS-TSP
Using Genetic Algorithms to optimize ACS-TSP Marcin L. Pilat and Tony White School of Computer Science, Carleton University, 1125 Colonel By Drive, Ottawa, ON, K1S 5B6, Canada {mpilat,arpwhite}@scs.carleton.ca
More informationReconfiguration Optimization for Loss Reduction in Distribution Networks using Hybrid PSO algorithm and Fuzzy logic
Bulletin of Environment, Pharmacology and Life Sciences Bull. Env. Pharmacol. Life Sci., Vol 4 [9] August 2015: 115-120 2015 Academy for Environment and Life Sciences, India Online ISSN 2277-1808 Journal
More informationInitializing the Particle Swarm Optimizer Using the Nonlinear Simplex Method
Initializing the Particle Swarm Optimizer Using the Nonlinear Simplex Method K.E. PARSOPOULOS, M.N. VRAHATIS Department of Mathematics University of Patras University of Patras Artificial Intelligence
More informationUsing CODEQ to Train Feed-forward Neural Networks
Using CODEQ to Train Feed-forward Neural Networks Mahamed G. H. Omran 1 and Faisal al-adwani 2 1 Department of Computer Science, Gulf University for Science and Technology, Kuwait, Kuwait omran.m@gust.edu.kw
More informationARMA MODEL SELECTION USING PARTICLE SWARM OPTIMIZATION AND AIC CRITERIA. Mark S. Voss a b. and Xin Feng.
Copyright 2002 IFAC 5th Triennial World Congress, Barcelona, Spain ARMA MODEL SELECTION USING PARTICLE SWARM OPTIMIZATION AND AIC CRITERIA Mark S. Voss a b and Xin Feng a Department of Civil and Environmental
More informationMeta- Heuristic based Optimization Algorithms: A Comparative Study of Genetic Algorithm and Particle Swarm Optimization
2017 2 nd International Electrical Engineering Conference (IEEC 2017) May. 19 th -20 th, 2017 at IEP Centre, Karachi, Pakistan Meta- Heuristic based Optimization Algorithms: A Comparative Study of Genetic
More informationACCEPTED VERSION.
ACCEPTED VERSION Zheng, Feifei; Zecchin, Aaron Carlo; Simpson, Angus Ross Self-adaptive differential evolution algorithm applied to water distribution system optimization Journal of Computing in Civil
More informationSIMULTANEOUS COMPUTATION OF MODEL ORDER AND PARAMETER ESTIMATION FOR ARX MODEL BASED ON MULTI- SWARM PARTICLE SWARM OPTIMIZATION
SIMULTANEOUS COMPUTATION OF MODEL ORDER AND PARAMETER ESTIMATION FOR ARX MODEL BASED ON MULTI- SWARM PARTICLE SWARM OPTIMIZATION Kamil Zakwan Mohd Azmi, Zuwairie Ibrahim and Dwi Pebrianti Faculty of Electrical
More informationA Hybrid Fireworks Optimization Method with Differential Evolution Operators
A Fireworks Optimization Method with Differential Evolution Operators YuJun Zheng a,, XinLi Xu a, HaiFeng Ling b a College of Computer Science & Technology, Zhejiang University of Technology, Hangzhou,
More informationGENETIC ALGORITHM VERSUS PARTICLE SWARM OPTIMIZATION IN N-QUEEN PROBLEM
Journal of Al-Nahrain University Vol.10(2), December, 2007, pp.172-177 Science GENETIC ALGORITHM VERSUS PARTICLE SWARM OPTIMIZATION IN N-QUEEN PROBLEM * Azhar W. Hammad, ** Dr. Ban N. Thannoon Al-Nahrain
More informationInertia Weight. v i = ωv i +φ 1 R(0,1)(p i x i )+φ 2 R(0,1)(p g x i ) The new velocity update equation:
Convergence of PSO The velocity update equation: v i = v i +φ 1 R(0,1)(p i x i )+φ 2 R(0,1)(p g x i ) for some values of φ 1 and φ 2 the velocity grows without bound can bound velocity to range [ V max,v
More informationA *69>H>N6 #DJGC6A DG C<>C::G>C<,8>:C8:H /DA 'D 2:6G, ()-"&"3 -"(' ( +-" " " % '.+ % ' -0(+$,
The structure is a very important aspect in neural network design, it is not only impossible to determine an optimal structure for a given problem, it is even impossible to prove that a given structure
More informationInteractive 3D Visualization Of Optimization For Water Distribution Systems
City University of New York (CUNY) CUNY Academic Works International Conference on Hydroinformatics 8-1-2014 Interactive 3D Visualization Of Optimization For Water Distribution Systems Matthew Barrie Johns
More informationAn improved PID neural network controller for long time delay systems using particle swarm optimization algorithm
An improved PID neural network controller for long time delay systems using particle swarm optimization algorithm A. Lari, A. Khosravi and A. Alfi Faculty of Electrical and Computer Engineering, Noushirvani
More informationACONM: A hybrid of Ant Colony Optimization and Nelder-Mead Simplex Search
ACONM: A hybrid of Ant Colony Optimization and Nelder-Mead Simplex Search N. Arun & V.Ravi* Assistant Professor Institute for Development and Research in Banking Technology (IDRBT), Castle Hills Road #1,
More informationImproving Tree-Based Classification Rules Using a Particle Swarm Optimization
Improving Tree-Based Classification Rules Using a Particle Swarm Optimization Chi-Hyuck Jun *, Yun-Ju Cho, and Hyeseon Lee Department of Industrial and Management Engineering Pohang University of Science
More informationFeature weighting using particle swarm optimization for learning vector quantization classifier
Journal of Physics: Conference Series PAPER OPEN ACCESS Feature weighting using particle swarm optimization for learning vector quantization classifier To cite this article: A Dongoran et al 2018 J. Phys.:
More informationCenter-Based Sampling for Population-Based Algorithms
Center-Based Sampling for Population-Based Algorithms Shahryar Rahnamayan, Member, IEEE, G.GaryWang Abstract Population-based algorithms, such as Differential Evolution (DE), Particle Swarm Optimization
More informationQUANTUM BASED PSO TECHNIQUE FOR IMAGE SEGMENTATION
International Journal of Computer Engineering and Applications, Volume VIII, Issue I, Part I, October 14 QUANTUM BASED PSO TECHNIQUE FOR IMAGE SEGMENTATION Shradha Chawla 1, Vivek Panwar 2 1 Department
More informationA Multiobjective Memetic Algorithm Based on Particle Swarm Optimization
A Multiobjective Memetic Algorithm Based on Particle Swarm Optimization Dr. Liu Dasheng James Cook University, Singapore / 48 Outline of Talk. Particle Swam Optimization 2. Multiobjective Particle Swarm
More informationParticle Swarm Optimization
Particle Swarm Optimization Gonçalo Pereira INESC-ID and Instituto Superior Técnico Porto Salvo, Portugal gpereira@gaips.inesc-id.pt April 15, 2011 1 What is it? Particle Swarm Optimization is an algorithm
More informationA MULTI-SWARM PARTICLE SWARM OPTIMIZATION WITH LOCAL SEARCH ON MULTI-ROBOT SEARCH SYSTEM
A MULTI-SWARM PARTICLE SWARM OPTIMIZATION WITH LOCAL SEARCH ON MULTI-ROBOT SEARCH SYSTEM BAHAREH NAKISA, MOHAMMAD NAIM RASTGOO, MOHAMMAD FAIDZUL NASRUDIN, MOHD ZAKREE AHMAD NAZRI Department of Computer
More informationCell-to-switch assignment in. cellular networks. barebones particle swarm optimization
Cell-to-switch assignment in cellular networks using barebones particle swarm optimization Sotirios K. Goudos a), Konstantinos B. Baltzis, Christos Bachtsevanidis, and John N. Sahalos RadioCommunications
More informationUniversité Libre de Bruxelles
Université Libre de Bruxelles Institut de Recherches Interdisciplinaires et de Développements en Intelligence Artificielle An Estimation of Distribution Particle Swarm Optimization Algorithm Mudassar Iqbal
More informationSmall World Particle Swarm Optimizer for Global Optimization Problems
Small World Particle Swarm Optimizer for Global Optimization Problems Megha Vora and T.T. Mirnalinee Department of Computer Science and Engineering S.S.N College of Engineering, Anna University, Chennai,
More informationPUBLISHED VERSION American Geophysical Union
PUBLISHED VERSION Zheng, Feifei; Simpson, Angus Ross; Zecchin, Aaron Carlo; Deuerlein, Jochen Werner A graph decomposition-based approach for water distribution network optimization Water Resources Research,
More informationA NEW APPROACH TO SOLVE ECONOMIC LOAD DISPATCH USING PARTICLE SWARM OPTIMIZATION
A NEW APPROACH TO SOLVE ECONOMIC LOAD DISPATCH USING PARTICLE SWARM OPTIMIZATION Manjeet Singh 1, Divesh Thareja 2 1 Department of Electrical and Electronics Engineering, Assistant Professor, HCTM Technical
More informationEE 553 Term Project Report Particle Swarm Optimization (PSO) and PSO with Cross-over
EE Term Project Report Particle Swarm Optimization (PSO) and PSO with Cross-over Emre Uğur February, 00 Abstract In this work, Particle Swarm Optimization (PSO) method is implemented and applied to various
More informationA NEW METHODOLOGY FOR EMERGENT SYSTEM IDENTIFICATION USING PARTICLE SWARM OPTIMIZATION (PSO) AND THE GROUP METHOD OF DATA HANDLING (GMDH)
A NEW METHODOLOGY FOR EMERGENT SYSTEM IDENTIFICATION USING PARTICLE SWARM OPTIMIZATION (PSO) AND THE GROUP METHOD OF DATA HANDLING (GMDH) Mark S. Voss Dept. of Civil and Environmental Engineering Marquette
More informationHybrid Particle Swarm-Based-Simulated Annealing Optimization Techniques
Hybrid Particle Swarm-Based-Simulated Annealing Optimization Techniques Nasser Sadati Abstract Particle Swarm Optimization (PSO) algorithms recently invented as intelligent optimizers with several highly
More informationHybrid Particle Swarm and Neural Network Approach for Streamflow Forecasting
Math. Model. Nat. Phenom. Vol. 5, No. 7, 010, pp. 13-138 DOI: 10.1051/mmnp/01057 Hybrid Particle Swarm and Neural Network Approach for Streamflow Forecasting A. Sedki and D. Ouazar Department of Civil
More informationSWITCHES ALLOCATION IN DISTRIBUTION NETWORK USING PARTICLE SWARM OPTIMIZATION BASED ON FUZZY EXPERT SYSTEM
SWITCHES ALLOCATION IN DISTRIBUTION NETWORK USING PARTICLE SWARM OPTIMIZATION BASED ON FUZZY EXPERT SYSTEM Tiago Alencar UFMA tiagoalen@gmail.com Anselmo Rodrigues UFMA schaum.nyquist@gmail.com Maria da
More informationOptimal Design of Water Distribution Network Using Differential Evolution
Optimal Design of Water Distribution Network Using Differential Evolution R. Uma Assistant Professor, Department of Civil Engineering, P.S.R. Engineering College, Sivakasi (India) Abstract: A water distribution
More informationComparison of Some Evolutionary Algorithms for Approximate Solutions of Optimal Control Problems
Australian Journal of Basic and Applied Sciences, 4(8): 3366-3382, 21 ISSN 1991-8178 Comparison of Some Evolutionary Algorithms for Approximate Solutions of Optimal Control Problems Akbar H. Borzabadi,
More informationPARTICLE SWARM OPTIMIZATION (PSO) [1] is an
Proceedings of International Joint Conference on Neural Netorks, Atlanta, Georgia, USA, June -9, 9 Netork-Structured Particle Sarm Optimizer Considering Neighborhood Relationships Haruna Matsushita and
More informationGenetic-PSO Fuzzy Data Mining With Divide and Conquer Strategy
Genetic-PSO Fuzzy Data Mining With Divide and Conquer Strategy Amin Jourabloo Department of Computer Engineering, Sharif University of Technology, Tehran, Iran E-mail: jourabloo@ce.sharif.edu Abstract
More informationSolving Travelling Salesman Problem Using Variants of ABC Algorithm
Volume 2, No. 01, March 2013 ISSN 2278-1080 The International Journal of Computer Science & Applications (TIJCSA) RESEARCH PAPER Available Online at http://www.journalofcomputerscience.com/ Solving Travelling
More informationParticle Swarm Optimization Artificial Bee Colony Chain (PSOABCC): A Hybrid Meteahuristic Algorithm
Particle Swarm Optimization Artificial Bee Colony Chain (PSOABCC): A Hybrid Meteahuristic Algorithm Oğuz Altun Department of Computer Engineering Yildiz Technical University Istanbul, Turkey oaltun@yildiz.edu.tr
More informationThe Design of Pole Placement With Integral Controllers for Gryphon Robot Using Three Evolutionary Algorithms
The Design of Pole Placement With Integral Controllers for Gryphon Robot Using Three Evolutionary Algorithms Somayyeh Nalan-Ahmadabad and Sehraneh Ghaemi Abstract In this paper, pole placement with integral
More informationCHAPTER 2 CONVENTIONAL AND NON-CONVENTIONAL TECHNIQUES TO SOLVE ORPD PROBLEM
20 CHAPTER 2 CONVENTIONAL AND NON-CONVENTIONAL TECHNIQUES TO SOLVE ORPD PROBLEM 2.1 CLASSIFICATION OF CONVENTIONAL TECHNIQUES Classical optimization methods can be classified into two distinct groups:
More informationUnidimensional Search for solving continuous high-dimensional optimization problems
2009 Ninth International Conference on Intelligent Systems Design and Applications Unidimensional Search for solving continuous high-dimensional optimization problems Vincent Gardeux, Rachid Chelouah,
More informationApplication of Improved Discrete Particle Swarm Optimization in Logistics Distribution Routing Problem
Available online at www.sciencedirect.com Procedia Engineering 15 (2011) 3673 3677 Advanced in Control Engineeringand Information Science Application of Improved Discrete Particle Swarm Optimization in
More informationHybrid discrete dynamically dimensioned search (HD-DDS) algorithm for water distribution system design optimization
WATER RESOURCES RESEARCH, VOL. 45,, doi:10.1029/2008wr007673, 2009 Hybrid discrete dynamically dimensioned search (HD-DDS) algorithm for water distribution system design optimization Bryan A. Tolson, 1
More informationGeneration of Ultra Side lobe levels in Circular Array Antennas using Evolutionary Algorithms
Generation of Ultra Side lobe levels in Circular Array Antennas using Evolutionary Algorithms D. Prabhakar Associate Professor, Dept of ECE DVR & Dr. HS MIC College of Technology Kanchikacherla, AP, India.
More informationMulti-Objective Pipe Smoothing Genetic Algorithm For Water Distribution Network Design
City University of New York (CUNY) CUNY Academic Works International Conference on Hydroinformatics 8-1-2014 Multi-Objective Pipe Smoothing Genetic Algorithm For Water Distribution Network Design Matthew
More informationParticle Swarm Optimization
Dario Schor, M.Sc., EIT schor@ieee.org Space Systems Department Magellan Aerospace Winnipeg Winnipeg, Manitoba 1 of 34 Optimization Techniques Motivation Optimization: Where, min x F(x), subject to g(x)
More informationA Comparative Analysis on the Performance of Particle Swarm Optimization and Artificial Immune Systems for Mathematical Test Functions.
Australian Journal of Basic and Applied Sciences 3(4): 4344-4350 2009 ISSN 1991-8178 A Comparative Analysis on the Performance of Particle Swarm Optimization and Artificial Immune Systems for Mathematical
More informationIndex Terms PSO, parallel computing, clustering, multiprocessor.
Parallel Particle Swarm Optimization in Data Clustering Yasin ORTAKCI Karabuk University, Computer Engineering Department, Karabuk, Turkey yasinortakci@karabuk.edu.tr Abstract Particle Swarm Optimization
More informationOptimal Power Flow Using Particle Swarm Optimization
Optimal Power Flow Using Particle Swarm Optimization M.Chiranjivi, (Ph.D) Lecturer Department of ECE Bule Hora University, Bulehora, Ethiopia. Abstract: The Optimal Power Flow (OPF) is an important criterion
More informationINTERNATIONAL JOURNAL OF ENGINEERING SCIENCES & MANAGEMENT
INTERNATIONAL JOURNAL OF ENGINEERING SCIENCES & MANAGEMENT MOBILITY MANAGEMENT IN CELLULAR NETWORK Prakhar Agrawal 1, Ravi Kateeyare 2, Achal Sharma 3 1 Research Scholar, 2,3 Asst. Professor 1,2,3 Department
More informationFunction Approximation and Feature Selection Tool
Function Approximation and Feature Selection Tool Version: 1.0 The current version provides facility for adaptive feature selection and prediction using flexible neural tree. Developers: Varun Kumar Ojha
More informationThe movement of the dimmer firefly i towards the brighter firefly j in terms of the dimmer one s updated location is determined by the following equat
An Improved Firefly Algorithm for Optimization Problems Amarita Ritthipakdee 1, Arit Thammano, Nol Premasathian 3, and Bunyarit Uyyanonvara 4 Abstract Optimization problem is one of the most difficult
More informationBinary Differential Evolution Strategies
Binary Differential Evolution Strategies A.P. Engelbrecht, Member, IEEE G. Pampará Abstract Differential evolution has shown to be a very powerful, yet simple, population-based optimization approach. The
More informationParticle Swarm Optimization Approach for Scheduling of Flexible Job Shops
Particle Swarm Optimization Approach for Scheduling of Flexible Job Shops 1 Srinivas P. S., 2 Ramachandra Raju V., 3 C.S.P Rao. 1 Associate Professor, V. R. Sdhartha Engineering College, Vijayawada 2 Professor,
More informationAn Approach to Polygonal Approximation of Digital CurvesBasedonDiscreteParticleSwarmAlgorithm
Journal of Universal Computer Science, vol. 13, no. 10 (2007), 1449-1461 submitted: 12/6/06, accepted: 24/10/06, appeared: 28/10/07 J.UCS An Approach to Polygonal Approximation of Digital CurvesBasedonDiscreteParticleSwarmAlgorithm
More informationSolving Economic Load Dispatch Problems in Power Systems using Genetic Algorithm and Particle Swarm Optimization
Solving Economic Load Dispatch Problems in Power Systems using Genetic Algorithm and Particle Swarm Optimization Loveleen Kaur 1, Aashish Ranjan 2, S.Chatterji 3, and Amod Kumar 4 1 Asst. Professor, PEC
More informationFeeder Reconfiguration Using Binary Coding Particle Swarm Optimization
488 International Journal Wu-Chang of Control, Wu Automation, and Men-Shen and Systems, Tsai vol. 6, no. 4, pp. 488-494, August 2008 Feeder Reconfiguration Using Binary Coding Particle Swarm Optimization
More informationExperimental Study on Bound Handling Techniques for Multi-Objective Particle Swarm Optimization
Experimental Study on Bound Handling Techniques for Multi-Objective Particle Swarm Optimization adfa, p. 1, 2011. Springer-Verlag Berlin Heidelberg 2011 Devang Agarwal and Deepak Sharma Department of Mechanical
More informationARTIFICIAL INTELLIGENCE (CSCU9YE ) LECTURE 5: EVOLUTIONARY ALGORITHMS
ARTIFICIAL INTELLIGENCE (CSCU9YE ) LECTURE 5: EVOLUTIONARY ALGORITHMS Gabriela Ochoa http://www.cs.stir.ac.uk/~goc/ OUTLINE Optimisation problems Optimisation & search Two Examples The knapsack problem
More informationIEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, VOL. 5, NO. 1, FEBRUARY
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, VOL. 5, NO. 1, FEBRUARY 2001 41 Brief Papers An Orthogonal Genetic Algorithm with Quantization for Global Numerical Optimization Yiu-Wing Leung, Senior Member,
More informationSolving A Nonlinear Side Constrained Transportation Problem. by Using Spanning Tree-based Genetic Algorithm. with Fuzzy Logic Controller
Solving A Nonlinear Side Constrained Transportation Problem by Using Spanning Tree-based Genetic Algorithm with Fuzzy Logic Controller Yasuhiro Tsujimura *, Mitsuo Gen ** and Admi Syarif **,*** * Department
More informationModified Particle Swarm Optimization with Novel Modulated Inertia for Velocity Update
Modified Particle Swarm Optimization with Novel Modulated Inertia for Velocity Update Abdul Hadi Hamdan #1, Fazida Hanim Hashim #2, Abdullah Zawawi Mohamed *3, W. M. Diyana W. Zaki #4, Aini Hussain #5
More informationCooperative Coevolution using The Brain Storm Optimization Algorithm
Cooperative Coevolution using The Brain Storm Optimization Algorithm Mohammed El-Abd Electrical and Computer Engineering Department American University of Kuwait Email: melabd@auk.edu.kw Abstract The Brain
More informationOptimization of Benchmark Functions Using Artificial Bee Colony (ABC) Algorithm
IOSR Journal of Engineering (IOSRJEN) e-issn: 2250-3021, p-issn: 2278-8719 Vol. 3, Issue 10 (October. 2013), V4 PP 09-14 Optimization of Benchmark Functions Using Artificial Bee Colony (ABC) Algorithm
More informationAn Optimization of Association Rule Mining Algorithm using Weighted Quantum behaved PSO
An Optimization of Association Rule Mining Algorithm using Weighted Quantum behaved PSO S.Deepa 1, M. Kalimuthu 2 1 PG Student, Department of Information Technology 2 Associate Professor, Department of
More informationAn Island Based Hybrid Evolutionary Algorithm for Optimization
An Island Based Hybrid Evolutionary Algorithm for Optimization Changhe Li and Shengxiang Yang Department of Computer Science, University of Leicester University Road, Leicester LE1 7RH, UK {cl160,s.yang}@mcs.le.ac.uk
More informationTHREE PHASE FAULT DIAGNOSIS BASED ON RBF NEURAL NETWORK OPTIMIZED BY PSO ALGORITHM
THREE PHASE FAULT DIAGNOSIS BASED ON RBF NEURAL NETWORK OPTIMIZED BY PSO ALGORITHM M. Sivakumar 1 and R. M. S. Parvathi 2 1 Anna University, Tamilnadu, India 2 Sengunthar College of Engineering, Tamilnadu,
More informationFuzzy Inspired Hybrid Genetic Approach to Optimize Travelling Salesman Problem
Fuzzy Inspired Hybrid Genetic Approach to Optimize Travelling Salesman Problem Bindu Student, JMIT Radaur binduaahuja@gmail.com Mrs. Pinki Tanwar Asstt. Prof, CSE, JMIT Radaur pinki.tanwar@gmail.com Abstract
More informationThree-Dimensional Off-Line Path Planning for Unmanned Aerial Vehicle Using Modified Particle Swarm Optimization
Three-Dimensional Off-Line Path Planning for Unmanned Aerial Vehicle Using Modified Particle Swarm Optimization Lana Dalawr Jalal Abstract This paper addresses the problem of offline path planning for
More informationLECTURE 16: SWARM INTELLIGENCE 2 / PARTICLE SWARM OPTIMIZATION 2
15-382 COLLECTIVE INTELLIGENCE - S18 LECTURE 16: SWARM INTELLIGENCE 2 / PARTICLE SWARM OPTIMIZATION 2 INSTRUCTOR: GIANNI A. DI CARO BACKGROUND: REYNOLDS BOIDS Reynolds created a model of coordinated animal
More informationDesign optimization method for Francis turbine
IOP Conference Series: Earth and Environmental Science OPEN ACCESS Design optimization method for Francis turbine To cite this article: H Kawajiri et al 2014 IOP Conf. Ser.: Earth Environ. Sci. 22 012026
More informationAPPLICATION OF BPSO IN FLEXIBLE MANUFACTURING SYSTEM SCHEDULING
International Journal of Mechanical Engineering and Technology (IJMET) Volume 8, Issue 5, May 2017, pp. 186 195, Article ID: IJMET_08_05_020 Available online at http://www.ia aeme.com/ijmet/issues.asp?jtype=ijmet&vtyp
More information1. Introduction. 2. Motivation and Problem Definition. Volume 8 Issue 2, February Susmita Mohapatra
Pattern Recall Analysis of the Hopfield Neural Network with a Genetic Algorithm Susmita Mohapatra Department of Computer Science, Utkal University, India Abstract: This paper is focused on the implementation
More informationA Novel Hybrid Self Organizing Migrating Algorithm with Mutation for Global Optimization
International Journal of Soft Computing and Engineering (IJSCE) ISSN: 2231-2307, Volume-3, Issue-6, January 2014 A Novel Hybrid Self Organizing Migrating Algorithm with Mutation for Global Optimization
More informationParticle Swarm Optimization For N-Queens Problem
Journal of Advanced Computer Science and Technology, 1 (2) (2012) 57-63 Science Publishing Corporation www.sciencepubco.com/index.php/jacst Particle Swarm Optimization For N-Queens Problem Aftab Ahmed,
More informationHybridization EVOLUTIONARY COMPUTING. Reasons for Hybridization - 1. Naming. Reasons for Hybridization - 3. Reasons for Hybridization - 2
Hybridization EVOLUTIONARY COMPUTING Hybrid Evolutionary Algorithms hybridization of an EA with local search techniques (commonly called memetic algorithms) EA+LS=MA constructive heuristics exact methods
More informationSmall World Network Based Dynamic Topology for Particle Swarm Optimization
Small World Network Based Dynamic Topology for Particle Swarm Optimization Qingxue Liu 1,2, Barend Jacobus van Wyk 1 1 Department of Electrical Engineering Tshwane University of Technology Pretoria, South
More informationMobile Robot Path Planning in Static Environments using Particle Swarm Optimization
Mobile Robot Path Planning in Static Environments using Particle Swarm Optimization M. Shahab Alam, M. Usman Rafique, and M. Umer Khan Abstract Motion planning is a key element of robotics since it empowers
More informationWitold Pedrycz. University of Alberta Edmonton, Alberta, Canada
2017 IEEE International Conference on Systems, Man, and Cybernetics (SMC) Banff Center, Banff, Canada, October 5-8, 2017 Analysis of Optimization Algorithms in Automated Test Pattern Generation for Sequential
More informationPARALLEL PARTICLE SWARM OPTIMIZATION IN DATA CLUSTERING
PARALLEL PARTICLE SWARM OPTIMIZATION IN DATA CLUSTERING YASIN ORTAKCI Karabuk University, Computer Engineering Department, Karabuk, Turkey E-mail: yasinortakci@karabuk.edu.tr Abstract Particle Swarm Optimization
More informationA HYBRID ALGORITHM BASED ON PARTICLE SWARM OPTIMIZATION
INTERNATIONAL JOURNAL OF INFORMATION AND SYSTEMS SCIENCES Volume 1, Number 3-4, Pages 275-282 2005 Institute for Scientific Computing and Information A HYBRID ALGORITHM BASED ON PARTICLE SWARM OPTIMIZATION
More informationGRID SCHEDULING USING ENHANCED PSO ALGORITHM
GRID SCHEDULING USING ENHANCED PSO ALGORITHM Mr. P.Mathiyalagan 1 U.R.Dhepthie 2 Dr. S.N.Sivanandam 3 1 Lecturer 2 Post Graduate Student 3 Professor and Head Department of Computer Science and Engineering
More informationAdaptive Multi-objective Particle Swarm Optimization Algorithm
Adaptive Multi-objective Particle Swarm Optimization Algorithm P. K. Tripathi, Sanghamitra Bandyopadhyay, Senior Member, IEEE and S. K. Pal, Fellow, IEEE Abstract In this article we describe a novel Particle
More informationNovel Initialisation and Updating Mechanisms in PSO for Feature Selection in Classification
Novel Initialisation and Updating Mechanisms in PSO for Feature Selection in Classification Bing Xue, Mengjie Zhang, and Will N. Browne School of Engineering and Computer Science Victoria University of
More informationConvolutional Code Optimization for Various Constraint Lengths using PSO
International Journal of Electronics and Communication Engineering. ISSN 0974-2166 Volume 5, Number 2 (2012), pp. 151-157 International Research Publication House http://www.irphouse.com Convolutional
More informationPortable GPU-Based Artificial Neural Networks For Data-Driven Modeling
City University of New York (CUNY) CUNY Academic Works International Conference on Hydroinformatics 8-1-2014 Portable GPU-Based Artificial Neural Networks For Data-Driven Modeling Zheng Yi Wu Follow this
More informationMetaheuristic Development Methodology. Fall 2009 Instructor: Dr. Masoud Yaghini
Metaheuristic Development Methodology Fall 2009 Instructor: Dr. Masoud Yaghini Phases and Steps Phases and Steps Phase 1: Understanding Problem Step 1: State the Problem Step 2: Review of Existing Solution
More informationTransactions on Ecology and the Environment vol 19, 1998 WIT Press, ISSN
Calibration of water distribution network models using genetic algorithms G. Walters, D. Savic, M. Morley, W. de Schaetzen & R. Atkinson Centre for Water Studies, School of Engineering & Computer Science,
More information1 Lab + Hwk 5: Particle Swarm Optimization
1 Lab + Hwk 5: Particle Swarm Optimization This laboratory requires the following equipment: C programming tools (gcc, make), already installed in GR B001 Webots simulation software Webots User Guide Webots
More information