Distributed Optimization of Feature Mining Using Evolutionary Techniques

Size: px
Start display at page:

Download "Distributed Optimization of Feature Mining Using Evolutionary Techniques"

Transcription

1 Distributed Optimization of Feature Mining Using Evolutionary Techniques Karthik Ganesan Pillai University of Dayton Computer Science 300 College Park Dayton, OH Dale Emery Courte University of Dayton Computer Science 300 College Park Dayton, OH Abstract Pattern recognition is a resource intensive task which includes feature extraction, feature selection and classification. Optimizing any of these steps can significantly improve performance. Evolutionary computation methods are utilized to address optimization problems that explore a huge, nonlinear and multidimensional search space. In this paper a new distributed framework is introduced which greatly reduces the computation time of such systems, concentrating on feature extraction and feature selection which will operate parallel. This software architecture incorporates Mother Nature s most powerful tools, evolution and parallelism, in its design, while maintaining robustness. Keywords: evolutionary computation, genetic algorithms, feature extraction, classification, distributed architecture. 1. Introduction In this paper the problem of extracting features from data and selecting the best subset of those features for classification of the objects represented by the data is approached using a distributed architecture. It is an extensive and computationally intensive task, where optimization plays an important role. Training machines to learn by themselves about the patterns present in data consumes enormous amount of time when a single machine is used. Optimization of pattern recognition problems is considered very difficult, and is highly multidimensional in nature. In considering this resource intensive task, this paper addresses it by introducing a distributed framework that will greatly reduce the computation at each unit while maintaining the robustness of design. Evolutionary computation methods are techniques that are developed to provide optimal solutions to such problems. This architecture uses evolutionary computation techniques to optimize the solution obtained by such systems. Extraction and selection of meaningful features plays an important role in the accuracy and efficiency of the classifiers. Extracting features is the process of synthesizing meaningful features from the original data. Such features will help the classifier to be more accurate and efficient. Feature selection is the process of selecting the best set of features from a given set. This is a search problem, where the performance of the classifier on the given feature set may be exhibited by a fitness function that is used to assess the validity of that subset. Here, a supervised evolutionary learning method is used to extract useful and meaningful features from the data. 2. Approach We introduce a distributed evolutionary computation method to evolve both feature extractors and a feature selector. Based on a feature set created by distributed feature agents, we use a k-nearest neighbor method to classify the objects in the training data. This drives the fitness function for parallel genetic algorithms (GA) that select the best set of features from the given set of features. These parallel GA s increase the efficiency and enhance the search capabilities of the system proposed in [9]. Distributed feature agents operate independently in a distributed environment. These feature agents deposit extracted features in a central feature mine. Parallel distributed GA s then determine feature selections from sets of features stored in the mine. Feedback based on competition between the distributed feature

2 selectors will guide the distributed agents to refine their search. Upon receiving the feedback, feature agents will adjust to search for features either locally or in some new location. This process continues until a user defined threshold is reached. The best evolved feature set will be used in testing the final system configuration against hold-out test data. 3. Pattern Recognition Pattern recognition can be defined as process acting on raw data and actions taken upon the data to identify what it represents. It is a multi-step process in which steps include collecting data which is to be classified; building models on the data which is used to train the system, synthesizing features from the data and finally classifying the data based on its category using these new, extracted features. To classify a pattern in data we need to identify certain features in the data that will help us to recognize those patterns. Feature extraction is the process of synthesizing useful features from the data that is used by the classifiers to recognize the patterns in the data. Reducing the dimensionality of features in data can greatly aid the classifier in terms of both efficiency and accuracy. 4. Evolutionary Computation Effective optimization of computational systems has been accomplished through forms of evolutionary computation [9]. Evolutionary computation is a family of computational approaches that tries to mimic the biological process of evolution in computer programs. In this approach the system is initialized with an initial population of candidate solutions, then reproduction is performed through two important operators mutation and cross-over. A fitness function is used to evaluate the performance of each of the candidate solutions, then based on the fitness of the candidate solution selection is performed. Several different types of selection methods exist, to name a few Roulette wheel selection, Tournament selection and Truncation selection. Fitness landscape is a term used frequently in these methods that envisions the fitness of all candidate solutions as a mountain range, in which the maximum value in this landscape corresponds to the optimized value of the best found candidate solution. 5. EC techniques in Pattern Recognition Evolutionary computation approaches have been used for extraction and selection of features from the data; primarily genetic algorithms and genetic programming have been used. Feature extraction for rule-based machine learning architectures for image recognition and texture classification was explored. In classification, if the training data set is limited, then even the useful features can cause loss of accuracy. This is known as curse of dimensionality. This occurs because the amount of computations required for pattern recognition and the amount of data required for training systems grows exponentially with the increase of the dimensionality of the feature space [1]. Genetic algorithms have been used in feature selection method by Siedlecki and Sklanski. In this method genetic algorithm was used to find out a vector with one s and zeros which is used by knn classifier that gives the error rate below some threshold value and at the same time it has minimum number of one s, since each one in the vector corresponds to a feature used [2]. Later Punch and Kelly & Davis extended this work by using genetic algorithm in feature extraction. In this work they used a weight vector instead of just one s and zeros. This weight vector consists of real values to be multiplied with each feature resulting in a new feature vector that is linearly related to the original one. Genetic algorithms were used to find a weight vector that minimizes the error rate of knn classifier [3, 4]. Michael Raymer et.al extended this work to use a masking genetic algorithm for simultaneous selection and extraction of features. In this approach a masking vector with ones and zeros which is used along with weight vector. Both weight vector and masking vector to multiply with each feature, by this way they can maintain the weight vector value while disengaging a feature by having a zero in the masking vector at its bit position [5]. 6. Distributed Approaches in Evolutionary Computation Since evolution in biological systems is parallel in nature, some level of parallelism is incorporated into genetic algorithms. Moreover this will greatly enhance the computation power such systems as genetic algorithms [7] are computationally intensive. Distributed computation of genetic algorithms contributes to

