# Sparse Matrices Reordering using Evolutionary Algorithms: A Seeded Approach

Save this PDF as:

Size: px
Start display at page:

## Transcription

1 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) - University of Las Palmas de Gran Canaria, Spain

2 2 Introduction Index Evolutionary Algorithms. Generalities Solving the reordering problem with evolutionary algorithms Coding of the chromosomesor candidate solutions About the Objective Functions Experimental Results Conclusions

3 3 Introduction Sparse matrices have the majority of their entries as zeros, being the non-zer values a minimum proportion of the total. Their use is frequent and well spread in many fields of science and engineering. Discrete modelling with finite elements or finite volumes in engineering problems follows to a linear system of equations Ax=b, frequently governed by a sparse matrix. The resolution of this system can be handled with direct (Gauss, LUfactorization, etc.) or iterative (conjugate gradient, generalized minimal residual GMRES, biconjugate gradient stabilized Bi-CGSTAB, etc.) method depending on the problem characteristics. Either the case, the reordering of the entry positions often provides advantages. In direct methods, when the matrix bandwidth is reduced via reordering, the fill in effect (zero entries filling before factoring procedure) is diminished. In iterative methods, the effect of certain preconditioners can be improved. This reordering problem belongs to the nondeterministic polynomial time NP-class combinatorial problems.

4 4 Introduction Classical methods have been developed for reordering (inverse Cuthill- McKee, minimum degree). In recent years, bio-inspired and heuristic methods have been proposed, such as tabu search [20] or simulated annealing [16]. The sparse matrix reordering problem has been faced previously also as a graph partitioning problem. In this way, classical methods have been proposed for parallel computers; but also evolutionary methods, in single objective optimization, considering multiobjective optimization. Here we introduce a methodology with evolutionary algorithms for sparse matrix reordering, describing the evolutionary operators, the codification various fitness functions proposed for a suitable performance. Results are compared with a classical method: the inverse Cuthill-McKee reordering. Moreover, a seeded approach is exposed, being its results capable of outperform the previous ones.

5 5 Introduction Index Evolutionary Algorithms. Generalities Solving the reordering problem with evolutionary algorithms Coding of the chromosomesor candidate solutions About the Objective Functions Experimental Results Conclusions

6 6 Evolutionary Algorithms. Generalities Evolutionary algorithms are global search methods, based in population handling, adaptive, iterative and robust. They mimic generally the natural process of evolution, and are used often as stochastic optimisation methods. Analogy with natural evolution: Each candidate solution to the global optimum, which belongs to a population of candidates, is coded in a vector (which is called, array, chromosome or individual) and with the interchange of information of the candidate solutions (crossover) or randomly varying this information (mutation), diversity of new candidate solutions is obtained. They are evaluated (measuring their adaptation or fitness to the environment) by the objective function. Some candidate solutions are selected (selection) depending on their adaptation to the environment, creating a new population of candidate solutions to the global optimum. This process is applied iteratively, and progressively the medium quality of potential solutions improves.

7 7 Evolutionary Algorithms. Generalities The main difference between evolutionary algorithms and other search methods (as gradient methods, etc.) is that the search space exploration is handled using the information of a population of structures or candidate solutions, instead of following a direction or considering only one individual. Their capabilities of avoiding local optima, of only requiring the fitness function value to perform the optimization without any other condition, and the posibility to perform multiobjective optimization are specially outstanding.

8 8 Introduction Index Evolutionary Algorithms. Generalities Solving the reordering problem with evolutionary algorithms Coding of the chromosomesor candidate solutions About the Objective Functions Experimental Results Conclusions

9 9 Solving the reordering problem with evolutionary algorithms The resolution of the sparse matrices reordering problem using evolutionary algorithms requires: Suitable chromosome codification The variable information among candidate solutions (what differentiates one solution from another) is the only knowledge required to be coded. In addition, this information should be structured in such a way that the information interchange between solutions using crossover or its modification using mutation does not produce an infeasible solution. Appropriate definition of the fitness function. (it should contain all the required conditions of the desired solution)

10 10 Introduction Index Evolutionary Algorithms. Generalities Solving the reordering problem with evolutionary algorithms Coding of the chromosomesor candidate solutions About the Objective Functions Experimental Results Conclusions

