Study of the convergence of Interactive Genetic Algorithm in iterative user s tests: application to car dashboard design

Size: px
Start display at page:

Download "Study of the convergence of Interactive Genetic Algorithm in iterative user s tests: application to car dashboard design"

Transcription

1 Original Article Proceedings of IDMME - Virtual Concept 2010 Bordeaux, France, October 20 22, 2010 HOME Study of the convergence of Interactive Genetic Algorithm in iterative user s tests: application to car dashboard design Emilie Poirson 1, Jean-François Petiot 1, Emmanuel Aliouat 2, Ludivine Boivin 2 and David Blumenthal 2 (1) : IRCCyN (UMR CNRS 6597) Ecole Centrale de Nantes {emilie.poirson, jeanfrancois.petiot}@irccyn.ec-nantes.fr (2) : Renault, Direction de la Recherche, Groupe Perception et Analyse sensorielle DREAM/DTAA, Technocentre Renault, France Abstract: The development of new products that satisfy consumers needs and preferences is a very important issue. In particular, the shape of a product is an important factor in the success or the failure of a product. Since several years, in various research fields, many works are dedicated to the design of shapes by the analysis of user s perception. The work proposed in this paper is based on the use of interactive users assessment tests to enhance creativity, by the way of interactive genetic algorithms (IGA) for capturing users responses. This paper presents a study of the convergence of the IGAs, where the fitness function of a classical GA is replaced by a selection by the userof the well suited products. The paper presents the methodology used to tune the input parameters of the IGAs for a convergence of the results. The proposed application concerns the design of innovative car dashboards and is briefly described. Key words: IGA (Interactive Genetic Algorithm), convergence, shape design, car dashboard 1- Introduction In automotive design, fitting with the expectations of the users is a crucial issue. These expectations can be functional or can concern subjective aspects (sensory or semantics). In particular, the external form of a product is an important factor in the success or the failure [B1], as it conditions the ergonomics, the aesthetics but also the product semantics [KB1]. When industrials address a new specific semantic dimension, such as a need of "innovative dashboard", the challenge for the company is to clearly understand what does the verbatim "innovative" mean for the users, and to translate it in design attributes. On the one hand, consumers know what they want (and what they don t) but they generally are not able to formulate precisely their need in technical terms or to justify their choices according to design attributes [HC1]. On the other hand, companies develop competences in product design but they encounter difficulties to anticipate precisely the consumer's acceptance. Therefore, a key challenge in product design is to analyze consumer's evaluation to extract useful information for product innovation [H1]. Many research works in form design are dedicated to the integration of users response in the design process. In Japan, Kansei engineering is a powerful approach to product design involving user s perceptions [N1] [YA1]. In engineering, the multiattribute utility theory (MAUT) has become the basic theory to express an objective function including consumers perceptions and preferences [LC1]. For example, Interactive genetic algorithms (IGA) are proposed for capturing aesthetics intention of users [GT1]. IGAs are based upon the idea of involving a human as an evaluator in an evolutionary process. The concept is that human interaction with potential designs can be useful when the traditional fitness evaluation used in normal Genetic Algorithms is difficult or impossible to describe with an explicit expression.. Our work is in this context. We propose to use Interactive user assessments in order to extract design attributes corresponding to a specific semantic dimension of a particular product, an innovative car dashboard. The method is based on an iterative selection process by the user of representative models of the dashboard, defined by their CAD model. The choices of the user are interpreted by an Interactive Genetic Algorithm (IGA), and constitute a dynamic way to explore the design space, and possibly converge toward particular products (the product space changes iteratively in regard to the responses of the consumer). In previous papers [PP1, PP2], we presented the general methodology for the study of innovative dashboard by IGA, and the definition of the CAD models. In this paper, we particularly focus on the tuning of the input parameters of the IGA and on the study of the convergence ability of the IGA, according to the size of the design space. This paper is structured as follows: Section 2 gives backgrounds on Interactive Genetic Algorithm and describes its position in the complete study of the car dashboard [PP1] [PP2]. Section 3 presents the methodology used to prove the convergence of the algorithm and to tune the different input parameters. The results are presented in this Section 3, before giving some concluding remarks in section 4. Paper Number -1- Copyright of IDMME - Virtual Concept