3 keeping variety of chromosomes to avoid immature convergence. Therefore parallel and distributed execution of genetic algorithms has the possibility to obtain high speed computation and high quality solution. Generally in these approaches the population is divided in to sub populations each representing a GA system. Chromosomes of such sub groups are transferred to other groups this is known as Island model genetic algorithms. This causes coupling of genetic materials across the different sub systems which will prevent local optimum in any sub population.. Co-evolution of competing solutions is sometimes used in parallel evolutionary systems. In this method different species compete with each other to evolve an optimized solution. 7. System Design Our system is divided into three principal components: feature agents, a feature mine and parallel distributed GA s. Figure 1 represents system architecture with all the components. Number of distributed agents and parallel GA s are totally independent of each other. Each parallel GA searches a population of features that is extracted from different search space of individual distributed agents. This allows parallel GA s to search in wide range of search space at same time and selects the best features from that space. Feedback from feature mine allows distributed feature agents to explore the search space more effectively, which drives the entire system to more optimal solutions. Feature agents are independent distributed components which extract features from the given training data and deposit them into the feature mine. Figure 2 illustrates an overview of algorithm used in feature agents. The feature mine maintains all these extracted features colleted from each feature agents separately in a table data structure. Figure 4 illustrates an overview of algorithm used in feature mine. Parallel distributed GA s retrieve features from table, deposited by feature agents in the feature mine and selects a subset of features from it. After selecting a subset of features from the given set using a genetic algorithm, these parallel distributed GA s deposit a bit string representing the best found feature subset in the feature mine. The feature mine selects the best feature subset among the deposited feature subset and stores it. The feature agents, waiting for the report from the feature mine, queries the feature miner about the best-found subset of features. Upon receiving the best subset feature from feature mine, these feature agents check whether the features deposited by them are selected. If they find that the features deposited by them in the feature mine are selected then they perform micro mutations in their search but leave the selected feature in place. Through these micro mutations, the agents continue to extract features from the dataset and deposit the features extracted into feature mine. Agents that find none of their extracted features have been selected perform a macro mutation that directs their search to new areas of the search space. Figure 3 illustrates the algorithm used in parallel GA s. This cycle continues until a user defined threshold is reached. The best evolved feature subset is used in testing the final system configuration against hold-out test data. 8. System Implementation Our first distributed feature mining system has been developed and tested using JAVA 2 SDK, MATLAB 7.0, and CORBA. Feature agents and parallel GA s are implemented using MATLAB and PR Tools for pattern recognition [11]. Feature mine uses CORBA server with JAVA implementation. All these components are connected using JAVA objects with CORBA s distributed applications technology. CORBA is used to implement the data mine server, as it provides facilities to incorporate several language components to interoperate with another. This system is developed and tested using both WINDOWS PC s and SUN workstations.

4 Figure 1 System Architecture 1. Initialize the system, load training data, and register to the feature mine. 2. Compute the dimension of area randomly and extract features from those areas. 3. Deposit all the extracted features from the feature mine. 4. Wait for the report from the feature mine. 5. Check to see if any feature column is selected in feature mine in previous epoch; if yes then do mine a minor mutation on the on all the columns except for the one which is selected. Else do a random change in the dimensions of the area and then extract features from these patches. 6. Deposit extracted features from the feature mine. 7. Repeat steps 4 to 6 until maximum number of epoch is reached. 8. On the final epoch use the dimension of patches which is used in the last epoch, extract features from the test data and deposit in the feature mine. 9. The agents are now configured with final system configuration, and these patches will be used against actual data. Figure 2 Feature agent 1. Initialize the GA s with maximum population size, mutation rate, maximum number of generations, and maximum number of epochs and register to the feature mine. 2. Wait for the trigger from the feature mine. 3. Apply mutation operator to produce off springs. 4. Divide the training data into two, one for the training and other for testing. 5. For each chromosome in the population, use k-nearest neighbor method to classify objects in the data. Compute the fitness of chromosomes using the testing data. 6. Inform the feature mine about the best selected features, sort the chromosome in the population and truncate the number of chromosomes in initial population. 7. Do step 2 to 6 until maximum number of epoch is reached. 8. At the maximum epoch, load the test data classify the objects in the data using the best chromosome. Figure 3 Parallel GA s

5 1. Initialize the feature mine. 2. Wait for the distributed agents and parallel GA s to register them with it. 3. Wait for the distributed feature agents to deposit all the features in the table. 4. Trigger the parallel GA s to select the best feature subset in the table. 5. Wait for the parallel GA s to report about the best found feature subset. 6. Report to the distributed agents about the best found feature subset which is waiting for it. 7. Do step 3 to 6 until maximum epoch is reached. 8. Once the final epoch is reached store all the dimensions of patches which will be used for classifying the actual data. Figure 4 Feature mine 9. Experiments In early experiments, the public MSTAR targets dataset was used [8]. This contains collections of X-band SAR imagery of target types is used. It has types of targets, which are T- 72 tank, BMP2 infantry flying vehicle, BTR-70 armored personnel carrier. All these images are taken at an angle of 15 and 17 degree with full aspect coverage and each image is of 128 by 128 pixels in size. Data from this dataset is divided into training data and test data. Training data is chosen in such a way that it has all kind of tanks in different poses. Once the system has reached it final configuration, it is tested against the test data to check the accuracy of the system. Two sets of experiments were conducted with this dataset, using two sampling methods. In method one, training and test data were collected in a sequential order from the dataset, with alternative image file corresponds to training and test data, so that different targets is covered in all poses for both training and test data. In sampling method two, random image files of all the targets were picked up from the dataset. In both the sampling methods one hundred image files of each target is collected, hence three hundred images were used in total for training and testing individually. Parameters used in these experiments are supplied in Tables 1 and 2. Feature agents use a genotype that represents a coordinate position in image, width and height of the patch, which is selected at random in the initial population. For these initial experiments, the feature associated with a patch is simply the average pixel value. Mutation is the only variation operator applied to patches. A random chance of 50 % is used to determine which coordinate or width or height will be changed and the coordinates might increase or decrease in value. In the parallel GA s, mutation is the only operator applied to the population and the chromosome is represented by a bit string one s and zeros. Each bit corresponds to a feature and a one in that position indicates that feature is selected and a zero indicates feature not selected. This differs from a classical GA in which crossover operator is applied to bit strings. For mutation, two positions which are in the range of length of chromosome are selected and all the bit positions in that range are inverted. Population size is doubled for each generation and after calculating the fitness, the best of the population sorted according to their fitness is selected. Population size is reduced back to initial number of chromosomes, using simple truncation selection. During fitness function calculates the error rate that is computed by leave one out method. Test accuracy is determined by classifying each test image based on distances to training images only, using knn with k=3. Table 3 and 4 summarizes the result obtained from both sampling methods. The consistency of results using the two sampling methods demonstrates that the system is not dependent on a specific composition of training images. Table 1 Feature Agent Configuration Maximum Epoch 20 Maximum Features 20 Maximum Movement 10 Minimum width 10 Maximum width 25 Minimum height 10 Maximum height 25 Table 2 Parallel GA Configuration Maximum Epoch 20 Maximum Generation 10 Population Size 20 Mutation Rate 1 Maximum Features 20

