The Modified IWO Algorithm for Optimization of Numerical Functions
|
|
- Adam Jackson
- 6 years ago
- Views:
Transcription
1 The Modified IWO Algorithm for Optimization of Numerical Functions Daniel Kostrzewa and Henryk Josiński Silesian University of Technology, Akademicka 16 PL Gliwice, Poland Abstract. The Invasive Weed Optimization algorithm (IWO) is an optimization method inspired by dynamic growth of weeds colony. The authors of the present paper have modified the IWO algorithm introducing a hybrid strategy of the search space exploration. The goal of the project was to evaluate the modified version by testing its usefulness for numerical s minimization. The optimized multidimensional s: Griewank, Rastrigin, and Rosenbrock are frequently used as benchmarks which allows to compare the experimental results with outcomes reported in the literature. Both the results produced by the original version of the IWO algorithm and the Adaptive Particle Swarm Optimization (APSO) method served as the reference points. Keywords: Invasive Weed Optimization algorithm, Griewank, Rastrigin fuction, Rosenbrock. 1 Introduction The Invasive Weed Optimization (IWO) algorithm is an optimization method, in which the exploration strategy of the search space (similarly to the evolutionary algorithm) is based on the transformation of a complete solution into another one. Its idea was inspired by observation of dynamic spreading of weeds and their quick adaptation to environmental conditions [1]. The authors of the method from University of Tehran emphasized its usefulness for continuous optimization tasks. Their research was focused inter alia on minimization of the multimodal s and tuning of a second order compensator [1], antenna configurations [2], electricity market dynamics [3], and a recommender system [4]. The authors of the present paper have modified the IWO algorithm introducing a hybrid strategy of the search space exploration (described in detail in section 2) and broadened the scope of the IWO algorithm application dealing skillfully with an important discrete optimization task from the databases area the join ordering problem for both centralized and distributed data [5]-[6]. The symmetric TSP was also successfully solved by the modified IWO equipped with the inver-over operator [7]. The goal of the present paper is an evaluation of the modified IWO based on the effects of the optimization of the Griewank, Rastrigin and Rosenbrock L. Rutkowski et al. (Eds.): SIDE 2012 and EC 2012, LNCS 7269, pp , c Springer-Verlag Berlin Heidelberg 2012
2 268 D. Kostrzewa and H. Josiński s. The results (minima values) produced by the modified IWO were compared with the outcomes generated by the original IWO as well as with the results of the Adaptive Particle Swarm Optimization (APSO) [8], [9]. The organization of this paper is as follows section 2 contains a brief description of the IWO algorithm taking into serious consideration the proposed hybrid method of the search space penetration. Optimized s are presented in section 3. Section 4 deals with procedure of the experimental research along with its results. The conclusions are formulated in section 5. 2 Description of the Modified IWO Algorithm The modified version of the IWO algorithm provides the opportunity to experiment with different search space exploration strategies. The pseudocode mentioned below describes the algorithm by means of terminological convention consistent with the,,natural inspiration of its idea: Create the first population composed of n randomly generated individuals. For each individual { Compute the value of the fitness as the reciprocal of the minimized. } While the stop criterion is not satisfied { For each individual from the population { Compute the number of seeds depending on the value of the fitness. For each seed { Determine a place of fall of the seed choosing with the fixed probability one of the following methods: dispersing, spreading or rolling down. Create a new individual according to the randomly chosen method. Compute the value of the fitness for the new individual. } } Create a new population composed of n best adapted individuals taking into account members of the former population as well as new individuals. } The number of seeds S ind produced by a single individual depends on the value of its fitness f ind the greater the degree of individual s adaptation, the greater its reproduction ability according to the following formula: S ind = S min + (f ind f min ) S max S min, (1) f max f min
3 Modified IWO Algorithm 269 where S max, S min denote maximum and minimum admissible number of seeds generated, respectively, by the best population member (fitness f max )andby the worst one (fitness f min ). The character of the operation described as,,determine a place of fall of the seed differs depending on the method chosen randomly for its realization. Probability values of selection assigned to the particular methods: dispersing, spreading and rolling down form parameters of the algorithm. In case of dispersing the aforementioned operation computes the distance between the place where the seed falls on the ground and the parent individual (Fig. 1a). The distance is described by normal distribution with a mean equal to 0 and a standard deviation truncated to nonnegative values. The standard deviation is decreased in each algorithm iteration (i.e. for each population) and computed for the iteration iter, iter [1,iter max ] according to the following formula: ( ) m itermax iter σ iter = (σ init σ fin)+σ fin. (2) iter max The total number of iterations (iter max ), equivalent to the total number of populations, can be either used in form of the algorithm parameter with the purpose of determination of the stop criterion or can be estimated based on the stop criterion defined as the execution time limit. The symbols σ init, σ fin represent, respectively, initial and final values of the standard deviation, whereas m is a nonlinear modulation factor. According to the dispersing method construction of a new individual represented by a vector of a length equal to n, where element i, i [1,n] contains argument x i of the optimized n-dimensional, is based on the random generation of the values for all arguments x i. Those values determine the direction of the seed s,,fly. Because the seed has to fall on the ground at the determined distance from the parent individual, the values of arguments are scaled so that this condition is fulfilled. The spreading is a random disseminating seeds over the whole of the search space. Therefore, this operation is equivalent to the random construction of new individuals (Fig. 1b). The rolling down is basedonthe examinationofthe neighbourhoodofthe parent individual. In case of continuous optimization the term,,neighbours stands for individuals located at the same randomly generated distance from the considered one. The best adapted individual is chosen from among the determined number of neighbours, whereupon its neighbourhood is analyzed in search of the next best adapted individual. This procedure is repeated k times (k is a parameter of the method) giving the opportunity to select the best adapted individual found in the k-th iteration as a new one (Fig. 1c). 3 Characterization of the Optimized Functions According to [10] there are following classes of s used as benchmarks for numerical optimization problems:
4 270 D. Kostrzewa and H. Josiński Fig. 1. Idea of: a) dispersing b) spreading c) rolling down (k =3) 1. Unimodal, convex, multidimensional. 2. Multimodal, two-dimensional with a small number of local extremes. 3. Multimodal, two-dimensional with a huge number of local extremes. 4. Multimodal, multidimensional with a huge number of local extremes. Griewank and Rastrigin s belong to the 4. class. The classical Rosenbrock is a two-dimensional unimodal, whereas the n-dimensional (n =4 30) Rosenbrock has 2 minima [11]. The global minimum for all s is equal to 0. The formula defining the n-dimensional Griewank (Fig. 2a) is as follows: f (x) = n n x 2 i i=1 i=1 ( ) xi cos +1. (3) i The n-dimensional Rastrigin (Fig. 2b) is described by the following formula: n [ f (x) =10n + x 2 i 10 cos (2πx i ) ]. (4) i=1 The following formula defines the n-dimensional (n >1) Rosenbrock (Fig. 2c): n 1 [ f (x) = 100 ( x i+1 x 2 ) 2 i +(1 xi ) 2]. (5) i=1 4 Experimental Research The goal of the experiments was to compare the results (minima values) found by the modified IWO with the outcomes generated by other methods. As reference
5 Modified IWO Algorithm 271 Fig. 2. a) The Griewank b) the Rastrigin c) the Rosenbrock points served the results achieved from experiments with the original version of the IWO algorithm and those reported in [9] as minima found by the APSO method. For purpose of comparison the initial scope of the search space for particular s as well as other optimization parameters correspond with values proposed in the literature. The initial scopes given in Figures 5, 6, 7 are asymmetric according to the suggestion expressed in [9]. Values of the modified IWO parameters describing the hybrid strategy of the search space exploration were collected in Table 1. They were found during the research as the most appropriate values for the considered problem. The workstation used for experiments is described by the following parameters: Intel Core2 Quad Q GHz processor, RAM 2GB 800MHz. The number of Table 1. Modified IWO parameters describing the search space exploration strategy Description Griewank (n = 10) Griewank (n =20, 30) Rastrigin Rosenbrock Number k of neighbourhoods examined during the rolling down Probability of the dispersing Probability of the spreading Probability of the rolling down
6 272 D. Kostrzewa and H. Josiński trial runs for each in the presence of a single parameters configuration of the optimization method was equal to 500. Minima of the 30-dimensional Rastrigin and Griewank s found by the original and modified versions of the IWO algorithm are presented in Figures 3, 4, respectively. The X values denote the optimization time. Fig. 3. Comparison between the original and modified IWO based on the Rastrigin Fig. 4. Comparison between the original and modified IWO based on the Griewank Minima of the n-dimensional Rastrigin, Rosenbrock, and Griewank s (n =10, 20, 30) found by the modified IWO algorithm and the APSO method are presented in Figures 5, 6, 7, respectively. The n value is strictly related to the number of algorithm iterations (respectively: 1000, 1500, 2000) used as a stop criterion. The X values denote the number of individuals.
7 Modified IWO Algorithm 273 Fig. 5. Comparison between the APSO and IWO algorithms based on the Rastrigin Fig. 6. Comparison between the APSO and IWO algorithms based on the Rosenbrock Fig. 7. Comparison between the APSO and IWO algorithms based on the Griewank
8 274 D. Kostrzewa and H. Josiński 5 Conclusion The experiments revealed the usefulness of the modified IWO for solving continuous optimization tasks. The method can compete with other algorithms, although it should be compared with some methods mentioned in the literature as successful ones (e.g. Artificial Bee Colony). The hybrid strategy of the search space exploration turned out to be more efficient than the dissemination used in the original IWO. However, the influence of the strategy components (dispersing, spreading, rolling down) on the solution found by the modified IWO requires further research. In the area of discrete optimization the modified IWO takes part at present in the World TSP Challenge ( and in the Mona Lisa TSP Challenge ( References 1. Mehrabian, R., Lucas, C.: A novel numerical optimization algorithm inspired from weed colonization. Ecological Informatics 1(4), (2006) 2. Mallahzadeh, A.R., Oraizi, H., Davoodi-Rad, Z.: Application of the Invasive Weed Optimization Technique for Antenna Configurations. Progress in Electromagnetics Research, (2008) 3. Sahraei-Ardakani, M., Roshanaei, M., Rahimi-Kian, A., Lucas, C.: A Study of Electricity Market Dynamics Using Invasive Weed Colonization Optimization. In: IEEE Symposium on Computational Intelligence and Games, pp (2008) 4. Sepehri Rad, H., Lucas, C.: A Recommender System based on Invasive Weed Optimization Algorithm. In: IEEE Congress on Evolutionary Computation, pp (2007) 5. Kostrzewa, D., Josiński, H.: Verification of the Search Space Exploration Strategy Based on the Solutions of the Join Ordering Problem. In: Man-Machine Interactions, AISC, pp (2011) 6. Kostrzewa, D., Josiński, H.: The Comparison of an Adapted Evolutionary Algorithm with the Invasive Weed Optimization Algorithm Based on the Problem of Predetermining the Progress of Distributed Data Merging Process. In: Man- Machine Interactions. AISC, pp (2009) 7. Kostrzewa, D., Josiński, H.: Application of the IWO Algorithm for the Travelling Salesman Problem. In: Proceedings of the 3rd KKNTPD, pp (2010) (in Polish) 8. Hossen, S., Rabbi, F., Rahman, M.: Adaptive Particle Swarm Optimization (APSO) for multimodal optimization. International Journal of Engineering and Technology 1(3), (2009) 9. Xie, X.-F., Zhang, W.-J., Yang, Z.-L.: Adaptive Particle Swarm Optimization on Individual Level. In: International Conference on Signal Processing, pp (2002) 10. Molga, M., Smutnicki, C.: Test s for optimization needs (2005), Shang, Y.-W., Huang-Qiu, Y.: A Note on the Extended Rosenbrock Function. Evolutionary Computation 14(1), (2006)
Comparison 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 informationDiscrete Invasive Weed Optimization Algorithm: Application to Cooperative Multiple Task Assignment of UAVs
Discrete Invasive Weed Optimization Algorithm: Application to Cooperative Multiple Task Assignment of UAVs Mohsen Ramezani Ghalenoei, Student Member, IEEE, Hossein Hajimirsadeghi, Student Member, IEEE,
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 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 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 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 informationDiscrete Invasive Weed Optimization for Nash Equilibrium Search in Nonlinear Games
SOCIAL, COGNITIVE, AND BEHAVIOURAL SYSTEMS FINAL PROJECT 1 Discrete Invasive Weed Optimization for Nash Equilibrium Search in Nonlinear Games Hossein Hajimirsadeghi Abstract Finding Nash Equilibrium (NE)
More informationABC Optimization: A Co-Operative Learning Approach to Complex Routing Problems
Progress in Nonlinear Dynamics and Chaos Vol. 1, 2013, 39-46 ISSN: 2321 9238 (online) Published on 3 June 2013 www.researchmathsci.org Progress in ABC Optimization: A Co-Operative Learning Approach to
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 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 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 informationFeeding the Fish Weight Update Strategies for the Fish School Search Algorithm
Feeding the Fish Weight Update Strategies for the Fish School Search Algorithm Andreas Janecek and Ying Tan Key Laboratory of Machine Perception (MOE), Peking University Department of Machine Intelligence,
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 informationUsing Interval Scanning to Improve the Performance of the Enhanced Unidimensional Search Method
Using Interval Scanning to Improve the Performance of the Enhanced Unidimensional Search Method Mahamed G. H. Omran Department of Computer Science Gulf university for Science & Technology, Kuwait Email:
More informationOn the Idea of a New Artificial Intelligence Based Optimization Algorithm Inspired From the Nature of Vortex
On the Idea of a New Artificial Intelligence Based Optimization Algorithm Inspired From the Nature of Vortex Utku Kose Computer Sciences Application and Research Center Usak University, Usak, Turkey utku.kose@usak.edu.tr
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 informationAn Improved Tree Seed Algorithm for Optimization Problems
International Journal of Machine Learning and Computing, Vol. 8, o. 1, February 2018 An Improved Tree Seed Algorithm for Optimization Problems Murat Aslan, Mehmet Beskirli, Halife Kodaz, and Mustafa Servet
More informationAdaptive Spiral Optimization Algorithm for Benchmark Problems
Bilecik Şeyh Edebali Üniversitesi Fen Bilimleri Dergisi, Cilt:, Sayı:, 6 ISSN: -77 (http://edergi.bilecik.edu.tr/index.php/fbd) Araştırma Makalesi/Research Article Adaptive Spiral Optimization Algorithm
More informationHYBRIDIZING INVASIVE WEED OPTIMIZATION WITH FIREFLY ALGORITHM FOR UNCONSTRAINED AND CONSTRAINED OPTIMIZATION PROBLEMS
28 th February 217. Vol.95. No 4 25 ongoing JATIT & LLS HYBRIDIZING INVASIVE WEED OPTIMIZATION WITH FIREFLY ALGORITHM FOR UNCONSTRAINED AND CONSTRAINED OPTIMIZATION PROBLEMS 1 HYREIL A KASDIRIN, 2 N. M.
More informationThe Simple Genetic Algorithm Performance: A Comparative Study on the Operators Combination
INFOCOMP 20 : The First International Conference on Advanced Communications and Computation The Simple Genetic Algorithm Performance: A Comparative Study on the Operators Combination Delmar Broglio Carvalho,
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 informationA Comparative Study on Nature Inspired Algorithms with Firefly Algorithm
International Journal of Engineering and Technology Volume 4 No. 10, October, 2014 A Comparative Study on Nature Inspired Algorithms with Firefly Algorithm M. K. A. Ariyaratne, T. G. I. Fernando Department
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 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 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 informationThe Coral Reefs Optimization Algorithm: An Efficient Meta-heuristic for Solving Hard Optimization Problems
The Coral Reefs Optimization Algorithm: An Efficient Meta-heuristic for Solving Hard Optimization Problems S. Salcedo-Sanz 1, J. Del Ser 2, I. Landa-Torres 2, S. Gil-López 2, and A. Portilla-Figueras 1
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 informationTHE DEVELOPMENT OF THE POTENTIAL AND ACADMIC PROGRAMMES OF WROCLAW UNIVERISTY OF TECHNOLOGY METAHEURISTICS
METAHEURISTICS 1. Objectives The goals of the laboratory workshop are as follows: to learn basic properties of evolutionary computation techniques and other metaheuristics for solving various global optimization
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 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 informationEnhanced ABC Algorithm for Optimization of Multiple Traveling Salesman Problem
I J C T A, 9(3), 2016, pp. 1647-1656 International Science Press Enhanced ABC Algorithm for Optimization of Multiple Traveling Salesman Problem P. Shunmugapriya 1, S. Kanmani 2, R. Hemalatha 3, D. Lahari
More informationConstrained Optimization of the Stress Function for Multidimensional Scaling
Constrained Optimization of the Stress Function for Multidimensional Scaling Vydunas Saltenis Institute of Mathematics and Informatics Akademijos 4, LT-08663 Vilnius, Lithuania Saltenis@ktlmiilt Abstract
More informationApplication of genetic algorithms and Kohonen networks to cluster analysis
Application of genetic algorithms and Kohonen networks to cluster analysis Marian B. Gorza lczany and Filip Rudziński Department of Electrical and Computer Engineering Kielce University of Technology Al.
More informationBenchmark Functions for the CEC 2008 Special Session and Competition on Large Scale Global Optimization
Benchmark Functions for the CEC 2008 Special Session and Competition on Large Scale Global Optimization K. Tang 1, X. Yao 1, 2, P. N. Suganthan 3, C. MacNish 4, Y. P. Chen 5, C. M. Chen 5, Z. Yang 1 1
More informationHybrid Differential Evolution Algorithm for Traveling Salesman Problem
Available online at www.sciencedirect.com Procedia Engineering 15 (2011) 2716 2720 Advanced in Control Engineeringand Information Science Hybrid Differential Evolution Algorithm for Traveling Salesman
More informationNUMERICAL METHODS PERFORMANCE OPTIMIZATION IN ELECTROLYTES PROPERTIES MODELING
NUMERICAL METHODS PERFORMANCE OPTIMIZATION IN ELECTROLYTES PROPERTIES MODELING Dmitry Potapov National Research Nuclear University MEPHI, Russia, Moscow, Kashirskoe Highway, The European Laboratory for
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 informationACCELERATING THE ANT COLONY OPTIMIZATION
ACCELERATING THE ANT COLONY OPTIMIZATION BY SMART ANTS, USING GENETIC OPERATOR Hassan Ismkhan Department of Computer Engineering, University of Bonab, Bonab, East Azerbaijan, Iran H.Ismkhan@bonabu.ac.ir
More informationPARTICLE Swarm Optimization (PSO), an algorithm by
, March 12-14, 2014, Hong Kong Cluster-based Particle Swarm Algorithm for Solving the Mastermind Problem Dan Partynski Abstract In this paper we present a metaheuristic algorithm that is inspired by Particle
More informationOptimization Using Particle Swarms with Near Neighbor Interactions
Optimization Using Particle Swarms with Near Neighbor Interactions Kalyan Veeramachaneni, Thanmaya Peram, Chilukuri Mohan, and Lisa Ann Osadciw Department of Electrical Engineering and Computer Science
More informationTHE OPTIMIZATION OF RUNNING QUERIES IN RELATIONAL DATABASES USING ANT-COLONY ALGORITHM
THE OPTIMIZATION OF RUNNING QUERIES IN RELATIONAL DATABASES USING ANT-COLONY ALGORITHM Adel Alinezhad Kolaei and Marzieh Ahmadzadeh Department of Computer Engineering & IT Shiraz University of Technology
More informationMassively Parallel Approximation Algorithms for the Traveling Salesman Problem
Massively Parallel Approximation Algorithms for the Traveling Salesman Problem Vaibhav Gandhi May 14, 2015 Abstract This paper introduces the reader to massively parallel approximation algorithms which
More informationFeeding the Fish Weight Update Strategies for the Fish School Search Algorithm. Andreas Janecek
Feeding the Fish Weight for the Fish School Search Algorithm Andreas Janecek andreas.janecek@univie.ac.at International Conference on Swarm Intelligence (ICSI) Chongqing, China - Jun 14, 2011 Outline Basic
More informationArtificial Bee Colony (ABC) Optimization Algorithm for Solving Constrained Optimization Problems
Artificial Bee Colony (ABC) Optimization Algorithm for Solving Constrained Optimization Problems Dervis Karaboga and Bahriye Basturk Erciyes University, Engineering Faculty, The Department of Computer
More informationInvasive Weed Optimization for Turbojet Engine Fuel Controller Gain Tuning
International Journal of Aerospace Sciences 203, 2(3): 38-47 DOI: 0.5923/j.aerospace.2030203.06 Invasive Weed Optimization for Turbojet Engine Fuel Controller Gain Tuning S. Jafari *, M. Montazeri-Gh Systems
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 informationHybrid Optimization Coupling Electromagnetism and Descent Search for Engineering Problems
Proceedings of the International Conference on Computational and Mathematical Methods in Science and Engineering, CMMSE 2008 13 17 June 2008. Hybrid Optimization Coupling Electromagnetism and Descent Search
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 informationJournal of Universal Computer Science, vol. 14, no. 14 (2008), submitted: 30/9/07, accepted: 30/4/08, appeared: 28/7/08 J.
Journal of Universal Computer Science, vol. 14, no. 14 (2008), 2416-2427 submitted: 30/9/07, accepted: 30/4/08, appeared: 28/7/08 J.UCS Tabu Search on GPU Adam Janiak (Institute of Computer Engineering
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 of Genetic Algorithm and Continuous Ant Colony Optimization for Optimum Solution
International Journal of Computer Networs and Communications Security VOL.2, NO.1, JANUARY 2014, 1 6 Available online at: www.cncs.org ISSN 2308-9830 C N C S Hybrid of Genetic Algorithm and Continuous
More informationConstraint-Based Synthesis of Linear Antenna Array Using Modified Invasive Weed Optimization
Progress In Electromagnetics Research M, Vol. 36, 9 22, 2014 Constraint-Based Synthesis of Linear Antenna Array Using Modified Invasive Weed Optimization Lakshman Pappula * and Debalina Ghosh Abstract
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 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 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 informationRECORD-TO-RECORD TRAVEL ALGORITHM FOR ATTRIBUTE REDUCTION IN ROUGH SET THEORY
RECORD-TO-RECORD TRAVEL ALGORITHM FOR ATTRIBUTE REDUCTION IN ROUGH SET THEORY MAJDI MAFARJA 1,2, SALWANI ABDULLAH 1 1 Data Mining and Optimization Research Group (DMO), Center for Artificial Intelligence
More informationThe Genetic Algorithm for finding the maxima of single-variable functions
Research Inventy: International Journal Of Engineering And Science Vol.4, Issue 3(March 2014), PP 46-54 Issn (e): 2278-4721, Issn (p):2319-6483, www.researchinventy.com The Genetic Algorithm for finding
More informationIntroduction to Stochastic Optimization Methods (meta-heuristics) Modern optimization methods 1
Introduction to Stochastic Optimization Methods (meta-heuristics) Modern optimization methods 1 Efficiency of optimization methods Robust method Efficiency Specialized method Enumeration or MC kombinatorial
More informationPerformance Assessment of DMOEA-DD with CEC 2009 MOEA Competition Test Instances
Performance Assessment of DMOEA-DD with CEC 2009 MOEA Competition Test Instances Minzhong Liu, Xiufen Zou, Yu Chen, Zhijian Wu Abstract In this paper, the DMOEA-DD, which is an improvement of DMOEA[1,
More informationA SIMULATED ANNEALING ALGORITHM FOR SOME CLASS OF DISCRETE-CONTINUOUS SCHEDULING PROBLEMS. Joanna Józefowska, Marek Mika and Jan Węglarz
A SIMULATED ANNEALING ALGORITHM FOR SOME CLASS OF DISCRETE-CONTINUOUS SCHEDULING PROBLEMS Joanna Józefowska, Marek Mika and Jan Węglarz Poznań University of Technology, Institute of Computing Science,
More informationSUITABLE CONFIGURATION OF EVOLUTIONARY ALGORITHM AS BASIS FOR EFFICIENT PROCESS PLANNING TOOL
DAAAM INTERNATIONAL SCIENTIFIC BOOK 2015 pp. 135-142 Chapter 12 SUITABLE CONFIGURATION OF EVOLUTIONARY ALGORITHM AS BASIS FOR EFFICIENT PROCESS PLANNING TOOL JANKOWSKI, T. Abstract: The paper presents
More informationA Hybrid Genetic Algorithm for the Distributed Permutation Flowshop Scheduling Problem Yan Li 1, a*, Zhigang Chen 2, b
International Conference on Information Technology and Management Innovation (ICITMI 2015) A Hybrid Genetic Algorithm for the Distributed Permutation Flowshop Scheduling Problem Yan Li 1, a*, Zhigang Chen
More informationANANT COLONY SYSTEMFOR ROUTING IN PCB HOLES DRILLING PROCESS
International Journal of Innovative Management, Information & Production ISME International c2013 ISSN 2185-5439 Volume 4, 1, June 2013 PP. 50-56 ANANT COLONY SYSTEMFOR ROUTING IN PCB HOLES DRILLING PROCESS
More informationAdaptative Clustering Particle Swarm Optimization
Adaptative Clustering Particle Swarm Optimization Salomão S. Madeiro, Carmelo J. A. Bastos-Filho, Member, IEEE, and Fernando B. Lima Neto, Senior Member, IEEE, Elliackin M. N. Figueiredo Abstract The performance
More informationAutomatic differentiation based for particle swarm optimization steepest descent direction
International Journal of Advances in Intelligent Informatics ISSN: 2442-6571 Vol 1, No 2, July 2015, pp. 90-97 90 Automatic differentiation based for particle swarm optimization steepest descent direction
More informationA Parameter Study for Differential Evolution
A Parameter Study for Differential Evolution ROGER GÄMPERLE SIBYLLE D MÜLLER PETROS KOUMOUTSAKOS Institute of Computational Sciences Department of Computer Science Swiss Federal Institute of Technology
More informationSolving Constraint Satisfaction Problems by Artificial Bee Colony with Greedy Scouts
, 23-25 October, 2013, San Francisco, USA Solving Constraint Satisfaction Problems by Artificial Bee Colony with Greedy Scouts Yuko Aratsu, Kazunori Mizuno, Hitoshi Sasaki, Seiichi Nishihara Abstract In
More informationFuzzy Ant Clustering by Centroid Positioning
Fuzzy Ant Clustering by Centroid Positioning Parag M. Kanade and Lawrence O. Hall Computer Science & Engineering Dept University of South Florida, Tampa FL 33620 @csee.usf.edu Abstract We
More informationOptimal Reactive Power Dispatch Using Hybrid Loop-Genetic Based Algorithm
Optimal Reactive Power Dispatch Using Hybrid Loop-Genetic Based Algorithm Md Sajjad Alam Student Department of Electrical Engineering National Institute of Technology, Patna Patna-800005, Bihar, India
More information3. Genetic local search for Earth observation satellites operations scheduling
Distance preserving recombination operator for Earth observation satellites operations scheduling Andrzej Jaszkiewicz Institute of Computing Science, Poznan University of Technology ul. Piotrowo 3a, 60-965
More informationAutomatic Group-Outlier Detection
Automatic Group-Outlier Detection Amine Chaibi and Mustapha Lebbah and Hanane Azzag LIPN-UMR 7030 Université Paris 13 - CNRS 99, av. J-B Clément - F-93430 Villetaneuse {firstname.secondname}@lipn.univ-paris13.fr
More informationA Hybrid Metaheuristic Based on Differential Evolution and Local Search with Quadratic Interpolation
A Hybrid Metaheuristic Based on Differential Evolution and Local Search with Quadratic Interpolation María Laura Tardivo 1, Leticia Cagnina 2, Guillermo Leguizamón 2 1 Department of Computer Science, Universidad
More informationarxiv: v1 [cs.ne] 22 Mar 2016
Adaptive Parameter Selection in Evolutionary Algorithms by Reinforcement Learning with Dynamic Discretization of Parameter Range arxiv:1603.06788v1 [cs.ne] 22 Mar 2016 ABSTRACT Arkady Rost ITMO University
More informationVariable Neighborhood Particle Swarm Optimization for Multi-objective Flexible Job-Shop Scheduling Problems
Variable Neighborhood Particle Swarm Optimization for Multi-objective Flexible Job-Shop Scheduling Problems Hongbo Liu 1,2,AjithAbraham 3,1, Okkyung Choi 3,4, and Seong Hwan Moon 4 1 School of Computer
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 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 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 informationDETERMINING MAXIMUM/MINIMUM VALUES FOR TWO- DIMENTIONAL MATHMATICLE FUNCTIONS USING RANDOM CREOSSOVER TECHNIQUES
DETERMINING MAXIMUM/MINIMUM VALUES FOR TWO- DIMENTIONAL MATHMATICLE FUNCTIONS USING RANDOM CREOSSOVER TECHNIQUES SHIHADEH ALQRAINY. Department of Software Engineering, Albalqa Applied University. E-mail:
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 informationTelecommunication and Informatics University of North Carolina, Technical University of Gdansk Charlotte, NC 28223, USA
A Decoder-based Evolutionary Algorithm for Constrained Parameter Optimization Problems S lawomir Kozie l 1 and Zbigniew Michalewicz 2 1 Department of Electronics, 2 Department of Computer Science, Telecommunication
More informationA Particle Swarm Optimization Algorithm with Path Relinking for the Location Routing Problem
J Math Model lgor (2008) 7:59 78 DOI 10.1007/s10852-007-9073-6 Particle Swarm Optimization lgorithm with Path Relinking for the Location Routing Problem Yannis Marinakis Magdalene Marinaki Received: 5
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 informationA Computation Time Comparison of Self-Organising Migrating Algorithm in Java and C#
A Computation Time Comparison of Self-Organising Migrating Algorithm in Java and C# JAN KOLEK 1, PAVEL VAŘACHA 2, ROMAN JAŠEK 3 Tomas Bata University in Zlin Faculty of Applied Informatics nam. T.G..Masaryka
More informationLOW AND HIGH LEVEL HYBRIDIZATION OF ANT COLONY SYSTEM AND GENETIC ALGORITHM FOR JOB SCHEDULING IN GRID COMPUTING
LOW AND HIGH LEVEL HYBRIDIZATION OF ANT COLONY SYSTEM AND GENETIC ALGORITHM FOR JOB SCHEDULING IN GRID COMPUTING Mustafa Muwafak Alobaedy 1, and Ku Ruhana Ku-Mahamud 2 2 Universiti Utara Malaysia), Malaysia,
More informationSci.Int.(Lahore),28(1), ,2016 ISSN ; CODEN: SINTE 8 201
Sci.Int.(Lahore),28(1),201-209,2016 ISSN 1013-5316; CODEN: SINTE 8 201 A NOVEL PLANT PROPAGATION ALGORITHM: MODIFICATIONS AND IMPLEMENTATION Muhammad Sulaiman 1, Abdel Salhi 2, Eric S Fraga 3, Wali Khan
More informationDS-PSO: Particle Swarm Optimization with Dynamic and Static Topologies
Bowdoin College Bowdoin Digital Commons Honors Projects Student Scholarship and Creative Work 5-2017 DS-PSO: Particle Swarm Optimization with Dynamic and Static Topologies Dominick Sanchez mingosanch@gmail.com
More informationDiscrete Particle Swarm Optimization for TSP based on Neighborhood
Journal of Computational Information Systems 6:0 (200) 3407-344 Available at http://www.jofcis.com Discrete Particle Swarm Optimization for TSP based on Neighborhood Huilian FAN School of Mathematics and
More informationOptimistic Path using Artificial Bee Colony Approach
International Journal of Information & Computation Technology. ISSN 0974-2239 Volume 4, Number 13 (2014), pp. 1255-1261 International Research Publications House http://www. irphouse.com Optimistic Path
More informationInternational Journal of Information Technology and Knowledge Management (ISSN: ) July-December 2012, Volume 5, No. 2, pp.
Empirical Evaluation of Metaheuristic Approaches for Symbolic Execution based Automated Test Generation Surender Singh [1], Parvin Kumar [2] [1] CMJ University, Shillong, Meghalya, (INDIA) [2] Meerut Institute
More informationJob Shop Scheduling Problem (JSSP) Genetic Algorithms Critical Block and DG distance Neighbourhood Search
A JOB-SHOP SCHEDULING PROBLEM (JSSP) USING GENETIC ALGORITHM (GA) Mahanim Omar, Adam Baharum, Yahya Abu Hasan School of Mathematical Sciences, Universiti Sains Malaysia 11800 Penang, Malaysia Tel: (+)
More informationDistributed Probabilistic Model-Building Genetic Algorithm
Distributed Probabilistic Model-Building Genetic Algorithm Tomoyuki Hiroyasu 1, Mitsunori Miki 1, Masaki Sano 1, Hisashi Shimosaka 1, Shigeyoshi Tsutsui 2, and Jack Dongarra 3 1 Doshisha University, Kyoto,
More informationA Modified PSO Technique for the Coordination Problem in Presence of DG
A Modified PSO Technique for the Coordination Problem in Presence of DG M. El-Saadawi A. Hassan M. Saeed Dept. of Electrical Engineering, Faculty of Engineering, Mansoura University, Egypt saadawi1@gmail.com-
More informationQuick Combinatorial Artificial Bee Colony -qcabc- Optimization Algorithm for TSP
Quick Combinatorial Artificial Bee Colony -qcabc- Optimization Algorithm for TSP 97 Beyza Gorkemli Department of Computer Engineering Erciyes University Kayseri, TURKEY bgorkemli@erciyes.edu.tr Abstract
More informationA THREAD BUILDING BLOCKS BASED PARALLEL GENETIC ALGORITHM
www.arpapress.com/volumes/vol31issue1/ijrras_31_1_01.pdf A THREAD BUILDING BLOCKS BASED PARALLEL GENETIC ALGORITHM Erkan Bostanci *, Yilmaz Ar & Sevgi Yigit-Sert SAAT Laboratory, Computer Engineering Department,
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 informationET-based Test Data Generation for Multiple-path Testing
2016 3 rd International Conference on Engineering Technology and Application (ICETA 2016) ISBN: 978-1-60595-383-0 ET-based Test Data Generation for Multiple-path Testing Qingjie Wei* College of Computer
More informationNumerical Experiments with a Population Shrinking Strategy within a Electromagnetism-like Algorithm
Numerical Experiments with a Population Shrinking Strategy within a Electromagnetism-like Algorithm Ana Maria A. C. Rocha and Edite M. G. P. Fernandes Abstract This paper extends our previous work done
More informationAn Evolutionary Algorithm for Minimizing Multimodal Functions
An Evolutionary Algorithm for Minimizing Multimodal Functions D.G. Sotiropoulos, V.P. Plagianakos and M.N. Vrahatis University of Patras, Department of Mamatics, Division of Computational Mamatics & Informatics,
More informationSIMULATION APPROACH OF CUTTING TOOL MOVEMENT USING ARTIFICIAL INTELLIGENCE METHOD
Journal of Engineering Science and Technology Special Issue on 4th International Technical Conference 2014, June (2015) 35-44 School of Engineering, Taylor s University SIMULATION APPROACH OF CUTTING TOOL
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 information