2 2- Backgrounds on IGAs 2.1 Interactive Genetic Algorithm Genetic algorithms (GA) are evolutionary optimization methods [G1]. The principle of GA is based on iterative generations of populations of individuals, converging step by step toward solutions which are adapted to the problem. Individuals are described by a set of factors which are coded (their genes). Based on the principle of Darwin s natural evolution theory, the algorithm proceeds to a selection of parents, which will spread in the next generation their genetic dominant heritage, suitable for a desired objective. Classically, the fitness evaluation of the individuals is numerically calculated, ignoring the user. A particular category of GA, called Interactive Genetic Algorithms (IGA) introduces the user in the optimization loop to assess the fitness. At each iteration, the user selects individuals (products) that he/she considers as the most interesting for the desired objective. After a number of iterations (convergence loop), the method may converge toward solutions that satisfy the objective desired by the user. These algorithms are used for example to explore design spaces and to encourage creativity [KP1] [KC1] [YD1] [KP2]. They have the advantage to not require an explicit formulation of the fitness function, given that the user plays this role. For some applications, this advantage is crucial [T1]. 2.2 IGAs in context The key point of the methodology is that the user s assessments are iterative (the user navigate in the design space) and that the IGA may lead to the convergence of the navigation toward representative designs. A computational framework is proposed for the capture of the user s response to a set of virtual designs (Figure 1). It is based on the following stages: 1. Definition of the design factors: design attributes of the dashboard (for example the type of vents) 2. Definition of the design variables: entities that drive the CAD model (for example the depth of the control panel) 3. CAD modelling. Each dashboard is contextualized in the interior of a car. 4. Interactive user s tests. An interactive and iterative assessment test is proposed to a set of users. From a population of dashboards, the user has to select the ones which are the most representative of the considered semantic dimension. The IGA generates new population of dashboards which are iteratively proposed to the user for evaluation. 5. Analysis of the results. The final choices of each user are analyzed in order to uncover common properties and representative attributes. This paper will not describe all the stages of the methodology (made in previous papers [PP1, PP2]). The aim of the paper is to focus on the IGA stage and to describe it in detail. Figure 1: Synoptic of the methodology and definition of the different stages. 2.3 Specification of our IGAs This subsection presents the mechanism of the IGAs used and describes the input parameters of the IGA Encoding of the designs factors Each design factor of the dashboard can take different values defined in advance (called levels ). A particular design is represented by a chromosome containing one level for each factor. The interactive user test is in fact an optimization problem represented by: - variables: the design factors - an objective function: the distance between what a user has in mind as innovative and the representation that are showed. This function has to be minimized. A design is a chromosome of x variables, each variable having a particular number of levels. A variable is represented by a binary string where the length of the string depends on the number of allowed values for the variables IGA process Figure 2 presents the mechanism of the IGAs used. The IGA creates an initial population of designs (by their chromosomes) and presents them to a user, who then selects a subset of these individuals based on preference. Thanks to a roulette method, the selected individuals are favoured to be parents of the following population. A new population is thus created and the hand is given to the user to select again their favourite. This cyclic method runs till the maximum of generation is reached. As in the MOGA-II algorithm (see [PR1]), each chromosome of the population is a parent of the following Paper Number -2- Copyright IDMME - Virtual Concept

3 generation, that gives robustness to the algorithm. Furthermore, the use of directional crossover helps the fastness of the convergence. Chromosome Factor 1 Factor n Final user selection Carlo process, several runs of the tests will be computed so as to study the probability of convergence of the IGA and to propose optimal values for the input parameters of the IGA. Population User Selection Parent 1 Roulette wheel Selection of parent 2 Parent 2 Child Mutation Selection Crossover Figure 2: IGA process to acquire user perception At each iteration, the user selection will be done thanks to a Matlab Interface, as illustrated in figure 3. Figure 4: Example of interface for user selection, applied to 2D geometrical forms. The user has to select maximum 2 individuals, considered as the nearest to the target The efficiency of the IGA is ruled by its operators and by the values of input parameters: - crossover and crossover rate Rc - mutation and mutation rate Rm - selection and selection rate Rc - Roulette wheel rate Rw Let s focus on the reproduction strategy, in the grey square in dotted line on Figure 2. Each parent of the population is chosen one after one. An indicator (i) is randomly chosen between 0 and 1. The crossover rate (Rc), mutation (Rm) or selection (Rs) are real values chosen between 0 and 1 as following: Rc + Rm + Rs = 1 Figure 3: Interface for user selection of innovative dashboard The task of the user is to select 0, 1 or 2 dashboards which are representative (according to his/her point of view) of the semantic term innovative. Several choices are asked to the user, and this process may converge toward particular design attributes of the dashboard. In this paper, in order to study the convergence of the IGA, we used a simpler design problem, defined by 2D symmetrical geometrical forms defined by control points (polylines). The number of points and their coordinates, which constitute the levels, can be variable. Figure 4 presents the case of a form defined by 3 control points (y = 0, y = 1, y = 2) and represents a population of 8 individuals of the design space. In order to study the convergence of the IGA, we also defined explicitly a target in the design space, i.e. a form which is the objective to reach (form in red in figure 4). So, it will be possible to study the ability of the IGA to converge towards predefined forms, and more interesting, to simulate the choices of a user by computing a fitting distance. In this way, like in a Monte The random indicator (rand (i)) is thus compared to Rc, Rm and Rs (Figure 5) and the result gives the operation to make. rand (i) Crossover Mut Selection 0 Rc Rc+Rm 1 Figure 5: Choice of the operation of reproduction. In this case, the chosen operation is crossover. If (rand (i)) < Rc, the operation is a crossover. If Rc<(rand (i)) < Rc+Rm, the operation is a mutation. If (rand (i))> Rc+Rm, the operation is a simple selection. Crossover The crossover is a classical operator of reproduction. It is a one point crossover. This operation needs a second parent, selected randomly in the other individuals. The point of crossing is also randomly chosen between the variables and the binary strings are cut at that point. The two head pieces are swapped that allows the creation of two new Paper Number -3- Copyright IDMME - Virtual Concept