6 Table 3 Sampling Method One Results Test Number Training Accuracy Test Accuracy Number of Features Average S.D Figure 5 Sample Feature Patches Table 4 Sampling Method Two Results Test Number Training Accuracy Test Accuracy Number of Features Average S.D BTR BMP2 T72 Figure 6 Sample target Images 10. Conclusion and Future Work: Results obtained from these experiments are comparable to similar experiments using the CHAMP system [6], which evolves cooperating voting classifiers. Exploring the search space in distributed population of candidate solutions proves to be a viable alternative for sequential evolutionary computation techniques that require more computation time. Future work includes possible replacement of the feature mine with more direct communication methods. This prevents the mine from being a bottleneck for network traffic when large volumes of data are handled. 11. Acknowledgements Partial funding was provided for this work by the University of Dayton Research Council, and the Ohio Board of Regents.

7 Thanks also to the University of Dayton Computer Science Department, the Dayton Area Graduate Studies Institute (DAGSI), and Wright State University College of Engineering and Computer Science, for equipment and technical support. 12. References: [1] Xuechuan Wang, Feature Extraction and Dimensionality Reduction in Pattern Recognition and Their Application in Speech Recognition, A Dissertation. Griffith University, [2] W. Siedlecki and J. Sklansky, A note on Genetic Algorithms for Large-Scale Feature Selection, Pattern Recognition Letters, vol. 10, pp , [3] W. F. Punch, E. D. Goodman, M. Pei, L. ChiaShun, P. Hovland, and R. Enbody, Further Research on Feature Selection and Classification Using Genetic Algorithms, International Conference On Genetic Algorithms 93, pp , [4] J. D. Kelly and L. Davis, Hybridizing the Genetic Algorithm and the K Nearest Neighbors Classification Algorithm, Proc. Fourth Inter. Conf. Genetic Algorithms and their Applications (ICGA), pp , [5] Michael L. Raymer, William F. Punch, Erik D. Goodman, Paul C. Sanschagrin, Leslie A. Kuhn, Simultaneous Feature Extraction and Selection Using a Masking Genetic Algorithm. [6] Dale E. Courte, Evolutionary Optimization of Voting Classifiers, Ph.D. Dissertation, Wirght State University, Dayton, OH, [7] J.H Holland, Adaptation in Natural and Artificial systems, University of Michigan Press, [8] MSTAR. [9] T. Back, D.B. Fogel, T. Michaeleevicz. Evolutionary Computation Basic Algorithms And Operators. [10] Dale E. Courte. Evolutionary Feature Mining. Proceedings of the Sixteenth Midwest Artificial Intelligence Cognitive Science Conference [11] PRTOOLS.

Genetic Algorithms for Classification and Feature Extraction

Genetic Algorithms for Classification and Feature Extraction Genetic Algorithms for Classification and Feature Extraction Min Pei, Erik D. Goodman, William F. Punch III and Ying Ding, (1995), Genetic Algorithms For Classification and Feature Extraction, Michigan

More information

Coevolving Functions in Genetic Programming: Classification using K-nearest-neighbour

Coevolving Functions in Genetic Programming: Classification using K-nearest-neighbour Coevolving Functions in Genetic Programming: Classification using K-nearest-neighbour Manu Ahluwalia Intelligent Computer Systems Centre Faculty of Computer Studies and Mathematics University of the West

More information

V.Petridis, S. Kazarlis and A. Papaikonomou

V.Petridis, S. Kazarlis and A. Papaikonomou Proceedings of IJCNN 93, p.p. 276-279, Oct. 993, Nagoya, Japan. A GENETIC ALGORITHM FOR TRAINING RECURRENT NEURAL NETWORKS V.Petridis, S. Kazarlis and A. Papaikonomou Dept. of Electrical Eng. Faculty of

More information

Meta- Heuristic based Optimization Algorithms: A Comparative Study of Genetic Algorithm and Particle Swarm Optimization

Meta- 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 information

Preprocessing of Stream Data using Attribute Selection based on Survival of the Fittest

Preprocessing of Stream Data using Attribute Selection based on Survival of the Fittest Preprocessing of Stream Data using Attribute Selection based on Survival of the Fittest Bhakti V. Gavali 1, Prof. Vivekanand Reddy 2 1 Department of Computer Science and Engineering, Visvesvaraya Technological

More information

Using Genetic Algorithms to Improve Pattern Classification Performance

Using Genetic Algorithms to Improve Pattern Classification Performance Using Genetic Algorithms to Improve Pattern Classification Performance Eric I. Chang and Richard P. Lippmann Lincoln Laboratory, MIT Lexington, MA 021739108 Abstract Genetic algorithms were used to select

More information

Simultaneous Feature Extraction and Selection Using a Masking Genetic Algorithm

Simultaneous Feature Extraction and Selection Using a Masking Genetic Algorithm Simultaneous Feature Extraction and Selection Using a Masking Genetic Algorithm Michael L. Raymer 1,2, William F. Punch 2, Erik D. Goodman 2,3, Paul C. Sanschagrin 1, and Leslie A. Kuhn 1 1 Protein Structural

More information

CHAPTER 5 ENERGY MANAGEMENT USING FUZZY GENETIC APPROACH IN WSN

CHAPTER 5 ENERGY MANAGEMENT USING FUZZY GENETIC APPROACH IN WSN 97 CHAPTER 5 ENERGY MANAGEMENT USING FUZZY GENETIC APPROACH IN WSN 5.1 INTRODUCTION Fuzzy systems have been applied to the area of routing in ad hoc networks, aiming to obtain more adaptive and flexible

More information

Information Fusion Dr. B. K. Panigrahi

Information Fusion Dr. B. K. Panigrahi Information Fusion By Dr. B. K. Panigrahi Asst. Professor Department of Electrical Engineering IIT Delhi, New Delhi-110016 01/12/2007 1 Introduction Classification OUTLINE K-fold cross Validation Feature

More information

1. Introduction. 2. Motivation and Problem Definition. Volume 8 Issue 2, February Susmita Mohapatra

1. Introduction. 2. Motivation and Problem Definition. Volume 8 Issue 2, February Susmita Mohapatra Pattern Recall Analysis of the Hopfield Neural Network with a Genetic Algorithm Susmita Mohapatra Department of Computer Science, Utkal University, India Abstract: This paper is focused on the implementation

More information

CHAPTER 6 HYBRID AI BASED IMAGE CLASSIFICATION TECHNIQUES