11 11 Chromosome Coding The used matrix storage is a compact storage, based in the compressed schema of Radicati, where the dynamic memory assignment characteristics of C++ language are considered. Using a compact storage in a sparse matrix is advantageous due to the fact, that only a few number of its values are non-zeros. The sparse matrix (A) is defined through two matrices called position matrix (PA) and value matrix (VA). The position matrix PA stores by rows the position of the non-zero values of each file of the matrix; except the first value, that corresponds to the whole number of non-zero values contained in the PA row. The value matrix VA contains the matrix values, storing in the first value of each row the main diagonal value, and the rest of the values correspond to the non-zero values whose positions are defined in the position matrix.

12 12 Chromosome Coding Each candidate solution (one chromosome) is representative of one defined ordering corresponding to the matrix A. It could be limited exclusively to a vector with so many elements as the dimension of sparse matrix A, and defining the ordering of its nodes. So, each chromosome is constituted by the natural numbers from 1 to n, being n the dimension of matrix A, and in a random ordering. This ordering defines the permutation of rows of position and value matrices (PA and VA), as well as the interior permutations of the position values of each row, in such a way that allows to define the new matrix in compact storage (also the values of the independent term vector should be permuted in the same ordering, in order that the solution of the original lineal system would not be altered). Using this codification, the chromosome treatment is analogous to that corresponding in well known evolutionary problems, such as simple scheduling [13], or the classical travelling salesman problem [15], where a set of cities or control points should be covered in the shortest possible path, and the chromosome can be expressed as the ordering of the cities through the route.

13 13 Chromosome Coding

14 14 Chromosome Coding The position-based crossover consists in fixing by a uniform and random crossover mask, those positions that will be interchanged by two parents. To maintain the coherency in the chromosome representation, the remaining positions are maintained in the original relative ordering in the chromosome, and they are filled in the remaining gaps. An example of the procedure is showed in figure 2 for matrix A, where a 1 in the mask means crossover of the position and a 0 means no crossover of the position. Solución Candidata1= { 1,2,3,4} Solución Candidata2 = { 4,3,2,1} Mascara Cruce= { 0,1,0,1} Nueva Solución Candidata Generada 1 = { 2,3,4,1} Nueva Solución CandidataGenerada 2 = { 3, 2,1,4}

15 15 Chromosome Coding The order-based mutation acts by a mutation mask which contains the positions to mutate. It is considered a uniform mask, where every position has the same probability to be altered. Each mutated value interchanges its position with other randomly determined gene. An example of the procedure is showed in figure 3 for matrix A, where the randomly mutated position described by the mask is the fourth. Cromosoma = { 2,3,4,1} MascaraMutacion= { 0,1,0,0 } Nueva Solución Candidata = { 2,1,4,3}

16 16 Chromosome Coding Steady-state genetic algorithm with duplicates elimination, where two solutions are substituted each generation, deleting in the insertion the two worst solutions. Selection is performed through stochastic universal sampling (SUS) using a ranking ordering for the probabilities definition. Population size of 50 individuals is considered, being the crossover rate of 100% and the stop criterion a total of fitness function evaluations. The selected mutation rate is of 0.4%, which gives the best results from a set of rates tested among 0.2%, 0.4%, 0.8% and 1.5% in the presented test case (average of 10 independent runs).

17 17 Introduction Index Evolutionary Algorithms. Generalities Solving the reordering problem with evolutionary algorithms Coding of the chromosomesor candidate solutions About the Objective Functions Experimental Results Conclusions

18 18 About Objective Functions Semi-Bandwith of sparse matrix: F1 = max?i j?, a ij? 0 (maximum number of intermediate positions that separate the further term of a row from the principal diagonal of the matrix ) Envelope of sparse matrix: F2 =? i (max j min j), a ij? 0 (total number of matrix positions which is covered among its non-zero entries by rows or by columns, being in symmetric matrix profiles both values equivalents ) F3 =? i? j?i j? 1.4, a ij? 0. F4 =? i? j?i j 3.0, a ij? 0. F5 =? i? j a ij?i j?, a ij? 0.

19 19 Introduction Index Evolutionary Algorithms. Generalities Solving the reordering problem with evolutionary algorithms Coding of the chromosomesor candidate solutions About the Objective Functions Experimental Results Conclusions

20 20 Experimental Results Test case considered is a sparse matrix of dimension 441, belonging to a convection-diffusion problem handled by finite elements. This original matrix is included in the initial population in every case. Final results are compared with the inverse Cuthill-McKee reordering, which is graphically shown

21 21 Experimental Results

22 22 Experimental Results Evolutionary Approach, Best results of 10 runs

23 23 Experimental Results