4 individuals (figure 6). Crossover - n strings of x variables are randomly generated, each coded on y bits, n being the number of individuals in the population. Var.n-1 Figure 6: Representation of the crossover Mutation The mutation is an operator that ensures diversity from one generation to the next, which means robustness of the algorithm because the mutation is a tool to explore a bigger part of the design space. Selection The parent selected is directly introduced in the new population, without change. The reproduction is done till reaching the maximum number of generations The input parameters of the IGA The set of input parameters is composed of: - Number of variables : in our case, the variables are the control points of the geometrical form (or the design factors of the dashboard) - Interval in which the variables can take their values - Number of levels of each variables (how many values can take each variable) - Number of individuals in a population - Maximum number of possible selections by the user - Maximum number of generation - Wheel rate : weight given to a selected individual - Crossrate (0<Rc<1) - Mutrate (0<Rm<1-Rc) A given problem is defined by a number of variables, their corresponding levels, a number of individuals and a max. number of generations, and how many selection the user can make. The wheelrate, crossrate and mutrate are difficult to define, they are often defined empirically. This study aims to prove that there are some ideal values of these parameters, depending on the number of variables. The next section presents the protocol used to test the ideal values of these parameters. 3- Study of the convergence of the IGA In order to do study the convergence of the IGA and the tuning process of the Wheelrate, Rc, Rm and Rs, we simulated the selection process by computing a distance between each individual and a given target Var. The first step is to verify that the IGA converges in an acceptable number of generations for a perceptive test: - a target on x variables is defined The evaluation of the fitness is made by the Euclidian distance between each individual and the target. The simulated selected individuals are the 2 closest to the target. Each simulation, with a given combination of input variables is performed 1000 times and the mean is presented (Figure 7). 3 targets, representing problems of different size, have been considered: - a diamond shape: 3 variables on 25 levels - a square : 4 variables on 11 levels - a circle : 21 variables on 10 levels Figure 7 shows the evolution of the distance to the target according to the number of generations considered, for the 3 different cases. The first results is that bigger the problem, slower the convergence. Figure 7: Mean distance (left) and minimum distance (right) between the population and the target (diamond in blue, square in red and circle in green) with Rc = 0.5, Rm = 0.1, Wheelrate = 6. In the application on the dashboard, we envisage to consider 15 variables (factors) with 3 or 4 levels each. So, we can expect a faster convergence than the circle case (green line). 3.1 Roulette-Wheel strategy The interactive genetic algorithm is based on a roulette wheel selection: Higher the wheelrate coefficient, more important the chance to be chosen as a parent for the selected individuals. To determine the best value to attribute to wheelrate, a simulated test was carried out. Most common values were taken for Rm and Rc (respectively 0.1 and 0.5). The wheelrate varied from 1 to 10 (a selected individual can have 1 to 10 times more chance to be parents 2 in the crossover). Each evaluation was done 100 times and averaged.. Paper Number -4- Copyright IDMME - Virtual Concept

5 Figure 8: Simulation results of the mean and the mini Euclidean distance to target for varying wheelrate values Figure 8 shows the influence of wheelrate value on the convergence of the algorithm. With wheelrate (Rw) equal to 1, all the individuals have the same chance to be parent 2. If Rw = 10, the selected individual have 10 times more chance to be the parent 2 of a crossover, that implies a faster convergence: More important the roulette-wheel, faster the convergence. But the Rw has a so big influence that to converge so fast, the exploration of the design space is more local. In order not to be trapped in a local minimum which is not the global minimum, the exploration of the design space must be complete. A compromise must be found between fastness of convergence and exploration of the design space. In our algorithm, every individual is selected as parent 1 and in the case of crossover, a parent 2 is chosen. The influence of Rw is not of the primary (choice of parent 1) but secondary level (case of the crossover). As every individual is parent, the exploration of design space is conserved. The Rw is thus chosen between 5 and 7: it allows a fast convergence without a too reduced exploration of the design space. 3.2 Mutation strategy In our case, the mutation is a modification of one factor in the design space. The value of one factor chosen randomly is also chosen randomly among the other levels. More important the mutation rate, more mutation will occur. The default of the mutation is that, in too large proportions, it can slow down the convergence of the algorithm, jumping at another area of the design space. A compromise must be found on the mutation rate Rm to keep a good convergence when exploring a large design space. Our test was carried out with the value found previously for the roulette-wheel (7) and Crossover was 0.5. Rm evolves from 0 to 0.5 (1 Rc), by step of Figure 9 presents the results. Figure 9: Simulation results of the mean and the mini Euclidean distance to target for varying mutation rate On figure 9, the yellow line is the convergence of the IGA without mutation (Rm = 0). We are looking to values of Rm which improve the convergence of IGA. The four values found are 0.05, 0.1, 0.15, 0.2. A second test, with a Rc of 0.6 confirms these results. For the following of the study, we will thus keep the value of 0.1 or 0.2 for Mutation Rate (Rm). 3.3 Crossover strategy As explained in a previous section, the population is subjected to a mutation, or a selection or a crossover (requiring a second individual as parent). The rate of crossover is between 0 and 1 - (Rm + Rs). The compromise to find is between a large exploration of the design space and the fact to keep selection in the IGA. In the case of finding the ideal model in the first population, if the Rc is very high, the user won t have any luck to find his ideal back in the next populations. We have tested, with Rw= 7 and Rm = 0.1 the evolution of the convergence for variables values of Rc (step of 0.1). Figure 10 presents the results. Figure 10: Simulation results of the mean and the mini Euclidean distance to target for varying crossover rate Paper Number -5- Copyright IDMME - Virtual Concept

