PARALLEL GENETIC ALGORITHMS IMPLEMENTED ON TRANSPUTERS
|
|
- Todd Parker
- 5 years ago
- Views:
Transcription
1 PARALLEL GENETIC ALGORITHMS IMPLEMENTED ON TRANSPUTERS Viktor Nìmec, Josef Schwarz Technical University of Brno Faculty of Engineering and Computer Science Department of Computer Science and Engineering CZ Brno, Bozetechova 2 nemecv@dcse.fee.vutbr.cz schwarz@dcse.fee.vutbr.cz Abstract: This paper deals with a course-grain parallel genetic algorithm for solving the placement and TSP problem as well. Both of them are typical tasks from the field of the layout design of VLSI circuits. It can be proved that both are NP problems. A TRANSGEN program was created in OCCAM language, which enables wide class experiments via extensive menu for setting main parameters of genetic optimization. The main attention was paid to the adaptation of main genetics operators including the migration operator usable for placement optimization. To test TRANSGEN algorithm some experiments were done. A few circuits were used to be illustrated the behaviour of the algorithm. From this experiments we have concluded that the achieved linear speedup of the parallel version of the genetic program is effected by a better covergence of the itaration process. Key words: optimalization, layout, TSP, parallel genetic algorithm, transputers, granularity INTRODUCTION Placement is a cruical task in the layout of VLSI circuits and PCBs (printed circuit boards). It has a great impact on the cost and routability. It can be characterizied by an assigment of circuit elements(modules) to locations on a chip or PCB (printed circuit boards). Let E={e 1,...e n } be a set of circuit elements and set of nets, S={s 1,...,s k }, where a net is a set of elements to be interconnect. A set of locations L={l 1,...l n } is given. The locations (slots) are organized upon the layout styles. To simplify the problem the set of slots forms a regular structure of locations with c columns and r rows with unit distance of neighbour location. The objective function is minimal total sum of wires, which realize the nets. To precise the problem the hypergraph is used for the representation of the circuit and the position graph is used for the slots representation. Many different techniques are used to solve the placement problem [1]. Well known among them are the simulated annealing and decomposition methods. The genetic algorithm seems to be a new powerful optimization approach, which is based on the idea of optimizing by simulating the natural process of evolution. From the nature of genetic algorithm flows the high suitability for the parallelization of the simple sequential genetic algorithm. We have developed PGA -a parallel genetic algorithm on transputers T800, T9000 using the basic group of four genetic operators - selection (reproduction), crossover, mutation and migration.
2 Two possible implementations are presented in the paper - fine-grain and coarse-grain one. Experiments showed that perfect domain decomposition is the most advantageous method for implementing such genetic algorithm. Our approach was tested on travelling salesman (TSP) and genetic placement (GP) problems. TRANSPUTER ENVIRONMENT 1. Processor description We will describe a processor architecture the genetic algorithms have been implemented on and parallel principles of our approach in this section. We have worked with transputers - parallel processors manufactured by INMOS company. The transputer is a microcomputer with its own local memory and with links for connecting one transputer to another. It is possible to execute unlimited number of parallel processes on one processor because of its internal architecture (in this case we will obtain a pseudoparallel structure). A transputer network can be built by interconnecting more processors (transputers) via links. Processes executed on different nodes of this network runs in parallel and can communicate between themselves using channels. The transputer is then classed among MIMD (multiple instruction streams over multiple data streams) architectures. A language OCCAM is used for programing the transputers. The language OCCAM allows user to write parallel programms easily. The language OCCAM contains construct PAR for executing parallel processes and two special operators? and! are used for communication between processes. We have used this language for implementing the parallel genetic algorithms. 2. Algorithm implementation A genetic algorithm in general has three main parts: initialization (creation of initial population - this step is made only once at the beginning of the algorithm), reproduction and evaluation (these two steps are repeated in a loop). There can be more approaches to parallelization of such algorithm. Fine-granularity approach exploits parallel aspects of genetic algorithms to maximum. Evaluation of individuals can be decomposed into a number of parallel modules equivalent to a size of a generation. Each module evaluates one individual. Reproduction can be done in separate modules as well. Each module receives two individuals (parents) as parameters then performs the crossover and it returns a new individual (offspring) as the result. According to the terminology introduced in [2] these modules are called homes. The set of homes represents the colony. So far we have described a standard genetic algorithm with some parallel improvements. The colony represents the whole generation. Such decomposition may improve the speed of the algorithm when implemented on parallel processors, but it doesn t improve the efficiency of the algorithm. Experiments showed that this approach is not so advantageous because of large amount of communication between all modules. When the size of colony is great the communication overhead significantly slowes down the computations. The parallelizing of evaluation and the reproduction is not very promising then. We present another simple but effective parallelization technique here. We have used the coarse - granularity approach which brings a new aspect to the decomposition of the genetic algorithms. The main idea consists in dividing the generation of individuals into more colonies which exchange genetic material in certain intervals. This parallelization technique avoids the communication with trivial parallelization schemes. The distributed placement procedure (colony) is in fact a basic sequential genetic algorithm. This algorithm evaluates and reproduces certain amount of individuals in sequential way. These procedures are mapped onto a transputer network and executed in parallel. The procedures form a ring topology which is deadlock free. A new genetic operator migration is introduced. Migration transfers genetic individuals from one environment to another. Implementation of a genetic algorithm as described above falls into the perfect domain decomposition category. Very little communication overhead and the balanced computation results in almost 100% efficiency. This was also proved by our experiments.
3 DETAILS OF PGA ON THE PLACEMENT PROBLEM 1. String encoding. Several representations of the different complexity were considered for the string/placement. Finally an extended encoding was used. A serial number is associated with each symbol (node of hypergraph/element of circuit) in the string, which represents the node allocation (number of slot) in the placement. Thus, symbols in the string are position independent. When a node is moved along the string the interpretation of the string remains unchanged. It allows simply to change the slot ordering.. 2. Population size and offspring size. The population size N p and offspring size N o determines processing time and result quality. The both parameters are provided by the user. The parameter N p and N o are considered to be from 5 to 300. From experimental observation [4], it was found, that the relative small population of about 30 individuals/configutations gives the reasonable performance. The suitable number of generated offsprings N o is about 30% of population size [3]. In case of grain coarse PGA the size of the total population is about 300 and it is distributed into 2,5 or 10 subpopulation. Each population is allocated to each process and the standard GA is performed on each process. 3. Fitness function. The fitness function used in the procedure Evaluation is based upon the classical objective function of the minimal total sum of wires. The length of wires is estimated by the minimal semiperimeter of rectangle enclosing elements of each net (HSP). It is easy to compute and it is often used as standard measure of the net complexity. It can be proved that the sum of semiperimeters equals the sum of mincut values used as a criterion in decomposition algorithms (Breuer mincut algorithm). In case of standard cell placement it would be necessary to extend the simple objective function with penalty subfunction to effect the overlapping of standard cells. Fitness function is based on the objective function. We compute the sum of costs (total wire lengths) at first. The fitness function are then computed as the division of the sum by each cost. The smaller the cost the higher is its fitness function. Suitable parents for crossover are then selected according to their fitness function in the reproduction phase of our algorithm. 4. Crossover operator. The traditional crossover operator which is used typically for the bit string is not suitable for the placement problem because it produces very often irregular configuration (conflict crossing). We used the powerfull conflictless operator called PMX [2] (Partially Map Crossover). Usually the parents are chosen from the population on the basis of their fitness. The fitter individuals have a higher propability of being selected. In TRANSGEN the choise of parents is supported by special routine which enables to specify the probability function use the concept of roullete wheel. Morover there are posibble to use a to cut srossover operator with the specifyied average distance D c between them. 5. Mutation. It is possible to use two mutations operators together or separately. Both of them are based upon the classical random exchange of nodes. The number of nodes is fixed to value of two, but can be expanded to value of three. The first mutation operator is used for parents mutation.the mutation rate R mp is defined as percentage of the total number of symbols in the population, which are mutated in each generation. For the n - node/element placement problem and for the size N c of the population nn c R mp /2 pairwise interchanges are performed. Typicaly average value R mp = The mutation rate is set dynamically using some special procedure which allows to scan the relief of the fitness function of the whole population and to control so
4 called the saturation depth. The second mutation operator is applied to group of offspring. The typical mutation rate R mo = 0.01 is fixed and can be only changed a the beginning of optimization process. 6. Migration. The migration operator enables to combine the algorithms running on different processors into a single distributed genetic algorithm. The migration rate R mig specifies the epoch length that separates the interchange of the best choromozones among all the processes. We used elitism concept so as the only such a chromozone is accepted from the other process that is better than the current one. The effectivness of the migration depends namely on the migration rate. It has been experimentally observed that the suitable range of migration rate lies between 0,2 and 0,05. Concurently it can be used another mechanism of the exchages which is activated in a case only when the accepted chromozone is better then the current one by a fixed value named threshold point. 7. Selection. After generating offspring the procedure Selection is activated to choose the future generation from joined set of parents and offspring. In the TRANSGEN algorithm a competetive strategy is implemented - all the parents and offspring compete each other and the N c fittest individuals survive and move into the next generation. 8. Stopping criterion The standard way for finishing the optimization is the limitation of the number of generations N g. The another possibility is the time limitation. 9. Experiments The Table 1. shows the resulted minimal value of the objective function with diferent number of processes (N proc ). The total population size is set to be the same in all cases. N g is the number of generations. In case of RL25 experiment N g value specifies the number of generations needed to find the global optimum. In the second experiment IC67 the global optimum is not known. We have observed the value of objective function (HSP) reached in the fixed number of generations. The PGA using one process represent the standard GA. RL25 known optimum = 45 IC67 N proc N p N g HSP N proc N p N g HSP Table1: Results of RL25 and IC67 experiments DETAILS OF GA FOR TSP problem Although a main effort has been concentrated on genetic placement algorithm (see the previous section) we have made experiments with travelling salesman problem as well to test the versatility of our approach. We will describe only the differencies between TSP and GP algorithm here because the main principles of implementing a parallel genetic algorithm have already been mentioned. We have used ordered crossover method [2] during the reproduction phase. Obviously, the position of a gen in a chromozone is not significant in this case. A more important attribute is the order of genes. The ordered
5 e l u a v Parallel genetic algorithm implemented on transputers - Viktor Nìmec, Josef Schwarz crossover seems to be the most suitable method because it tends to preserve the order of genes in a chromozone. The problem was to find the shortest path between 15 cities. The distances between each two were given in a matrix. The results of our experiments are summarised in the table 2. The column N proc specifies number of colonies used. There were 30 individuals in each colony. The notation 4 (2+2) means that there were four colonies from which two were mapped on the first processor node and another two on the second. The second column specifies the time needed to find a global solution (the global solution was known). The column solution specifies the number of generations in which the solution was find. N proc Time [s] N g 1 (1+0) (1+1) (2+0) (2+2) Table 2: Results of experiments with TSP problem. Due to the order crossover method used the results were very good. This is a typical example of perfect domain decomposition. This example demonstrates the benefit of decomposing the algorithm into two processor nodes (see 2nd and 3rd row of table 2) P S H Nproc = 1 Nproc = Generation no. Graph 1: Optimalization curve for the IC67 placement problem PERFORMANCE The graph 1 demonstrates benefits of parallel approach to genetic algorithms. The generation size is fixed in both cases. If 10 logical processes (colonies) are used the optimalization procedure converges faster than in case when 1 logical process is used. Obviously, the solution for more processes is equal or even better than for one logical process (which in fact represents the simple GA).
6 The most important advantage is the considerable speedup of computations when more processors are available. In the above mentioned case the speedup coefficient can be theoretically equal to 10. The communication overhead and context switching leads to slight decrease of this value. The overall slowdown also depends on the type of decomposition used. The main attribute of the perfect domain decomposition (used in our PGA algorithm) is the low amount of communication between logical processes. We have proved that the speedup is almost linear in proportion to number of processors used for computations. CONCLUSION This paper described a new distributed placement algorithm for the PCB layout with set of the discrete slots. A new approach was presented by using independent genetic modules colonies. The TRANSGEN program is developed in OCCAM language and implemented on the transputers T800 and T9000. The parallel algorithm PGA preserves the result quality of the single algorithm with achieved speedup. The speedup is almost linear in proportion to number of physical processors (transputers) used. The migration operator introduces a new important attribute in solving genetic algorithms. In some cases there are better convergence in parallel version PGA. It is obvious that the TRANSGEN is a promising new tool that need futher investigation namely in the refinning of mutation procedure and in the chromozone representation. It is worth to examine a dynamically setting of migration rate according the population size and the depth of the saturation in each proceess. Finaly it is possible to implement futher version of PGA for the standard cell layout and for other CAD problems. This aim can be accomplished using the block architecture of PGA. ACKNOWLEDGEMENT This work was done under the support of the grant agency GAÈR contract number 102/94/1096. REFERENCES [1] Schwarz J.: Design Automatization of Composition and Placement of Integrated Circuit. PhD. Theses, Technical University of Brno, Facultyof Engineering and Computer Science, Department of Computer Science and Engineering, Brno, 1993, 136 pp., in Czech. [2] Goldberg E.,D.: Genetic Algorithms in Search, Optimization, and Machine Learning, Addison- Wesley, 1989 [3] Shahookar K., Mazumder P.: VLSI Cell Placement Techniques, ACM Computing Survays, Vol. 23, No. 2, June 1991, pp [4] INMOS: Transputer databook, Prentice-hall, 1989 [5] Dvorak, Vaclav: Concurent algorithms for message passing parallel algorithms, Teaching material developed in TEMPUS joint european project no. 0449, 1994
Introduction. A very important step in physical design cycle. It is the process of arranging a set of modules on the layout surface.
Placement Introduction A very important step in physical design cycle. A poor placement requires larger area. Also results in performance degradation. It is the process of arranging a set of modules on
More informationHeuristic 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 informationCAD Algorithms. Placement and Floorplanning
CAD Algorithms Placement Mohammad Tehranipoor ECE Department 4 November 2008 1 Placement and Floorplanning Layout maps the structural representation of circuit into a physical representation Physical representation:
More informationGenetic Placement: Genie Algorithm Way Sern Shong ECE556 Final Project Fall 2004
Genetic Placement: Genie Algorithm Way Sern Shong ECE556 Final Project Fall 2004 Introduction Overview One of the principle problems in VLSI chip design is the layout problem. The layout problem is complex
More informationGenetic Algorithm for Circuit Partitioning
Genetic Algorithm for Circuit Partitioning ZOLTAN BARUCH, OCTAVIAN CREŢ, KALMAN PUSZTAI Computer Science Department, Technical University of Cluj-Napoca, 26, Bariţiu St., 3400 Cluj-Napoca, Romania {Zoltan.Baruch,
More informationGenetic 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 informationEvolutionary Multiobjective Bayesian Optimization Algorithm: Experimental Study
Evolutionary Multiobective Bayesian Optimization Algorithm: Experimental Study Josef Schwarz * schwarz@dcse.fee.vutbr.cz Jiří Očenášek * ocenasek@dcse.fee.vutbr.cz Abstract: This paper deals with the utilizing
More informationGenetic Algorithm for FPGA Placement
Genetic Algorithm for FPGA Placement Zoltan Baruch, Octavian Creţ, and Horia Giurgiu Computer Science Department, Technical University of Cluj-Napoca, 26, Bariţiu St., 3400 Cluj-Napoca, Romania {Zoltan.Baruch,
More informationEvolutionary 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 informationUsing Genetic Algorithm with Triple Crossover to Solve Travelling Salesman Problem
Proc. 1 st International Conference on Machine Learning and Data Engineering (icmlde2017) 20-22 Nov 2017, Sydney, Australia ISBN: 978-0-6480147-3-7 Using Genetic Algorithm with Triple Crossover to Solve
More informationV.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 informationSolving ISP Problem by Using Genetic Algorithm
International Journal of Basic & Applied Sciences IJBAS-IJNS Vol:09 No:10 55 Solving ISP Problem by Using Genetic Algorithm Fozia Hanif Khan 1, Nasiruddin Khan 2, Syed Inayatulla 3, And Shaikh Tajuddin
More informationEscaping Local Optima: Genetic Algorithm
Artificial Intelligence Escaping Local Optima: Genetic Algorithm Dae-Won Kim School of Computer Science & Engineering Chung-Ang University We re trying to escape local optima To achieve this, we have learned
More informationARTIFICIAL INTELLIGENCE (CSCU9YE ) LECTURE 5: EVOLUTIONARY ALGORITHMS
ARTIFICIAL INTELLIGENCE (CSCU9YE ) LECTURE 5: EVOLUTIONARY ALGORITHMS Gabriela Ochoa http://www.cs.stir.ac.uk/~goc/ OUTLINE Optimisation problems Optimisation & search Two Examples The knapsack problem
More informationCAD Algorithms. Circuit Partitioning
CAD Algorithms Partitioning Mohammad Tehranipoor ECE Department 13 October 2008 1 Circuit Partitioning Partitioning: The process of decomposing a circuit/system into smaller subcircuits/subsystems, which
More informationReducing Graphic Conflict In Scale Reduced Maps Using A Genetic Algorithm
Reducing Graphic Conflict In Scale Reduced Maps Using A Genetic Algorithm Dr. Ian D. Wilson School of Technology, University of Glamorgan, Pontypridd CF37 1DL, UK Dr. J. Mark Ware School of Computing,
More informationOptimizing 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 informationNeural Network Weight Selection Using Genetic Algorithms
Neural Network Weight Selection Using Genetic Algorithms David Montana presented by: Carl Fink, Hongyi Chen, Jack Cheng, Xinglong Li, Bruce Lin, Chongjie Zhang April 12, 2005 1 Neural Networks Neural networks
More informationAnalysis of the impact of parameters values on the Genetic Algorithm for TSP
www.ijcsi.org 158 Analysis of the impact of parameters values on the Genetic Algorithm for TSP Avni Rexhepi 1, Adnan Maxhuni 2, Agni Dika 3 1,2,3 Faculty of Electrical and Computer Engineering, University
More informationComparative Analysis of Genetic Algorithm Implementations
Comparative Analysis of Genetic Algorithm Implementations Robert Soricone Dr. Melvin Neville Department of Computer Science Northern Arizona University Flagstaff, Arizona SIGAda 24 Outline Introduction
More informationA Modified Genetic Algorithm for Process Scheduling in Distributed System
A Modified Genetic Algorithm for Process Scheduling in Distributed System Vinay Harsora B.V.M. Engineering College Charatar Vidya Mandal Vallabh Vidyanagar, India Dr.Apurva Shah G.H.Patel College of Engineering
More informationIMPROVEMENT OF THE QUALITY OF VLSI CIRCUIT PARTITIONING PROBLEM USING GENETIC ALGORITHM
Volume 3, No. 12, December 2012 Journal of Global Research in Computer Science RESEARCH PAPER Available Online at www.jgrcs.info IMPROVEMENT OF THE QUALITY OF VLSI CIRCUIT PARTITIONING PROBLEM USING GENETIC
More informationThe study of comparisons of three crossover operators in genetic algorithm for solving single machine scheduling problem. Quan OuYang, Hongyun XU a*
International Conference on Manufacturing Science and Engineering (ICMSE 2015) The study of comparisons of three crossover operators in genetic algorithm for solving single machine scheduling problem Quan
More informationUsing Genetic Algorithms in Integer Programming for Decision Support
Doi:10.5901/ajis.2014.v3n6p11 Abstract Using Genetic Algorithms in Integer Programming for Decision Support Dr. Youcef Souar Omar Mouffok Taher Moulay University Saida, Algeria Email:Syoucef12@yahoo.fr
More informationParallel Traveling Salesman. PhD Student: Viet Anh Trinh Advisor: Professor Feng Gu.
Parallel Traveling Salesman PhD Student: Viet Anh Trinh Advisor: Professor Feng Gu Agenda 1. Traveling salesman introduction 2. Genetic Algorithm for TSP 3. Tree Search for TSP Travelling Salesman - Set
More informationIntroduction (7.1) Genetic Algorithms (GA) (7.2) Simulated Annealing (SA) (7.3) Random Search (7.4) Downhill Simplex Search (DSS) (7.
Chapter 7: Derivative-Free Optimization Introduction (7.1) Genetic Algorithms (GA) (7.2) Simulated Annealing (SA) (7.3) Random Search (7.4) Downhill Simplex Search (DSS) (7.5) Jyh-Shing Roger Jang et al.,
More informationA COMPARATIVE STUDY OF FIVE PARALLEL GENETIC ALGORITHMS USING THE TRAVELING SALESMAN PROBLEM
A COMPARATIVE STUDY OF FIVE PARALLEL GENETIC ALGORITHMS USING THE TRAVELING SALESMAN PROBLEM Lee Wang, Anthony A. Maciejewski, Howard Jay Siegel, and Vwani P. Roychowdhury * Microsoft Corporation Parallel
More informationGENETIC 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 informationGenetic 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 informationMutations for Permutations
Mutations for Permutations Insert mutation: Pick two allele values at random Move the second to follow the first, shifting the rest along to accommodate Note: this preserves most of the order and adjacency
More informationGenetic Algorithms with Oracle for the Traveling Salesman Problem
PROCEEDINGS OF WORLD ACADEMY OF SCIENCE, ENGINEERING AND TECHNOLOGY VOLUME 7 AUGUST 25 ISSN 17-884 Genetic Algorithms with Oracle for the Traveling Salesman Problem Robin Gremlich, Andreas Hamfelt, Héctor
More informationGenetic 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 informationEncoding Techniques in Genetic Algorithms
Encoding Techniques in Genetic Algorithms Debasis Samanta Indian Institute of Technology Kharagpur dsamanta@iitkgp.ac.in 01.03.2016 Debasis Samanta (IIT Kharagpur) Soft Computing Applications 01.03.2016
More informationReduce Total Distance and Time Using Genetic Algorithm in Traveling Salesman Problem
Reduce Total Distance and Time Using Genetic Algorithm in Traveling Salesman Problem A.Aranganayaki(Research Scholar) School of Computer Science and Engineering Bharathidasan University Tamil Nadu, India
More informationMINIMAL EDGE-ORDERED SPANNING TREES USING A SELF-ADAPTING GENETIC ALGORITHM WITH MULTIPLE GENOMIC REPRESENTATIONS
Proceedings of Student/Faculty Research Day, CSIS, Pace University, May 5 th, 2006 MINIMAL EDGE-ORDERED SPANNING TREES USING A SELF-ADAPTING GENETIC ALGORITHM WITH MULTIPLE GENOMIC REPRESENTATIONS Richard
More informationA Modified Genetic Algorithm for Task Scheduling in Multiprocessor Systems
A Modified Genetic Algorithm for Task Scheduling in Multiprocessor Systems Yi-Hsuan Lee and Cheng Chen Department of Computer Science and Information Engineering National Chiao Tung University, Hsinchu,
More informationCHAPTER 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 informationSIMULATION APPROACH OF CUTTING TOOL MOVEMENT USING ARTIFICIAL INTELLIGENCE METHOD
Journal of Engineering Science and Technology Special Issue on 4th International Technical Conference 2014, June (2015) 35-44 School of Engineering, Taylor s University SIMULATION APPROACH OF CUTTING TOOL
More information1. Introduction. 2. Motivation and Problem Definition. Volume 8 Issue 2, February Susmita Mohapatra
Pattern Recall Analysis of the Hopfield Neural Network with a Genetic Algorithm Susmita Mohapatra Department of Computer Science, Utkal University, India Abstract: This paper is focused on the implementation
More informationTopological 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 informationTerm Paper for EE 680 Computer Aided Design of Digital Systems I Timber Wolf Algorithm for Placement. Imran M. Rizvi John Antony K.
Term Paper for EE 680 Computer Aided Design of Digital Systems I Timber Wolf Algorithm for Placement By Imran M. Rizvi John Antony K. Manavalan TimberWolf Algorithm for Placement Abstract: Our goal was
More informationAn Improved Genetic Algorithm based Fault tolerance Method for distributed wireless sensor networks.
An Improved Genetic Algorithm based Fault tolerance Method for distributed wireless sensor networks. Anagha Nanoti, Prof. R. K. Krishna M.Tech student in Department of Computer Science 1, Department of
More informationOptimizing Flow Shop Sequencing Through Simulation Optimization Using Evolutionary Methods
Optimizing Flow Shop Sequencing Through Simulation Optimization Using Evolutionary Methods Sucharith Vanguri 1, Travis W. Hill 2, Allen G. Greenwood 1 1 Department of Industrial Engineering 260 McCain
More informationTask Graph Scheduling on Multiprocessor System using Genetic Algorithm
Task Graph Scheduling on Multiprocessor System using Genetic Algorithm Amit Bansal M.Tech student DCSE, G.N.D.U. Amritsar, India Ravreet Kaur Asst. Professor DCSE, G.N.D.U. Amritsar, India Abstract Task
More informationOptimization of Function by using a New MATLAB based Genetic Algorithm Procedure
Optimization of Function by using a New MATLAB based Genetic Algorithm Procedure G.N Purohit Banasthali University Rajasthan Arun Mohan Sherry Institute of Management Technology Ghaziabad, (U.P) Manish
More informationAkaike information criterion).
An Excel Tool The application has three main tabs visible to the User and 8 hidden tabs. The first tab, User Notes, is a guide for the User to help in using the application. Here the User will find all
More informationSolving Traveling Salesman Problem Using Parallel Genetic. Algorithm and Simulated Annealing
Solving Traveling Salesman Problem Using Parallel Genetic Algorithm and Simulated Annealing Fan Yang May 18, 2010 Abstract The traveling salesman problem (TSP) is to find a tour of a given number of cities
More informationChapter 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 informationModified Order Crossover (OX) Operator
Modified Order Crossover (OX) Operator Ms. Monica Sehrawat 1 N.C. College of Engineering, Israna Panipat, Haryana, INDIA. Mr. Sukhvir Singh 2 N.C. College of Engineering, Israna Panipat, Haryana, INDIA.
More informationEstimation of Wirelength
Placement The process of arranging the circuit components on a layout surface. Inputs: A set of fixed modules, a netlist. Goal: Find the best position for each module on the chip according to appropriate
More informationAn experimental evaluation of a parallel genetic algorithm using MPI
2009 13th Panhellenic Conference on Informatics An experimental evaluation of a parallel genetic algorithm using MPI E. Hadjikyriacou, N. Samaras, K. Margaritis Dept. of Applied Informatics University
More informationDETERMINING MAXIMUM/MINIMUM VALUES FOR TWO- DIMENTIONAL MATHMATICLE FUNCTIONS USING RANDOM CREOSSOVER TECHNIQUES
DETERMINING MAXIMUM/MINIMUM VALUES FOR TWO- DIMENTIONAL MATHMATICLE FUNCTIONS USING RANDOM CREOSSOVER TECHNIQUES SHIHADEH ALQRAINY. Department of Software Engineering, Albalqa Applied University. E-mail:
More informationParallel Genetic Algorithm to Solve Traveling Salesman Problem on MapReduce Framework using Hadoop Cluster
Parallel Genetic Algorithm to Solve Traveling Salesman Problem on MapReduce Framework using Hadoop Cluster Abstract- Traveling Salesman Problem (TSP) is one of the most common studied problems in combinatorial
More informationNetwork 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 informationRole 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 informationA Framework for Parallel Genetic Algorithms on PC Cluster
A Framework for Parallel Genetic Algorithms on PC Cluster Guangzhong Sun, Guoliang Chen Department of Computer Science and Technology University of Science and Technology of China (USTC) Hefei, Anhui 230027,
More informationA Distributed Hybrid Algorithm for Composite Stock Cutting
Appl. Math. Inf. Sci. 6 No. 2S pp. 661S-667S (2012) Applied Mathematics & Information Sciences An International Journal @ 2012 NSP Natural Sciences Publishing Cor. A Distributed Hybrid Algorithm for Composite
More informationA 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 informationSolving the Capacitated Single Allocation Hub Location Problem Using Genetic Algorithm
Solving the Capacitated Single Allocation Hub Location Problem Using Genetic Algorithm Faculty of Mathematics University of Belgrade Studentski trg 16/IV 11 000, Belgrade, Serbia (e-mail: zoricast@matf.bg.ac.yu)
More informationSparse 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 informationComparison of TSP Algorithms
Comparison of TSP Algorithms Project for Models in Facilities Planning and Materials Handling December 1998 Participants: Byung-In Kim Jae-Ik Shim Min Zhang Executive Summary Our purpose in this term project
More informationIntroduction to Genetic Algorithms. Based on Chapter 10 of Marsland Chapter 9 of Mitchell
Introduction to Genetic Algorithms Based on Chapter 10 of Marsland Chapter 9 of Mitchell Genetic Algorithms - History Pioneered by John Holland in the 1970s Became popular in the late 1980s Based on ideas
More informationSolving the Travelling Salesman Problem in Parallel by Genetic Algorithm on Multicomputer Cluster
Solving the Travelling Salesman Problem in Parallel by Genetic Algorithm on Multicomputer Cluster Plamenka Borovska Abstract: The paper investigates the efficiency of the parallel computation of the travelling
More information5. Computational Geometry, Benchmarks and Algorithms for Rectangular and Irregular Packing. 6. Meta-heuristic Algorithms and Rectangular Packing
1. Introduction 2. Cutting and Packing Problems 3. Optimisation Techniques 4. Automated Packing Techniques 5. Computational Geometry, Benchmarks and Algorithms for Rectangular and Irregular Packing 6.
More informationThree-Dimensional Cylindrical Model for Single-Row Dynamic Routing
MATEMATIKA, 2014, Volume 30, Number 1a, 30-43 Department of Mathematics, UTM. Three-Dimensional Cylindrical Model for Single-Row Dynamic Routing 1 Noraziah Adzhar and 1,2 Shaharuddin Salleh 1 Department
More informationTransactions on Information and Communications Technologies vol 3, 1993 WIT Press, ISSN
The implementation of a general purpose FORTRAN harness for an arbitrary network of transputers for computational fluid dynamics J. Mushtaq, A.J. Davies D.J. Morgan ABSTRACT Many Computational Fluid Dynamics
More informationAn adaptive genetic algorithm for dynamically reconfigurable modules allocation
An adaptive genetic algorithm for dynamically reconfigurable modules allocation Vincenzo Rana, Chiara Sandionigi, Marco Santambrogio and Donatella Sciuto chiara.sandionigi@dresd.org, {rana, santambr, sciuto}@elet.polimi.it
More informationGenetic Algorithm for Dynamic Capacitated Minimum Spanning Tree
28 Genetic Algorithm for Dynamic Capacitated Minimum Spanning Tree 1 Tanu Gupta, 2 Anil Kumar 1 Research Scholar, IFTM, University, Moradabad, India. 2 Sr. Lecturer, KIMT, Moradabad, India. Abstract Many
More informationGENETIC ALGORITHM VERSUS PARTICLE SWARM OPTIMIZATION IN N-QUEEN PROBLEM
Journal of Al-Nahrain University Vol.10(2), December, 2007, pp.172-177 Science GENETIC ALGORITHM VERSUS PARTICLE SWARM OPTIMIZATION IN N-QUEEN PROBLEM * Azhar W. Hammad, ** Dr. Ban N. Thannoon Al-Nahrain
More informationGenetic Algorithm for optimization using MATLAB
Volume 4, No. 3, March 2013 (Special Issue) International Journal of Advanced Research in Computer Science RESEARCH PAPER Available Online at www.ijarcs.info Genetic Algorithm for optimization using MATLAB
More informationInnovative Systems Design and Engineering ISSN (Paper) ISSN (Online) Vol.5, No.1, 2014
Abstract Tool Path Optimization of Drilling Sequence in CNC Machine Using Genetic Algorithm Prof. Dr. Nabeel Kadim Abid Al-Sahib 1, Hasan Fahad Abdulrazzaq 2* 1. Thi-Qar University, Al-Jadriya, Baghdad,
More informationGenetic 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 informationParallel Combinatorial Search on Computer Cluster: Sam Loyd s Puzzle
Parallel Combinatorial Search on Computer Cluster: Sam Loyd s Puzzle Plamenka Borovska Abstract: The paper investigates the efficiency of parallel branch-and-bound search on multicomputer cluster for the
More informationParallel Simulated Annealing for VLSI Cell Placement Problem
Parallel Simulated Annealing for VLSI Cell Placement Problem Atanu Roy Karthik Ganesan Pillai Department Computer Science Montana State University Bozeman {atanu.roy, k.ganeshanpillai}@cs.montana.edu VLSI
More informationIntroduction to Genetic Algorithms. Genetic Algorithms
Introduction to Genetic Algorithms Genetic Algorithms We ve covered enough material that we can write programs that use genetic algorithms! More advanced example of using arrays Could be better written
More informationGrid Scheduling Strategy using GA (GSSGA)
F Kurus Malai Selvi et al,int.j.computer Technology & Applications,Vol 3 (5), 8-86 ISSN:2229-693 Grid Scheduling Strategy using GA () Dr.D.I.George Amalarethinam Director-MCA & Associate Professor of Computer
More informationNesting of Irregular Shapes Using Feature Matching and Parallel Genetic Algorithms
Nesting of Irregular Shapes Using Feature Matching and Parallel Genetic Algorithms Anand Uday Erik D. Goodman Ananda A. Debnath Genetic Algorithms Research and Applications Group (GARAGe) Michigan State
More informationWhat is GOSET? GOSET stands for Genetic Optimization System Engineering Tool
Lecture 5: GOSET 1 What is GOSET? GOSET stands for Genetic Optimization System Engineering Tool GOSET is a MATLAB based genetic algorithm toolbox for solving optimization problems 2 GOSET Features Wide
More informationGenetic 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 informationCS:4420 Artificial Intelligence
CS:4420 Artificial Intelligence Spring 2018 Beyond Classical Search Cesare Tinelli The University of Iowa Copyright 2004 18, Cesare Tinelli and Stuart Russell a a These notes were originally developed
More informationUsing Simple Ancestry to Deter Inbreeding for Persistent Genetic Algorithm Search
Using Simple Ancestry to Deter Inbreeding for Persistent Genetic Algorithm Search Aditya Wibowo and Peter Jamieson Dept. of Electrical and Computer Engineering Miami University Abstract In this work, we
More informationExtending MATLAB and GA to Solve Job Shop Manufacturing Scheduling Problems
Extending MATLAB and GA to Solve Job Shop Manufacturing Scheduling Problems Hamidullah Khan Niazi 1, Sun Hou-Fang 2, Zhang Fa-Ping 3, Riaz Ahmed 4 ( 1, 4 National University of Sciences and Technology
More informationCHAPTER 1 at a glance
CHAPTER 1 at a glance Introduction to Genetic Algorithms (GAs) GA terminology Genetic operators Crossover Mutation Inversion EDA problems solved by GAs 1 Chapter 1 INTRODUCTION The Genetic Algorithm (GA)
More informationA 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 informationAutomata 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 informationMetaheuristic Optimization with Evolver, Genocop and OptQuest
Metaheuristic Optimization with Evolver, Genocop and OptQuest MANUEL LAGUNA Graduate School of Business Administration University of Colorado, Boulder, CO 80309-0419 Manuel.Laguna@Colorado.EDU Last revision:
More informationGenetic 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 informationAn Improved Genetic Algorithm for the Traveling Salesman Problem with Multi-Relations
Journal of Computer Science 7 (1): 70-74, 2011 ISSN 1549-3636 2011 Science Publications An Improved Genetic Algorithm for the Traveling Salesman Problem with Multi-Relations Supat Patvichaichod Department
More informationHomework 2: Search and Optimization
Scott Chow ROB 537: Learning Based Control October 16, 2017 Homework 2: Search and Optimization 1 Introduction The Traveling Salesman Problem is a well-explored problem that has been shown to be NP-Complete.
More informationCS5401 FS2015 Exam 1 Key
CS5401 FS2015 Exam 1 Key This is a closed-book, closed-notes exam. The only items you are allowed to use are writing implements. Mark each sheet of paper you use with your name and the string cs5401fs2015
More informationTrain schedule diagram drawing algorithm considering interrelationship between labels
Train schedule diagram drawing algorithm considering interrelationship between labels H. Izumi', N. Tomii',2 The University of Electro-Communications, Japan. 2Railway Technical Research Institute, Japan.
More informationA TOTALLY DISTRIBUTED GENETIC ALGORITHM: FROM A CELLULAR SYSTEM TO THE MESH OF PROCESSORS
A TOTALLY DISTRIBUTED GENETIC ALGORITHM: FROM A CELLULAR SYSTEM TO THE MESH OF PROCESSORS Lukáš Sekanina and Václav Dvoák Department of Computer Science and Engineering Brno University of Technology Boetchova
More informationThe Memetic Algorithm for The Minimum Spanning Tree Problem with Degree and Delay Constraints
The Memetic Algorithm for The Minimum Spanning Tree Problem with Degree and Delay Constraints Minying Sun*,Hua Wang* *Department of Computer Science and Technology, Shandong University, China Abstract
More informationIntroducing a New Advantage of Crossover: Commonality-Based Selection
Introducing a New Advantage of Crossover: Commonality-Based Selection Stephen Chen Stephen F. Smith The Robotics Institute The Robotics Institute Carnegie Mellon University Carnegie Mellon University 5000
More informationAn Empirical Investigation of Meta-heuristic and Heuristic Algorithms for a 2D Packing Problem
European Journal of Operational Research 128/1, 34-57, 2000. An Empirical Investigation of Meta-heuristic and Heuristic Algorithms for a 2D Packing Problem E. Hopper and B. C. H. Turton School of Engineering,
More informationApplication of Parallel Processing to Rendering in a Virtual Reality System
Application of Parallel Processing to Rendering in a Virtual Reality System Shaun Bangay Peter Clayton David Sewry Department of Computer Science Rhodes University Grahamstown, 6140 South Africa Internet:
More informationA Genetic Algorithm Approach to the Group Technology Problem
IMECS 008, 9- March, 008, Hong Kong A Genetic Algorithm Approach to the Group Technology Problem Hatim H. Sharif, Khaled S. El-Kilany, and Mostafa A. Helaly Abstract In recent years, the process of cellular
More informationThe Parallel Software Design Process. Parallel Software Design
Parallel Software Design The Parallel Software Design Process Deborah Stacey, Chair Dept. of Comp. & Info Sci., University of Guelph dastacey@uoguelph.ca Why Parallel? Why NOT Parallel? Why Talk about
More informationarxiv: v1 [cs.ai] 12 Feb 2017
GENETIC AND MEMETIC ALGORITHM WITH DIVERSITY EQUILIBRIUM BASED ON GREEDY DIVERSIFICATION ANDRÉS HERRERA-POYATOS 1 AND FRANCISCO HERRERA 1,2 arxiv:1702.03594v1 [cs.ai] 12 Feb 2017 1 Research group Soft
More informationA New Approach to Execution Time Estimations in a Hardware/Software Codesign Environment
A New Approach to Execution Time Estimations in a Hardware/Software Codesign Environment JAVIER RESANO, ELENA PEREZ, DANIEL MOZOS, HORTENSIA MECHA, JULIO SEPTIÉN Departamento de Arquitectura de Computadores
More information