24 24 Experimental Results Considering the semi-bandwidth as fitness function (first considered) does not seem to be an appropriate election for obtaining matrices with reduced profile. The semi-bandwidth is reduced from 428 to 328, but is very far from the value obtained with the inverse Cuthill-McKee ordering. This disappointing behaviour is understandable considering that the semi-bandwidth as fitness function is not a progressive indicator. It covers many different solutions without discriminating better and worse solutions taking into account the number of entries that are nearer the main diagonal. A fitness function that allows more progression among solutions is required. In this direction were suggested the other proposed fitness functions.

25 25 Experimental Results Considering the envelope as fitness function (second considered) improves the obtained results, reducing the semi-bandwidth to 175. The behaviour of the evolutionary algorithm is clearly favoured by the higher progressiveness of this fitness function compared with the first one. However, the envelope criterion is subjected to irregularities that allow a reduction of semi-bandwidth in certain zones of the profile. The third and fourth proposed fitness functions follow this aim of reduction of irregularities without losing the progressiveness among solutions. Both increase the penalization to the further terms and it is reflected in the semi-bandwidth obtained values (92 and 50), that are improved respect to the first and second fitness functions. The higher grade of the power in the fourth fitness function increases this effect, permitting to achieve a lower final value.

26 26 Experimental Results The importance of an adequate election of the fitness function is here evidenced: not always the most obvious proposal (here the semi-bandwidth) is the better. The capability of being a progressive fitness function, that allows identifying slow changes of candidate solutions in the right direction, is in this sparse matrix reordering problem fundamental to achieve success, as results have proven. This characteristic helps the evolutionary algorithm to evolve and learn during its development.

27 27 Experimental Results The evolutionary approach for solving the sparse matrix reordering problem has demonstrated a general good performance in terms of solutions quality, except in the case of the semi-bandwidth as fitness function. In the rest of cases, the values of the evolutionary orderings are lower than those provided by the inverse Cuthill-McKee solution (with the exception of the second fitness function, which is slightly higher). However, improving the results of this evolutionary approach is sought.

28 28 Experimental Results The inclusion in the initial population of high quality solutions has been proved to be capable of obtaining improved results in terms of convergence speed and/or final quality, both in single and multi-objective evolutionary optimization. Here is analysed the case of inserting the inverse Cuthill- McKee sparse matrix ordering as a high quality solution in the initial population, what is called Seeded approach.

29 29 Experimental Results Seeded Approach, Best results of 10 runs

30 30 Experimental Results

31 31 Experimental Results As it can be inferred from the obtained results of this seeded approach, in general the values are improved compared with the evolutionary one, even in the case of the first fitness function (semi-bandwidth). This seeded approach allows for obtaining better sparse matrix reorderings in terms of quality compared with the sole classic Cuthill-McKee method.

32 32 Introduction Index Evolutionary Algorithms. Generalities Solving the reordering problem with evolutionary algorithms Coding of the chromosomesor candidate solutions About the Objective Functions Experimental Results Conclusions

33 33 Discussion Reorderings obtained from functions 5 and 6 introduce a rise in the values of their functions 1 to 4. It can be observed also in figures 5 and 6, where the two inferior graphs in both figures represent this reorderings: some points are further from the principal diagonal than in previous pictures -this effect is reduced in function 6 with respect to function 5, because of its raised power position-term-. This occurs because the own value of the non-zero entry in the fitness function has been taken into account. In the case that this value is sufficiently low, its contribution to the fitness function summation is small, even in the case of being more separated to the main diagonal of the matrix. This consideration of the own value is not possible in the classic reordering procedures, and gives a possible potential competitive advantage to evolutionary algorithms reordering methods.

34 34 Discussion The advantages of the reordering influence when solving a linear system of equations is increased with the rise of the system size. This fact also increases the complexity of the combinatorial problem of reordering, and consequently, the calculation time. This balance has to be further analyzed in matrices of greater order or complexity.

35 35 Conclusions Here a successful methodology for sparse matrix reordering using evolutionary algorithms is presented. The introduced seeded approach has proven to outperform in terms of quality of the solution the classical one. Even more, evolutionary algorithms allow the consideration of the value of the terms in the ordering procedure, which could be of particular interest for the preconditioning of iterative solvers. The advantages that an improved reordering can provide are especially outstanding in the case of performing design optimization with evolutionary algorithms, where many resolutions of matrix systems are required (e.g. finite or volume elements); but only one reordering may be necessary. In that sense, further work should be advisable for achieving lower calculation times in the seeded approach procedure, including suitable operators and parameters of the evolutionary part.

36 36 Thank you very much for your attention David Greiner, Gustavo Montero, Gabriel Winter nstitute of Intelligent Systems and Numerical Applications in Engineerin (IUSIANI) - University of Las Palmas de Gran Canaria, Spain