6 Figure 10 shows that Crossover is a fundamental operation in IGA (there is no convergence with Rc = 0). Then, there is a sort of threshold around 0.4: from 0.1 to 0.4, evolution is clearly visible for the mean or the mini. From 0.5 to 0.9, the differences are less important and, what s more, the order is different between the mean (entire population) and the mini (one element of the population). The best values seem here to be 0.5, 0.6 or 0.7. It depends also on the type of problem. 4- Conclusion In this paper, we studied the convergence of IGAs, integrated in iterative user s tests. These tests are used to enhance innovation and to understand a given semantic dimension. It will be applied to the particular case of a car dashboard and its innovative character. We described first the mechanism of the IGA implemented. Second, to study the convergence of IGA, we defined problems of different size, according to the number of design factors and their corresponding levels. A simple representation of the product using 2D geometrical shapes, defined by polylines, has been proposed to study the convergence of IGA. Furthermore, in order to obtain robust results according to the convergence, the fitness evaluation of the IGA has been simulated using computed distances to a given predefined target. We showed that for a fairly large number of factors, and for a large number of levels, the IGA converge in a relatively low number of generations. Given that the IGAs must be used in a perceptual test, a relatively small number of generations (<20) must be proposed, so as to not fatigue the user. A compromise must be found between a fast convergence and a large exploration of the design space. To determine the best compromise, this paper showed the process of simulated evaluation and the results of the most suitable values of the input parameters of the IGAs for a simple model (3 variables of 11 levels). The perspectives of this work are to test different settings of the algorithm. For example, the way to select the parents is typical from MOGA. The NSGA (Nondominated Sorting Genetic Algorithm), which do not require each individual to be parent, could be tested. Is the same way, different changes in the definition of mutation could be tested (restrict the mutation to the neighbouring elements). Finally, we will implement our framework to tackle a real design problem, i.e. a problem with 15 variables of 3 or 4 levels (like our real example) and make a link toa CAD model of the dashboard. These perceptual test will be usefull to define the attributes making an "innovative" dashboard for a set of users. 5- Acknowledgments Acknowledgments to Julien Benabes for his substantive hand in programming interface with Matlab. 6- References [B1] Bloch P. Seeking the ideal form: Product Design and Consumer Response. Journal of Marketing, 56(3), pp [G1] Goldberg, D.E., Genetic Algorithms in search, optimization & machine learning, Addison-Wesley Publishing Company, [GT1] Gu Z., Tang M.X., Frazer J.H. Capturing aesthetics intention during interactive evolution. Computer Aided Design 38 (2006), [H1] Hsiao S.W., Concurrent design method for developing a new product International Journal of Industrial Ergonomics 29, [HC1] Hsu S.H., Chuang M.C., Chang C.C., A semantic differential study of designers and users product form perception. International Journal of Industrial Ergonomics 25, [KB1] Krippendorff K. and Butter R. Product semantics: Exploring the symbolic qualities of form The Journal of the Industrial Designers Society of America, Spring, 1984, pp.4-9. [KC1] Hee-Su Kim, Sung-Bae Cho. Engineering Application of interactive genetic algorithm to fashion design. Applications of Artificial Intelligence 13 (2000) [KP1] Kelly J., Papalambros P., Wakefield G. «The Development of a Tool for the Preference Assessment of the Visual Aesthetics of an Object Using Interactive Genetic Algorithms» 9th Generative Art Conference GA2005. [KP2] Kelly, J., Papalambros, P. Y., and Seifert, C. M., "Interactive Genetic Algorithms for Use as Creativity Enhancement Tools", the Proceedings of the AAAI Spring Symposium, Stanford, CA, March 26-28, 2008, pp [LC1] Lewis K., Chen W., Schmidt L., eds, Decision making in Engineering Design, ASME Press, 2006 [N1] Nagamachi M. (1995). Kansei engineering: a new ergonomic consumer-oriented technology for product development. International Journal of Industrial Ergonomics, 15, [PP1] E. Poirson, J-F. Petiot, T. Leroy, E. Aliouat, L. Boivin, D. Blumenthal. Intégration d'évaluations clients pour favoriser l'innovation - Application au design de planches de bord automobile. Proceedings of CONFERE juillet 2009, Marrakech, MAROC. [PP2] E. Poirson, J-F. Petiot, E.Aliouat, L. Boivin and D. Blumenthal. Interactive user tests to Enhance innovation ; application to car Dasboard Design. International conference on kansei engineering and emotion research KEER2010, PARIS, March 2-4, [PR1] Poles S., Rigoni E. and Robic T. MOGA-II performance on noisy optimization problems. Proceedings of the International Conference on Bioinspired Optimization Methods and their Applications, pp Jozef Stefan Institute, Ljubljana, [T1] Takagi H. Interactive evolutionary computation: Fusion of the capabilities of EC optimization and human evaluation. Proceedings of the IEEE, 89(9): , [YA1] Yoshida, S., Aoyama, H. Basic study on trend prediction for style design. DETC Paper Number -6- Copyright IDMME - Virtual Concept

7 ASME International Design Engineering Technical Conferences, Brooklyn, New York, USA. [YD1] Yannou B., Dihlmann M., Awedikian R. Evolutive design of car silhouettes. DETC Proceedings of IDETC/CIE 2008, August 2008, Brooklyn, NY, USA. Paper Number -7- Copyright IDMME - Virtual Concept

Evolutionary form design: the application of genetic algorithmic techniques to computer-aided product design

Evolutionary form design: the application of genetic algorithmic techniques to computer-aided product design Loughborough University Institutional Repository Evolutionary form design: the application of genetic algorithmic techniques to computer-aided product design This item was submitted to Loughborough University's

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

Topological Machining Fixture Layout Synthesis Using Genetic Algorithms

Topological Machining Fixture Layout Synthesis Using Genetic Algorithms Topological Machining Fixture Layout Synthesis Using Genetic Algorithms Necmettin Kaya Uludag University, Mechanical Eng. Department, Bursa, Turkey Ferruh Öztürk Uludag University, Mechanical Eng. Department,

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

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

Multi-objective Optimization

Multi-objective Optimization Some introductory figures from : Deb Kalyanmoy, Multi-Objective Optimization using Evolutionary Algorithms, Wiley 2001 Multi-objective Optimization Implementation of Constrained GA Based on NSGA-II Optimization

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

Towards Automatic Recognition of Fonts using Genetic Approach

Towards Automatic Recognition of Fonts using Genetic Approach Towards Automatic Recognition of Fonts using Genetic Approach M. SARFRAZ Department of Information and Computer Science King Fahd University of Petroleum and Minerals KFUPM # 1510, Dhahran 31261, Saudi

More information

Evolutionary Algorithms: Lecture 4. Department of Cybernetics, CTU Prague.