CHAPTER 6 HYBRID AI BASED IMAGE CLASSIFICATION TECHNIQUES CHAPTER 6 HYBRID AI BASED IMAGE CLASSIFICATION TECHNIQUES 6.1 INTRODUCTION The exploration of applications of ANN for image classification has yielded satisfactory results. But, the scope for improving

More information

Santa Fe Trail Problem Solution Using Grammatical Evolution

Santa Fe Trail Problem Solution Using Grammatical Evolution 2012 International Conference on Industrial and Intelligent Information (ICIII 2012) IPCSIT vol.31 (2012) (2012) IACSIT Press, Singapore Santa Fe Trail Problem Solution Using Grammatical Evolution Hideyuki

More information

Domain Independent Prediction with Evolutionary Nearest Neighbors.

Domain Independent Prediction with Evolutionary Nearest Neighbors. Research Summary Domain Independent Prediction with Evolutionary Nearest Neighbors. Introduction In January of 1848, on the American River at Coloma near Sacramento a few tiny gold nuggets were discovered.

More information

A GENETIC ALGORITHM FOR CLUSTERING ON VERY LARGE DATA SETS

A GENETIC ALGORITHM FOR CLUSTERING ON VERY LARGE DATA SETS A GENETIC ALGORITHM FOR CLUSTERING ON VERY LARGE DATA SETS Jim Gasvoda and Qin Ding Department of Computer Science, Pennsylvania State University at Harrisburg, Middletown, PA 17057, USA {jmg289, qding}@psu.edu

More information

ISSN: [Keswani* et al., 7(1): January, 2018] Impact Factor: 4.116

ISSN: [Keswani* et al., 7(1): January, 2018] Impact Factor: 4.116 IJESRT INTERNATIONAL JOURNAL OF ENGINEERING SCIENCES & RESEARCH TECHNOLOGY AUTOMATIC TEST CASE GENERATION FOR PERFORMANCE ENHANCEMENT OF SOFTWARE THROUGH GENETIC ALGORITHM AND RANDOM TESTING Bright Keswani,

More information

Scheme of Big-Data Supported Interactive Evolutionary Computation

Scheme of Big-Data Supported Interactive Evolutionary Computation 2017 2nd International Conference on Information Technology and Management Engineering (ITME 2017) ISBN: 978-1-60595-415-8 Scheme of Big-Data Supported Interactive Evolutionary Computation Guo-sheng HAO

More information

Optimization of Association Rule Mining through Genetic Algorithm

Optimization of Association Rule Mining through Genetic Algorithm Optimization of Association Rule Mining through Genetic Algorithm RUPALI HALDULAKAR School of Information Technology, Rajiv Gandhi Proudyogiki Vishwavidyalaya Bhopal, Madhya Pradesh India Prof. JITENDRA

More information

Genetic Model Optimization for Hausdorff Distance-Based Face Localization

Genetic Model Optimization for Hausdorff Distance-Based Face Localization c In Proc. International ECCV 2002 Workshop on Biometric Authentication, Springer, Lecture Notes in Computer Science, LNCS-2359, pp. 103 111, Copenhagen, Denmark, June 2002. Genetic Model Optimization

More information

An Application of Genetic Algorithm for Auto-body Panel Die-design Case Library Based on Grid

An Application of Genetic Algorithm for Auto-body Panel Die-design Case Library Based on Grid An Application of Genetic Algorithm for Auto-body Panel Die-design Case Library Based on Grid Demin Wang 2, Hong Zhu 1, and Xin Liu 2 1 College of Computer Science and Technology, Jilin University, Changchun

More information

Genetic Programming. Charles Chilaka. Department of Computational Science Memorial University of Newfoundland

Genetic Programming. Charles Chilaka. Department of Computational Science Memorial University of Newfoundland Genetic Programming Charles Chilaka Department of Computational Science Memorial University of Newfoundland Class Project for Bio 4241 March 27, 2014 Charles Chilaka (MUN) Genetic algorithms and programming

More information

Automata Construct with Genetic Algorithm

Automata Construct with Genetic Algorithm Automata Construct with Genetic Algorithm Vít Fábera Department of Informatics and Telecommunication, Faculty of Transportation Sciences, Czech Technical University, Konviktská 2, Praha, Czech Republic,

More information

Traffic 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 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 information

A New Selection Operator - CSM in Genetic Algorithms for Solving the TSP

A New Selection Operator - CSM in Genetic Algorithms for Solving the TSP A New Selection Operator - CSM in Genetic Algorithms for Solving the TSP Wael Raef Alkhayri Fahed Al duwairi High School Aljabereyah, Kuwait Suhail Sami Owais Applied Science Private University Amman,

More information

A Genetic Algorithm for Graph Matching using Graph Node Characteristics 1 2

A Genetic Algorithm for Graph Matching using Graph Node Characteristics 1 2 Chapter 5 A Genetic Algorithm for Graph Matching using Graph Node Characteristics 1 2 Graph Matching has attracted the exploration of applying new computing paradigms because of the large number of applications

More information

Neural Network Weight Selection Using Genetic Algorithms

Neural Network Weight Selection Using Genetic Algorithms Neural Network Weight Selection Using Genetic Algorithms David Montana presented by: Carl Fink, Hongyi Chen, Jack Cheng, Xinglong Li, Bruce Lin, Chongjie Zhang April 12, 2005 1 Neural Networks Neural networks

More information

Genetic Algorithms Variations and Implementation Issues

Genetic Algorithms Variations and Implementation Issues Genetic Algorithms Variations and Implementation Issues CS 431 Advanced Topics in AI Classic Genetic Algorithms GAs as proposed by Holland had the following properties: Randomly generated population Binary

More information

A Novel Approach to Planar Mechanism Synthesis Using HEEDS

A Novel Approach to Planar Mechanism Synthesis Using HEEDS AB-2033 Rev. 04.10 A Novel Approach to Planar Mechanism Synthesis Using HEEDS John Oliva and Erik Goodman Michigan State University Introduction The problem of mechanism synthesis (or design) is deceptively

More information

JHPCSN: Volume 4, Number 1, 2012, pp. 1-7

JHPCSN: Volume 4, Number 1, 2012, pp. 1-7 JHPCSN: Volume 4, Number 1, 2012, pp. 1-7 QUERY OPTIMIZATION BY GENETIC ALGORITHM P. K. Butey 1, Shweta Meshram 2 & R. L. Sonolikar 3 1 Kamala Nehru Mahavidhyalay, Nagpur. 2 Prof. Priyadarshini Institute

More information

MODULE 6 Different Approaches to Feature Selection LESSON 10

MODULE 6 Different Approaches to Feature Selection LESSON 10 MODULE 6 Different Approaches to Feature Selection LESSON 10 Sequential Feature Selection Keywords: Forward, Backward, Sequential, Floating 1 Sequential Methods In these methods, features are either sequentially