### GENETIC ALGORITHM with Hands-On exercise

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

### Evolutionary Computation Algorithms for Cryptanalysis: A Study

Evolutionary Computation Algorithms for Cryptanalysis: A Study Poonam Garg Information Technology and Management Dept. Institute of Management Technology Ghaziabad, India pgarg@imt.edu Abstract The cryptanalysis

### CHAPTER 4 GENETIC ALGORITHM

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

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

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

### ABSTRACT I. INTRODUCTION. J Kanimozhi *, R Subramanian Department of Computer Science, Pondicherry University, Puducherry, Tamil Nadu, India

ABSTRACT 2018 IJSRSET Volume 4 Issue 4 Print ISSN: 2395-1990 Online ISSN : 2394-4099 Themed Section : Engineering and Technology Travelling Salesman Problem Solved using Genetic Algorithm Combined Data

### Neural Network Weight Selection Using Genetic Algorithms

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

### Introduction (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.,

### Solving Traveling Salesman Problem for Large Spaces using Modified Meta- Optimization Genetic Algorithm

Solving Traveling Salesman Problem for Large Spaces using Modified Meta- Optimization Genetic Algorithm Maad M. Mijwel Computer science, college of science, Baghdad University Baghdad, Iraq maadalnaimiy@yahoo.com

### Genetic Algorithms. Kang Zheng Karl Schober

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

### Application of a Genetic Algorithm to a Scheduling Assignement Problem

Application of a Genetic Algorithm to a Scheduling Assignement Problem Amândio Marques a and Francisco Morgado b a CISUC - Center of Informatics and Systems of University of Coimbra, 3030 Coimbra, Portugal

### Comparison 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

### Combining Two Local Searches with Crossover: An Efficient Hybrid Algorithm for the Traveling Salesman Problem

Combining Two Local Searches with Crossover: An Efficient Hybrid Algorithm for the Traveling Salesman Problem Weichen Liu, Thomas Weise, Yuezhong Wu and Qi Qi University of Science and Technology of Chine

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

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

### Introduction to Optimization

Introduction to Optimization Approximation Algorithms and Heuristics November 21, 2016 École Centrale Paris, Châtenay-Malabry, France Dimo Brockhoff Inria Saclay Ile-de-France 2 Exercise: The Knapsack

### Pre-requisite Material for Course Heuristics and Approximation Algorithms

Pre-requisite Material for Course Heuristics and Approximation Algorithms This document contains an overview of the basic concepts that are needed in preparation to participate in the course. In addition,

### Genetic 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,

### Q. Wang National Key Laboratory of Antenna and Microwave Technology Xidian University No. 2 South Taiba Road, Xi an, Shaanxi , P. R.

Progress In Electromagnetics Research Letters, Vol. 9, 29 38, 2009 AN IMPROVED ALGORITHM FOR MATRIX BANDWIDTH AND PROFILE REDUCTION IN FINITE ELEMENT ANALYSIS Q. Wang National Key Laboratory of Antenna

### Lecture 4. Convexity Robust cost functions Optimizing non-convex functions. 3B1B Optimization Michaelmas 2017 A. Zisserman

Lecture 4 3B1B Optimization Michaelmas 2017 A. Zisserman Convexity Robust cost functions Optimizing non-convex functions grid search branch and bound simulated annealing evolutionary optimization The Optimization

### An Evolutionary Algorithm for the Multi-objective Shortest Path Problem

An Evolutionary Algorithm for the Multi-objective Shortest Path Problem Fangguo He Huan Qi Qiong Fan Institute of Systems Engineering, Huazhong University of Science & Technology, Wuhan 430074, P. R. China

### Radio Network Planning with Combinatorial Optimisation Algorithms

Author manuscript, published in "ACTS Mobile Telecommunications Summit 96, Granada : Spain (1996)" Radio Network Planning with Combinatorial Optimisation Algorithms P. Calégari, F. Guidec, P. Kuonen, EPFL,

### GVR: a New Genetic Representation for the Vehicle Routing Problem

GVR: a New Genetic Representation for the Vehicle Routing Problem Francisco B. Pereira 1,2, Jorge Tavares 2, Penousal Machado 1,2, Ernesto Costa 2 1 Instituto Superior de Engenharia de Coimbra, Quinta

### Ant Colony Optimization

Ant Colony Optimization CompSci 760 Patricia J Riddle 1 Natural Inspiration The name Ant Colony Optimization was chosen to reflect its original inspiration: the foraging behavior of some ant species. It

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

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