Evolutionary Algorithms: Lecture 4. Department of Cybernetics, CTU Prague. Evolutionary Algorithms: Lecture 4 Jiří Kubaĺık Department of Cybernetics, CTU Prague http://labe.felk.cvut.cz/~posik/xe33scp/ pmulti-objective Optimization :: Many real-world problems involve multiple

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

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

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

CHAPTER 6 REAL-VALUED GENETIC ALGORITHMS

CHAPTER 6 REAL-VALUED GENETIC ALGORITHMS CHAPTER 6 REAL-VALUED GENETIC ALGORITHMS 6.1 Introduction Gradient-based algorithms have some weaknesses relative to engineering optimization. Specifically, it is difficult to use gradient-based algorithms

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

CHAPTER 4 GENETIC ALGORITHM

CHAPTER 4 GENETIC ALGORITHM 69 CHAPTER 4 GENETIC ALGORITHM 4.1 INTRODUCTION Genetic Algorithms (GAs) were first proposed by John Holland (Holland 1975) whose ideas were applied and expanded on by Goldberg (Goldberg 1989). GAs is

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

Multi-objective Optimization

Multi-objective Optimization Jugal K. Kalita Single vs. Single vs. Single Objective Optimization: When an optimization problem involves only one objective function, the task of finding the optimal solution is called single-objective

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

Using Evolutionary Design to Interactively Sketch Car Silhouettes and Stimulate Designer s Creativity

Using Evolutionary Design to Interactively Sketch Car Silhouettes and Stimulate Designer s Creativity Using Evolutionary Design to Interactively Sketch Car Silhouettes and Stimulate Designer s Creativity François Cluzel a, Bernard Yannou a,1, Markus Dihlmann b a Laboratoire Genie Industriel, Ecole Centrale

More information

Comparative Study on VQ with Simple GA and Ordain GA

Comparative Study on VQ with Simple GA and Ordain GA Proceedings of the 9th WSEAS International Conference on Automatic Control, Modeling & Simulation, Istanbul, Turkey, May 27-29, 2007 204 Comparative Study on VQ with Simple GA and Ordain GA SADAF SAJJAD

More information

Graphical Approach to Solve the Transcendental Equations Salim Akhtar 1 Ms. Manisha Dawra 2

Graphical Approach to Solve the Transcendental Equations Salim Akhtar 1 Ms. Manisha Dawra 2 Graphical Approach to Solve the Transcendental Equations Salim Akhtar 1 Ms. Manisha Dawra 2 1 M.Tech. Scholar 2 Assistant Professor 1,2 Department of Computer Science & Engineering, 1,2 Al-Falah School

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

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

Heuristic Optimisation

Heuristic Optimisation Heuristic Optimisation Part 10: Genetic Algorithm Basics Sándor Zoltán Németh http://web.mat.bham.ac.uk/s.z.nemeth s.nemeth@bham.ac.uk University of Birmingham S Z Németh (s.nemeth@bham.ac.uk) Heuristic

More information

Suppose you have a problem You don t know how to solve it What can you do? Can you use a computer to somehow find a solution for you?

Suppose you have a problem You don t know how to solve it What can you do? Can you use a computer to somehow find a solution for you? Gurjit Randhawa Suppose you have a problem You don t know how to solve it What can you do? Can you use a computer to somehow find a solution for you? This would be nice! Can it be done? A blind generate

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

Improving interpretability in approximative fuzzy models via multi-objective evolutionary algorithms.

Improving interpretability in approximative fuzzy models via multi-objective evolutionary algorithms. Improving interpretability in approximative fuzzy models via multi-objective evolutionary algorithms. Gómez-Skarmeta, A.F. University of Murcia skarmeta@dif.um.es Jiménez, F. University of Murcia fernan@dif.um.es

More information

Genetic algorithms in computer aided design

Genetic algorithms in computer aided design Loughborough University Institutional Repository Genetic algorithms in computer aided design This item was submitted to Loughborough University's Institutional Repository by the/an author. Citation: GRAHAM,

More information

Genetic Algorithm based Fractal Image Compression

Genetic Algorithm based Fractal Image Compression Vol.3, Issue.2, March-April. 2013 pp-1123-1128 ISSN: 2249-6645 Genetic Algorithm based Fractal Image Compression Mahesh G. Huddar Lecturer, Dept. of CSE,Hirasugar Institute of Technology, Nidasoshi, India

More information

Genetic Tuning for Improving Wang and Mendel s Fuzzy Database

Genetic Tuning for Improving Wang and Mendel s Fuzzy Database Proceedings of the 2009 IEEE International Conference on Systems, Man, and Cybernetics San Antonio, TX, USA - October 2009 Genetic Tuning for Improving Wang and Mendel s Fuzzy Database E. R. R. Kato, O.

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

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

Genetic Algorithm for Finding Shortest Path in a Network

Genetic Algorithm for Finding Shortest Path in a Network Intern. J. Fuzzy Mathematical Archive Vol. 2, 2013, 43-48 ISSN: 2320 3242 (P), 2320 3250 (online) Published on 26 August 2013 www.researchmathsci.org International Journal of Genetic Algorithm for Finding

More information

A genetic algorithms approach to optimization parameter space of Geant-V prototype

A genetic algorithms approach to optimization parameter space of Geant-V prototype A genetic algorithms approach to optimization parameter space of Geant-V prototype Oksana Shadura CERN, PH-SFT & National Technical Univ. of Ukraine Kyiv Polytechnic Institute Geant-V parameter space [1/2]

More information

Genetic Algorithms and Image Search Pavel Mrázek

Genetic Algorithms and Image Search Pavel Mrázek Genetic Algorithms and Image Search Pavel Mrázek Department of Computer Science, Faculty of Electrical Engineering, Czech Technical University (»VUT), Karlovo nám. 13, 12135 Praha 2, Czech Republic e-mail:

More information

1 Lab + Hwk 5: Particle Swarm Optimization

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

A Genetic Algorithm-Based Approach for Energy- Efficient Clustering of Wireless Sensor Networks

A Genetic Algorithm-Based Approach for Energy- Efficient Clustering of Wireless Sensor Networks A Genetic Algorithm-Based Approach for Energy- Efficient Clustering of Wireless Sensor Networks A. Zahmatkesh and M. H. Yaghmaee Abstract In this paper, we propose a Genetic Algorithm (GA) to optimize

More information

An Evolutionary Algorithm for the Multi-objective Shortest Path Problem

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

ARTIFICIAL INTELLIGENCE (CSCU9YE ) LECTURE 5: EVOLUTIONARY ALGORITHMS

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

Optimizing the Sailing Route for Fixed Groundfish Survey Stations

Optimizing the Sailing Route for Fixed Groundfish Survey Stations International Council for the Exploration of the Sea CM 1996/D:17 Optimizing the Sailing Route for Fixed Groundfish Survey Stations Magnus Thor Jonsson Thomas Philip Runarsson Björn Ævar Steinarsson Presented

More information

Planning and Search. Genetic algorithms. Genetic algorithms 1

Planning and Search. Genetic algorithms. Genetic algorithms 1 Planning and Search Genetic algorithms Genetic algorithms 1 Outline Genetic algorithms Representing states (individuals, or chromosomes) Genetic operations (mutation, crossover) Example Genetic algorithms

More information

Active contour: a parallel genetic algorithm approach

Active contour: a parallel genetic algorithm approach id-1 Active contour: a parallel genetic algorithm approach Florence Kussener 1 1 MathWorks, 2 rue de Paris 92196 Meudon Cedex, France Florence.Kussener@mathworks.fr Abstract This paper presents an algorithm

More information

A new approach for specifying and solving layout problems

A new approach for specifying and solving layout problems A new approach for specifying and solving layout problems Julien Bénabès, Fouad Bennis, Emilie Poirson, Yannick Ravaut To cite this version: Julien Bénabès, Fouad Bennis, Emilie Poirson, Yannick Ravaut.

More information

Genetic Algorithm Based Template Optimization for a Vision System: Obstacle Detection

Genetic Algorithm Based Template Optimization for a Vision System: Obstacle Detection ISTET'09 Umair Ali Khan, Alireza Fasih, Kyandoghere Kyamakya, Jean Chamberlain Chedjou Transportation Informatics Group, Alpen Adria University, Klagenfurt, Austria. Genetic Algorithm Based Template Optimization

More information

Genetic Algorithms. PHY 604: Computational Methods in Physics and Astrophysics II

Genetic Algorithms. PHY 604: Computational Methods in Physics and Astrophysics II Genetic Algorithms Genetic Algorithms Iterative method for doing optimization Inspiration from biology General idea (see Pang or Wikipedia for more details): Create a collection of organisms/individuals

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

Tolerance Synthesis by Constraint Propagation

Tolerance Synthesis by Constraint Propagation Tolerance Synthesis by Constraint Propagation Christopher C. Yang and Jason Wong Department of Systems Engineering and Engineering Management The Chinese University of Hong Kong Abstract Optimizing the

More information

Evolving SQL Queries for Data Mining

Evolving SQL Queries for Data Mining Evolving SQL Queries for Data Mining Majid Salim and Xin Yao School of Computer Science, The University of Birmingham Edgbaston, Birmingham B15 2TT, UK {msc30mms,x.yao}@cs.bham.ac.uk Abstract. This paper

More information

Design of a Route Guidance System with Shortest Driving Time Based on Genetic Algorithm

Design of a Route Guidance System with Shortest Driving Time Based on Genetic Algorithm Design of a Route Guidance System with Shortest Driving Time Based on Genetic Algorithm UMIT ATILA 1, ISMAIL RAKIP KARAS 2, CEVDET GOLOGLU 3, BEYZA YAMAN 2, ILHAMI MUHARREM ORAK 2 1 Directorate of Computer

More information

Sparse Matrices Reordering using Evolutionary Algorithms: A Seeded Approach

Sparse Matrices Reordering using Evolutionary Algorithms: A Seeded Approach 1 Sparse Matrices Reordering using Evolutionary Algorithms: A Seeded Approach David Greiner, Gustavo Montero, Gabriel Winter Institute of Intelligent Systems and Numerical Applications in Engineering (IUSIANI)

More information

INTERACTIVE MULTI-OBJECTIVE GENETIC ALGORITHMS FOR THE BUS DRIVER SCHEDULING PROBLEM

INTERACTIVE MULTI-OBJECTIVE GENETIC ALGORITHMS FOR THE BUS DRIVER SCHEDULING PROBLEM Advanced OR and AI Methods in Transportation INTERACTIVE MULTI-OBJECTIVE GENETIC ALGORITHMS FOR THE BUS DRIVER SCHEDULING PROBLEM Jorge PINHO DE SOUSA 1, Teresa GALVÃO DIAS 1, João FALCÃO E CUNHA 1 Abstract.

More information

Codebook generation for Image Compression with Simple and Ordain GA

Codebook generation for Image Compression with Simple and Ordain GA Codebook generation for Image Compression with Simple and Ordain GA SAJJAD MOHSIN, SADAF SAJJAD COMSATS Institute of Information Technology Department of Computer Science Tobe Camp, Abbotabad PAKISTAN

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

Evolutionary Computation Algorithms for Cryptanalysis: A Study

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

1 Lab 5: Particle Swarm Optimization

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

DETERMINING MAXIMUM/MINIMUM VALUES FOR TWO- DIMENTIONAL MATHMATICLE FUNCTIONS USING RANDOM CREOSSOVER TECHNIQUES

