A Genetic Algorithm for Solving Beehive Hidato Puzzles
|
|
- Ursula Wilkins
- 6 years ago
- Views:
Transcription
1 A Genetic Algorithm for Solving Beehive Hidato Puzzles Matheus Müller Pereira da Silva and Camila Silva de Magalhães Universidade Federal do Rio de Janeiro - UFRJ, Campus Xerém, Duque de Caxias, RJ , Brazil mullerpds@ufrj.br,camila@xerem.ufrj.br Abstract. Beehive Hidato puzzles are logic games, similar to Sudoku, in which the grid cells are hexagons. Some hexagons are prefilled with given numbers, and the objective of the game is to find a path of natural numbers, from 1 to the grid size n, in such a way that consecutive numbers stay connected by any hexagon side. Although the rules of the game are simple, finding the solution to this problem can be quite challenging. In this work, we designed and implemented a genetic algorithm (GA) to solve Beehive Hidato problems. The proposed GA uses common genetic operators and the RTS niching technique to preserve population diversity. A new strategy based on gene convergence rate is also implemented and tested. The proposed algorithm was evaluated in 21 instances of Beehive Hidato with different sizes and complexities. The results show that GAs are promising tools for solving Beehive Hidato problems. Keywords: Genetic Algorithm, Hidato Puzzles, Niching 1 Introduction Hidato (from the Hebrew hida that means riddle) is a puzzle logic game, similar to the very popular Sudoku. This game was proposed by the Israeli mathematician Gyora M. Benedek [9]. The Hidato puzzle consists of n grid cells in which the player has to complete the cells with natural numbers from 1 to n, in such a way that consecutive numbers stay in adjacent cells. Some of the Hidato grid cells are fulfilled with given numbers that are unchanged, including always the first and the largest number (1 and n). While the Hidato rules are very simple, completing the game grid can be quite challenging. The Beehive Hidato is a variant of the classic squared grid cell Hidato and was inspired by honeycomb structures. The grid cells of Beehive Hidato adopt the hexagonal format, and consecutive numbers can be placed on any hexagon connected with other through any of its sides. Hidato games have different difficulty levels related to the size of the Hidato grid (number of hexagons) and also the number of fixed given numbers. The larger the number of hexagons and the smaller the amount of fixed given numbers, the more difficult the Hidato problem is. The hexagonal grid can also contain holes, which means that some places (hexagonal cells) are not allowed to be filled with any number.
2 2 Da Silva, M.M.P. and De Magalhães, C.S. Although a lot of research effort has been made to solve the Sudoku game using many different techniques [5, 6, 11 13] to the best of the author s knowledge, this is the first paper to address the Hidato problem. Most of the works for solving Sudoku uses nature inspired optimization techniques, such as Particle Swarm Optimization (PSO) and Genetic Algorithms (GA), with relatively good performance. In this work, we propose a genetic algorithm [4] specifically designed to solve Beehive Hidato puzzles. We are interested in investigating the capability of genetic algorithms in solving the Beehive Hidato problem. The proposed GA uses a steady-state population model and commonly used crossover and mutation operators for permutation representation problems. The population diversity is maintained by using the Restricted Tournament Selection (RTS) [1] niching technique with a dynamic tournament size (w) [10]. A new convergence based gene insertion strategy is also proposed and tested in an attempt to improve performance and convergence speed. The proposed GA was applied to 21 instances of the Beehive Hidato problem of different sizes and complexities. The results show that the proposed GA can easily handle small size Beehive Hidato problems. Nevertheless, for the class 2 hidato instances tested, the success rate varies from 3% to 100% depending on the Hidato complexity. The rest of the paper is organized as follows. Section 2 describes the Beehive Hidato rules and the new proposed GA. Section 3 presents the results obtained with the application of the GA proposed to the 21 Beehive Hidato instances and analyses the influence of the RTS technique on it. The conclusions of the work done are presented in Section 4. 2 Beehive Hidato Rules and The Proposed Genetic Algorithm 2.1 Hidato Rules In Beehive Hidato, initially, there is a grid of hexagons with some prefilled fixed numbers (Fig. 1a). The aim is to fill the empty hexagons with consecutive numbers from 1 to the largest number in the grid. In other words, 1 must be adjacent to 2, 2 must be adjacent to 3 and so on, generating a continuous path. Every Hidato puzzle has a unique solution. Fig. 1b shows the complete solution and its corresponding path for this Hidato. Beehive Hidato, similar to Sudoku, is a constraint satisfaction fill-in puzzle with simple rules [7]. Rule 1: Each hexagonal cell of the grid must be filled with a natural number ranging from 1 to n; Rule 2: Each number, ranging from 1 to n, is only in one hexagonal cell (i.e., number repetition is not allowed on grid) Rule 3: Prefilled numbers are not allowed to change.
3 A Genetic Algorithm for Solving Hidato Puzzles 3 Fig. 1. Initial hidato grid with prefilled fixed numbers (yellow), first and last numbers (red) (a). Complete solution and its corresponding path (blue line) (b). 2.2 The Proposed GA The proposed method is a steady-state genetic algorithm specifically designed to solve hexagonal Hidato puzzles. In a steady-state GA, a newly created offspring is immediately tested for insertion in the population. The GA initiates generating a random initial population of candidate Beehive Hidato solutions. Parents individuals are randomly selected, and the genetic operators are applied (crossover followed by mutation). The offspring are inserted in the population according to the Restricted Tournament Selection (RTS) method [1]. The population evolves until the maximum number of fitness function evaluations (FEs) allowed or until the global optimum is found. Representation Each Beehive Hidato solution is represented by a permutation of integers of 1 to n, where n is the total number of genes on a given chromosome (e.g.: {1, 5, 3, 2, 4}). Thus, number repetitions are not allowed. In this representation, the numbers of the Hidato are organized linearly, always starting from the top left to the bottom right hexagonal cell of the grid. However, fixed prefilled numbers of Hidato are not included in the chromosome. These given numbers are removed from the initial population generation (randomly arranging only the non fixed numbers of the problem) and are considered only in order to complete the solution in the fitness evaluations. Fitness Function A fitness function was specially designed to quantify the quality of a solution for the Beehive Hidato problem, considering the rules of the puzzle. Solutions of Beehive Hidato comprises hexagonal cells filled with consecutive numbers linked adjacently. So, for each hexagonal cell of the Beehive Hidato, we sum one point to each following number (successor or predecessor)
4 4 Da Silva, M.M.P. and De Magalhães, C.S. that is connected to it in an adjacent hexagonal cell. So, for a Beehive Hidato of size N, the fitness of the optimum solution is equal to (N 2) 2. Two points are subtracted from N 2 to take into account the first and last numbers, which have only one next number to it. In other words, the fitness function checks for every number n, if there are consecutive numbers (n + 1 and n 1) adjacent to it, assigning one point to each of these conditions when true. The proposed GA was designed to maximize this fitness function. A pseudo-code for evaluating a Beehive Hidato solution can be seen below: fitness_score = 0 For each number n in candidate solution: For every adjacent number n_a of n: If n_a equals to n + 1: fitness_score = fitness_score + 1 If n_a equals to n - 1: fitness_score = fitness_score + 1 Diversity Preservation To promote population diversity and, therefore, avoid premature convergence to local optimum, the RTS crowding technique [1] was implemented. This technique is based on the concept of local competition in which similar individuals competes to stay in the population. In this scheme, parents are randomly selected and a newly generated individual is inserted in the population replacing the most similar among w randomly selected individuals if it is better than the most similar one. The distance between two solutions for the Beehive Hidato problem was defined here as the number of hexagonal cells with distinct values. For example, given chromosome 1 = {1, 5, 3, 2, 4} and chromosome 2 = {1, 5, 2, 4, 3}, the distance between them is evaluated as 3. In this AG, the w parameter was dynamically set to linearly decay from 100% of the population to 10%, during whole execution [10]. In this way, strong niche formation is favored at the beginning of the evolution, and it is relaxed towards the end. Genetic Operators The genetic operators used were two commonly used operators for permutation representations in GAs. Only one crossover and one mutation operator were used. The crossover operator used was the Partially Mapped Crossover (PMX) as described by Whitley [2]. The mutation operator used was swap mutation, as described in [3]. This operator works by randomly choosing two genes and swapping their values. Crossover probability was set to 90%, and mutation probability was set to 10%. Convergence Based Gene Insertion - (CBGI) Strategy In an attempt of to improve the algorithm performance in finding the correct order of numbers in the hexagonal grid even when the Beehive Hidato problem has few fixed given numbers, we implemented a convergence based gene insertion (CBGI) strategy.
5 A Genetic Algorithm for Solving Hidato Puzzles 5 This strategy works as follows: after a elapsed evolution time S (a percentage of the total evolution time, calculated on the maximum number of fitness function evaluations), the algorithm evaluates for each gene of the best individual its allele frequency, considering all individuals in the GA population. This process occurs periodically (in epochs). If the allele frequency of a gene of the best individual in the population is higher than a parameter c, the value of the gene is inserted as a given fixed number for the Beehive Hidato problem, and it is held in that way until the end of the evolution. More specifically, for each gene of the current best individual, the algorithm evaluates the number of occurrences of its gene value, in the same position, for all individuals in the population. Then, this quantity is divided by the population size, to get its rate. The gene with the highest convergence rate (above of a parameter c) is then selected to be inserted in the Beehive Hidato problem as a fixed number, in its corresponding position. 3 Results The performance of the steady-state GA implemented was evaluated for 21 hexagonal Beehive Hidato problems. These problems were randomly selected from two different databases [8,9] and used as initial test problems for the algorithm s performance. From those, problems 1 to 10 are composed by 19 hexagons (class 1 problems), problems 11 to 21 have 37 hexagons (class 2 problems). Therefore, the fitness value of the globally optimum solution for class 1 and class 2 problems is 36 and 72, respectively. All experiments were performed using a population size of 250 individuals and a maximum of 2.0E + 05 fitness function evaluations. For all problem instances, 30 independent GA runs were performed. The parameters related to the convergence based gene insertion (GBGI) strategy used were: S set to 20%, epoch to 5% and c to 20%. It means that, after 20% of the total maximum number of fitness function evaluations, and then on each 5% of the evolution, a gene is inserted as part of the Beehive Hidato problems if its rate of occurrence in the population surpass c. The algorithm performance was evaluated with and without the use of the GBGI strategy. Tables 1 to 4 shows, for every problem instance: the best fitness found, the averaged best fitness, the averaged number of fitness function evaluations to reach the best solution found and the success rate (SR). SR is defined as the number of successful runs (i.e., runs in which the global optimum solution was found) over the total number of runs. Tables 1 and 2 show results for problems 1-10 and 11-21, respectively, without using the CBGI strategy (described in section 2.2). Tables 3 and 4 show results for the GA when using the CBGI strategy, with parameters S and c set to 20%. For all class 1 Beehive Hidato problem instances (problems 1 to 10, show in Tables 1 and 3), the genetic algorithm implemented can find the global optimum solution with a success rate of 100% with and without the use of the CBGI
6 6 Da Silva, M.M.P. and De Magalhães, C.S. Table 1. Beehive Hidato class 1 problems without the CBGI strategy problem best fit. avg. best fit. st. dev. avg. FEs st. dev average: SR Table 2. Beehive Hidato class 2 problems without the CBGI strategy problem best fit. avg. best fit. st. dev. avg. FEs st. dev. SR average:
7 A Genetic Algorithm for Solving Hidato Puzzles 7 strategy. These class 1 Beehive Hidato problem instances differ in the quantity and values of the fixed given numbers. The number of given numbers varies, in this case, from 6 (problem 4) to 8 (problems 2, 5 and 10). For all other problems, seven numbers are given. As expected, the averaged number of fitness evaluations to reach the global optimum is higher to the problem with less given numbers (problem 4). When using the CBGI strategy (Table 3), we observed a slightly reduction in the averaged number of fitness evaluations to reach the optimum. The main difference is found for problem 4 in which the averaged number of FE dropped off about 2500 evaluations. Table 3. Beehive Hidato class 1 problems with the CBGI strategy problem best fit. avg. best fit. st. dev. avg. FEs st. dev average SR Table 4. Beehive Hidato class 2 problems with the CBGI strategy problem best fit. avg. best fit. st. dev. avg. FEs st. dev. SR average:
8 8 Da Silva, M.M.P. and De Magalhães, C.S. For class 2 Beehive Hidato (problems 11 to 21) the GA performance varies significantly from instance to instance (Tables 2 and 4). However, the GA implemented was able to find the global optimum solution for all problem instances tested. The fixed given number of these instances ranges from 9 (problems 15, 16 and 19) to 13 (problem 13). Problems 17 and 21 have ten fixed given numbers, problems 12, 14 and 18 have 11, and problems 11 and 20 have each one, 12 prefilled numbers. For 5 of the 11 class 2 problem instances, the proposed algorithm presented a success rate higher or equal to 60% in finding the global optimum solution. For 2 of these, the algorithm SR is equal or higher than 80%. As expected, for problem instances with less fixed given numbers (problems 15, 16 and 19), the algorithm presented an inferior performance with SR of only 3%. The same is observed with problem number 18, for which the SR obtained was of 7%. The SR of the algorithm for problems 14 and 17 (with 11 and 10 fixed given numbers) were of 17% and 47%, respectively. When the CBGI strategy is used in the GA to solve class 2 Beehive Hidato problems (Table 4), no significant change in the average algorithm performance was observed. However, an improvement of 10% in SR was found for problems 19 and 14, two difficult problems. A higher and more significant improvement was observed only for problem 11, for which the SR increased to 17%. Problems 15, 18 and 21 had minor improvements (4% to 6%). For the other class 2 problem instances tested, the SR of the GA using the CBGI strategy was equal or worse than the GA results without using it. However, the average FE for reaching the global optimum is lower when the CBGI is used for all cases, except for problem 14, in which the GA-CBGI approach has a slightly higher average FE (Table 4). The proposed GA can quickly solve class 1 Beehive Hidato problems with 100% of success rate. However, for class 2 problems the success rate of the GA proposed varies from 3% (more difficult problems, with only nine fixed given numbers) to 100%. From the 11 class 2 problem instances tested, the GA and the GA with the CBGI strategy obtained a success rate above 50% for five instances. 3.1 Influence of the Diversity Preservation Technique To evaluate the influence of the RTS niching technique on the results, we tested the proposed GA on the 21 Beehive Hidato problems using another selectioninsertion technique, without a diversity preservation mechanism. All the other GA parameters, operators, and strategies remained the same. The only modification was that the parent selection was performed by binary tournament selection [3]. Besides, a newly generated offspring in the population was inserted in the population replacing the worst individual. Results for class 1 and class 2 Beehive Hidato problems are shown in Tables 5 and 6, respectively. For class 1 Hidato problems, although the GA can find the global optimum, we observe a decreased success rate for all ten instances tested. The most significative performance loss was observed for problem four (the most difficult class 1 problem tested). For problems one and three the success rate also decreased
9 A Genetic Algorithm for Solving Hidato Puzzles 9 from 100% (Table 3) to 57% and 47% respectively (Table 5). For the other class 1 problem instances, the success rate varied from 70% to 93%. However, the averaged best fitness value is worse than the results with the RTS niching technique in all cases. Table 5. Beehive Hidato class 1 problems with CBGI strategy without the RTS technique problem best fit. avg. best fit. st. dev. avg. FEs st. dev average: SR Table 6. Beehive Hidato class 2 problems with CBGI strategy without the RTS technique problem best fit. avg. best fit. st. dev. avg. FEs st. dev average: SR When we compare the results with and without the use of the RTS technique for class 2 Beehive Hidato problem instances we see that the algorithm cannot find the global optimum solution for any of the 11 problems tested (Table 6). Although solutions near to the global optimum were found for five problems
10 10 Da Silva, M.M.P. and De Magalhães, C.S. (best fit. values of 70), the averaged best fit is significantly worse than the results using the RTS strategy in all cases. The averaged best fitness without the utilization of the RTS is below 65 (Table 6) whereas when using the RTS strategy it is above 68 (Table 4) for all cases. The RTS technique has a crucial role in avoiding premature convergence, preserving diversity and improving the algorithm performance significantly. 4 Conclusion In this work, we presented a genetic algorithm for solving the Beehive Hidato Problem. To the best of the author s knowledge, this is the first work to adress this problem. A GA representation and a form to evaluate the individual fitness were specifically designed and implemented to solve the Beehive Hidato problem. The proposed algorithm uses GA operators commonly used for permutation representation problems, and the RTS niching technique, to assure diversity preservation, an important aspect in solving logic based puzzles [5]. A new strategy based on gene rate convergence (CBGI) is also proposed and tested in an attempt to improve the GA search, progressively reducing the search space by inserting new fixed given numbers to the problem during evolution. The main improvement observed with the inclusion of the CBGI strategy was: (i) a higher success rate for more challenging cases; and (ii) a higher convergence speed (lower averaged number of FEs to reach the global optimum). Although the mean results for the proposed GA and the GA-CBGI are very similar, we believe that this strategy can be further improved to give better results. The main drawback of this approach is that once a gene value is inserted in a wrong position, it will be a part of the problem and will stay unchanged until the end of the evolution, taking the algorithm in the direction of a wrong solution. Rather than inserting genes with high convergence rate as part of the Beehive Hidato problem, a strategy that spreads the values of the best individual s genes to the chromosomes of others individuals in the population may be a better option. These analyses are in progress and will be reported soon. References 1. Harik, G.R.: Finding Multimodal Solutions Using Restricted Tournament Selection. ICGA (1995) 2. Whitley, D.: Permutations, Handbook of Evolutionary Computation (1997) 3. Eiben, A.E., James E.S.: Introduction to Evolutionary Computing. Springer (2003) 4. Goldberg, D.E.: Genetic Algorithms in Search, Optimization and Machine Learning. Addison-Wesley (1989) 5. Segura, C. et al.: The importance of diversity in the application of evolutionary algorithms to the Sudoku problem. Evolutionary Computation (CEC), IEEE Congress (2016) 6. Singh, G., Deep, K.: A new membrane algorithm using the rules of Particle Swarm Optimization incorporated within the framework of cell-like P-systems to solve Sudoku. Applied Soft Computing. 54, (2016)
11 A Genetic Algorithm for Solving Hidato Puzzles Bartos, S.: Effective encoding of the Hidato and Numbrix puzzles to their CNF representation. Charles University, Bachelor thesis (2014) 8. Hidoku Solver Online, [Accessed 15 Aug. 2017] 9. Hidato, [Accessed 15 Aug. 2017] 10. de Magalhes, C.S., Almeida, D. M., Barbosa, H. J. C., Dardenne, L.E.: A dynamic niching genetic algorithm strategy for docking highly flexible ligands. Information Sciences. 289: (2014) 11. Mantere T., Improved ant colony genetic algorithm hybrid for sudoku solving, in Information and Communication Technologies (WICT), Third World Congress on, Dec 2013, pp (2013) 12. Z. Wang, T. Yasuda, and K. Ohkura, An evolutionary approach to sudoku puzzles with filtered mutations, in Evolutionary Computation (CEC), 2015 IEEE Congress on, May 2015, pp (2015) 13. L. Clementis, Advantage of parallel simulated annealing optimization by solving sudoku puzzle, in Emergent Trends in Robotics and Intelligent Systems, ser. Advances in Intelligent Systems and Computing, P. Sink, P. Hartono, M. Virkov, J. Vak, and R. Jaka, Eds. Springer International Publishing, 2015, vol. 316, pp (2015)
Solving and Analyzing Sudokus with Cultural Algorithms 5/30/2008. Timo Mantere & Janne Koljonen
with Cultural Algorithms Timo Mantere & Janne Koljonen University of Vaasa Department of Electrical Engineering and Automation P.O. Box, FIN- Vaasa, Finland timan@uwasa.fi & jako@uwasa.fi www.uwasa.fi/~timan/sudoku
More informationA Novel Multistage Genetic Algorithm Approach for Solving Sudoku Puzzle
A Novel Multistage Genetic Algorithm Approach for Solving Sudoku Puzzle Haradhan chel, Deepak Mylavarapu 2 and Deepak Sharma 2 Central Institute of Technology Kokrajhar,Kokrajhar, BTAD, Assam, India, PIN-783370
More informationEvolutionary Optimization for the Channel Assignment Problem in Wireless Mobile Network
(649 -- 917) Evolutionary Optimization for the Channel Assignment Problem in Wireless Mobile Network Y.S. Chia, Z.W. Siew, S.S. Yang, H.T. Yew, K.T.K. Teo Modelling, Simulation and Computing Laboratory
More informationAchieving Desirable Gameplay Objectives by Niched Evolution of Game Parameters
Achieving Desirable Gameplay Objectives by Niched Evolution of Game Parameters Scott Watson, Andrew Vardy, Wolfgang Banzhaf Department of Computer Science Memorial University of Newfoundland St John s.
More informationA Retrievable Genetic Algorithm for Efficient Solving of Sudoku Puzzles Seyed Mehran Kazemi, Bahare Fatemi
A Retrievable Genetic Algorithm for Efficient Solving of Sudoku Puzzles Seyed Mehran Kazemi, Bahare Fatemi Abstract Sudoku is a logic-based combinatorial puzzle game which is popular among people of different
More informationThe Behavior Evolving Model and Application of Virtual Robots
The Behavior Evolving Model and Application of Virtual Robots Suchul Hwang Kyungdal Cho V. Scott Gordon Inha Tech. College Inha Tech College CSUS, Sacramento 253 Yonghyundong Namku 253 Yonghyundong Namku
More informationLANDSCAPE SMOOTHING OF NUMERICAL PERMUTATION SPACES IN GENETIC ALGORITHMS
LANDSCAPE SMOOTHING OF NUMERICAL PERMUTATION SPACES IN GENETIC ALGORITHMS ABSTRACT The recent popularity of genetic algorithms (GA s) and their application to a wide range of problems is a result of their
More informationEvolution of Sensor Suites for Complex Environments
Evolution of Sensor Suites for Complex Environments Annie S. Wu, Ayse S. Yilmaz, and John C. Sciortino, Jr. Abstract We present a genetic algorithm (GA) based decision tool for the design and configuration
More informationSmart Grid Reconfiguration Using Genetic Algorithm and NSGA-II
Smart Grid Reconfiguration Using Genetic Algorithm and NSGA-II 1 * Sangeeta Jagdish Gurjar, 2 Urvish Mewada, 3 * Parita Vinodbhai Desai 1 Department of Electrical Engineering, AIT, Gujarat Technical University,
More informationAdaptive Hybrid Channel Assignment in Wireless Mobile Network via Genetic Algorithm
Adaptive Hybrid Channel Assignment in Wireless Mobile Network via Genetic Algorithm Y.S. Chia Z.W. Siew A. Kiring S.S. Yang K.T.K. Teo Modelling, Simulation and Computing Laboratory School of Engineering
More informationSolving Sudoku with Genetic Operations that Preserve Building Blocks
Solving Sudoku with Genetic Operations that Preserve Building Blocks Yuji Sato, Member, IEEE, and Hazuki Inoue Abstract Genetic operations that consider effective building blocks are proposed for using
More informationCS 441/541 Artificial Intelligence Fall, Homework 6: Genetic Algorithms. Due Monday Nov. 24.
CS 441/541 Artificial Intelligence Fall, 2008 Homework 6: Genetic Algorithms Due Monday Nov. 24. In this assignment you will code and experiment with a genetic algorithm as a method for evolving control
More informationA comparison of a genetic algorithm and a depth first search algorithm applied to Japanese nonograms
A comparison of a genetic algorithm and a depth first search algorithm applied to Japanese nonograms Wouter Wiggers Faculty of EECMS, University of Twente w.a.wiggers@student.utwente.nl ABSTRACT In this
More informationImprovement of Robot Path Planning Using Particle. Swarm Optimization in Dynamic Environments. with Mobile Obstacles and Target
Advanced Studies in Biology, Vol. 3, 2011, no. 1, 43-53 Improvement of Robot Path Planning Using Particle Swarm Optimization in Dynamic Environments with Mobile Obstacles and Target Maryam Yarmohamadi
More informationAn Evolutionary Approach to the Synthesis of Combinational Circuits
An Evolutionary Approach to the Synthesis of Combinational Circuits Cecília Reis Institute of Engineering of Porto Polytechnic Institute of Porto Rua Dr. António Bernardino de Almeida, 4200-072 Porto Portugal
More informationGenetic Algorithms with Heuristic Knight s Tour Problem
Genetic Algorithms with Heuristic Knight s Tour Problem Jafar Al-Gharaibeh Computer Department University of Idaho Moscow, Idaho, USA Zakariya Qawagneh Computer Department Jordan University for Science
More informationFOUR TOTAL TRANSFER CAPABILITY. 4.1 Total transfer capability CHAPTER
CHAPTER FOUR TOTAL TRANSFER CAPABILITY R structuring of power system aims at involving the private power producers in the system to supply power. The restructured electric power industry is characterized
More informationSolving Assembly Line Balancing Problem using Genetic Algorithm with Heuristics- Treated Initial Population
Solving Assembly Line Balancing Problem using Genetic Algorithm with Heuristics- Treated Initial Population 1 Kuan Eng Chong, Mohamed K. Omar, and Nooh Abu Bakar Abstract Although genetic algorithm (GA)
More informationWire Layer Geometry Optimization using Stochastic Wire Sampling
Wire Layer Geometry Optimization using Stochastic Wire Sampling Raymond A. Wildman*, Joshua I. Kramer, Daniel S. Weile, and Philip Christie Department University of Delaware Introduction Is it possible
More informationThe Application of Multi-Level Genetic Algorithms in Assembly Planning
Volume 17, Number 4 - August 2001 to October 2001 The Application of Multi-Level Genetic Algorithms in Assembly Planning By Dr. Shana Shiang-Fong Smith (Shiang-Fong Chen) and Mr. Yong-Jin Liu KEYWORD SEARCH
More informationComputational Intelligence Optimization
Computational Intelligence Optimization Ferrante Neri Department of Mathematical Information Technology, University of Jyväskylä 12.09.2011 1 What is Optimization? 2 What is a fitness landscape? 3 Features
More informationTABLE OF CONTENTS CHAPTER NO. TITLE PAGE NO. LIST OF TABLES LIST OF FIGURES LIST OF SYMBOLS AND ABBREVIATIONS
vi TABLE OF CONTENTS CHAPTER TITLE PAGE ABSTRACT LIST OF TABLES LIST OF FIGURES LIST OF SYMBOLS AND ABBREVIATIONS iii viii x xiv 1 INTRODUCTION 1 1.1 DISK SCHEDULING 1 1.2 WINDOW-CONSTRAINED SCHEDULING
More informationAN EVOLUTIONARY ALGORITHM FOR CHANNEL ASSIGNMENT PROBLEM IN WIRELESS MOBILE NETWORKS
ISSN: 2229-6948(ONLINE) DOI: 10.21917/ict.2012.0087 ICTACT JOURNAL ON COMMUNICATION TECHNOLOGY, DECEMBER 2012, VOLUME: 03, ISSUE: 04 AN EVOLUTIONARY ALGORITHM FOR CHANNEL ASSIGNMENT PROBLEM IN WIRELESS
More informationCreating a Dominion AI Using Genetic Algorithms
Creating a Dominion AI Using Genetic Algorithms Abstract Mok Ming Foong Dominion is a deck-building card game. It allows for complex strategies, has an aspect of randomness in card drawing, and no obvious
More informationChapter 5 OPTIMIZATION OF BOW TIE ANTENNA USING GENETIC ALGORITHM
Chapter 5 OPTIMIZATION OF BOW TIE ANTENNA USING GENETIC ALGORITHM 5.1 Introduction This chapter focuses on the use of an optimization technique known as genetic algorithm to optimize the dimensions of
More informationNUMERICAL SIMULATION OF SELF-STRUCTURING ANTENNAS BASED ON A GENETIC ALGORITHM OPTIMIZATION SCHEME
NUMERICAL SIMULATION OF SELF-STRUCTURING ANTENNAS BASED ON A GENETIC ALGORITHM OPTIMIZATION SCHEME J.E. Ross * John Ross & Associates 350 W 800 N, Suite 317 Salt Lake City, UT 84103 E.J. Rothwell, C.M.
More informationShuffled Complex Evolution
Shuffled Complex Evolution Shuffled Complex Evolution An Evolutionary algorithm That performs local and global search A solution evolves locally through a memetic evolution (Local search) This local search
More informationA Review on Genetic Algorithm and Its Applications
2017 IJSRST Volume 3 Issue 8 Print ISSN: 2395-6011 Online ISSN: 2395-602X Themed Section: Science and Technology A Review on Genetic Algorithm and Its Applications Anju Bala Research Scholar, Department
More informationCYCLIC GENETIC ALGORITHMS FOR EVOLVING MULTI-LOOP CONTROL PROGRAMS
CYCLIC GENETIC ALGORITHMS FOR EVOLVING MULTI-LOOP CONTROL PROGRAMS GARY B. PARKER, CONNECTICUT COLLEGE, USA, parker@conncoll.edu IVO I. PARASHKEVOV, CONNECTICUT COLLEGE, USA, iipar@conncoll.edu H. JOSEPH
More informationSECTOR SYNTHESIS OF ANTENNA ARRAY USING GENETIC ALGORITHM
2005-2008 JATIT. All rights reserved. SECTOR SYNTHESIS OF ANTENNA ARRAY USING GENETIC ALGORITHM 1 Abdelaziz A. Abdelaziz and 2 Hanan A. Kamal 1 Assoc. Prof., Department of Electrical Engineering, Faculty
More informationComparing Methods for Solving Kuromasu Puzzles
Comparing Methods for Solving Kuromasu Puzzles Leiden Institute of Advanced Computer Science Bachelor Project Report Tim van Meurs Abstract The goal of this bachelor thesis is to examine different methods
More informationPID Controller Tuning using Soft Computing Methodologies for Industrial Process- A Comparative Approach
Indian Journal of Science and Technology, Vol 7(S7), 140 145, November 2014 ISSN (Print) : 0974-6846 ISSN (Online) : 0974-5645 PID Controller Tuning using Soft Computing Methodologies for Industrial Process-
More informationARRANGING WEEKLY WORK PLANS IN CONCRETE ELEMENT PREFABRICATION USING GENETIC ALGORITHMS
ARRANGING WEEKLY WORK PLANS IN CONCRETE ELEMENT PREFABRICATION USING GENETIC ALGORITHMS Chien-Ho Ko 1 and Shu-Fan Wang 2 ABSTRACT Applying lean production concepts to precast fabrication have been proven
More information2. Simulated Based Evolutionary Heuristic Methodology
XXVII SIM - South Symposium on Microelectronics 1 Simulation-Based Evolutionary Heuristic to Sizing Analog Integrated Circuits Lucas Compassi Severo, Alessandro Girardi {lucassevero, alessandro.girardi}@unipampa.edu.br
More informationApplication of Layered Encoding Cascade Optimization Model to Optimize Single Stage Amplifier Circuit Design
J. Basic. Appl. Sci. Res., 4(1)273-280, 2014 2014, TextRoad Publication ISSN 2090-4304 Journal of Basic and Applied Scientific Research www.textroad.com Application of Layered Encoding Cascade Optimization
More informationCPS331 Lecture: Genetic Algorithms last revised October 28, 2016
CPS331 Lecture: Genetic Algorithms last revised October 28, 2016 Objectives: 1. To explain the basic ideas of GA/GP: evolution of a population; fitness, crossover, mutation Materials: 1. Genetic NIM learner
More informationANGLE MODULATED SIMULATED KALMAN FILTER ALGORITHM FOR COMBINATORIAL OPTIMIZATION PROBLEMS
ANGLE MODULATED SIMULATED KALMAN FILTER ALGORITHM FOR COMBINATORIAL OPTIMIZATION PROBLEMS Zulkifli Md Yusof 1, Zuwairie Ibrahim 1, Ismail Ibrahim 1, Kamil Zakwan Mohd Azmi 1, Nor Azlina Ab Aziz 2, Nor
More informationBiologically Inspired Embodied Evolution of Survival
Biologically Inspired Embodied Evolution of Survival Stefan Elfwing 1,2 Eiji Uchibe 2 Kenji Doya 2 Henrik I. Christensen 1 1 Centre for Autonomous Systems, Numerical Analysis and Computer Science, Royal
More informationGenetic Algorithms for Optimal Channel. Assignments in Mobile Communications
Genetic Algorithms for Optimal Channel Assignments in Mobile Communications Lipo Wang*, Sa Li, Sokwei Cindy Lay, Wen Hsin Yu, and Chunru Wan School of Electrical and Electronic Engineering Nanyang Technological
More informationIntroduction to Genetic Algorithms
Introduction to Genetic Algorithms Peter G. Anderson, Computer Science Department Rochester Institute of Technology, Rochester, New York anderson@cs.rit.edu http://www.cs.rit.edu/ February 2004 pg. 1 Abstract
More informationThe Genetic Algorithm
The Genetic Algorithm The Genetic Algorithm, (GA) is finding increasing applications in electromagnetics including antenna design. In this lesson we will learn about some of these techniques so you are
More informationDynamic Spectrum Allocation for Cognitive Radio. Using Genetic Algorithm
Abstract Cognitive radio (CR) has emerged as a promising solution to the current spectral congestion problem by imparting intelligence to the conventional software defined radio that allows spectrum sharing
More informationA Factorial Representation of Permutations and Its Application to Flow-Shop Scheduling
Systems and Computers in Japan, Vol. 38, No. 1, 2007 Translated from Denshi Joho Tsushin Gakkai Ronbunshi, Vol. J85-D-I, No. 5, May 2002, pp. 411 423 A Factorial Representation of Permutations and Its
More informationImplementation of FPGA based Decision Making Engine and Genetic Algorithm (GA) for Control of Wireless Parameters
Advances in Computational Sciences and Technology ISSN 0973-6107 Volume 11, Number 1 (2018) pp. 15-21 Research India Publications http://www.ripublication.com Implementation of FPGA based Decision Making
More informationFreeCiv Learner: A Machine Learning Project Utilizing Genetic Algorithms
FreeCiv Learner: A Machine Learning Project Utilizing Genetic Algorithms Felix Arnold, Bryan Horvat, Albert Sacks Department of Computer Science Georgia Institute of Technology Atlanta, GA 30318 farnold3@gatech.edu
More informationVariable Size Population NSGA-II VPNSGA-II Technical Report Giovanni Rappa Queensland University of Technology (QUT), Brisbane, Australia 2014
Variable Size Population NSGA-II VPNSGA-II Technical Report Giovanni Rappa Queensland University of Technology (QUT), Brisbane, Australia 2014 1. Introduction Multi objective optimization is an active
More informationAutomatically Generating Puzzle Problems with Varying Complexity
Automatically Generating Puzzle Problems with Varying Complexity Amy Chou and Justin Kaashoek Mentor: Rishabh Singh Fourth Annual PRIMES MIT Conference May 19th, 2014 The Motivation We want to help people
More informationA Hybrid Evolutionary Approach for Multi Robot Path Exploration Problem
A Hybrid Evolutionary Approach for Multi Robot Path Exploration Problem K.. enthilkumar and K. K. Bharadwaj Abstract - Robot Path Exploration problem or Robot Motion planning problem is one of the famous
More informationOptimization of Tile Sets for DNA Self- Assembly
Optimization of Tile Sets for DNA Self- Assembly Joel Gawarecki Department of Computer Science Simpson College Indianola, IA 50125 joel.gawarecki@my.simpson.edu Adam Smith Department of Computer Science
More informationA Multi-Population Parallel Genetic Algorithm for Continuous Galvanizing Line Scheduling
A Multi-Population Parallel Genetic Algorithm for Continuous Galvanizing Line Scheduling Muzaffer Kapanoglu Department of Industrial Engineering Eskişehir Osmangazi University 26030, Eskisehir, Turkey
More informationOptimization of Time of Day Plan Scheduling Using a Multi-Objective Evolutionary Algorithm
University of Nebraska - Lincoln DigitalCommons@University of Nebraska - Lincoln Civil Engineering Faculty Publications Civil Engineering 1-2005 Optimization of Time of Day Plan Scheduling Using a Multi-Objective
More informationCONTROLLER DESIGN BASED ON CARTESIAN GENETIC PROGRAMMING IN MATLAB
CONTROLLER DESIGN BASED ON CARTESIAN GENETIC PROGRAMMING IN MATLAB Branislav Kadlic, Ivan Sekaj ICII, Faculty of Electrical Engineering and Information Technology, Slovak University of Technology in Bratislava
More informationPseudo Noise Sequence Generation using Elliptic Curve for CDMA and Security Application
IJIRST International Journal for Innovative Research in Science & Technology Volume 1 Issue 11 April 2015 ISSN (online): 2349-6010 Pseudo Noise Sequence Generation using Elliptic Curve for CDMA and Security
More informationReview of Soft Computing Techniques used in Robotics Application
International Journal of Information and Computation Technology. ISSN 0974-2239 Volume 3, Number 3 (2013), pp. 101-106 International Research Publications House http://www. irphouse.com /ijict.htm Review
More informationLecture 10: Memetic Algorithms - I. An Introduction to Meta-Heuristics, Produced by Qiangfu Zhao (Since 2012), All rights reserved
Lecture 10: Memetic Algorithms - I Lec10/1 Contents Definition of memetic algorithms Definition of memetic evolution Hybrids that are not memetic algorithms 1 st order memetic algorithms 2 nd order memetic
More informationReactive Planning with Evolutionary Computation
Reactive Planning with Evolutionary Computation Chaiwat Jassadapakorn and Prabhas Chongstitvatana Intelligent System Laboratory, Department of Computer Engineering Chulalongkorn University, Bangkok 10330,
More informationFault Location Using Sparse Wide Area Measurements
319 Study Committee B5 Colloquium October 19-24, 2009 Jeju Island, Korea Fault Location Using Sparse Wide Area Measurements KEZUNOVIC, M., DUTTA, P. (Texas A & M University, USA) Summary Transmission line
More informationPosition Control of Servo Systems using PID Controller Tuning with Soft Computing Optimization Techniques
Position Control of Servo Systems using PID Controller Tuning with Soft Computing Optimization Techniques P. Ravi Kumar M.Tech (control systems) Gudlavalleru engineering college Gudlavalleru,Andhra Pradesh,india
More informationOPTIMIZATION ON FOOTING LAYOUT DESI RESIDENTIAL HOUSE WITH PILES FOUNDA. Author(s) BUNTARA.S. GAN; NGUYEN DINH KIEN
Title OPTIMIZATION ON FOOTING LAYOUT DESI RESIDENTIAL HOUSE WITH PILES FOUNDA Author(s) BUNTARA.S. GAN; NGUYEN DINH KIEN Citation Issue Date 2013-09-11 DOI Doc URLhttp://hdl.handle.net/2115/54229 Right
More informationPopulation Adaptation for Genetic Algorithm-based Cognitive Radios
Population Adaptation for Genetic Algorithm-based Cognitive Radios Timothy R. Newman, Rakesh Rajbanshi, Alexander M. Wyglinski, Joseph B. Evans, and Gary J. Minden Information Technology and Telecommunications
More informationNAVIGATION OF MOBILE ROBOT USING THE PSO PARTICLE SWARM OPTIMIZATION
Journal of Academic and Applied Studies (JAAS) Vol. 2(1) Jan 2012, pp. 32-38 Available online @ www.academians.org ISSN1925-931X NAVIGATION OF MOBILE ROBOT USING THE PSO PARTICLE SWARM OPTIMIZATION Sedigheh
More informationEffect of Parameter Tuning on Performance of Cuckoo Search Algorithm for Optimal Reactive Power Dispatch
RESEARCH ARTICLE OPEN ACCESS Effect of Parameter Tuning on Performance of Cuckoo Search Algorithm for Optimal Reactive Power Dispatch Tejaswini Sharma Laxmi Srivastava Department of Electrical Engineering
More information1 Introduction
Published in IET Electric Power Applications Received on 8th October 2008 Revised on 9th January 2009 ISSN 1751-8660 Recursive genetic algorithm-finite element method technique for the solution of transformer
More informationDesign and Development of an Optimized Fuzzy Proportional-Integral-Derivative Controller using Genetic Algorithm
INTERNATIONAL CONFERENCE ON CONTROL, AUTOMATION, COMMUNICATION AND ENERGY CONSERVATION 2009, KEC/INCACEC/708 Design and Development of an Optimized Fuzzy Proportional-Integral-Derivative Controller using
More informationMulti-objective Optimization Inspired by Nature
Evolutionary algorithms Multi-objective Optimization Inspired by Nature Jürgen Branke Institute AIFB University of Karlsruhe, Germany Karlsruhe Institute of Technology Darwin s principle of natural evolution:
More informationOptimization of Recloser Placement to Improve Reliability by Genetic Algorithm
Energy and Power Engineering, 2011, 3, 508-512 doi:10.4236/epe.2011.34061 Published Online September 2011 (http://www.scirp.org/journal/epe) Optimization of Recloser Placement to Improve Reliability by
More informationRating and Generating Sudoku Puzzles Based On Constraint Satisfaction Problems
Rating and Generating Sudoku Puzzles Based On Constraint Satisfaction Problems Bahare Fatemi, Seyed Mehran Kazemi, Nazanin Mehrasa International Science Index, Computer and Information Engineering waset.org/publication/9999524
More informationISudoku. Jonathon Makepeace Matthew Harris Jamie Sparrow Julian Hillebrand
Jonathon Makepeace Matthew Harris Jamie Sparrow Julian Hillebrand ISudoku Abstract In this paper, we will analyze and discuss the Sudoku puzzle and implement different algorithms to solve the puzzle. After
More informationTechniques for Generating Sudoku Instances
Chapter Techniques for Generating Sudoku Instances Overview Sudoku puzzles become worldwide popular among many players in different intellectual levels. In this chapter, we are going to discuss different
More informationGeneric optimization for SMPS design with Smart Scan and Genetic Algorithm
Generic optimization for SMPS design with Smart Scan and Genetic Algorithm H. Yeung *, N. K. Poon * and Stephen L. Lai * * PowerELab Limited, Hong Kong, HKSAR Abstract the paper presents a new approach
More informationCOMPUTATONAL INTELLIGENCE
COMPUTATONAL INTELLIGENCE October 2011 November 2011 Siegfried Nijssen partially based on slides by Uzay Kaymak Leiden Institute of Advanced Computer Science e-mail: snijssen@liacs.nl Katholieke Universiteit
More informationLocal Search: Hill Climbing. When A* doesn t work AIMA 4.1. Review: Hill climbing on a surface of states. Review: Local search and optimization
Outline When A* doesn t work AIMA 4.1 Local Search: Hill Climbing Escaping Local Maxima: Simulated Annealing Genetic Algorithms A few slides adapted from CS 471, UBMC and Eric Eaton (in turn, adapted from
More informationReal-Coded Genetic Algorithm for Robust Design of UPFC Supplementary Damping Controller
Real-Coded Genetic Algorithm for Robust Design of UPFC Supplementary Damping Controller S. C. Swain, S. Mohapatra, S. Panda & S. R. Nayak Abstract - In this paper is used in Designing UPFC based supplementary
More informationLoad Frequency Controller Design for Interconnected Electric Power System
Load Frequency Controller Design for Interconnected Electric Power System M. A. Tammam** M. A. S. Aboelela* M. A. Moustafa* A. E. A. Seif* * Department of Electrical Power and Machines, Faculty of Engineering,
More informationAn Optimized Performance Amplifier
Electrical and Electronic Engineering 217, 7(3): 85-89 DOI: 1.5923/j.eee.21773.3 An Optimized Performance Amplifier Amir Ashtari Gargari *, Neginsadat Tabatabaei, Ghazal Mirzaei School of Electrical and
More informationA COMPARATIVE APPROACH ON PID CONTROLLER TUNING USING SOFT COMPUTING TECHNIQUES
A COMPARATIVE APPROACH ON PID CONTROLLER TUNING USING SOFT COMPUTING TECHNIQUES 1 T.K.Sethuramalingam, 2 B.Nagaraj 1 Research Scholar, Department of EEE, AMET University, Chennai 2 Professor, Karpagam
More informationA Genetic Algorithm-Based Controller for Decentralized Multi-Agent Robotic Systems
A Genetic Algorithm-Based Controller for Decentralized Multi-Agent Robotic Systems Arvin Agah Bio-Robotics Division Mechanical Engineering Laboratory, AIST-MITI 1-2 Namiki, Tsukuba 305, JAPAN agah@melcy.mel.go.jp
More informationAntenna Array Synthesis for Suppressed Side Lobe Level Using Evolutionary Algorithms
Antenna Array Synthesis for Suppressed Side Lobe Level Using Evolutionary Algorithms Ch.Ramesh, P.Mallikarjuna Rao Abstract: - Antenna performance was greatly reduced by the presence of the side lobe level
More informationMachine Learning in Iterated Prisoner s Dilemma using Evolutionary Algorithms
ITERATED PRISONER S DILEMMA 1 Machine Learning in Iterated Prisoner s Dilemma using Evolutionary Algorithms Department of Computer Science and Engineering. ITERATED PRISONER S DILEMMA 2 OUTLINE: 1. Description
More informationSlotted Multiband PIFA antenna with Slotted Ground Plane for Wireless Mobile Applications
I J C T A, 9(2-A), 2016, pp. 711-718 International Science Press Slotted Multiband PIFA antenna with Slotted Ground Plane for Wireless Mobile Applications Layla Wakrim*, Saida Ibnyaich* and Moha M Rabet
More informationEvolutionary Programming Optimization Technique for Solving Reactive Power Planning in Power System
Evolutionary Programg Optimization Technique for Solving Reactive Power Planning in Power System ISMAIL MUSIRIN, TITIK KHAWA ABDUL RAHMAN Faculty of Electrical Engineering MARA University of Technology
More informationA Novel Approach to Solving N-Queens Problem
A Novel Approach to Solving N-ueens Problem Md. Golam KAOSAR Department of Computer Engineering King Fahd University of Petroleum and Minerals Dhahran, KSA and Mohammad SHORFUZZAMAN and Sayed AHMED Department
More informationA COMPACT TRI-BAND ANTENNA DESIGN USING BOOLEAN DIFFERENTIAL EVOLUTION ALGORITHM. Xidian University, Xi an, Shaanxi , P. R.
Progress In Electromagnetics Research C, Vol. 32, 139 149, 2012 A COMPACT TRI-BAND ANTENNA DESIGN USING BOOLEAN DIFFERENTIAL EVOLUTION ALGORITHM D. Li 1, *, F.-S. Zhang 1, and J.-H. Ren 2 1 National Key
More informationMeta-Heuristic Approach for Supporting Design-for- Disassembly towards Efficient Material Utilization
Meta-Heuristic Approach for Supporting Design-for- Disassembly towards Efficient Material Utilization Yoshiaki Shimizu *, Kyohei Tsuji and Masayuki Nomura Production Systems Engineering Toyohashi University
More informationDetermination of the PID Controller Parameters by Modified Genetic Algorithm for Improved Performance
JOURNAL OF INFORMATION SCIENCE AND ENGINEERING 23, 1469-1480 (2007) Determination of the PID Controller Parameters by Modified Genetic Algorithm for Improved Performance Department of Electrical Electronic
More informationFINANCIAL TIME SERIES FORECASTING USING A HYBRID NEURAL- EVOLUTIVE APPROACH
FINANCIAL TIME SERIES FORECASTING USING A HYBRID NEURAL- EVOLUTIVE APPROACH JUAN J. FLORES 1, ROBERTO LOAEZA 1, HECTOR RODRIGUEZ 1, FEDERICO GONZALEZ 2, BEATRIZ FLORES 2, ANTONIO TERCEÑO GÓMEZ 3 1 Division
More informationState assignment for Sequential Circuits using Multi- Objective Genetic Algorithm
State assignment for Sequential Circuits using Multi- Objective Genetic Algorithm Journal: Manuscript ID: CDT-2010-0045.R2 Manuscript Type: Research Paper Date Submitted by the Author: n/a Complete List
More informationInternational Journal of Modern Trends in Engineering and Research. Optimizing Search Space of Othello Using Hybrid Approach
International Journal of Modern Trends in Engineering and Research www.ijmter.com Optimizing Search Space of Othello Using Hybrid Approach Chetan Chudasama 1, Pramod Tripathi 2, keyur Prajapati 3 1 Computer
More informationUsing Artificial intelligent to solve the game of 2048
Using Artificial intelligent to solve the game of 2048 Ho Shing Hin (20343288) WONG, Ngo Yin (20355097) Lam Ka Wing (20280151) Abstract The report presents the solver of the game 2048 base on artificial
More informationEvolving Digital Logic Circuits on Xilinx 6000 Family FPGAs
Evolving Digital Logic Circuits on Xilinx 6000 Family FPGAs T. C. Fogarty 1, J. F. Miller 1, P. Thomson 1 1 Department of Computer Studies Napier University, 219 Colinton Road, Edinburgh t.fogarty@dcs.napier.ac.uk
More informationUSING GENETIC ALGORITHMS TO EVOLVE CHARACTER BEHAVIOURS IN MODERN VIDEO GAMES
USING GENETIC ALGORITHMS TO EVOLVE CHARACTER BEHAVIOURS IN MODERN VIDEO GAMES T. Bullen and M. Katchabaw Department of Computer Science The University of Western Ontario London, Ontario, Canada N6A 5B7
More informationCOGNITIVE RADIOS WITH GENETIC ALGORITHMS: INTELLIGENT CONTROL OF SOFTWARE DEFINED RADIOS
COGNITIVE RADIOS WITH GENETIC ALGORITHMS: INTELLIGENT CONTROL OF SOFTWARE DEFINED RADIOS Thomas W. Rondeau, Bin Le, Christian J. Rieser, Charles W. Bostian Center for Wireless Telecommunications (CWT)
More informationSolving Japanese Puzzles with Heuristics
Solving Japanese Puzzles with Heuristics Sancho Salcedo-Sanz, Emilio G. Ortíz-García, Angel M. Pérez-Bellido, Antonio Portilla-Figueras and Xin Yao Department of Signal Theory and Communications Universidad
More informationEvolutionary Computation and Machine Intelligence
Evolutionary Computation and Machine Intelligence Prabhas Chongstitvatana Chulalongkorn University necsec 2005 1 What is Evolutionary Computation What is Machine Intelligence How EC works Learning Robotics
More informationIntrinsic Evolution of Analog Circuits on a Programmable Analog Multiplexer Array
Intrinsic Evolution of Analog Circuits on a Programmable Analog Multiplexer Array José Franco M. Amaral 1, Jorge Luís M. Amaral 1, Cristina C. Santini 2, Marco A.C. Pacheco 2, Ricardo Tanscheit 2, and
More informationEvolutionary Image Enhancement for Impulsive Noise Reduction
Evolutionary Image Enhancement for Impulsive Noise Reduction Ung-Keun Cho, Jin-Hyuk Hong, and Sung-Bae Cho Dept. of Computer Science, Yonsei University Biometrics Engineering Research Center 134 Sinchon-dong,
More informationPrinter Model + Genetic Algorithm = Halftone Masks
Printer Model + Genetic Algorithm = Halftone Masks Peter G. Anderson, Jonathan S. Arney, Sunadi Gunawan, Kenneth Stephens Laboratory for Applied Computing Rochester Institute of Technology Rochester, New
More informationA Genetic Approach with a Simple Fitness Function for Sorting Unsigned Permutations by Reversals
A Genetic Approach with a Simple Fitness Function for Sorting Unsigned Permutations by Reversals José Luis Soncco Álvarez Department of Computer Science University of Brasilia Brasilia, D.F., Brazil Email:
More informationSudoku Tutor 1.0 User Manual
Sudoku Tutor 1.0 User Manual CAPABILITIES OF SUDOKU TUTOR 1.0... 2 INSTALLATION AND START-UP... 3 PURCHASE OF LICENSING AND REGISTRATION... 4 QUICK START MAIN FEATURES... 5 INSERTION AND REMOVAL... 5 AUTO
More informationHarmonic Minimization for Cascade Multilevel Inverter based on Genetic Algorithm
Harmonic Minimization for Cascade Multilevel Inverter based on Genetic Algorithm Ranjhitha.G 1, Padmanaban.K 2 PG Scholar, Department of EEE, Gnanamani College of Engineering, Namakkal, India 1 Assistant
More information