### METAHEURISTIC. Jacques A. Ferland Department of Informatique and Recherche Opérationnelle Université de Montréal.

METAHEURISTIC Jacques A. Ferland Department of Informatique and Recherche Opérationnelle Université de Montréal ferland@iro.umontreal.ca March 2015 Overview Heuristic Constructive Techniques: Generate

### Optimizing 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

### Modified 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.

### Local Search and Optimization Chapter 4. Mausam (Based on slides of Padhraic Smyth, Stuart Russell, Rao Kambhampati, Raj Rao, Dan Weld )

Local Search and Optimization Chapter 4 Mausam (Based on slides of Padhraic Smyth, Stuart Russell, Rao Kambhampati, Raj Rao, Dan Weld ) 1 2 Outline Local search techniques and optimization Hill-climbing

### An evolutionary annealing-simplex algorithm for global optimisation of water resource systems

FIFTH INTERNATIONAL CONFERENCE ON HYDROINFORMATICS 1-5 July 2002, Cardiff, UK C05 - Evolutionary algorithms in hydroinformatics An evolutionary annealing-simplex algorithm for global optimisation of water

### Reducing 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,

### Overcompressing JPEG images with Evolution Algorithms

Author manuscript, published in "EvoIASP2007, Valencia : Spain (2007)" Overcompressing JPEG images with Evolution Algorithms Jacques Lévy Véhel 1, Franklin Mendivil 2 and Evelyne Lutton 1 1 Inria, Complex

### A 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

### Design Space Exploration

Design Space Exploration SS 2012 Jun.-Prof. Dr. Christian Plessl Custom Computing University of Paderborn Version 1.1.0 2012-06-15 Overview motivation for design space exploration design space exploration

### Relationship between Genetic Algorithms and Ant Colony Optimization Algorithms

Relationship between Genetic Algorithms and Ant Colony Optimization Algorithms Osvaldo Gómez Universidad Nacional de Asunción Centro Nacional de Computación Asunción, Paraguay ogomez@cnc.una.py and Benjamín

### Outline. Best-first search. Greedy best-first search A* search Heuristics Local search algorithms

Outline Best-first search Greedy best-first search A* search Heuristics Local search algorithms Hill-climbing search Beam search Simulated annealing search Genetic algorithms Constraint Satisfaction Problems

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

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

### Outline. Motivation. Introduction of GAs. Genetic Algorithm 9/7/2017. Motivation Genetic algorithms An illustrative example Hypothesis space search

Outline Genetic Algorithm Motivation Genetic algorithms An illustrative example Hypothesis space search Motivation Evolution is known to be a successful, robust method for adaptation within biological

### Unavailability and Cost Minimization in a Parallel-Series System using Multi-Objective Evolutionary Algorithms

Unavailability and Cost Minimization in a Parallel-Series System using Multi-Objective Evolutionary Algorithms Ferney A. Maldonado-Lopez, Jorge Corchuelo, and Yezid Donoso Systems and Computer Engineering

### METAHEURISTICS Genetic Algorithm

METAHEURISTICS Genetic Algorithm Jacques A. Ferland Department of Informatique and Recherche Opérationnelle Université de Montréal ferland@iro.umontreal.ca Genetic Algorithm (GA) Population based algorithm

### Automata Construct with Genetic Algorithm

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

### New Solution Methods for Single Machine Bicriteria Scheduling Problem: Minimization of Average Flowtime and Number of Tardy Jobs

New Solution Methods for Single Machine Bicriteria Scheduling Problem: Minimization of Average Flowtime and Number of Tardy Jobs Fatih Safa Erenay a, Ihsan Sabuncuoglu b, Ayşegül Toptal b,*, Manoj Kumar

### AMS526: Numerical Analysis I (Numerical Linear Algebra)

AMS526: Numerical Analysis I (Numerical Linear Algebra) Lecture 5: Sparse Linear Systems and Factorization Methods Xiangmin Jiao Stony Brook University Xiangmin Jiao Numerical Analysis I 1 / 18 Sparse

### SOLVING THE JOB-SHOP SCHEDULING PROBLEM WITH A SIMPLE GENETIC ALGORITHM

ISSN 1726-4529 Int j simul model 8 (2009) 4, 197-205 Original scientific paper SOLVING THE JOB-SHOP SCHEDULING PROBLEM WITH A SIMPLE GENETIC ALGORITHM Lestan, Z.; Brezocnik, M.; Buchmeister, B.; Brezovnik,