DETERMINING MAXIMUM/MINIMUM VALUES FOR TWO- DIMENTIONAL MATHMATICLE FUNCTIONS USING RANDOM CREOSSOVER TECHNIQUES DETERMINING MAXIMUM/MINIMUM VALUES FOR TWO- DIMENTIONAL MATHMATICLE FUNCTIONS USING RANDOM CREOSSOVER TECHNIQUES SHIHADEH ALQRAINY. Department of Software Engineering, Albalqa Applied University. E-mail:

More information

Automatic Selection of GCC Optimization Options Using A Gene Weighted Genetic Algorithm

Automatic Selection of GCC Optimization Options Using A Gene Weighted Genetic Algorithm Automatic Selection of GCC Optimization Options Using A Gene Weighted Genetic Algorithm San-Chih Lin, Chi-Kuang Chang, Nai-Wei Lin National Chung Cheng University Chiayi, Taiwan 621, R.O.C. {lsch94,changck,naiwei}@cs.ccu.edu.tw

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

Network Routing Protocol using Genetic Algorithms

Network Routing Protocol using Genetic Algorithms International Journal of Electrical & Computer Sciences IJECS-IJENS Vol:0 No:02 40 Network Routing Protocol using Genetic Algorithms Gihan Nagib and Wahied G. Ali Abstract This paper aims to develop a

More information

Interactive Computational Intelligence: A Framework and Applications

Interactive Computational Intelligence: A Framework and Applications 1 Interactive Computational Intelligence: A Framework and Applications Agenda Overview Methodology IGA Knowledge-based encoding Partial evaluation based on clustering Direct manipulation of evolution Applications

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

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

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

Genetic Programming. and its use for learning Concepts in Description Logics

Genetic Programming. and its use for learning Concepts in Description Logics Concepts in Description Artificial Intelligence Institute Computer Science Department Dresden Technical University May 29, 2006 Outline Outline: brief introduction to explanation of the workings of a algorithm

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

A GENETIC ALGORITHM APPROACH TO OPTIMAL TOPOLOGICAL DESIGN OF ALL TERMINAL NETWORKS

A GENETIC ALGORITHM APPROACH TO OPTIMAL TOPOLOGICAL DESIGN OF ALL TERMINAL NETWORKS A GENETIC ALGORITHM APPROACH TO OPTIMAL TOPOLOGICAL DESIGN OF ALL TERMINAL NETWORKS BERNA DENGIZ AND FULYA ALTIPARMAK Department of Industrial Engineering Gazi University, Ankara, TURKEY 06570 ALICE E.

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

Aero-engine PID parameters Optimization based on Adaptive Genetic Algorithm. Yinling Wang, Huacong Li

Aero-engine PID parameters Optimization based on Adaptive Genetic Algorithm. Yinling Wang, Huacong Li International Conference on Applied Science and Engineering Innovation (ASEI 215) Aero-engine PID parameters Optimization based on Adaptive Genetic Algorithm Yinling Wang, Huacong Li School of Power and

More information

Intelligent Risk Identification and Analysis in IT Network Systems

Intelligent Risk Identification and Analysis in IT Network Systems Intelligent Risk Identification and Analysis in IT Network Systems Masoud Mohammadian University of Canberra, Faculty of Information Sciences and Engineering, Canberra, ACT 2616, Australia masoud.mohammadian@canberra.edu.au

More information

Binary Representations of Integers and the Performance of Selectorecombinative Genetic Algorithms

Binary Representations of Integers and the Performance of Selectorecombinative Genetic Algorithms Binary Representations of Integers and the Performance of Selectorecombinative Genetic Algorithms Franz Rothlauf Department of Information Systems University of Bayreuth, Germany franz.rothlauf@uni-bayreuth.de

More information

Learning Adaptive Parameters with Restricted Genetic Optimization Method

Learning Adaptive Parameters with Restricted Genetic Optimization Method Learning Adaptive Parameters with Restricted Genetic Optimization Method Santiago Garrido and Luis Moreno Universidad Carlos III de Madrid, Leganés 28911, Madrid (Spain) Abstract. Mechanisms for adapting

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

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

Role of Genetic Algorithm in Routing for Large Network

Role of Genetic Algorithm in Routing for Large Network Role of Genetic Algorithm in Routing for Large Network *Mr. Kuldeep Kumar, Computer Programmer, Krishi Vigyan Kendra, CCS Haryana Agriculture University, Hisar. Haryana, India verma1.kuldeep@gmail.com

More information

Multi-Objective Pipe Smoothing Genetic Algorithm For Water Distribution Network Design

Multi-Objective Pipe Smoothing Genetic Algorithm For Water Distribution Network Design City University of New York (CUNY) CUNY Academic Works International Conference on Hydroinformatics 8-1-2014 Multi-Objective Pipe Smoothing Genetic Algorithm For Water Distribution Network Design Matthew

More 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

Interactive Evolution of XUL User Interfaces

Interactive Evolution of XUL User Interfaces Interactive Evolution of XUL User Interfaces Juan C. Quiroz Evolutionary Computing Systems Lab University of Nevada, Reno Reno, NV 89557, USA quiroz@cse.unr.edu Sushil J. Louis Evolutionary Computing Systems

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

Study on GA-based matching method of railway vehicle wheels

Study on GA-based matching method of railway vehicle wheels Available online www.jocpr.com Journal of Chemical and Pharmaceutical Research, 2014, 6(4):536-542 Research Article ISSN : 0975-7384 CODEN(USA) : JCPRC5 Study on GA-based matching method of railway vehicle

More information

Distributed Optimization of Feature Mining Using Evolutionary Techniques

