In addition to hybrid swarm intelligence algorithms, another way for an swarm intelligence algorithm to have balance between an swarm intelligence
|
|
- Samson Walters
- 5 years ago
- Views:
Transcription
1 xiv Preface Swarm intelligence algorithms are a collection of population-based stochastic optimization algorithms which are generally categorized under the big umbrella of evolutionary computation algorithms. There is no standard definition that defines a swarm intelligence algorithm and differentiates it from other population-based optimization algorithms. In the literature, there are a lot of swarm intelligence algorithms which have been reported and introduced, for example, ant colony optimization, artificial immune system, bacterial foraging optimization algorithm, bee colony optimization algorithm, brain storm optimization algorithm, firefly optimization algorithm, firework optimization algorithm, fish school search optimization algorithm, particle swarm optimization algorithm, shuffled frog-leaping algorithm, to name just a few. Generally speaking, a swarm intelligence algorithm is a population-based stochastic optimization algorithm that is inspired or motivated by the collective behavior of small and simple objects such as the ants in ant colony optimization algorithm, fishes in fish school search optimization algorithms, and birds in particle swarm optimization algorithm. Collectively and cooperatively, a population of individuals in a swarm intelligence algorithm, each of which represents a possible solution to the problem to be solved, is updated or generated iteration over iteration in the hope that the better and better population of individuals will be generated over iterations and finally a good enough solution will be found. Originally, a swarm optimization algorithm usually was designed or introduced to be simple in concept which was at least one reason that the swarm intelligence algorithm attracted attentions initially. With the successes and wide studies of a swarm intelligence algorithm, it has been and will be applied to solve more and more complicated problems which are at least difficult, if not impossible, for traditional algorithms such as hill-climbing algorithms to solve. As a consequence of solving more complicated optimization problems, the swarm intelligence algorithm itself has been under extensive modifications and studies. One tendency of researches on swarm intelligence algorithms is to combine an original or a modified swarm intelligence algorithm with another optimization algorithm in the hope that the hybrid algorithm can be better than any component algorithm itself in general or in solving one specific problem. One common goal of a hybrid algorithm is to have one component algorithm focus on global search while another component algorithm focuses on local search so that the hybrid algorithm has better balance between exploration capability and exploitation capability and therefore has more capability to avoid premature convergence and to find better and good enough solution(s). One example is the complementary cyber swarm intelligence introduced in the chapter A Complementary Cyber Swarm Algorithm in this book. This is also one of common purposes of researches on memetic algorithms which, in the aspects of swarm intelligence researches, combine a swarm intelligence algorithm with another swarm intelligence algorithm or one of other non-swarm intelligence algorithms.
2 In addition to hybrid swarm intelligence algorithms, another way for an swarm intelligence algorithm to have balance between an swarm intelligence algorithm s exploration capability and exploitation capability is to design the swarm intelligence algorithm to be able to converge to a local minimum or to diverge from a local minimum when it is necessary. For example, a swarm intelligence algorithm needs to have the capability to converge so that the swarm intelligence algorithm can converge to (or find) a good enough solution. But for complicated, nonlinear, especially multimodal problems, it is easy for an swarm intelligence algorithm to be trapped into a local minimum, therefore, the swarm intelligence algorithm needs to be able to jump out of the local minimum, that is, to diverge from the local minimum so that the swarm intelligence algorithm can start another round of convergent search process in the hope to find a better and good enough solution. One way to design a swarm intelligence algorithm to be able in either convergent search process or divergent search process is to establish a relationship between at least one parameter of the swarm intelligence algorithm and the search process of the swarm intelligence algorithm. For example, for a parameter of an swarm intelligence algorithm, if the parameter is within one range of values, the search process of the swarm intelligence algorithm is in convergent search process while in another range of values, the search process is in divergent search process, then the swarm intelligence algorithm can be put into either convergent or divergent search process by simply changing the value of the parameter. A good example is the chaos-enhanced firefly algorithm proposed in the chapter Chaos-Enhanced Firefly Algorithm with Automatic Parameter Tuning. Another way is to design a swarm intelligence algorithm to have both convergent operation and divergent operation during each iteration so that the search process of the swarm intelligence algorithm involves both convergent search operation and divergent search operation; therefore, intuitively, the swarm intelligence algorithm has higher potential to escape from local minima which represent not-good enough solutions. A good example is the brain storm optimization algorithm discussed in the chapter An Optimization Algorithm Based on Brainstorming Process in this book. Another trend for the research on swarm intelligence algorithms is to specially design or modify a swarm intelligence algorithm to be able to solve one kind of optimization problems more effectively and/ or more efficiently. For example, for the multi-objective optimization problems with constraints, special care could and should be taken for particle swarm optimization algorithms to solve them, such as how to take care of feasible and infeasible solutions. Another example is to use an optimization algorithm to solve optimization problems with boundary constraints. Special techniques have to be designed and implemented to take care of boundary constraints violations. Also, certain performance metrics could be defined and measured to monitor the search process of the optimization algorithm, such as the population diversity defined in particle swarm optimization algorithms. One major purpose of the research on swarm intelligence algorithms is to be able to apply these swarm intelligence algorithms to solve real-world problems. So far, swarm intelligence algorithms have been applied to successfully solve wide range of application problems. Successful applications of these swarm intelligence algorithms are the major vitality to keep the researches on swarm intelligence algorithms to be active and attract attentions from wider and wider range of applications. Therefore, the application of swarm intelligence algorithms to effectively and efficiently solve real-world problems is another important and critical research direction on swarm intelligence in addition to the research direction on swarm intelligence algorithms. xv
3 xvi WHAT IS THE BOOK ABOUT? This book volume does not intend to cover all aspects of research on swarm intelligence algorithms and their applications. It is a snapshot of current research on swarm intelligence algorithms and their applications which are included and/or covered in the 2011 issues of the International Journal of Swarm Intelligence Research. It may reflect a research tendency in the research areas of swarm intelligence algorithms. This book volume can be a good reference book for researchers who have been conducting research work on swarm intelligence algorithms or at least are interested in the research areas of swarm intelligence algorithms. It can also be used as a reference book for graduate students and senior undergraduate students who are going to conduct researches on swarm intelligence algorithms and/or their applications. ORGANIZATION OF THE BOOK This book volume consists of 14 chapters which are organized into two sections for the convenience of reference. Section 1 includes 8 chapters which are about current research works on swarm intelligence algorithms. Section 2 includes 6 chapters which are about the applications of swarm intelligence algorithms. Section 1: Swarm Intelligence Algorithms Scatter search algorithm was introduced by Glover in It is a population-based search algorithm originally designed for solving general integer problems. The scatter search algorithm can be implemented as an integration of five basic components, which are: diversification-generation component, improvement component, reference-set update component, subset-generation component, and solution-combination component. The reference-set is usually a smaller subset of the population of individuals with better qualities, and plays a central role in the algorithm. Path relinking was also introduced by Glover in It used the neighborhood space instead of Euclidean space in scatter search. The search algorithms can be considered as forming path between and/or beyond existing solutions. In the chapter Scatter Search and Path Relinking: A Tutorial on the Linear Arrangement Problem, Marti et al. reviewed the scatter search algorithm and path relinking process, and applied them to solve the minimum linear arrangement problem, which is a NP-hard combinatorial optimization problem, in order to illustrate how the algorithms work. The authors also discussed the relationship between scatter search/path relinking, and the recent particle swarm optimization algorithm introduced by Kennedy and Eberhart in 1995 through pointing out the differences and similarities between them. Hybrid algorithms combine one algorithm with another algorithm by taking advantage of strength of all involved algorithms. A cyber swarm algorithm is a combination of particle swarm optimization algorithm with scatter search algorithm embedded with path relinking process. It intends to make the particle swarm optimization algorithm more effective than those without combing scatter search with path relinking process by better balancing between intensification and diversification. In the chapter A Complementary Cyber Swarm Intelligence, Yin et al. proposed a complementary cyber swarm algorithm which makes use a different set of ideas from the Tabu search in addition to the scatter search
4 with path relinking process. It can better utilize the history search information to guide or restrict the search for better exploitation of the search area and for better manipulation of adaptive memory which consists of best solutions observed throughout search process derived from Tabu search. Experimental results demonstrated that the proposed complementary cyber swam algorithm performs better than the original cyber swarm intelligence and the standard PSO proposed by Clerc at least with regards to the benchmark functions tested. Max-cut problem is a NP-hard optimization problem. Its objective is to find a cut in a graph which has the maximum sum of the edge weights. Path relinking method involves a pair of solutions, an initiating solution and a guiding solution, and generates a set of solutions that lie on a path between or beyond the pair of solutions. Global equilibrium search algorithm generates a set of initial solutions at each different temperature value, which is similar to that in the simulated annealing method, for other local search methods as starting solutions. In the Chapter Path Relinking Scheme for the Max-Cut Problem within Global Equilibrium Search, Shylo and Shylo propose a hybrid search algorithm which embeds the path relinking method into the global equilibrium search algorithm to take advantages from both approaches, that is, maintaining high quality of solutions by the global equilibrium search algorithm, and combining existing high quality solutions to form a new enhanced solution by path relinking method. The proposed hybrid algorithm was applied to solve max-cut problem. Experimental results show that the proposed approach can provide solutions with better quality within less time. In the chapter Path Relinking with Multi-Start Tabu Search for the Quadratic Assignment Problem, James and Rego proposed a hybrid optimization algorithm for solving quadratic assignment problem. Their proposed algorithm is a combination of path relinking algorithm and the Tabu search method. Path relinking algorithm forms a path between an initiating solution and one or more guiding solutions by selecting high quality solutions from a set of best solutions obtained in the history of search process, which is similar to the concept of personal, local, and/or global best positions in a particle swarm optimization algorithm. Tabu search is a neighborhood search technique which can provide higher quality solutions from a starting solution. By selecting different tabu restriction and aspiration criteria, the Tabu search method can make a trade-off between intensification (exploitation) and diversification (exploration). In this chapter, the authors utilized a Tabu search with multi-starts as the improvement method component in the path relinking algorithm to further improve the solutions on the path between an initiating solution and guiding solutions. The outcome solutions with better quality from the Tabu search in return will be used as new initiating and guiding solutions by the path relinking methods. The proposed algorithm was tested on the quadratic assignment problem (QAP) which is a classical NP-hard combinatorial optimization problem. In addition, the authors analyzed different strategies and their effectiveness on solving QAP problems with different landscapes, and therefore provided a guidance to integrate these components to design more effective QAP algorithms. The authors also compared the proposed algorithm with the particle swarm optimization algorithm and pointed out their differences and similarities. For most real world multi-objective optimization problems, there are constraints which define the feasibility of potential solutions. The only feasible solutions are acceptable solutions, and infeasible solutions are those which need to be avoided. There are several existing techniques to handle constraints. For example, 1) higher priority is given to constraints so that feasible solution areas will more likely be searched compared with infeasible solution areas; 2) genetic operators are designed to allow only feasible solutions surviving into next generation; 3) dominance principles are defined to rank all individuals including both feasible and infeasible solutions so that higher rank solutions will be preferred over generations; et cetera. These existing constraints handling techniques have been adopted by multi- xvii
5 xviii objective particle swarm optimization (MOPSO) algorithms to handle multi-objective problems with constraints. In the chapter A Multiobjective Particle Swarm Optimizer for Constrained Optimization, the authors proposed to convert constraints into one extra objective the purpose of which is to have zero constraint violation after going through an evolutionary process. For example, a k-objective optimization problem with constraints will be converted into a (k+1)-objective optimization problem without constraints. The additional objective is defined as the constraint violation which is then a minimization objective function. The essential goals of the proposed MOPSO are 1) to search for feasible solutions through guiding obtained infeasible solutions towards feasible solutions over generations; 2) to converge to feasible optimal solution or Pareto front eventually. In order to achieve the above goals, the proposed constrained MOPSO modified a standard MOPSO in the following aspects, 1) a rank-constraint violation indicator and a feasibility ration are defined for the step of updating particles personal best memory; 2) two fixed size archives are designed to hold feasible global best solutions and infeasible global best solutions, respectively so that the infeasible solutions can be used as bridges to explore feasible solution areas; 3) the global best is selected equally from the above two archives and by applying tournament selection with the use of dynamic crowing distance values; 4) the particles are updated by taking consideration of the constraint violation and the feasibility ratio; 5) applying both uniform mutation and Gaussian mutation operations. Simulation results on the benchmark functions illustrated that the proposed MOPSO is highly competitive by comparing with other three existing algorithms, i.e., NSGA- II, GZHW, and WTY algorithms. When a particle swarm optimization algorithm applies to solve a multimodal problem, premature convergence may happen. The designs of various particles swarm optimization algorithms for multimodal problems have to take and have taken this into consideration. This consideration may be also necessary for designing particle swarm optimization algorithms for unimodal problems. For example, for a unimodal problem with boundary constraints, premature convergence may occur if boundary constraints are handled improperly. In the chapter Experimental Study on Boundary Constraints Handling in Particle Swarm Optimization: From Population Diversity Perspective Cheng et al. experimentally studied boundary constraints handling techniques in particle swarm optimization algorithms with different topology structures. In this chapter, population diversity, which is a way to measure the distribution of particles in the search space, is utilized to monitor the search process of particle swarm optimization algorithms with different topology structures and different boundary handling techniques. The topology structure of a particle swarm optimization algorithm determines the information propagation method and speed. A good particle swarm optimization algorithm generally should possess a good balance between its exploration capability and exploitation capability over its entire search process. The topology structure of a particle swarm optimization algorithm determines the information propagation method and speed, therefore different boundary handling technique may be required for a particle swarm optimization algorithm with a different topology structure. The topology structures studied in the chapter include star structure, ring structure, four cluster structure, and von Neumann structure. The boundary constraints handling techniques studied include classical strategy, deterministic strategy, stochastic strategy, and modified stochastic strategy. Experimental results and observations revealed the tendency of particles exploration capability and exploitation capability during the search process. For example, a deterministic boundary handling technique may improve the search performance of the particle swarm optimization algorithm with ring, four clusters, or Von Neumann structure, but not the star structure; Stochastic boundary handling technique can have good exploration capability, and therefore, by further including the method of resetting particles in a small or decreased region, the particle swarm optimization algo-
6 rithm will also retain good exploitation ability so that better performance can be achieved by the particle swarm optimization algorithm. In general, from the search tendency revealed by the population diversity, a more effective and efficient particle swarm optimization algorithm could be designed for solving an optimization problem by considering, say, boundary handling technique and topology structure together. Firefly optimization algorithm is a population-based algorithm which is inspired by flashing behavior of fireflies. Like other swarm intelligence algorithms, premature convergence may occur in firefly optimization algorithm, and firefly optimization algorithm may be trapped in any local minima which is not a good enough solution to the problem to be solved. A critical feature for an optimization algorithm to have is to have the capability to escape from local minimum, therefore to have more chances to search other local minima and eventually find at least a local minima, if not a global optima, which represents a good enough solution to the problem to be solved. Traditionally, an optimization algorithm is designed to have the ability to avoid instability or chaotic behavior. In the chapter Chaos-Enhanced Firefly Algorithm with Automatic Parameter Tuning, Yang analyzed the original firefly optimization algorithm and observed that by changing a parameter of the simplified firefly algorithm s equation with a single agent (individual), chaotic behavior can be observed. It is then reasonable to believe that chaotic behavior should appear in the original firefly optimization algorithm by changing its parameter. As a consequence, the firefly optimization algorithm can enter either a stable and convergent search process or a chaotic and divergent search process by intensively controlling or adjusting this parameter, therefore, the firefly optimization algorithm can be modified to interchangeably enter either convergent search process or divergent search process. That means at least theoretically the firefly optimization algorithm can be made to balance between its exploration capability and exploitation capability. In the chapter, the author further discussed the automatic parameter tuning for the proposed chaos-enhanced firefly optimization algorithm. There are a lot of swarm intelligence algorithms reported in the literature so far, such as particle swarm optimization algorithm, ant colony optimization algorithm, fish school search optimization algorithm, bacterial foraging optimization algorithm, firework optimization algorithm, and firefly optimization algorithm, to name just a few. Most of these swarm intelligence algorithms are inspired by objects with low level intelligence at individual level, for example, birds in particle swarm optimization algorithm, ants in ant colony optimization algorithm, fishes in fish school search optimization algorithm, et cetera. The collective collaboration of these objects with low level intelligence inspired the designs of these optimization algorithms, which have shown good search capability. It is natural and intuitive to expect that an optimization algorithm inspired by the collective collaboration of human being should be at least competitive with, if not superior to, these swarm intelligence algorithms inspired by the collective collaboration of these objects with low level intelligence, because human being are the most intelligent animal in this world. In the chapter An Optimization Algorithm Based on Brainstorming Process, Shi proposed a new population-based stochastic optimization algorithm called the brain storm optimization algorithm, which is inspired by the human being brainstorming process. Brainstorming process is often utilized by a group of people to brain storm good ideas to solve problems that is very difficult, if not impossible, for a single person to solve. In the chapter, Shi first introduced one type of brainstorming process, which is then modeled. The brainstorming process model is then standardized and abstracted as a flow chart based on which two versions of brain storm optimization algorithms are designed and implemented. A brain storm optimization algorithm basically consists of two kind major operations within each iteration: the clustering operation and the individual updating operation. The clustering operation focuses more on convergence of the search process while the individual generation operation focuses xix
7 xx more on divergence of search process. In other words, each iteration of the brain storm optimization algorithm involves both expansion operation and contraction operation. The two versions of brain storm optimization algorithms are tested on ten benchmark functions. The experimental results validated and illustrated the effectiveness and efficiency of the proposed brain storm optimization algorithms. Furthermore, in the chapter, two measurement metrics are defined: the average inter-cluster distance and the inter-cluster diversity. The average inter-cluster distance measures and/or monitors the distribution of cluster centers, while the inter-cluster diversity can be looked as a measurement of information entropy for the population of individuals in the brain storm optimization algorithm. The two metrics can be further utilized to monitor and control the search process of a brain storm optimization algorithm so that better performed brain storm optimization algorithm can be achieved. Section 2: Swarm Intelligence Applications In applications such as text mining, web classification, etc., there are huge amount of data items which have been and will be continually collected. Furthermore, each data item represents a point in a highdimensional space. For example, in web classification, each web can be represented by a vector of occurrence frequencies of all words that are possible to occur in any web page. These high-dimensional data vectors together form a data matrix which usually is a sparse matrix. Therefore, for the web classification problem, a good way is to greatly reduce its dimension through low-rank approximation approaches. Most commonly used low rank approximation approaches are singular value decomposition, principal component analysis, factor analysis, independent components analysis, and multidimensional scaling, to name just a few. Among them, singular value decomposition and principal component analysis approaches provide best approximation in the sense that Frobenius norm is the smallest. However, the low rank approximations obtained by singular value decomposition and principal component analysis contain elements with both positive and negative values. For many applications, negative values in a low rank approximation are not meaningful; therefore, a low rank approximation with all non-negative elements are sought, called non-negative matrix factorization (NMF). One goal of NMF as in the web classification is to reduce dimensionality so that the classification task can be easier to achieve, and at the same time, the classification accuracy can be higher. Another more general goal of NMF is to find a good enough non-negative matrix approximate for large sparse matrix such as that generated in the web classification application which usually will be modeled as an optimization problem with nonlinear, no-convex, discontinuous, and multimodal objective function. The population-base algorithms such as swarm intelligence algorithms are good choices to solve this kind of optimization problems. In the chapter Swarm Intelligence for Non-Negative Matrix Factorization, Janecek and Tan utilized five different population-based algorithms as the NMF approaches, which are: particle swarm optimization algorithm, genetic algorithm, fish school search algorithm, differential evolution, and firework algorithm. Among them, three are swarm intelligence algorithms. To improve convergence speed and increase classification accuracy, two optimization strategies for initialization and iterative update are designed and implemented in the five population-based optimization algorithms. A watchman route problem (WRP) is a problem that is to find the shortest route in a polygon with holes under the condition that all points inside the polygon are visible from the route. The generalized watchman route problem is a problem that mobile robot operator should find the shortest route for the robot to oversee the whole area with holes. Both the WRP and generalized WAP problems are NP-hard problems. Ant colony optimization algorithm is a nature-inspired optimization algorithm that was ab-
8 stracted and modeled from what ants do. Simulated ants intend to find the shortest path by following the path that has the stronger smell of pheromone. In the chapter How Ants Can Efficiently Solve the Generalized Watchman Route Problem, Paduch and Sapiecha proposed to use ant colony optimization algorithm to solve generalized watchman route problem. Image segmentation is a problem to label every pixel of an image so that the image can be simplified or be changed into a different image which is more meaningful and easier to understand. Fuzzy C-Means algorithm is a clustering algorithm that is widely used for image segmentation. Bacterial foraging optimization algorithm is a stochastic optimization algorithm that is motivated by the bacterial foraging behavior of E. coli. In the chapter Image Segmentation Based on Bacterial Foraging and FCM Algorithm, Mo and Yin proposed a hybrid algorithm, which combines the bacterial foraging optimization algorithm and fuzzy c-means algorithm to solve the image segmentation problems. Image segmentation problem is first represented as an optimization problem. Then the fuzzy-c-means algorithm is used to solve the optimization problem, and the bacterial foraging optimization algorithm is used to reinforce the global search capability of fuzzy c-means algorithm so that it can overcome the original fuzzy c-means algorithm s poor global search capability, and therefore can avoid its converging into local minima. The proposed hybrid algorithm is tested on several image segmentation problems. Experimental results illustrated the good performance of the proposed algorithm. Frequency assignment problem (FAP) is a problem to assign frequency to transmitters in a wireless communication network with at most acceptable interference among channels. Due to the limited available radio spectrum, FAP is a difficult, challenging, and practical problem. FAP will usually be represented as a strongly NP-hard optimization problem which optimization algorithms are designed to solve. In the chapter Minimum Span Frequency Assignment Based on a Multiagent Evolutionary Algorithm, Liu et al. proposed a hybrid algorithm, which is a combination of multi-agent system and evolutionary algorithm, to solve minimum span FAP problems the objective of which is to minimize the required frequency spectrum to meet a given level of reception quality over the network. Agents live in a lattice-like environment while evolutionary algorithm is utilized to evolve the agents behaviors so that to increase their energies, which correspond to better frequency assignment with minimum span. The proposed algorithm was tested on T-coloring problems, which is very closely related to the FAP problems, with different sizes and Philadelphia benchmark for FAPs. Experimental results illustrated the good performance of the proposed algorithm. The control of a nuclear reactor usually is based on data from a set of sensors. In order to control the nuclear system, which can be modeled as a nonlinear system, the control system needs to be reliable, robust, and stable, which means the control system needs to be a redundant control system in order to be able to detect and react to sensors failures quickly. One way to add redundancy is using hardware redundancy, for example, with redundant sensors. One possible problem with the redundant sensor strategy is that the lifetime expectation for all sensors is similar, therefore with one sensor fails, the other sensors are also like to fail soon. The other way is to add detect system to detect any possible failure and react to the detected failure. In the chapter Design of Robust Approach for Failure Detection in Dynamic Control Systems, Zaki Ei-Far proposed a robust instrument fault detection (IFD) algorithm based on a modified immune mechanism based evolutionary algorithm. Based on the proposed IFD algorithm, a fault diagnosis logic system is further created on the purpose to be able to determine on line optimal control action, quick fault detection, and controller structure reconfigurations. Through a sampling time, cycles of genetic operators are performed to ensure the capability of the proposed algorithm. The proposed IFD algorithm is applied to the control system of a nonlinear nuclear power reactor to illustrate the xxi
9 xxii performance of the proposed algorithm. Experimental results showed that the designed fault diagnosis logic system is capable of detecting the fault and reconfiguring the controller system under situations with system parameters uncertainties and noisy data. In applications such as surveillance operations, automated lawn mowing, and automated vacuum cleaning, distributed area coverage using multi-robot system is an important research topic in which multiple robots are teamed up to cover and/or explore an environment which may be initially unknown. Numerous area coverage algorithms exist to solve this kind of coverage problems in which usually, the entire environment should be covered or explored by at least one robot. For most existing coverage techniques, they consider the coverage problem independently, for example, each robot performs its action individually, while in reality, there are numerous different scenarios out there. For example, robots may be equipped with different sensors, and therefore, have different functionalities. Several robots with different functionalities should team up to perform one single task. Therefore for this kind of task, a more efficient solution is to consider the coverage problem together with the multi-robot formation problem. In the chapter Effects of Multi-Robot Team Formations on Distributed Area Coverage, Dasgupta, et al. combined the multi-robot formation techniques and area coverage techniques together so that an initially unknown environment can be efficiently covered by maintaining effective team formation of multiple robots. The authors theoretically analyzed their approach and conducted extensive experiments on the Webots robotic simulation platform in addition to using physical robots within an indoor environment. Yuhui Shi Xi an Jiaotong-Liverpool University, China
OPTIMIZATION EVOLUTIONARY ALGORITHMS. Biologically-Inspired and. Computer Intelligence. Wiley. Population-Based Approaches to.
EVOLUTIONARY OPTIMIZATION ALGORITHMS Biologically-Inspired and Population-Based Approaches to Computer Intelligence Dan Simon Cleveland State University Wiley DETAILED TABLE OF CONTENTS Acknowledgments
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 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 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 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 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 *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 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 informationMETAHEURISTICS. Introduction. Introduction. Nature of metaheuristics. Local improvement procedure. Example: objective function
Introduction METAHEURISTICS Some problems are so complicated that are not possible to solve for an optimal solution. In these problems, it is still important to find a good feasible solution close to the
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 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 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 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 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 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 informationNon-deterministic Search techniques. Emma Hart
Non-deterministic Search techniques Emma Hart Why do local search? Many real problems are too hard to solve with exact (deterministic) techniques Modern, non-deterministic techniques offer ways of getting
More informationA study of hybridizing Population based Meta heuristics
Volume 119 No. 12 2018, 15989-15994 ISSN: 1314-3395 (on-line version) url: http://www.ijpam.eu ijpam.eu A study of hybridizing Population based Meta heuristics Dr.J.Arunadevi 1, R.Uma 2 1 Assistant Professor,
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 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 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 informationA Survey of Parallel Social Spider Optimization Algorithm based on Swarm Intelligence for High Dimensional Datasets
International Journal of Computational Intelligence Research ISSN 0973-1873 Volume 13, Number 9 (2017), pp. 2259-2265 Research India Publications http://www.ripublication.com A Survey of Parallel Social
More informationMulti-Objective Optimization using Evolutionary Algorithms
Multi-Objective Optimization using Evolutionary Algorithms Kalyanmoy Deb Department of Mechanical Engineering, Indian Institute of Technology, Kanpur, India JOHN WILEY & SONS, LTD Chichester New York Weinheim
More informationPROBLEM FORMULATION AND RESEARCH METHODOLOGY
PROBLEM FORMULATION AND RESEARCH METHODOLOGY ON THE SOFT COMPUTING BASED APPROACHES FOR OBJECT DETECTION AND TRACKING IN VIDEOS CHAPTER 3 PROBLEM FORMULATION AND RESEARCH METHODOLOGY The foregoing chapter
More informationA Survey of Solving Approaches for Multiple Objective Flexible Job Shop Scheduling Problems
BULGARIAN ACADEMY OF SCIENCES CYBERNETICS AND INFORMATION TECHNOLOGIES Volume 15, No 2 Sofia 2015 Print ISSN: 1311-9702; Online ISSN: 1314-4081 DOI: 10.1515/cait-2015-0025 A Survey of Solving Approaches
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 informationMulti-Objective Optimization using Evolutionary Algorithms
Multi-Objective Optimization using Evolutionary Algorithms Kalyanmoy Deb Department ofmechanical Engineering, Indian Institute of Technology, Kanpur, India JOHN WILEY & SONS, LTD Chichester New York Weinheim
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 informationApplication of Emerging Metaheuristics in Power System Field
Application of Emerging Metaheuristics in Power System Field Dr.ir. J.L. Rueda Torres 26 th June 2015 1 Outline 1. Problem complexity 2. Why metaheuristics? 3. Emerging algorithms 4. Applications 2 1 Problem
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 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 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 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 informationModule 1 Lecture Notes 2. Optimization Problem and Model Formulation
Optimization Methods: Introduction and Basic concepts 1 Module 1 Lecture Notes 2 Optimization Problem and Model Formulation Introduction In the previous lecture we studied the evolution of optimization
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 informationDERIVATIVE-FREE OPTIMIZATION
DERIVATIVE-FREE OPTIMIZATION Main bibliography J.-S. Jang, C.-T. Sun and E. Mizutani. Neuro-Fuzzy and Soft Computing: A Computational Approach to Learning and Machine Intelligence. Prentice Hall, New Jersey,
More informationComparative Study of Meta-heuristics Optimization Algorithm using Benchmark Function
International Journal of Electrical and Computer Engineering (IJECE) Vol. 7, No. 3, June 2017, pp. 1643~1650 ISSN: 2088-8708, DOI: 10.11591/ijece.v7i3.pp1643-1650 1643 Comparative Study of Meta-heuristics
More informationOptimized Algorithm for Particle Swarm Optimization
Optimized Algorithm for Particle Swarm Optimization Fuzhang Zhao Abstract Particle swarm optimization (PSO) is becoming one of the most important swarm intelligent paradigms for solving global optimization
More informationEscaping Local Optima: Genetic Algorithm
Artificial Intelligence Escaping Local Optima: Genetic Algorithm Dae-Won Kim School of Computer Science & Engineering Chung-Ang University We re trying to escape local optima To achieve this, we have learned
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 informationModel Parameter Estimation
Model Parameter Estimation Shan He School for Computational Science University of Birmingham Module 06-23836: Computational Modelling with MATLAB Outline Outline of Topics Concepts about model parameter
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 informationA new improved ant colony algorithm with levy mutation 1
Acta Technica 62, No. 3B/2017, 27 34 c 2017 Institute of Thermomechanics CAS, v.v.i. A new improved ant colony algorithm with levy mutation 1 Zhang Zhixin 2, Hu Deji 2, Jiang Shuhao 2, 3, Gao Linhua 2,
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 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 informationKyrre Glette INF3490 Evolvable Hardware Cartesian Genetic Programming
Kyrre Glette kyrrehg@ifi INF3490 Evolvable Hardware Cartesian Genetic Programming Overview Introduction to Evolvable Hardware (EHW) Cartesian Genetic Programming Applications of EHW 3 Evolvable Hardware
More informationCT79 SOFT COMPUTING ALCCS-FEB 2014
Q.1 a. Define Union, Intersection and complement operations of Fuzzy sets. For fuzzy sets A and B Figure Fuzzy sets A & B The union of two fuzzy sets A and B is a fuzzy set C, written as C=AUB or C=A OR
More informationArtificial bee colony algorithm with multiple onlookers for constrained optimization problems
Artificial bee colony algorithm with multiple onlookers for constrained optimization problems Milos Subotic Faculty of Computer Science University Megatrend Belgrade Bulevar umetnosti 29 SERBIA milos.subotic@gmail.com
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 informationLuo, W., and Li, Y. (2016) Benchmarking Heuristic Search and Optimisation Algorithms in Matlab. In: 22nd International Conference on Automation and Computing (ICAC), 2016, University of Essex, Colchester,
More informationCHAPTER 1 INTRODUCTION
1 CHAPTER 1 INTRODUCTION 1.1 OPTIMIZATION OF MACHINING PROCESS AND MACHINING ECONOMICS In a manufacturing industry, machining process is to shape the metal parts by removing unwanted material. During the
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 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 informationNon-convex Multi-objective Optimization
Non-convex Multi-objective Optimization Multi-objective Optimization Real-world optimization problems usually involve more than one criteria multi-objective optimization. Such a kind of optimization problems
More informationParameter Estimation of PI Controller using PSO Algorithm for Level Control
Parameter Estimation of PI Controller using PSO Algorithm for Level Control 1 Bindutesh V.Saner, 2 Bhagsen J.Parvat 1,2 Department of Instrumentation & control Pravara Rural college of Engineering, Loni
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 informationThesis Submitted for the degree of. Doctor of Philosophy. at the University of Leicester. Changhe Li. Department of Computer Science
Particle Swarm Optimization in Stationary and Dynamic Environments Thesis Submitted for the degree of Doctor of Philosophy at the University of Leicester by Changhe Li Department of Computer Science University
More informationPre-requisite Material for Course Heuristics and Approximation Algorithms
Pre-requisite Material for Course Heuristics and Approximation Algorithms This document contains an overview of the basic concepts that are needed in preparation to participate in the course. In addition,
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 informationTitle: A memory-integrated artificial bee algorithm for heuristic optimisation
Title: A memory-integrated artificial bee algorithm for heuristic optimisation Name: T. Bayraktar This is a digitised version of a dissertation submitted to the University of Bedfordshire. It is available
More informationOptimization of Makespan and Mean Flow Time for Job Shop Scheduling Problem FT06 Using ACO
Optimization of Makespan and Mean Flow Time for Job Shop Scheduling Problem FT06 Using ACO Nasir Mehmood1, Muhammad Umer2, Dr. Riaz Ahmad3, Dr. Amer Farhan Rafique4 F. Author, Nasir Mehmood is with National
More informationMulti-Objective Discrete Particle Swarm Optimisation Algorithm for. Integrated Assembly Sequence Planning and Assembly Line Balancing
Multi-Objective Discrete Particle Swarm Optimisation Algorithm for Integrated Assembly Sequence Planning and Assembly Line Balancing Mohd Fadzil Faisae Ab Rashid 1, 2, Windo Hutabarat 1 and Ashutosh Tiwari
More informationA Firework Algorithm for Solving Capacitated Vehicle Routing Problem
A Firework Algorithm for Solving Capacitated Vehicle Routing Problem 1 Noora Hani Abdulmajeed and 2* Masri Ayob 1,2 Data Mining and Optimization Research Group, Center for Artificial Intelligence, Faculty
More informationACO and other (meta)heuristics for CO
ACO and other (meta)heuristics for CO 32 33 Outline Notes on combinatorial optimization and algorithmic complexity Construction and modification metaheuristics: two complementary ways of searching a solution
More informationArgha 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 informationAn evolutionary annealing-simplex algorithm for global optimisation of water resource systems
FIFTH INTERNATIONAL CONFERENCE ON HYDROINFORMATICS 1-5 July 2002, Cardiff, UK C05 - Evolutionary algorithms in hydroinformatics An evolutionary annealing-simplex algorithm for global optimisation of water
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 informationEvolutionary Computation Algorithms for Cryptanalysis: A Study
Evolutionary Computation Algorithms for Cryptanalysis: A Study Poonam Garg Information Technology and Management Dept. Institute of Management Technology Ghaziabad, India pgarg@imt.edu Abstract The cryptanalysis
More informationSelf-Organization in Sensor and Actor Networks
Self-Organization in Sensor and Actor Networks Falko Dressler University of Erlangen, Germany BICENTINNIAL BICINTINNIAL John Wiley & Sons, Ltd Contents Foreword Preface About the Author List of Abbreviations
More informationInternational Conference on Modeling and SimulationCoimbatore, August 2007
International Conference on Modeling and SimulationCoimbatore, 27-29 August 2007 OPTIMIZATION OF FLOWSHOP SCHEDULING WITH FUZZY DUE DATES USING A HYBRID EVOLUTIONARY ALGORITHM M.S.N.Kiran Kumara, B.B.Biswalb,
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 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 informationPartial Opposition-based Learning Using Current Best Candidate Solution
Partial Opposition-based Learning Using Current Best Candidate Solution Sedigheh Mahdavi Department of Electrical, Computer, and Software Engineering University of Ontario Institute of Technology (UOIT)
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). Webots simulation software. Webots User Guide Webots Reference Manual. The
More informationInternational Journal of Current Research and Modern Education (IJCRME) ISSN (Online): & Impact Factor: Special Issue, NCFTCCPS -
TO SOLVE ECONOMIC DISPATCH PROBLEM USING SFLA P. Sowmya* & Dr. S. P. Umayal** * PG Scholar, Department Electrical and Electronics Engineering, Muthayammal Engineering College, Rasipuram, Tamilnadu ** Dean
More informationExploration vs. Exploitation in Differential Evolution
Exploration vs. Exploitation in Differential Evolution Ângela A. R. Sá 1, Adriano O. Andrade 1, Alcimar B. Soares 1 and Slawomir J. Nasuto 2 Abstract. Differential Evolution (DE) is a tool for efficient
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 informationREAL-CODED GENETIC ALGORITHMS CONSTRAINED OPTIMIZATION. Nedim TUTKUN
REAL-CODED GENETIC ALGORITHMS CONSTRAINED OPTIMIZATION Nedim TUTKUN nedimtutkun@gmail.com Outlines Unconstrained Optimization Ackley s Function GA Approach for Ackley s Function Nonlinear Programming Penalty
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 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 informationA Combinatorial Algorithm for The Cardinality Constrained Portfolio Optimization Problem
0 IEEE Congress on Evolutionary Computation (CEC) July -, 0, Beijing, China A Combinatorial Algorithm for The Cardinality Constrained Portfolio Optimization Problem Tianxiang Cui, Shi Cheng, and Ruibin
More informationMachine Learning for Software Engineering
Machine Learning for Software Engineering Introduction and Motivation Prof. Dr.-Ing. Norbert Siegmund Intelligent Software Systems 1 2 Organizational Stuff Lectures: Tuesday 11:00 12:30 in room SR015 Cover
More informationEvolutionary Methods for State-based Testing
Evolutionary Methods for State-based Testing PhD Student Raluca Lefticaru Supervised by Florentin Ipate University of Piteşti, Romania Department of Computer Science Outline Motivation Search-based software
More informationBI-OBJECTIVE EVOLUTIONARY ALGORITHM FOR FLEXIBLE JOB-SHOP SCHEDULING PROBLEM. Minimizing Make Span and the Total Workload of Machines
International Journal of Mathematics and Computer Applications Research (IJMCAR) ISSN 2249-6955 Vol. 2 Issue 4 Dec - 2012 25-32 TJPRC Pvt. Ltd., BI-OBJECTIVE EVOLUTIONARY ALGORITHM FOR FLEXIBLE JOB-SHOP
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 informationOptimization Techniques for Design Space Exploration
0-0-7 Optimization Techniques for Design Space Exploration Zebo Peng Embedded Systems Laboratory (ESLAB) Linköping University Outline Optimization problems in ERT system design Heuristic techniques Simulated
More informationParticle Swarm Optimization to Solve Optimization Problems
Particle Swarm Optimization to Solve Optimization Problems Gregorio Toscano-Pulido and Carlos A. Coello Coello Evolutionary Computation Group at CINVESTAV-IPN (EVOCINV) Electrical Eng. Department, Computer
More informationAn Evolutionary Algorithm for the Multi-objective Shortest Path Problem
An Evolutionary Algorithm for the Multi-objective Shortest Path Problem Fangguo He Huan Qi Qiong Fan Institute of Systems Engineering, Huazhong University of Science & Technology, Wuhan 430074, P. R. China
More information1 Lab 5: Particle Swarm Optimization
1 Lab 5: Particle Swarm Optimization This laboratory requires the following: (The development tools are installed in GR B0 01 already): C development tools (gcc, make, etc.) Webots simulation software
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 informationEvolutionary Algorithms. CS Evolutionary Algorithms 1
Evolutionary Algorithms CS 478 - Evolutionary Algorithms 1 Evolutionary Computation/Algorithms Genetic Algorithms l Simulate natural evolution of structures via selection and reproduction, based on performance
More informationPart II. Computational Intelligence Algorithms
Part II Computational Intelligence Algorithms 126 Chapter 5 Population-based Single-objective Algorithms One bee makes no swarm. French proverb This chapter provides an overview of two CI algorithms that
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 informationAnt Colony Optimization: A New Stochastic Solver for Modeling Vapor-Liquid Equilibrium Data
Ant Colony Optimization: A New Stochastic Solver for Modeling Vapor-Liquid Equilibrium Data Jorge Adan Fernández-Vargas 1, Adrián Bonilla-Petriciolet *, Juan Gabriel Segovia- Hernández 1 and Salvador Hernández
More informationTABLE OF CONTENTS CHAPTER NO. TITLE PAGE NO. ABSTRACT LIST OF TABLES LIST OF FIGURES LIST OF SYMBOLS AND ABBREVIATIONS
ix TABLE OF CONTENTS CHAPTER NO. TITLE PAGE NO. ABSTRACT LIST OF TABLES LIST OF FIGURES LIST OF SYMBOLS AND ABBREVIATIONS v xiv xvi xvii 1. INTRODUCTION TO WIRELESS NETWORKS AND ROUTING PROTOCOLS 1 1.1
More informationRobust Descriptive Statistics Based PSO Algorithm for Image Segmentation
Robust Descriptive Statistics Based PSO Algorithm for Image Segmentation Ripandeep Kaur 1, Manpreet Kaur 2 1, 2 Punjab Technical University, Chandigarh Engineering College, Landran, Punjab, India Abstract:
More informationCOLLEGE TIMETABLE SCHEDULING USING OPTIMISTIC HYBRID SCHEDULING ALGORITHM
COLLEGE TIMETABLE SCHEDULING USING OPTIMISTIC HYBRID SCHEDULING ALGORITHM. B.S.Yelure 1, Y.D.Chavhan 2 Assistant Professor, Information Tech Dept., G.C.E.Karad, India 1. Assistant Professor, Information
More informationAn Introduction to Evolutionary Algorithms
An Introduction to Evolutionary Algorithms Karthik Sindhya, PhD Postdoctoral Researcher Industrial Optimization Group Department of Mathematical Information Technology Karthik.sindhya@jyu.fi http://users.jyu.fi/~kasindhy/
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 Review on Artificial Bee Colony Algorithms and Their Applications to Data Clustering
BULGARIAN ACADEMY OF SCIENCES CYBERNETICS AND INFORMATION TECHNOLOGIES Volume 17, No 3 Sofia 2017 Print ISSN: 1311-9702; Online ISSN: 1314-4081 DOI: 10.1515/cait-2017-0027 A Review on Artificial Bee Colony
More informationMeta Heuristic and Evolutionary Algorithms for Engineering Optimization
Meta Heuristic and Evolutionary Algorithms for Engineering Optimization Wiley Series in Operations Research and Management Science A complete list of the titles in this series appears at the end of this
More information