### GENETIC ALGORITHM VERSUS PARTICLE SWARM OPTIMIZATION IN N-QUEEN PROBLEM

Journal of Al-Nahrain University Vol.10(2), December, 2007, pp.172-177 Science GENETIC ALGORITHM VERSUS PARTICLE SWARM OPTIMIZATION IN N-QUEEN PROBLEM * Azhar W. Hammad, ** Dr. Ban N. Thannoon Al-Nahrain

### Discrete Optimization. Lecture Notes 2

Discrete Optimization. Lecture Notes 2 Disjunctive Constraints Defining variables and formulating linear constraints can be straightforward or more sophisticated, depending on the problem structure. The

### Heuristic Optimization Introduction and Simple Heuristics

Heuristic Optimization Introduction and Simple Heuristics José M PEÑA (jmpena@fi.upm.es) (Universidad Politécnica de Madrid) 1 Outline 1. What are optimization problems? 2. Exhaustive vs. Heuristic approaches

### A Genetic Algorithm with Hill Climbing for the Bandwidth Minimization Problem

A Genetic Algorithm with Hill Climbing for the Bandwidth Minimization Problem Andrew Lim a, Brian Rodrigues b,feixiao c a Department of Industrial Engineering and Engineering Management, Hong Kong University

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

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

### Artificial Intelligence Application (Genetic Algorithm)

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

### Using Genetic Algorithms to Solve the Box Stacking Problem

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

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

### MATLAB Based Optimization Techniques and Parallel Computing

MATLAB Based Optimization Techniques and Parallel Computing Bratislava June 4, 2009 2009 The MathWorks, Inc. Jörg-M. Sautter Application Engineer The MathWorks Agenda Introduction Local and Smooth Optimization

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

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

### Parallel 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

### Big Data Management and NoSQL Databases

NDBI040 Big Data Management and NoSQL Databases Lecture 10. Graph databases Doc. RNDr. Irena Holubova, Ph.D. holubova@ksi.mff.cuni.cz http://www.ksi.mff.cuni.cz/~holubova/ndbi040/ Graph Databases Basic

### Priority rule-based reconstruction for total weighted tardiness minimization of job-shop scheduling problem

Bulletin of the JSME Journal of Advanced Mechanical Design, Systems, and Manufacturing Vol.8, No.5, 2014 Priority rule-based reconstruction for total weighted tardiness minimization of job-shop scheduling

### Hardware Neuronale Netzwerke - Lernen durch künstliche Evolution (?)

SKIP - May 2004 Hardware Neuronale Netzwerke - Lernen durch künstliche Evolution (?) S. G. Hohmann, Electronic Vision(s), Kirchhoff Institut für Physik, Universität Heidelberg Hardware Neuronale Netzwerke

### Using a genetic algorithm for editing k-nearest neighbor classifiers

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

### An Ant Approach to the Flow Shop Problem

An Ant Approach to the Flow Shop Problem Thomas Stützle TU Darmstadt, Computer Science Department Alexanderstr. 10, 64283 Darmstadt Phone: +49-6151-166651, Fax +49-6151-165326 email: stuetzle@informatik.tu-darmstadt.de

### An Introduction to Evolutionary Algorithms

An Introduction to Evolutionary Algorithms Karthik Sindhya, PhD Postdoctoral Researcher Industrial Optimization Group Department of Mathematical Information Technology Karthik.sindhya@jyu.fi http://users.jyu.fi/~kasindhy/

### White Paper. Scia Engineer Optimizer: Automatic Optimization of Civil Engineering Structures. Authors: Radim Blažek, Martin Novák, Pavel Roun

White Paper Scia Engineer Optimizer: Automatic Optimization of Civil Engineering Structures Nemetschek Scia nv Industrieweg 1007 3540 Herk-de-Stad (Belgium) Tel.: (+32) 013 55.17.75 Fax: (+32) 013 55.41.75

### A Parallel Architecture for the Generalized Travelling Salesman Problem: Project Proposal

A Parallel Architecture for the Generalized Travelling Salesman Problem: Project Proposal Max Scharrenbroich, maxfs at umd.edu Dr. Bruce Golden, R. H. Smith School of Business, bgolden at rhsmith.umd.edu

### A short introduction to embedded optimization

A short introduction to embedded optimization Tecnomatix Plant Simulation Worldwide User Conference June 22nd, 2016 Realize innovation. A short introduction to embedded optimization Table of content 1.

### Introduction to Design Optimization: Search Methods

Introduction to Design Optimization: Search Methods 1-D Optimization The Search We don t know the curve. Given α, we can calculate f(α). By inspecting some points, we try to find the approximated shape