Distributed Optimization of Feature Mining Using Evolutionary Techniques Distributed Optimization of Feature Mining Using Evolutionary Techniques Karthik Ganesan Pillai University of Dayton Computer Science 300 College Park Dayton, OH 45469-2160 Dale Emery Courte University

More information

1 Lab + Hwk 5: Particle Swarm Optimization

1 Lab + Hwk 5: Particle Swarm Optimization 1 Lab + Hwk 5: Particle Swarm Optimization This laboratory requires the following equipment: C programming tools (gcc, make), already installed in GR B001 Webots simulation software Webots User Guide Webots

More information

GA is the most popular population based heuristic algorithm since it was developed by Holland in 1975 [1]. This algorithm runs faster and requires les

GA 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 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

Evolutionary Computation Part 2

Evolutionary Computation Part 2 Evolutionary Computation Part 2 CS454, Autumn 2017 Shin Yoo (with some slides borrowed from Seongmin Lee @ COINSE) Crossover Operators Offsprings inherit genes from their parents, but not in identical

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

Optimization of Surface Roughness in End Milling of Medium Carbon Steel by Coupled Statistical Approach with Genetic Algorithm

Optimization of Surface Roughness in End Milling of Medium Carbon Steel by Coupled Statistical Approach with Genetic Algorithm Optimization of Surface Roughness in End Milling of Medium Carbon Steel by Coupled Statistical Approach with Genetic Algorithm Md. Anayet Ullah Patwari Islamic University of Technology (IUT) Department

More information

Visualization of Crowd-Powered Impression Evaluation Results

Visualization of Crowd-Powered Impression Evaluation Results Visualization of Crowd-Powered Impression Evaluation Results Erika GOMI,YuriSAITO, Takayuki ITOH (*)Graduate School of Humanities and Sciences, Ochanomizu University Tokyo, Japan {erika53, yuri, itot }

More information

Dejong Function Optimization by means of a Parallel Approach to Fuzzified Genetic Algorithm

Dejong Function Optimization by means of a Parallel Approach to Fuzzified Genetic Algorithm Dejong Function Optimization by means of a Parallel Approach to Fuzzified Genetic Algorithm Ebrahim Bagheri, Hossein Deldari Department of Computer Science, University of New Bruswick Department of Computer

More information

Document Design with Interactive Evolution

Document Design with Interactive Evolution Document Design with Interactive Evolution Juan C. Quiroz, Amit Banerjee, Sushil J. Louis, Sergiu M. Dascalu Abstract We present human guided evolution of brochure documents. The user interacts with a

More information

Improving Performance of Multi-objective Genetic for Function Approximation through island specialisation

Improving Performance of Multi-objective Genetic for Function Approximation through island specialisation Improving Performance of Multi-objective Genetic for Function Approximation through island specialisation A. Guillén 1, I. Rojas 1, J. González 1, H. Pomares 1, L.J. Herrera 1, and B. Paechter 2 1) Department

More information

Interactive Evolution of XUL User Interfaces

Interactive Evolution of XUL User Interfaces Interactive Evolution of XUL User Interfaces Juan C. Quiroz Evolutionary Computing Systems Lab University of Nevada, Reno Reno, NV 89557, USA quiroz@cse.unr.edu Sushil J. Louis Evolutionary Computing Systems

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

entire search space constituting coefficient sets. The brute force approach performs three passes through the search space, with each run the se

entire search space constituting coefficient sets. The brute force approach performs three passes through the search space, with each run the se Evolving Simulation Modeling: Calibrating SLEUTH Using a Genetic Algorithm M. D. Clarke-Lauer 1 and Keith. C. Clarke 2 1 California State University, Sacramento, 625 Woodside Sierra #2, Sacramento, CA,

More information

MODELLING DOCUMENT CATEGORIES BY EVOLUTIONARY LEARNING OF TEXT CENTROIDS

MODELLING DOCUMENT CATEGORIES BY EVOLUTIONARY LEARNING OF TEXT CENTROIDS MODELLING DOCUMENT CATEGORIES BY EVOLUTIONARY LEARNING OF TEXT CENTROIDS J.I. Serrano M.D. Del Castillo Instituto de Automática Industrial CSIC. Ctra. Campo Real km.0 200. La Poveda. Arganda del Rey. 28500

More information

Innovative Design of Furniture Modeling Based on Tree Structure Genetic Algorithm

Innovative Design of Furniture Modeling Based on Tree Structure Genetic Algorithm Innovative Design of Furniture Modeling Based on Tree Structure Genetic lgorithm bstract Chang Chang School of Design, Xuchang University, Xuchang 461000, China The development of furniture design is the

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

DETERMINING PARETO OPTIMAL CONTROLLER PARAMETER SETS OF AIRCRAFT CONTROL SYSTEMS USING GENETIC ALGORITHM

DETERMINING PARETO OPTIMAL CONTROLLER PARAMETER SETS OF AIRCRAFT CONTROL SYSTEMS USING GENETIC ALGORITHM DETERMINING PARETO OPTIMAL CONTROLLER PARAMETER SETS OF AIRCRAFT CONTROL SYSTEMS USING GENETIC ALGORITHM Can ÖZDEMİR and Ayşe KAHVECİOĞLU School of Civil Aviation Anadolu University 2647 Eskişehir TURKEY

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

GENETIC ALGORITHM-AIDED ROUTING ON 3D DYNAMIC NETWORKS

GENETIC ALGORITHM-AIDED ROUTING ON 3D DYNAMIC NETWORKS GENETIC ALGORITHM-AIDED ROUTING ON 3D DYNAMIC NETWORKS U. Atila a *, I. R. Karas b a Directorate of Computer Center, Gazi University, Teknikokullar, Besevler, 06500, Ankara, Turkey - umitatila@gmail.com

More information