More information

Malaysian License Plate Recognition Artificial Neural Networks and Evolu Computation. The original publication is availabl

Malaysian License Plate Recognition Artificial Neural Networks and Evolu Computation. The original publication is availabl JAIST Reposi https://dspace.j Title Malaysian License Plate Recognition Artificial Neural Networks and Evolu Computation Stephen, Karungaru; Fukumi, Author(s) Minoru; Norio Citation Issue Date 2005-11

More information

GENETIC ALGORITHM with Hands-On exercise

GENETIC ALGORITHM with Hands-On exercise GENETIC ALGORITHM with Hands-On exercise Adopted From Lecture by Michael Negnevitsky, Electrical Engineering & Computer Science University of Tasmania 1 Objective To understand the processes ie. GAs Basic

More information

Monika Maharishi Dayanand University Rohtak

Monika Maharishi Dayanand University Rohtak Performance enhancement for Text Data Mining using k means clustering based genetic optimization (KMGO) Monika Maharishi Dayanand University Rohtak ABSTRACT For discovering hidden patterns and structures

More information

The k-means Algorithm and Genetic Algorithm

The k-means Algorithm and Genetic Algorithm The k-means Algorithm and Genetic Algorithm k-means algorithm Genetic algorithm Rough set approach Fuzzy set approaches Chapter 8 2 The K-Means Algorithm The K-Means algorithm is a simple yet effective

More information

An Introduction to Evolutionary Algorithms

An 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 information

Research on Applications of Data Mining in Electronic Commerce. Xiuping YANG 1, a

Research on Applications of Data Mining in Electronic Commerce. Xiuping YANG 1, a International Conference on Education Technology, Management and Humanities Science (ETMHS 2015) Research on Applications of Data Mining in Electronic Commerce Xiuping YANG 1, a 1 Computer Science Department,

More information

Grid-Based Genetic Algorithm Approach to Colour Image Segmentation

Grid-Based Genetic Algorithm Approach to Colour Image Segmentation Grid-Based Genetic Algorithm Approach to Colour Image Segmentation Marco Gallotta Keri Woods Supervised by Audrey Mbogho Image Segmentation Identifying and extracting distinct, homogeneous regions from

More information

Multi-objective pattern and feature selection by a genetic algorithm