### Dr.-Ing. Johannes Will CAD-FEM GmbH/DYNARDO GmbH dynamic software & engineering GmbH

Evolutionary and Genetic Algorithms in OptiSLang Dr.-Ing. Johannes Will CAD-FEM GmbH/DYNARDO GmbH dynamic software & engineering GmbH www.dynardo.de Genetic Algorithms (GA) versus Evolutionary Algorithms

### A Late Acceptance Hill-Climbing algorithm the winner of the International Optimisation Competition

The University of Nottingham, Nottingham, United Kingdom A Late Acceptance Hill-Climbing algorithm the winner of the International Optimisation Competition Yuri Bykov 16 February 2012 ASAP group research

### Speeding up Evolutionary Algorithms Through Restricted Mutation Operators

Speeding up Evolutionary Algorithms Through Restricted Mutation Operators Benjamin Doerr 1, Nils Hebbinghaus 1 and Frank Neumann 2 1 Max-Planck-Institut für Informatik, 66123 Saarbrücken, Germany. 2 Institut

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

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

### Bayesian Methods in Vision: MAP Estimation, MRFs, Optimization

Bayesian Methods in Vision: MAP Estimation, MRFs, Optimization CS 650: Computer Vision Bryan S. Morse Optimization Approaches to Vision / Image Processing Recurring theme: Cast vision problem as an optimization

### THE DEVELOPMENT OF THE POTENTIAL AND ACADMIC PROGRAMMES OF WROCLAW UNIVERISTY OF TECHNOLOGY METAHEURISTICS

METAHEURISTICS 1. Objectives The goals of the laboratory workshop are as follows: to learn basic properties of evolutionary computation techniques and other metaheuristics for solving various global optimization

### Genetic Algorithm for Job Shop Scheduling

Genetic Algorithm for Job Shop Scheduling Mr.P.P.Bhosale Department Of Computer Science and Engineering, SVERI s College Of Engineering Pandharpur, Solapur University Solapur Mr.Y.R.Kalshetty Department

### Application of Genetic Algorithms to CFD. Cameron McCartney

Application of Genetic Algorithms to CFD Cameron McCartney Introduction define and describe genetic algorithms (GAs) and genetic programming (GP) propose possible applications of GA/GP to CFD Application

### Local Search (Greedy Descent): Maintain an assignment of a value to each variable. Repeat:

Local Search Local Search (Greedy Descent): Maintain an assignment of a value to each variable. Repeat: Select a variable to change Select a new value for that variable Until a satisfying assignment is

### A Genetic Algorithm Framework

Fast, good, cheap. Pick any two. The Project Triangle 3 A Genetic Algorithm Framework In this chapter, we develop a genetic algorithm based framework to address the problem of designing optimal networks

### Sparse Matrices. This means that for increasing problem size the matrices become sparse and sparser. O. Rheinbach, TU Bergakademie Freiberg

Sparse Matrices Many matrices in computing only contain a very small percentage of nonzeros. Such matrices are called sparse ( dünn besetzt ). Often, an upper bound on the number of nonzeros in a row can

### Available online at ScienceDirect. Procedia CIRP 44 (2016 )

Available online at www.sciencedirect.com ScienceDirect Procedia CIRP 44 (2016 ) 102 107 6th CIRP Conference on Assembly Technologies and Systems (CATS) Worker skills and equipment optimization in assembly

### Hybrid Two-Stage Algorithm for Solving Transportation Problem

Hybrid Two-Stage Algorithm for Solving Transportation Problem Saleem Z. Ramadan (Corresponding author) Department of Mechanical and Industrial Engineering Applied Science Private University PO box 166,

### l 8 r 3 l 9 r 1 l 3 l 7 l 1 l 6 l 5 l 10 l 2 l 4 r 2

Heuristic Algorithms for the Terminal Assignment Problem Sami Khuri Teresa Chiu Department of Mathematics and Computer Science San Jose State University One Washington Square San Jose, CA 95192-0103 khuri@jupiter.sjsu.edu

### Design of an Optimal Nearest Neighbor Classifier Using an Intelligent Genetic Algorithm

Design of an Optimal Nearest Neighbor Classifier Using an Intelligent Genetic Algorithm Shinn-Ying Ho *, Chia-Cheng Liu, Soundy Liu, and Jun-Wen Jou Department of Information Engineering, Feng Chia University,

### A Genetic Algorithm for the Multiple Knapsack Problem in Dynamic Environment

, 23-25 October, 2013, San Francisco, USA A Genetic Algorithm for the Multiple Knapsack Problem in Dynamic Environment Ali Nadi Ünal Abstract The 0/1 Multiple Knapsack Problem is an important class of

### Network Reconfiguration for Loss Reduction in Electrical Distribution System Using Genetic Algorithm

Network Reconfiguration for Loss Reduction in Electrical Distribution System Using Genetic Algorithm S. A. Nagy*, I. S. Ibrahim, M. K. Ahmed*, A. S. Adail and S. Soliman Hot Labs Center, Atomic Energy

### CT79 SOFT COMPUTING ALCCS-FEB 2014

Q.1 a. Define Union, Intersection and complement operations of Fuzzy sets. For fuzzy sets A and B Figure Fuzzy sets A & B The union of two fuzzy sets A and B is a fuzzy set C, written as C=AUB or C=A OR

### N-Queens problem. Administrative. Local Search

Local Search CS151 David Kauchak Fall 2010 http://www.youtube.com/watch?v=4pcl6-mjrnk Some material borrowed from: Sara Owsley Sood and others Administrative N-Queens problem Assign 1 grading Assign 2

Adaptive-Mesh-Refinement Pattern I. Problem Data-parallelism is exposed on a geometric mesh structure (either irregular or regular), where each point iteratively communicates with nearby neighboring points

### Evolutionary Algorithms. CS Evolutionary Algorithms 1

Evolutionary Algorithms CS 478 - Evolutionary Algorithms 1 Evolutionary Computation/Algorithms Genetic Algorithms l Simulate natural evolution of structures via selection and reproduction, based on performance

### Path Planning Optimization Using Genetic Algorithm A Literature Review

International Journal of Computational Engineering Research Vol, 03 Issue, 4 Path Planning Optimization Using Genetic Algorithm A Literature Review 1, Er. Waghoo Parvez, 2, Er. Sonal Dhar 1, (Department

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

Chaotic Crossover Operator on Genetic Algorithm Hüseyin Demirci Computer Engineering, Sakarya University, Sakarya, 54187, Turkey Ahmet Turan Özcerit Computer Engineering, Sakarya University, Sakarya, 54187,

### Introduction to Genetic Algorithms

Advanced Topics in Image Analysis and Machine Learning Introduction to Genetic Algorithms Week 3 Faculty of Information Science and Engineering Ritsumeikan University Today s class outline Genetic Algorithms

### CS5401 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

### Artificial Intelligence

Artificial Intelligence Local Search Vibhav Gogate The University of Texas at Dallas Some material courtesy of Luke Zettlemoyer, Dan Klein, Dan Weld, Alex Ihler, Stuart Russell, Mausam Systematic Search:

### Efficient Multi-GPU CUDA Linear Solvers for OpenFOAM

Efficient Multi-GPU CUDA Linear Solvers for OpenFOAM Alexander Monakov, amonakov@ispras.ru Institute for System Programming of Russian Academy of Sciences March 20, 2013 1 / 17 Problem Statement In OpenFOAM,

### A 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

### Evolving SQL Queries for Data Mining

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

### Analysis 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

### Lecture

Lecture.. 7 Constrained problems & optimization Brief introduction differential evolution Brief eample of hybridization of EAs Multiobjective problems & optimization Pareto optimization This slides mainly

### An Evolutionary Algorithm for Minimizing Multimodal Functions

An Evolutionary Algorithm for Minimizing Multimodal Functions D.G. Sotiropoulos, V.P. Plagianakos and M.N. Vrahatis University of Patras, Department of Mamatics, Division of Computational Mamatics & Informatics,

### GENERATIONAL MODEL GENETIC ALGORITHM FOR REAL WORLD SET PARTITIONING PROBLEMS

International Journal of Electronic Commerce Studies Vol.4, No.1, pp. 33-46, 2013 doi: 10.7903/ijecs.1138 GENERATIONAL MODEL GENETIC ALGORITHM FOR REAL WORLD SET PARTITIONING PROBLEMS Chi-san Althon Lin

Administrative Local Search! CS311 David Kauchak Spring 2013 Assignment 2 due Tuesday before class Written problems 2 posted Class participation http://www.youtube.com/watch? v=irhfvdphfzq&list=uucdoqrpqlqkvctckzqa

### Genetic algorithms for the traveling salesman problem

337 Genetic Algorithms Annals of Operations Research 63(1996)339-370 339 Genetic algorithms for the traveling salesman problem Jean-Yves Potvin Centre de Recherche sur les Transports, Universitd de Montrgal,