Multi-objective pattern and feature selection by a genetic algorithm H. Ishibuchi, T. Nakashima: Multi-objective pattern and feature selection by a genetic algorithm, Proc. of Genetic and Evolutionary Computation Conference (Las Vegas, Nevada, U.S.A.) pp.1069-1076 (July

More information

ANTICIPATORY VERSUS TRADITIONAL GENETIC ALGORITHM

ANTICIPATORY VERSUS TRADITIONAL GENETIC ALGORITHM Anticipatory Versus Traditional Genetic Algorithm ANTICIPATORY VERSUS TRADITIONAL GENETIC ALGORITHM ABSTRACT Irina Mocanu 1 Eugenia Kalisz 2 This paper evaluates the performances of a new type of genetic

More information

CHAPTER 2 CONVENTIONAL AND NON-CONVENTIONAL TECHNIQUES TO SOLVE ORPD PROBLEM

CHAPTER 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 information

The Genetic Algorithm for finding the maxima of single-variable functions

The 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 information

Acknowledgments References:

Acknowledgments References: Acknowledgments This work was supported in part by Michigan State University s Center for Microbial Ecology and the Beijing Natural Science Foundation of China. References: [1] U. M. Fayyad, G. Piatetsky-Shapiro,

More information

International Journal of Digital Application & Contemporary research Website: (Volume 1, Issue 7, February 2013)

International 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 information

A NOVEL APPROACH FOR PRIORTIZATION OF OPTIMIZED TEST CASES

A NOVEL APPROACH FOR PRIORTIZATION OF OPTIMIZED TEST CASES A NOVEL APPROACH FOR PRIORTIZATION OF OPTIMIZED TEST CASES Abhishek Singhal Amity School of Engineering and Technology Amity University Noida, India asinghal1@amity.edu Swati Chandna Amity School of Engineering

More information

A Parallel Architecture for the Generalized Traveling Salesman Problem

A Parallel Architecture for the Generalized Traveling Salesman Problem A Parallel Architecture for the Generalized Traveling Salesman Problem Max Scharrenbroich AMSC 663 Project Proposal Advisor: Dr. Bruce L. Golden R. H. Smith School of Business 1 Background and Introduction

More information

Comparative Study of Data Mining Classification Techniques over Soybean Disease by Implementing PCA-GA

Comparative Study of Data Mining Classification Techniques over Soybean Disease by Implementing PCA-GA Comparative Study of Data Mining Classification Techniques over Soybean Disease by Implementing PCA-GA Dr. Geraldin B. Dela Cruz Institute of Engineering, Tarlac College of Agriculture, Philippines, delacruz.geri@gmail.com

More information

Comparison of PSO-Based Optimized Feature Computation for Automated Configuration of Multi-Sensor Systems

Comparison of PSO-Based Optimized Feature Computation for Automated Configuration of Multi-Sensor Systems Comparison of PSO-Based Optimized Feature Computation for Automated Configuration of Multi-Sensor Systems Kuncup Iswandy and Andreas Koenig Institute of Integrated Sensor Systems, University of Kaiserslautern,

More information

AN EVOLUTIONARY APPROACH TO DISTANCE VECTOR ROUTING

AN EVOLUTIONARY APPROACH TO DISTANCE VECTOR ROUTING International Journal of Latest Research in Science and Technology Volume 3, Issue 3: Page No. 201-205, May-June 2014 http://www.mnkjournals.com/ijlrst.htm ISSN (Online):2278-5299 AN EVOLUTIONARY APPROACH

More information

Genetic Algorithms for Vision and Pattern Recognition

Genetic Algorithms for Vision and Pattern Recognition Genetic Algorithms for Vision and Pattern Recognition Faiz Ul Wahab 11/8/2014 1 Objective To solve for optimization of computer vision problems using genetic algorithms 11/8/2014 2 Timeline Problem: Computer

More information

Using Genetic Algorithms to Solve the Box Stacking Problem

Using Genetic Algorithms to Solve the Box Stacking Problem Using Genetic Algorithms to Solve the Box Stacking Problem Jenniffer Estrada, Kris Lee, Ryan Edgar October 7th, 2010 Abstract The box stacking or strip stacking problem is exceedingly difficult to solve

More information

Segmentation of Noisy Binary Images Containing Circular and Elliptical Objects using Genetic Algorithms

Segmentation of Noisy Binary Images Containing Circular and Elliptical Objects using Genetic Algorithms Segmentation of Noisy Binary Images Containing Circular and Elliptical Objects using Genetic Algorithms B. D. Phulpagar Computer Engg. Dept. P. E. S. M. C. O. E., Pune, India. R. S. Bichkar Prof. ( Dept.

More information

GENETIC ALGORITHM VERSUS PARTICLE SWARM OPTIMIZATION IN N-QUEEN PROBLEM

GENETIC 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 information

Unsupervised Feature Selection Using Multi-Objective Genetic Algorithms for Handwritten Word Recognition

Unsupervised Feature Selection Using Multi-Objective Genetic Algorithms for Handwritten Word Recognition Unsupervised Feature Selection Using Multi-Objective Genetic Algorithms for Handwritten Word Recognition M. Morita,2, R. Sabourin 3, F. Bortolozzi 3 and C. Y. Suen 2 École de Technologie Supérieure, Montreal,

More information

Introduction to Genetic Algorithms. Based on Chapter 10 of Marsland Chapter 9 of Mitchell

Introduction to Genetic Algorithms. Based on Chapter 10 of Marsland Chapter 9 of Mitchell Introduction to Genetic Algorithms Based on Chapter 10 of Marsland Chapter 9 of Mitchell Genetic Algorithms - History Pioneered by John Holland in the 1970s Became popular in the late 1980s Based on ideas

More information

Inducing Parameters of a Decision Tree for Expert System Shell McESE by Genetic Algorithm

Inducing Parameters of a Decision Tree for Expert System Shell McESE by Genetic Algorithm Inducing Parameters of a Decision Tree for Expert System Shell McESE by Genetic Algorithm I. Bruha and F. Franek Dept of Computing & Software, McMaster University Hamilton, Ont., Canada, L8S4K1 Email:

More information

CHAPTER 5. CHE BASED SoPC FOR EVOLVABLE HARDWARE

CHAPTER 5. CHE BASED SoPC FOR EVOLVABLE HARDWARE 90 CHAPTER 5 CHE BASED SoPC FOR EVOLVABLE HARDWARE A hardware architecture that implements the GA for EHW is presented in this chapter. This SoPC (System on Programmable Chip) architecture is also designed

More information

Research on time optimal trajectory planning of 7-DOF manipulator based on genetic algorithm

Research on time optimal trajectory planning of 7-DOF manipulator based on genetic algorithm Acta Technica 61, No. 4A/2016, 189 200 c 2017 Institute of Thermomechanics CAS, v.v.i. Research on time optimal trajectory planning of 7-DOF manipulator based on genetic algorithm Jianrong Bu 1, Junyan

More information

Artificial Neural Network Evolutionary Algorithm (ANNEVA) Abstract

Artificial Neural Network Evolutionary Algorithm (ANNEVA) Abstract Artificial Neural Network Evolutionary Algorithm (ANNEVA) Tyler Haugen Dr. Jeff McGough Math and Computer Science Department South Dakota School of Mines and Technology Rapid City, SD 57701 tyler.haugen@mines.sdsmt.edu

More information

Structural Optimizations of a 12/8 Switched Reluctance Motor using a Genetic Algorithm

Structural Optimizations of a 12/8 Switched Reluctance Motor using a Genetic Algorithm International Journal of Sustainable Transportation Technology Vol. 1, No. 1, April 2018, 30-34 30 Structural Optimizations of a 12/8 Switched Reluctance using a Genetic Algorithm Umar Sholahuddin 1*,

More information

Classification of Concept-Drifting Data Streams using Optimized Genetic Algorithm

Classification of Concept-Drifting Data Streams using Optimized Genetic Algorithm Classification of Concept-Drifting Data Streams using Optimized Genetic Algorithm E. Padmalatha Asst.prof CBIT C.R.K. Reddy, PhD Professor CBIT B. Padmaja Rani, PhD Professor JNTUH ABSTRACT Data Stream

More information

Genetic-PSO Fuzzy Data Mining With Divide and Conquer Strategy

Genetic-PSO Fuzzy Data Mining With Divide and Conquer Strategy Genetic-PSO Fuzzy Data Mining With Divide and Conquer Strategy Amin Jourabloo Department of Computer Engineering, Sharif University of Technology, Tehran, Iran E-mail: jourabloo@ce.sharif.edu Abstract

More information

Genetic Algorithm Performance with Different Selection Methods in Solving Multi-Objective Network Design Problem

Genetic Algorithm Performance with Different Selection Methods in Solving Multi-Objective Network Design Problem etic Algorithm Performance with Different Selection Methods in Solving Multi-Objective Network Design Problem R. O. Oladele Department of Computer Science University of Ilorin P.M.B. 1515, Ilorin, NIGERIA

More information

Applied Cloning Techniques for a Genetic Algorithm Used in Evolvable Hardware Design

Applied Cloning Techniques for a Genetic Algorithm Used in Evolvable Hardware Design Applied Cloning Techniques for a Genetic Algorithm Used in Evolvable Hardware Design Viet C. Trinh vtrinh@isl.ucf.edu Gregory A. Holifield greg.holifield@us.army.mil School of Electrical Engineering and

More information

Genetic Algorithm for Dynamic Capacitated Minimum Spanning Tree

Genetic Algorithm for Dynamic Capacitated Minimum Spanning Tree 28 Genetic Algorithm for Dynamic Capacitated Minimum Spanning Tree 1 Tanu Gupta, 2 Anil Kumar 1 Research Scholar, IFTM, University, Moradabad, India. 2 Sr. Lecturer, KIMT, Moradabad, India. Abstract Many

More information

Mobile Agent Routing for Query Retrieval Using Genetic Algorithm

Mobile Agent Routing for Query Retrieval Using Genetic Algorithm 1 Mobile Agent Routing for Query Retrieval Using Genetic Algorithm A. Selamat a, b, M. H. Selamat a and S. Omatu b a Faculty of Computer Science and Information Systems, Universiti Teknologi Malaysia,

More information

A Structural Optimization Method of Genetic Network Programming. for Enhancing Generalization Ability

A Structural Optimization Method of Genetic Network Programming. for Enhancing Generalization Ability International Journal of Engineering Innovation and Management Vol.6, No.2, 2016 A Structural Optimization Method of Genetic Network Programming for Enhancing Generalization Ability Shingo Mabu, Yamaguchi

More information

Self-learning Mobile Robot Navigation in Unknown Environment Using Evolutionary Learning

Self-learning Mobile Robot Navigation in Unknown Environment Using Evolutionary Learning Journal of Universal Computer Science, vol. 20, no. 10 (2014), 1459-1468 submitted: 30/10/13, accepted: 20/6/14, appeared: 1/10/14 J.UCS Self-learning Mobile Robot Navigation in Unknown Environment Using

More information

MDL-based Genetic Programming for Object Detection

MDL-based Genetic Programming for Object Detection MDL-based Genetic Programming for Object Detection Yingqiang Lin and Bir Bhanu Center for Research in Intelligent Systems University of California, Riverside, CA, 92521, USA Email: {yqlin, bhanu}@vislab.ucr.edu

More information

The Study of Genetic Algorithm-based Task Scheduling for Cloud Computing

The Study of Genetic Algorithm-based Task Scheduling for Cloud Computing The Study of Genetic Algorithm-based Task Scheduling for Cloud Computing Sung Ho Jang, Tae Young Kim, Jae Kwon Kim and Jong Sik Lee School of Information Engineering Inha University #253, YongHyun-Dong,

More information

Research Article Path Planning Using a Hybrid Evolutionary Algorithm Based on Tree Structure Encoding

Research 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 information

Selection of Location, Frequency and Orientation Parameters of 2D Gabor Wavelets for Face Recognition

Selection of Location, Frequency and Orientation Parameters of 2D Gabor Wavelets for Face Recognition Selection of Location, Frequency and Orientation Parameters of 2D Gabor Wavelets for Face Recognition Berk Gökberk, M.O. İrfanoğlu, Lale Akarun, and Ethem Alpaydın Boğaziçi University, Department of Computer

More information

EVOLVING LEGO. Exploring the impact of alternative encodings on the performance of evolutionary algorithms. 1. Introduction

EVOLVING LEGO. Exploring the impact of alternative encodings on the performance of evolutionary algorithms. 1. Introduction N. Gu, S. Watanabe, H. Erhan, M. Hank Haeusler, W. Huang, R. Sosa (eds.), Rethinking Comprehensive Design: Speculative Counterculture, Proceedings of the 19th International Conference on Computer- Aided

More information

Artificial Intelligence Application (Genetic Algorithm)

Artificial Intelligence Application (Genetic Algorithm) Babylon University College of Information Technology Software Department Artificial Intelligence Application (Genetic Algorithm) By Dr. Asaad Sabah Hadi 2014-2015 EVOLUTIONARY ALGORITHM The main idea about

More information

FEATURE GENERATION USING GENETIC PROGRAMMING BASED ON FISHER CRITERION

FEATURE GENERATION USING GENETIC PROGRAMMING BASED ON FISHER CRITERION FEATURE GENERATION USING GENETIC PROGRAMMING BASED ON FISHER CRITERION Hong Guo, Qing Zhang and Asoke K. Nandi Signal Processing and Communications Group, Department of Electrical Engineering and Electronics,

More information

Evolutionary Mobile Agents

Evolutionary Mobile Agents Evolutionary Mobile Agents Assistant Barna Iantovics Petru Maior University of Tg. Mureş Abstract. We denote evolutionary agents the agents that can solve problems using methods based on evolutionary computation.

More information

Particle Swarm Optimization applied to Pattern Recognition

Particle Swarm Optimization applied to Pattern Recognition Particle Swarm Optimization applied to Pattern Recognition by Abel Mengistu Advisor: Dr. Raheel Ahmad CS Senior Research 2011 Manchester College May, 2011-1 - Table of Contents Introduction... - 3 - Objectives...

More information

Escaping Local Optima: Genetic Algorithm

Escaping 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 information

Literature Review On Implementing Binary Knapsack problem

Literature Review On Implementing Binary Knapsack problem Literature Review On Implementing Binary Knapsack problem Ms. Niyati Raj, Prof. Jahnavi Vitthalpura PG student Department of Information Technology, L.D. College of Engineering, Ahmedabad, India Assistant

More information

Image Classification and Processing using Modified Parallel-ACTIT

Image Classification and Processing using Modified Parallel-ACTIT Proceedings of the 2009 IEEE International Conference on Systems, Man, and Cybernetics San Antonio, TX, USA - October 2009 Image Classification and Processing using Modified Parallel-ACTIT Jun Ando and

More information

Machine Evolution. Machine Evolution. Let s look at. Machine Evolution. Machine Evolution. Machine Evolution. Machine Evolution

Machine Evolution. Machine Evolution. Let s look at. Machine Evolution. Machine Evolution. Machine Evolution. Machine Evolution Let s look at As you will see later in this course, neural networks can learn, that is, adapt to given constraints. For example, NNs can approximate a given function. In biology, such learning corresponds

More information

NOVEL HYBRID GENETIC ALGORITHM WITH HMM BASED IRIS RECOGNITION

NOVEL HYBRID GENETIC ALGORITHM WITH HMM BASED IRIS RECOGNITION NOVEL HYBRID GENETIC ALGORITHM WITH HMM BASED IRIS RECOGNITION * Prof. Dr. Ban Ahmed Mitras ** Ammar Saad Abdul-Jabbar * Dept. of Operation Research & Intelligent Techniques ** Dept. of Mathematics. College

More information

The Binary Genetic Algorithm. Universidad de los Andes-CODENSA

The Binary Genetic Algorithm. Universidad de los Andes-CODENSA The Binary Genetic Algorithm Universidad de los Andes-CODENSA 1. Genetic Algorithms: Natural Selection on a Computer Figure 1 shows the analogy between biological i l evolution and a binary GA. Both start

More information

Genetic Algorithms. Kang Zheng Karl Schober

Genetic Algorithms. Kang Zheng Karl Schober Genetic Algorithms Kang Zheng Karl Schober Genetic algorithm What is Genetic algorithm? A genetic algorithm (or GA) is a search technique used in computing to find true or approximate solutions to optimization

More information

Mineral Exploation Using Neural Netowrks

Mineral Exploation Using Neural Netowrks ABSTRACT I S S N 2277-3061 Mineral Exploation Using Neural Netowrks Aysar A. Abdulrahman University of Sulaimani, Computer Science, Kurdistan Region of Iraq aysser.abdulrahman@univsul.edu.iq Establishing

More information

Hierarchical Learning Algorithm for the Beta Basis Function Neural Network

Hierarchical Learning Algorithm for the Beta Basis Function Neural Network Third International Conference on Systems, Signals & Devices March 2-24, 2005 Sousse, Tunisia Volume III Communication and Signal Processing Hierarchical Learning Algorithm for the Beta Basis Function

More information

Computational Intelligence

Computational Intelligence Computational Intelligence Module 6 Evolutionary Computation Ajith Abraham Ph.D. Q What is the most powerful problem solver in the Universe? ΑThe (human) brain that created the wheel, New York, wars and

More information

Adaptive Elitist-Population Based Genetic Algorithm for Multimodal Function Optimization

Adaptive Elitist-Population Based Genetic Algorithm for Multimodal Function Optimization Adaptive Elitist-Population Based Genetic Algorithm for Multimodal Function ptimization Kwong-Sak Leung and Yong Liang Department of Computer Science & Engineering, The Chinese University of Hong Kong,

More information

Improving the Efficiency of Fast Using Semantic Similarity Algorithm

Improving the Efficiency of Fast Using Semantic Similarity Algorithm International Journal of Scientific and Research Publications, Volume 4, Issue 1, January 2014 1 Improving the Efficiency of Fast Using Semantic Similarity Algorithm D.KARTHIKA 1, S. DIVAKAR 2 Final year

More information

APPLICATION OF AERIAL VIDEO FOR TRAFFIC FLOW MONITORING AND MANAGEMENT

APPLICATION OF AERIAL VIDEO FOR TRAFFIC FLOW MONITORING AND MANAGEMENT Pitu Mirchandani, Professor, Department of Systems and Industrial Engineering Mark Hickman, Assistant Professor, Department of Civil Engineering Alejandro Angel, Graduate Researcher Dinesh Chandnani, Graduate

More information

Using a genetic algorithm for editing k-nearest neighbor classifiers

Using a genetic algorithm for editing k-nearest neighbor classifiers Using a genetic algorithm for editing k-nearest neighbor classifiers R. Gil-Pita 1 and X. Yao 23 1 Teoría de la Señal y Comunicaciones, Universidad de Alcalá, Madrid (SPAIN) 2 Computer Sciences Department,

More information

A Steady-State Genetic Algorithm for Traveling Salesman Problem with Pickup and Delivery

A Steady-State Genetic Algorithm for Traveling Salesman Problem with Pickup and Delivery A Steady-State Genetic Algorithm for Traveling Salesman Problem with Pickup and Delivery Monika Sharma 1, Deepak Sharma 2 1 Research Scholar Department of Computer Science and Engineering, NNSS SGI Samalkha,

More information

Chapter 14 Global Search Algorithms

Chapter 14 Global Search Algorithms Chapter 14 Global Search Algorithms An Introduction to Optimization Spring, 2015 Wei-Ta Chu 1 Introduction We discuss various search methods that attempts to search throughout the entire feasible set.

More information

A MULTI-OBJECTIVE GENETIC ALGORITHM FOR A MAXIMUM COVERAGE FLIGHT TRAJECTORY OPTIMIZATION IN A CONSTRAINED ENVIRONMENT

A MULTI-OBJECTIVE GENETIC ALGORITHM FOR A MAXIMUM COVERAGE FLIGHT TRAJECTORY OPTIMIZATION IN A CONSTRAINED ENVIRONMENT A MULTI-OBJECTIVE GENETIC ALGORITHM FOR A MAXIMUM COVERAGE FLIGHT TRAJECTORY OPTIMIZATION IN A CONSTRAINED ENVIRONMENT Bassolillo, S.*, D Amato, E.*, Notaro, I.*, Blasi, L.* * Department of Industrial

More information

Fast Efficient Clustering Algorithm for Balanced Data

Fast Efficient Clustering Algorithm for Balanced Data Vol. 5, No. 6, 214 Fast Efficient Clustering Algorithm for Balanced Data Adel A. Sewisy Faculty of Computer and Information, Assiut University M. H. Marghny Faculty of Computer and Information, Assiut

More information

A Genetic Algorithm for Minimum Tetrahedralization of a Convex Polyhedron

A Genetic Algorithm for Minimum Tetrahedralization of a Convex Polyhedron A Genetic Algorithm for Minimum Tetrahedralization of a Convex Polyhedron Kiat-Choong Chen Ian Hsieh Cao An Wang Abstract A minimum tetrahedralization of a convex polyhedron is a partition of the convex

More information

Review of feature selection techniques in bioinformatics by Yvan Saeys, Iñaki Inza and Pedro Larrañaga.

Review of feature selection techniques in bioinformatics by Yvan Saeys, Iñaki Inza and Pedro Larrañaga. Americo Pereira, Jan Otto Review of feature selection techniques in bioinformatics by Yvan Saeys, Iñaki Inza and Pedro Larrañaga. ABSTRACT In this paper we want to explain what feature selection is and

More information

[Kaur, 5(8): August 2018] ISSN DOI /zenodo Impact Factor

[Kaur, 5(8): August 2018] ISSN DOI /zenodo Impact Factor GLOBAL JOURNAL OF ENGINEERING SCIENCE AND RESEARCHES EVOLUTIONARY METAHEURISTIC ALGORITHMS FOR FEATURE SELECTION: A SURVEY Sandeep Kaur *1 & Vinay Chopra 2 *1 Research Scholar, Computer Science and Engineering,

More information

A Web-Based Evolutionary Algorithm Demonstration using the Traveling Salesman Problem

A Web-Based Evolutionary Algorithm Demonstration using the Traveling Salesman Problem A Web-Based Evolutionary Algorithm Demonstration using the Traveling Salesman Problem Richard E. Mowe Department of Statistics St. Cloud State University mowe@stcloudstate.edu Bryant A. Julstrom Department

More information

4/22/2014. Genetic Algorithms. Diwakar Yagyasen Department of Computer Science BBDNITM. Introduction

4/22/2014. Genetic Algorithms. Diwakar Yagyasen Department of Computer Science BBDNITM. Introduction 4/22/24 s Diwakar Yagyasen Department of Computer Science BBDNITM Visit dylycknow.weebly.com for detail 2 The basic purpose of a genetic algorithm () is to mimic Nature s evolutionary approach The algorithm

More information

Regression Test Case Prioritization using Genetic Algorithm

Regression Test Case Prioritization using Genetic Algorithm 9International Journal of Current Trends in Engineering & Research (IJCTER) e-issn 2455 1392 Volume 2 Issue 8, August 2016 pp. 9 16 Scientific Journal Impact Factor : 3.468 http://www.ijcter.com Regression

More information

Generation of Ultra Side lobe levels in Circular Array Antennas using Evolutionary Algorithms

Generation of Ultra Side lobe levels in Circular Array Antennas using Evolutionary Algorithms Generation of Ultra Side lobe levels in Circular Array Antennas using Evolutionary Algorithms D. Prabhakar Associate Professor, Dept of ECE DVR & Dr. HS MIC College of Technology Kanchikacherla, AP, India.

More information