Using evolutionary techniques to improve the multisensor fusion of environmental measurements

Size: px
Start display at page:

Download "Using evolutionary techniques to improve the multisensor fusion of environmental measurements"

Transcription

1 Using evolutionary techniques to improve the multisensor fusion of environmental measurements A.L. Hood 1*, V.M.Becerra 2 and R.J.Craddock 3 1 Technologies for Sustainable Built Environments Centre, University of Reading, United Kingdom 2 School of Systems Engineering, University of Reading, United Kingdom 3 Thales Research and Technology (UK), Reading, United Kingdom ABSTRACT * Corresponding author: fx016817@reading.ac.uk Within the environmental sciences, the ability to accurately collate, combine and present data from various sensors is important to validate research. Whilst measuring data from a single sensor is a standard practice, fusing the output of more than one sensor can be a complicated and computationally intensive process. Outlined is a brief introduction to the art of multisensor fusion and a suggestion that fusion optimisation and analysis could be improved with the use of evolutionary techniques common within the field of artificial intelligence. Evolutionary techniques are used in a wide array of research areas, but their application and initial parameter settings are often unique to the specific task at hand. By combining these two relatively established practices it is suggested that a new approach could be determined to provide a combined sensory output far superior to that of individual readings. Keywords: Artificial intelligence, sensor, fusion, evolutionary techniques, environmental 1. INTRODUCTION The ability to measure environmental variables plays a key part in climate research. However, like all sensors, environmental devices can be impacted by accuracy failures, obstruction and the inability to adapt to changes both measurable and unseen. These problems are only compounded when mounted upon evolving staging environments (such as moveable platforms, autonomous vehicles or harsh climate). Combining the outputs of multiple sensors can offer a durable sensor platform. If one data stream fails, the others can be used to compensate and in some cases provide estimates of the missing values. Further advancements can be made by using a combination of sensors that offer a variation in coverage areas; thus extending the operational range of the data gathering. Multisensor fusion (MSF) provides the possibilities for the combination of such data. Many models have been developed often uniquely for the task in hand, although no specific model for such environmental data fusion exists. In addition, MSF would benefit from a further understanding of the use of self-adapting algorithms which can keep track of ever evolving environments. One such approach is the Darwinian inspired evolutionary algorithm, which is a generic, flexible and versatile framework for complex optimisation and search problems. 1

2 2. THE BASICS OF MULTISENSOR FUSION The field of sensor fusion has its historical background within defence applications [1][2]. Sensor fusion can be described as the process of combining multiple data from several sensor (or data) sources, such that the result is in some cases better than would be possible when sensor data is used individually. This combined data improves accuracy and allows for more specific inferences than would be possible from a single source. Whilst data fusion is often seen as the combining of data from multiple sources of the same or different types, the definition also includes the fusion of data from a single data source such as measurements taken at different times [3]. The application of sensor fusion can provide many benefits. These include the increase in spatial and temporal coverage of sensors, increased precision and a reduction in sensory degradation. When combined and evaluated, the data provided can improve the accuracy of the inferences being assessed. 2.1 Examples Of MSF Figure 1 The multiple sensors within humans [4] One of the most efficient and critical sensory fusion systems is contained within the mammalian brain. The human brain for example is capable of collating data from our internal and external sensors and combining them to provide input into the decision making areas. If we were able to only focus on one sensory input at a time, for example sound, our perception of our environment would be incomplete and thus have an effect on how we make inferences. As shown by Figure 1, sensory systems can be a combination of sensors, each of which can be given a specific strength or impact value. Whilst it is often remarked that humans possess five primary sensors, our perception will be further defined by the supplementary use of secondary sensory inputs such as priorioception (position), equilibrioception (balance) and thermoception (temperature). A common civilian use of sensory fusion takes place within the control systems of many modern cars [5]. With the intention of improving safety, vehicles are equipped with multiple specific sensors to monitor the internal and external environment whilst in motion. By combining the measurements derived, a central control unit can make situational inferences and in some cases override the human controls (Figure 2). 2

3 Figure 2 An example multisensor architecture for improving vehicular safety [5] The consolidation of multiple data streams also allows for reasoning to continue if one or more input sources show signs of degradation. Weather conditions, sensor failure and interference can all cause an input to fail or produce inaccurate results. Whilst this would cause a severe reduction in accuracy using a single sensor system, the outputs of other sensors can be combined with a priori knowledge to derive alternatives. 2.2 Common Industry Models Although there are examples of multisensor use in civilian applications, the field has matured predominantly within defence applications such as tracking, identification and targeting. Emerging from this research have been various architectures conceived with the intention of offering a structure for the combination of outputs and inputs. The JDL (Joint Directors of Laboratories) architecture [6] (Figure 3) is widely used in both the defence and civilian fields, but it is believed to be quite inflexible [7]. The authors provided a definition for their hierarchical approach describing data fusion as: A multilevel, multifaceted process dealing with the automatic detection, association, correlation, estimation and combination of data and information from single and multiple sources Each of the defined levels provides a processing approach to further tailor the data provided from the outputs. In addition, a priori knowledge is provided by a database and allowances are included for human interaction to further refine the inference making process. In addition, other approaches such as the British Waterfall Fusion Process Model [8] and the adopted Boyd OODA loop [9] have been developed to offer alternatives which provide flexibility in the development of multisensory systems. 3

4 Figure 3 The JDL Architecture [3] 3 OUTLINE OF EVOLUTIONARY TECHNIQUES First developed in the 1950 s, evolutionary computation has developed over the decades into a powerful and versatile heuristic based global search and optimisation method. Taking its inspiration from the biological evolutionary process, the technique allows a system to move towards a solution within a search space by the combination and mutation of a population of possible candidates. Whilst the initial set-up and problem representation is often regarded as more an art than a science, genetic techniques have been used in a wide arrange of applications and are embraced as a subset of the field of artificial intelligence. 3.1 The Influence From Nature Biological entities can be described based on the composition of their genes; the DNA strings which offer a building block to the overall structure. These small DNA segments refer to specific features of the organism and can be broken down into individual sections which describe a variable referring to the value of this feature. A simple example may refer to a section responsible for the colour of eyes and will have a variable which when set refers to blue, brown or green. An individual can be described as the combination of each of these genes, known as a genome, and the population of identical genomes as a genotype. When this set of genes is referenced to its observed (or external) equivalent, it is known as its phenotype. Evolutionary computation utilises an approach similar to the biological representation (Figure 4) of an organism to define a particular solution found within a population of solutions. As in nature, these populations can be mated (combined) to produce offspring (new solutions) which share the traits of their parents. Ideally those traits will best enable an organism to increase its performance within its set environment. This can be evaluated with the use of a fitness function; a value which determines how well its phenotype fits within a set of parameters. 4

5 Figure 4 The comparative representation of biological systems and evolutionary computation [10] Similar to the natural occurring effects of population combination, evolutionary techniques adopt the use of gene mutation; random mutations of individual variables to provide variety in the genotype of the solution. 3.2 Basic Structure Of An Evolutionary Algorithm Representing the problem One of the first and important tasks when developing an evolutionary approach is the design of a candidate solution. This will represent the mapping from genotype to phenotype and will be created to accurately reflect a solution to the problem stipulated. As with a great deal of evolutionary solutions, this task will be made significantly easier with a stronger understanding of the problem and search space involved. The simplest approach to candidate representation is a binary genotype. Each variable to be considered is presented as a binary 0 or 1 value and can form a string of bits of infinite length. However, depending on the nature of the problem, consideration can be given to integer, real, floating or permutation approaches. Each variation produces its own unique challenges and care should be given where variables are linked and need to be kept together. Numerical representations can be made for non-numerical values, for example the set {0,1,2,3} can be used to produce the equivalents of the set {North, East, South, West} Of utmost importance is the maintenance of the link between the genotype and phenotype mappings. Failure at the design stage will often cause candidate solutions to be created which have phenotype mappings which are completely unsuitable for the search space and the problem at hand The fitness function In order to measure the suitability of a candidate solution to the problem, a fitness function must be derived to provide a numerical 'score' of strength. As an example, if the task was to derive an integer that maximises the value of x 2 using a candidate pool of 5 bit strings, then the solution the fitness f(x 2 ) would be calculated as 14 2 =

6 The fitness function is vital to the evolutionary approach. It offers the primary mechanism for determining proximity to an ideal solution and allows for the ranking of pooled candidate solutions during parent selection Selecting mating pairs As with natural evolution, the main onus on parental selection is to choose those 'mates' that offer the greatest strengths within the defined environment. The intention is to choose those parents with high fitness scores with the aim that recombination of their genes will, in some cases, maintain the best features from each of the parent candidates. There are many approaches to this task and each should be evaluated on a problem by problem basis. Commonly used methods include the roulette wheel, ranking tournaments and fitness proportional selection. Initially it may be intuitive to always select the top two ranked candidates for recombination, however this approach is likely to result in the process stopping at a local optimum rather than the global optimum solution Recombination and the injection of mutation Figure 5 Examples of one point and two point crossover [11] Once a process of parental selection has taken place, a decision needs to be taken regarding the crossover (mating) process. There are many documented approaches to this part of the algorithm, some specific to certain problem domains, but Figure 5 shows a commonly used one or two point crossover. During one bit crossover, a single point in the parents genotype is identified and the genes split into a head and a tail. The process recombines these genes head to tail from the represented parents to produce the required number of offspring. An important addition to this evolutionary approach is the introduction of the biological equivalent gene mutation. Using a user defined random process, one (or sometimes more) genes are selected to have their value altered (mutated). In a binary string genotype, this would result in one of the bits being switched (0 to 1 or 1 to 0). This application has been shown to be the key driver to 'bouncing' a solution out of a local optimum and allowing a wider search area to be considered. Once a new population of candidates has been created a population model needs to be adhered to. This may dictate that all parents are replaced by an equivalent number of children, or that only the top x percent of solutions from the previous generation are included. 6

7 Figure 6 The evolutionary process Evolutionary algorithms require a stopping criterion. This could be after a certain number of generations, or when the best solution has remained constant for a determined period of time. Until this threshold is met, the algorithm will continue (Figure 6) to loop. 4. ENVIRONMENTAL SENSING AND SENSOR FUSION MODELS 4.1 Sensor Use In Climate Science Sensor arrays are currently in use for systems responsible for weather forecasting and measuring the Earth's resources. These rely on a combination of visible, microwave, infrared, laser and MMV (millimetre-wave) sensors to collate information about rainfall, cloud cover, snow density amongst others. Due to the nature of the entities being observed, there are many instances of source obstruction (such as cloud cover), signal interference (solar storms) and sensor failure (often due to the difficultly regarding maintenance). Many of these issues can be either overcome or mitigated by the use of multiple, overlapping sensors and a combination of mathematical techniques. 4.2 Applying MSF Models To Environmental Measuring One of the most commonly used MSF models is the JDL data fusion architecture. As can be seen from Figure 3, the process is split into a series of levels; each responsible for processing the data to further refine its inferences. Whilst this model was not initially developed with civilian use in mind, it is possible to adapt it for other implementations [12]. Climate science is rich in data sources to facilitate the investigation of the impact of data combination. Raw data from one entity can be processed with the inferences from another to provide a clearer, more accurate depiction of that being studied. Information that is being measured at discrete time intervals can be estimated and combined with that measured using a differing scale. This offers a greater scope for climate modelling and further understanding of the relationships between the information being observed. 5. CONCLUSIONS / FURTHER WORK There are a large number of questions that need to be addressed in order to fully appreciate the possibilities of combining the techniques discussed for environmental applications. Firstly among these is the investigation of existing MSF models and how they can be applied to environmental problems. Could an existing model be adapted slightly, or does a new specific approach need to be 7

8 taken? Would it be better to design a more generic framework which could have a use outside of the parameters of this research? This is the initial task required before venturing into the intricacies of MSF. Any model must have at its core the driver of self-adaptation. Environmental sensors are affected by the environment they are measuring. There are both natural (e.g. weather) and unnatural (e.g. sensor degradation) impacts on sensor functioning which can be addressed by adding awareness to the model and evolving new strategies in situ. This is particularly important for sensors placed in locations where regular maintenance is difficult or must be scheduled in advance (including those placed on satellites or in harsh environments). Whether evolutionary algorithms offer the most robust approach to this problem, or only offer benefits at initialisation stage (such as optimum sensor placement) will need to be assessed. However, such algorithms work well in adapting environments and may prove very useful in areas where the search space is constantly changing. Finally, examples will need to be provided to highlight the benefit, if any, of utilising MSF in environmental measuring. It is easy to assume that utilising more than one data stream would offer a richer, more concise view of the environment being measured. However, automating this process will have to be proven to offer a more robust, trusted information source, that provides tangible benefits to the researchers undertaking such work. 6. REFERENCES [1] E. Waltz and J.Linus, Multi-sensor Data Fusion, Artech House, Norwood, MA 1990 [2] Hall, Mathematical Techniques in Multi-Sensor Data Fusion, Artech House, Norwood, MA 1992 [3] W. Elmenreich, An Introduction to Sensor Fusion, Vienna University of Technology, Austria, November 2002 [4] PULSE, Consumer electronics and the future of engaging the senses: an ergonomist s perspective. [Online]. Available: [5] Delphi, Delphi sensor fusion for automotive safety, [Online]. Available: [6] White, F.E., A Model for Data Fusion, Proc. 1st National Symposium on Sensor Fusion, 1988 [7] Steinburg, Bowman, White, Revisions to the JDL data fusion model, Proceedings of the 1999 IRIS Unclassified National Sensor and Data Fusion Conference, May 1999 [8] Markin, et al, Technology foresight on data fusion and data processing, The Royal Aeronautical Society, 1997 [9] Boyd, A discourse on wining and losing, Air University Library, Maxwell, AL, May 1987 (unpublished) [10] Maslov, Gertner, Mutli-sensor fusion: an evolutionary algorithm approach, Information Fusion 7, , 2007 [11] Johnston, R, Applications of Genetic Algorithms in Chemistry, University of Birmingham, [Online], Available: [12] Llinas, et al, Revisiting the JDL Data Fusion Model II, Proceedings of the Seventh International Conference on Information Fusion (FUSION 2004) 8

Part 1: Motivation, Basic Concepts, Algorithms

Part 1: Motivation, Basic Concepts, Algorithms Part 1: Motivation, Basic Concepts, Algorithms 1 Review of Biological Evolution Evolution is a long time scale process that changes a population of an organism by generating better offspring through reproduction.

More information

GENETIC ALGORITHMS. Narra Priyanka. K.Naga Sowjanya. Vasavi College of Engineering. Ibrahimbahg,Hyderabad.

GENETIC ALGORITHMS. Narra Priyanka. K.Naga Sowjanya. Vasavi College of Engineering. Ibrahimbahg,Hyderabad. GENETIC ALGORITHMS Narra Priyanka K.Naga Sowjanya Vasavi College of Engineering. Ibrahimbahg,Hyderabad mynameissowji@yahoo.com priyankanarra@yahoo.com Abstract Genetic algorithms are a part of evolutionary

More information

Optimisation and Operations Research

Optimisation and Operations Research Optimisation and Operations Research Lecture 17: Genetic Algorithms and Evolutionary Computing Matthew Roughan http://www.maths.adelaide.edu.au/matthew.roughan/ Lecture_notes/OORII/

More information

Introduction to Genetic Algorithm (GA) Presented By: Rabiya Khalid Department of Computer Science

Introduction to Genetic Algorithm (GA) Presented By: Rabiya Khalid Department of Computer Science Introduction to Genetic Algorithm (GA) Presented By: Rabiya Khalid Department of Computer Science 1 GA (1/31) Introduction Based on Darwin s theory of evolution Rapidly growing area of artificial intelligence

More information

Artificial Evolution. FIT3094 AI, A-Life and Virtual Environments Alan Dorin

Artificial Evolution. FIT3094 AI, A-Life and Virtual Environments Alan Dorin Artificial Evolution FIT3094 AI, A-Life and Virtual Environments Alan Dorin Copyrighted imagery used in the preparation of these lecture notes remains the property of the credited owners and is included

More information

Evolutionary Computation. Lecture 3. Evolutionary Computation. X 2 example: crossover. x 2 example: selection

Evolutionary Computation. Lecture 3. Evolutionary Computation. X 2 example: crossover. x 2 example: selection Evolutionary Computation Lecture 3 Evolutionary Computation CIS 412 Artificial Intelligence Umass, Dartmouth Stochastic search (or problem solving) techniques that mimic the metaphor of natural biological

More information

Machine Learning: Algorithms and Applications

Machine Learning: Algorithms and Applications Machine Learning: Algorithms and Applications Floriano Zini Free University of Bozen-Bolzano Faculty of Computer Science Academic Year 2011-2012 Lecture 4: 19 th March 2012 Evolutionary computing These

More information

Introduction to Artificial Intelligence. Prof. Inkyu Moon Dept. of Robotics Engineering, DGIST

Introduction to Artificial Intelligence. Prof. Inkyu Moon Dept. of Robotics Engineering, DGIST Introduction to Artificial Intelligence Prof. Inkyu Moon Dept. of Robotics Engineering, DGIST Chapter 9 Evolutionary Computation Introduction Intelligence can be defined as the capability of a system to

More information

Evolutionary Computation. Lecture 1 January, 2007 Ivan Garibay

Evolutionary Computation. Lecture 1 January, 2007 Ivan Garibay Evolutionary Computation Lecture 1 January, 2007 Ivan Garibay igaribay@cs.ucf.edu Lecture 1 What is Evolutionary Computation? Evolution, Genetics, DNA Historical Perspective Genetic Algorithm Components

More information

Processor Scheduling Algorithms in Environment of Genetics

Processor Scheduling Algorithms in Environment of Genetics Processor Scheduling Algorithms in Environment of Genetics Randeep Department of Computer Science and Engineering R.N. College of Engg. & Technology Haryana, India randeepravish@gmail.com Abstract The

More information

Energy management using genetic algorithms

Energy management using genetic algorithms Energy management using genetic algorithms F. Garzia, F. Fiamingo & G. M. Veca Department of Electrical Engineering, University of Rome "La Sapienza", Italy Abstract An energy management technique based

More information

Genetic Algorithms for Optimizations

Genetic Algorithms for Optimizations Genetic Algorithms for Optimizations 1. Introduction Genetic Algorithms (GAs) are developed to mimic some of the processes observed in natural evolution. GAs use the concept of Darwin's theory of evolution

More information

Genetic Algorithm: An Optimization Technique Concept

Genetic Algorithm: An Optimization Technique Concept Genetic Algorithm: An Optimization Technique Concept 1 Uma Anand, 2 Chain Singh 1 Student M.Tech (3 rd sem) Department of Computer Science Engineering Dronacharya College of Engineering, Gurgaon-123506,

More information

Evolutionary Computation

Evolutionary Computation Evolutionary Computation Evolution and Intelligent Besides learning ability, intelligence can also be defined as the capability of a system to adapt its behaviour to ever changing environment. Evolutionary

More information

College of information technology Department of software

College of information technology Department of software University of Babylon Undergraduate: third class College of information technology Department of software Subj.: Application of AI lecture notes/2011-2012 ***************************************************************************

More information

CHAPTER 3 RESEARCH METHODOLOGY

CHAPTER 3 RESEARCH METHODOLOGY 72 CHAPTER 3 RESEARCH METHODOLOGY Inventory management is considered to be an important field in Supply chain management. Once the efficient and effective management of inventory is carried out throughout

More information

VISHVESHWARAIAH TECHNOLOGICAL UNIVERSITY S.D.M COLLEGE OF ENGINEERING AND TECHNOLOGY. A seminar report on GENETIC ALGORITHMS.

VISHVESHWARAIAH TECHNOLOGICAL UNIVERSITY S.D.M COLLEGE OF ENGINEERING AND TECHNOLOGY. A seminar report on GENETIC ALGORITHMS. VISHVESHWARAIAH TECHNOLOGICAL UNIVERSITY S.D.M COLLEGE OF ENGINEERING AND TECHNOLOGY A seminar report on GENETIC ALGORITHMS Submitted by Pranesh S S 2SD06CS061 8 th semester DEPARTMENT OF COMPUTER SCIENCE

More information

Intelligent Techniques Lesson 4 (Examples about Genetic Algorithm)

Intelligent Techniques Lesson 4 (Examples about Genetic Algorithm) Intelligent Techniques Lesson 4 (Examples about Genetic Algorithm) Numerical Example A simple example will help us to understand how a GA works. Let us find the maximum value of the function (15x - x 2

More information

Genetic algorithms. History

Genetic algorithms. History Genetic algorithms History Idea of evolutionary computing was introduced in the 1960s by I. Rechenberg in his work "Evolution strategies" (Evolutionsstrategie in original). His idea was then developed

More information

10. Lecture Stochastic Optimization

10. Lecture Stochastic Optimization Soft Control (AT 3, RMA) 10. Lecture Stochastic Optimization Genetic Algorithms 10. Structure of the lecture 1. Soft control: the definition and limitations, basics of epert" systems 2. Knowledge representation

More information

From Genetics to Genetic Algorithms

From Genetics to Genetic Algorithms From Genetics to Genetic Algorithms Solution to Optimisation Problems Using Natural Systems Jitendra R Raol and Abhijit Jalisatgi Genetic algorithms are search procedures inspired by natural selection

More information

Keywords Genetic Algorithm (GA), Evolutionary, Representation, Binary, Floating Point, Operator

Keywords Genetic Algorithm (GA), Evolutionary, Representation, Binary, Floating Point, Operator Volume 5, Issue 4, 2015 ISSN: 2277 128X International Journal of Advanced Research in Computer Science and Software Engineering Research Paper Available online at: www.ijarcsse.com A Review on Genetic

More information

2. Genetic Algorithms - An Overview

2. Genetic Algorithms - An Overview 2. Genetic Algorithms - An Overview 2.1 GA Terminology Genetic Algorithms (GAs), which are adaptive methods used to solve search and optimization problems, are based on the genetic processes of biological

More information

The Metaphor. Individuals living in that environment Individual s degree of adaptation to its surrounding environment

The Metaphor. Individuals living in that environment Individual s degree of adaptation to its surrounding environment Genetic Algorithms Sesi 14 Optimization Techniques Mathematical Programming Network Analysis Branch & Bound Simulated Annealing Tabu Search Classes of Search Techniques Calculus Base Techniqes Fibonacci

More information

EVOLUTIONARY ALGORITHMS AT CHOICE: FROM GA TO GP EVOLŪCIJAS ALGORITMI PĒC IZVĒLES: NO GA UZ GP

EVOLUTIONARY ALGORITHMS AT CHOICE: FROM GA TO GP EVOLŪCIJAS ALGORITMI PĒC IZVĒLES: NO GA UZ GP ISSN 1691-5402 ISBN 978-9984-44-028-6 Environment. Technology. Resources Proceedings of the 7 th International Scientific and Practical Conference. Volume I1 Rēzeknes Augstskola, Rēzekne, RA Izdevniecība,

More information

Machine Learning. Genetic Algorithms

Machine Learning. Genetic Algorithms Machine Learning Genetic Algorithms Genetic Algorithms Developed: USA in the 1970 s Early names: J. Holland, K. DeJong, D. Goldberg Typically applied to: discrete parameter optimization Attributed features:

More information

Machine Learning. Genetic Algorithms

Machine Learning. Genetic Algorithms Machine Learning Genetic Algorithms Genetic Algorithms Developed: USA in the 1970 s Early names: J. Holland, K. DeJong, D. Goldberg Typically applied to: discrete parameter optimization Attributed features:

More information

Genetic Algorithm and Application in training Multilayer Perceptron Model

Genetic Algorithm and Application in training Multilayer Perceptron Model Genetic Algorithm and Application in training Multilayer Perceptron Model Tuan Dung Lai Faculty of Science, Engineering and Technology Swinburne University of Technology Hawthorn, Victoria 3122 Email:

More information

Evolutionary Algorithms

Evolutionary Algorithms Evolutionary Algorithms Evolutionary Algorithms What is Evolutionary Algorithms (EAs)? Evolutionary algorithms are iterative and stochastic search methods that mimic the natural biological evolution and/or

More information

CHAPTER 4 LINEAR ANTENNA ARRAY SYNTHESIS USING GENETIC ALGORITHM

CHAPTER 4 LINEAR ANTENNA ARRAY SYNTHESIS USING GENETIC ALGORITHM 76 CHAPTER 4 LINEAR ANTENNA ARRAY SYNTHESIS USING GENETIC ALGORITHM 4.1 INTRODUCTION Improving antenna characteristics such as directivity, input impedance, bandwidth, sidelobe level, null depth level

More information

TIMETABLING EXPERIMENTS USING GENETIC ALGORITHMS. Liviu Lalescu, Costin Badica

TIMETABLING EXPERIMENTS USING GENETIC ALGORITHMS. Liviu Lalescu, Costin Badica TIMETABLING EXPERIMENTS USING GENETIC ALGORITHMS Liviu Lalescu, Costin Badica University of Craiova, Faculty of Control, Computers and Electronics Software Engineering Department, str.tehnicii, 5, Craiova,

More information

Plan for today GENETIC ALGORITHMS. Randomised search. Terminology: The GA cycle. Decoding genotypes

Plan for today GENETIC ALGORITHMS. Randomised search. Terminology: The GA cycle. Decoding genotypes GENETIC ALGORITHMS Jacek Malec email: jacek.malec@cs.lth.se Plan for today What is a genetic algorithm? Degrees of freedom. Some examples. Co-evolution, SAGA, Genetic Programming, Evolutionary Strategies,...

More information

COMPARATIVE STUDY OF SELECTION METHODS IN GENETIC ALGORITHM

COMPARATIVE STUDY OF SELECTION METHODS IN GENETIC ALGORITHM COMPARATIVE STUDY OF SELECTION METHODS IN GENETIC ALGORITHM 1 MANSI GANGWAR, 2 MAIYA DIN, 3 V. K. JHA 1 Information Security, 3 Associate Professor, 1,3 Dept of CSE, Birla Institute of Technology, Mesra

More information

An introduction to evolutionary computation

An introduction to evolutionary computation An introduction to evolutionary computation Andrea Roli andrea.roli@unibo.it Dept. of Computer Science and Engineering (DISI) Campus of Cesena Alma Mater Studiorum Università di Bologna Outline 1 Basic

More information

Assoc. Prof. Rustem Popa, PhD

Assoc. Prof. Rustem Popa, PhD Dunarea de Jos University of Galati-Romania Faculty of Electrical & Electronics Engineering Dep. of Electronics and Telecommunications Assoc. Prof. Rustem Popa, PhD http://www.etc.ugal.ro/rpopa/index.htm

More information

Genetic Algorithm: A Search of Complex Spaces

Genetic Algorithm: A Search of Complex Spaces Genetic Algorithm: A Search of Complex Spaces Namita Khurana, Anju Rathi, Akshatha.P.S Lecturer in Department of (CSE/IT) KIIT College of Engg., Maruti Kunj, Sohna Road, Gurgaon, India ABSTRACT Living

More information

CSE /CSE6602E - Soft Computing Winter Lecture 9. Genetic Algorithms & Evolution Strategies. Guest lecturer: Xiangdong An

CSE /CSE6602E - Soft Computing Winter Lecture 9. Genetic Algorithms & Evolution Strategies. Guest lecturer: Xiangdong An CSE3 3./CSE66E - Soft Computing Winter Lecture 9 Genetic Algorithms & Evolution Strategies Guest lecturer: Xiangdong An xan@cs.yorku.ca Genetic algorithms J. Holland, Adaptation in Natural and Artificial

More information

Evolutionary Computation

Evolutionary Computation Evolutionary Computation Dean F. Hougen w/ contributions from Pedro Diaz-Gomez & Brent Eskridge Robotics, Evolution, Adaptation, and Learning Laboratory (REAL Lab) School of Computer Science University

More information

What is Evolutionary Computation? Genetic Algorithms. Components of Evolutionary Computing. The Argument. When changes occur...

What is Evolutionary Computation? Genetic Algorithms. Components of Evolutionary Computing. The Argument. When changes occur... What is Evolutionary Computation? Genetic Algorithms Russell & Norvig, Cha. 4.3 An abstraction from the theory of biological evolution that is used to create optimization procedures or methodologies, usually

More information

Introduction To Genetic Algorithms

Introduction To Genetic Algorithms Introduction To Genetic Algorithms Cse634 DATA MINING Professor Anita Wasilewska Computer Science Department Stony Brook University 1 Overview Introduction To Genetic Algorithms (GA) GA Operators and Parameters

More information

Genetic Algorithms. Part 3: The Component of Genetic Algorithms. Spring 2009 Instructor: Dr. Masoud Yaghini

Genetic Algorithms. Part 3: The Component of Genetic Algorithms. Spring 2009 Instructor: Dr. Masoud Yaghini Genetic Algorithms Part 3: The Component of Genetic Algorithms Spring 2009 Instructor: Dr. Masoud Yaghini Outline Genetic Algorithms: Part 3 Representation of Individuals Mutation Recombination Population

More information

Timetabling with Genetic Algorithms

Timetabling with Genetic Algorithms Timetabling with Genetic Algorithms NADIA NEDJAH AND LUIZA DE MACEDO MOURELLE Department of de Systems Engineering and Computation, State University of Rio de Janeiro São Francisco Xavier, 524, 5 O. Andar,

More information

Introduction Evolutionary Algorithm Implementation

Introduction Evolutionary Algorithm Implementation Introduction Traditional optimization methods fail when there are complex, nonlinear relationships between the parameters and the value to be optimized, the goal function has many local extrema, and resources

More information

IMPLEMENTATION OF AN OPTIMIZATION TECHNIQUE: GENETIC ALGORITHM

IMPLEMENTATION OF AN OPTIMIZATION TECHNIQUE: GENETIC ALGORITHM IMPLEMENTATION OF AN OPTIMIZATION TECHNIQUE: GENETIC ALGORITHM TWINKLE GUPTA* Department of Computer Science, Hindu Kanya MahaVidyalya, Jind, India Abstract We are encountered with various optimization

More information

Comparative Study of Different Selection Techniques in Genetic Algorithm

Comparative Study of Different Selection Techniques in Genetic Algorithm Journal Homepage: Comparative Study of Different Selection Techniques in Genetic Algorithm Saneh Lata Yadav 1 Asha Sohal 2 Keywords: Genetic Algorithms Selection Techniques Roulette Wheel Selection Tournament

More information

Selecting an Optimal Compound of a University Research Team by Using Genetic Algorithms

Selecting an Optimal Compound of a University Research Team by Using Genetic Algorithms Selecting an Optimal Compound of a University Research Team by Using Genetic Algorithms Florentina Alina Chircu 1 (1) Department of Informatics, Petroleum Gas University of Ploiesti, Romania E-mail: chircu_florentina@yahoo.com

More information

Design and Implementation of Genetic Algorithm as a Stimulus Generator for Memory Verification

Design and Implementation of Genetic Algorithm as a Stimulus Generator for Memory Verification International Journal of Emerging Engineering Research and Technology Volume 3, Issue 9, September, 2015, PP 18-24 ISSN 2349-4395 (Print) & ISSN 2349-4409 (Online) Design and Implementation of Genetic

More information

Generational and steady state genetic algorithms for generator maintenance scheduling problems

Generational and steady state genetic algorithms for generator maintenance scheduling problems Generational and steady state genetic algorithms for generator maintenance scheduling problems Item Type Conference paper Authors Dahal, Keshav P.; McDonald, J.R. Citation Dahal, K. P. and McDonald, J.

More information

EFFECT OF CROSS OVER OPERATOR IN GENETIC ALGORITHMS ON ANTICIPATORY SCHEDULING

EFFECT OF CROSS OVER OPERATOR IN GENETIC ALGORITHMS ON ANTICIPATORY SCHEDULING 24th International Symposium on on Automation & Robotics in in Construction (ISARC 2007) Construction Automation Group, I.I.T. Madras EFFECT OF CROSS OVER OPERATOR IN GENETIC ALGORITHMS ON ANTICIPATORY

More information

Intro. ANN & Fuzzy Systems. Lecture 36 GENETIC ALGORITHM (1)

Intro. ANN & Fuzzy Systems. Lecture 36 GENETIC ALGORITHM (1) Lecture 36 GENETIC ALGORITHM (1) Outline What is a Genetic Algorithm? An Example Components of a Genetic Algorithm Representation of gene Selection Criteria Reproduction Rules Cross-over Mutation Potential

More information

APPLICATION OF COMPUTER FOR ANALYZING WORLD CO2 EMISSION

APPLICATION OF COMPUTER FOR ANALYZING WORLD CO2 EMISSION APPLICATION OF COMPUTER FOR ANALYZING WORLD CO2 EMISSION M. Kavoosi 1, B.shafiee 2 1 Department of Computer Engineering, Izeh Branch, Islamic Azad University, Izeh, Iran 1 E-mail address: Hakavoosi@yahoo.com

More information

Evolutionary Algorithms

Evolutionary Algorithms Evolutionary Algorithms Fall 2008 1 Introduction Evolutionary algorithms (or EAs) are tools for solving complex problems. They were originally developed for engineering and chemistry problems. Much of

More information

Computational Intelligence Lecture 20:Intorcution to Genetic Algorithm

Computational Intelligence Lecture 20:Intorcution to Genetic Algorithm Computational Intelligence Lecture 20:Intorcution to Genetic Algorithm Farzaneh Abdollahi Department of Electrical Engineering Amirkabir University of Technology Fall 2012 Farzaneh Abdollahi Computational

More information

A HYBRID ALGORITHM TO MINIMIZE THE NUMBER OF TARDY JOBS IN SINGLE MACHINE SCHEDULING

A HYBRID ALGORITHM TO MINIMIZE THE NUMBER OF TARDY JOBS IN SINGLE MACHINE SCHEDULING DAAAM INTERNATIONAL SCIENTIFIC BOOK 2010 pp. 549-558 CHAPTER 48 A HYBRID ALGORITHM TO MINIMIZE THE NUMBER OF TARDY JOBS IN SINGLE MACHINE SCHEDULING BANCILA, D.; BUZATU, C. & FOTA, A. Abstract: Starting

More information

Genetic Algorithms. Moreno Marzolla Dip. di Informatica Scienza e Ingegneria (DISI) Università di Bologna.

Genetic Algorithms. Moreno Marzolla Dip. di Informatica Scienza e Ingegneria (DISI) Università di Bologna. Genetic Algorithms Moreno Marzolla Dip. di Informatica Scienza e Ingegneria (DISI) Università di Bologna http://www.moreno.marzolla.name/ Slides credit: Ozalp Babaoglu History Pioneered by John Henry Holland

More information

EMM4131 Popülasyon Temelli Algoritmalar (Population-based Algorithms) Introduction to Meta-heuristics and Evolutionary Algorithms

EMM4131 Popülasyon Temelli Algoritmalar (Population-based Algorithms) Introduction to Meta-heuristics and Evolutionary Algorithms 2017-2018 Güz Yarıyılı Balikesir Universitesi, Endustri Muhendisligi Bolumu EMM4131 Popülasyon Temelli Algoritmalar (Population-based Algorithms) 2 Introduction to Meta-heuristics and Evolutionary Algorithms

More information

Genetic Algorithms and Shape Grammars

Genetic Algorithms and Shape Grammars Genetic Algorithms and Shape Grammars Technical report Author Manuela Ruiz Montiel Date October 18, 2011 Version 1.1 1 Contents 1. Introduction... 3 2. Genetic algorithm... 4 3. Genotype... 7 4. Experiments...

More information

Evolutionary Algorithms - Introduction and representation Jim Tørresen

Evolutionary Algorithms - Introduction and representation Jim Tørresen INF3490 - Biologically inspired computing Lecture 2: Eiben and Smith, chapter 1-4 Evolutionary Algorithms - Introduction and representation Jim Tørresen Evolution Biological evolution: Lifeforms adapt

More information

What is an Evolutionary Algorithm? Presented by: Faramarz Safi (Ph.D.) Faculty of Computer Engineering Islamic Azad University, Najafabad Branch

What is an Evolutionary Algorithm? Presented by: Faramarz Safi (Ph.D.) Faculty of Computer Engineering Islamic Azad University, Najafabad Branch Presented by: Faramarz Safi (Ph.D.) Faculty of Computer Engineering Islamic Azad University, Najafabad Branch Chapter 2 Contents Recap of Evolutionary Metaphor Basic scheme of an EA Basic Components: Representation

More information

Genetic Algorithm. Presented by Shi Yong Feb. 1, 2007 Music McGill University

Genetic Algorithm. Presented by Shi Yong Feb. 1, 2007 Music McGill University Genetic Algorithm Presented by Shi Yong Feb. 1, 2007 Music Tech @ McGill University Outline Background: Biological Genetics & GA Two Examples Some Applications Online Demos* (if the time allows) Introduction

More information

A Genetic Algorithm Applying Single Point Crossover and Uniform Mutation to Minimize Uncertainty in Production Cost

A Genetic Algorithm Applying Single Point Crossover and Uniform Mutation to Minimize Uncertainty in Production Cost World Applied Sciences Journal 23 (8): 1013-1017, 2013 ISSN 1818-4952 IDOSI Publications, 2013 DOI: 10.5829/idosi.wasj.2013.23.08.956 A Genetic Algorithm Applying Single Point Crossover and Uniform Mutation

More information

Population and Community Dynamics. The Hardy-Weinberg Principle

Population and Community Dynamics. The Hardy-Weinberg Principle Population and Community Dynamics The Hardy-Weinberg Principle Key Terms Population: same species, same place, same time Gene: unit of heredity. Controls the expression of a trait. Can be passed to offspring.

More information

Feature Selection for Predictive Modelling - a Needle in a Haystack Problem

Feature Selection for Predictive Modelling - a Needle in a Haystack Problem Paper AB07 Feature Selection for Predictive Modelling - a Needle in a Haystack Problem Munshi Imran Hossain, Cytel Statistical Software & Services Pvt. Ltd., Pune, India Sudipta Basu, Cytel Statistical

More information

DEVELOPMENT OF MULTI-OBJECTIVE SIMULATION-BASED GENETIC ALGORITHM FOR SUPPLY CHAIN CYCLIC PLANNING AND OPTIMISATION

DEVELOPMENT OF MULTI-OBJECTIVE SIMULATION-BASED GENETIC ALGORITHM FOR SUPPLY CHAIN CYCLIC PLANNING AND OPTIMISATION From the SelectedWorks of Liana Napalkova May, 2008 DEVELOPMENT OF MULTI-OBJECTIVE SIMULATION-BASED GENETIC ALGORITHM FOR SUPPLY CHAIN CYCLIC PLANNING AND OPTIMISATION Galina Merkuryeva Liana Napalkova

More information

Immune Programming. Payman Samadi. Supervisor: Dr. Majid Ahmadi. March Department of Electrical & Computer Engineering University of Windsor

Immune Programming. Payman Samadi. Supervisor: Dr. Majid Ahmadi. March Department of Electrical & Computer Engineering University of Windsor Immune Programming Payman Samadi Supervisor: Dr. Majid Ahmadi March 2006 Department of Electrical & Computer Engineering University of Windsor OUTLINE Introduction Biological Immune System Artificial Immune

More information

Recessive Trait Cross Over Approach of GAs Population Inheritance for Evolutionary Optimisation

Recessive Trait Cross Over Approach of GAs Population Inheritance for Evolutionary Optimisation Recessive Trait Cross Over Approach of GAs Population Inheritance for Evolutionary Optimisation Amr Madkour, Alamgir Hossain, and Keshav Dahal Modeling Optimization Scheduling And Intelligent Control (MOSAIC)

More information

Genetic'Algorithms'::' ::'Algoritmi'Genetici'1

Genetic'Algorithms'::' ::'Algoritmi'Genetici'1 Genetic'Algorithms'::' ::'Algoritmi'Genetici'1 Prof. Mario Pavone Department of Mathematics and Computer Sciecne University of Catania v.le A. Doria 6 95125 Catania, Italy mpavone@dmi.unict.it http://www.dmi.unict.it/mpavone/

More information

Introduction To Genetic Algorithms

Introduction To Genetic Algorithms 1 Introduction To Genetic Algorithms Dr. Rajib Kumar Bhattacharjya Department of Civil Engineering IIT Guwahati Email: rkbc@iitg.ernet.in References 2 D. E. Goldberg, Genetic Algorithm In Search, Optimization

More information

Evolutionary Algorithms - Population management and popular algorithms Kai Olav Ellefsen

Evolutionary Algorithms - Population management and popular algorithms Kai Olav Ellefsen INF3490 - Biologically inspired computing Lecture 3: Eiben and Smith, chapter 5-6 Evolutionary Algorithms - Population management and popular algorithms Kai Olav Ellefsen Repetition: General scheme of

More information

Evolving Control for Micro Aerial Vehicles (MAVs)

Evolving Control for Micro Aerial Vehicles (MAVs) Evolving Control for Micro Aerial Vehicles (MAVs) M. Rhodes, G. Tener, and A. S. Wu Abstract This paper further explores the use of a genetic algorithm for the purposes of evolving the control systems

More information

A Genetic Algorithm on Inventory Routing Problem

A Genetic Algorithm on Inventory Routing Problem A Genetic Algorithm on Inventory Routing Problem Artvin Çoruh University e-mail: nevin.aydin@gmail.com Volume 3 No 3 (2014) ISSN 2158-8708 (online) DOI 10.5195/emaj.2014.31 http://emaj.pitt.edu Abstract

More information

Journal of Global Research in Computer Science PREMATURE CONVERGENCE AND GENETIC ALGORITHM UNDER OPERATING SYSTEM PROCESS SCHEDULING PROBLEM

Journal of Global Research in Computer Science PREMATURE CONVERGENCE AND GENETIC ALGORITHM UNDER OPERATING SYSTEM PROCESS SCHEDULING PROBLEM Volume, No. 5, December 00 Journal of Global Research in Computer Science RESEARCH PAPER Available Online at www.jgrcs.info PREMATURE CONVERGENCE AND GENETIC ALGORITHM UNDER OPERATING SYSTEM PROCESS SCHEDULING

More information

initial set of random solutions called population satisfying boundary and/or system

initial set of random solutions called population satisfying boundary and/or system CHAPTER 4 Genetic Algorithm GAs are stochastic search algorithms based on the mechanism of natural selection and natural genetics. GA, differing from conventional search techniques, start with an initial

More information

Selecting Genetic Algorithm Operators for CEM Problems

Selecting Genetic Algorithm Operators for CEM Problems Selecting Genetic Algorithm Operators for CEM Problems Randy L. Haupt Communications Science & Technology The Pennsylvania State University Applied Research Laboratory P. O. Box 30 State College, PA 16804-0030

More information

GENETIC ALGORITHM BASED APPROACH FOR THE SELECTION OF PROJECTS IN PUBLIC R&D INSTITUTIONS

GENETIC ALGORITHM BASED APPROACH FOR THE SELECTION OF PROJECTS IN PUBLIC R&D INSTITUTIONS GENETIC ALGORITHM BASED APPROACH FOR THE SELECTION OF PROJECTS IN PUBLIC R&D INSTITUTIONS SANJAY S, PRADEEP S, MANIKANTA V, KUMARA S.S, HARSHA P Department of Human Resource Development CSIR-Central Food

More information

Logistics. Final exam date. Project Presentation. Plan for this week. Evolutionary Algorithms. Crossover and Mutation

Logistics. Final exam date. Project Presentation. Plan for this week. Evolutionary Algorithms. Crossover and Mutation Logistics Crossover and Mutation Assignments Checkpoint -- Problem Graded -- comments on mycourses Checkpoint --Framework Mostly all graded -- comments on mycourses Checkpoint -- Genotype / Phenotype Due

More information

Application of Genetic Algorithm in Numerical Solution of Twodimensional

Application of Genetic Algorithm in Numerical Solution of Twodimensional European International Journal of Science and Technology ISSN: 2304-9693 www.eijst.org.uk Application of Genetic Algorithm in Numerical Solution of Twodimensional Laplace's Equation Mehran Qate 1, Majid

More information

[Sharma* et al., 5(6): June, 2016] ISSN: IC Value: 3.00 Impact Factor: 4.116

[Sharma* et al., 5(6): June, 2016] ISSN: IC Value: 3.00 Impact Factor: 4.116 IJESRT INTERNATIONAL JOURNAL OF ENGINEERING SCIENCES & RESEARCH TECHNOLOGY AN APPROACH TO GENERATE TEST CASES AUTOMATICALLY USING GENETIC ALGORITHM Deepika Sharma*, Dr. Sanjay Tyagi * Research Scholar,

More information

Fixed vs. Self-Adaptive Crossover-First Differential Evolution

Fixed vs. Self-Adaptive Crossover-First Differential Evolution Applied Mathematical Sciences, Vol. 10, 2016, no. 32, 1603-1610 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/10.12988/ams.2016.6377 Fixed vs. Self-Adaptive Crossover-First Differential Evolution Jason

More information

Minimizing Makespan for Machine Scheduling and Worker Assignment Problem in Identical Parallel Machine Models Using GA

Minimizing Makespan for Machine Scheduling and Worker Assignment Problem in Identical Parallel Machine Models Using GA , June 30 - July 2, 2010, London, U.K. Minimizing Makespan for Machine Scheduling and Worker Assignment Problem in Identical Parallel Machine Models Using GA Imran Ali Chaudhry, Sultan Mahmood and Riaz

More information

Rule Minimization in Predicting the Preterm Birth Classification using Competitive Co Evolution

Rule Minimization in Predicting the Preterm Birth Classification using Competitive Co Evolution Indian Journal of Science and Technology, Vol 9(10), DOI: 10.17485/ijst/2016/v9i10/88902, March 2016 ISSN (Print) : 0974-6846 ISSN (Online) : 0974-5645 Rule Minimization in Predicting the Preterm Birth

More information

ABSTRACT COMPUTER EVOLUTION OF GENE CIRCUITS FOR CELL- EMBEDDED COMPUTATION, BIOTECHNOLOGY AND AS A MODEL FOR EVOLUTIONARY COMPUTATION

ABSTRACT COMPUTER EVOLUTION OF GENE CIRCUITS FOR CELL- EMBEDDED COMPUTATION, BIOTECHNOLOGY AND AS A MODEL FOR EVOLUTIONARY COMPUTATION ABSTRACT COMPUTER EVOLUTION OF GENE CIRCUITS FOR CELL- EMBEDDED COMPUTATION, BIOTECHNOLOGY AND AS A MODEL FOR EVOLUTIONARY COMPUTATION by Tommaso F. Bersano-Begey Chair: John H. Holland This dissertation

More information

The Theory of Evolution

The Theory of Evolution The Theory of Evolution Mechanisms of Evolution Notes Pt. 4 Population Genetics & Evolution IMPORTANT TO REMEMBER: Populations, not individuals, evolve. Population = a group of individuals of the same

More information

Lesson Overview. What would happen when genetics answered questions about how heredity works?

Lesson Overview. What would happen when genetics answered questions about how heredity works? 17.1 Darwin developed his theory of evolution without knowing how heritable traits passed from one generation to the next or where heritable variation came from. What would happen when genetics answered

More information

Simulation-Based Analysis and Optimisation of Planning Policies over the Product Life Cycle within the Entire Supply Chain

Simulation-Based Analysis and Optimisation of Planning Policies over the Product Life Cycle within the Entire Supply Chain From the SelectedWorks of Liana Napalkova June, 2009 Simulation-Based Analysis and Optimisation of Planning Policies over the Product Life Cycle within the Entire Supply Chain Galina Merkuryeva Liana Napalkova

More information

Genetic Algorithms and Genetic Programming Lecture 13

Genetic Algorithms and Genetic Programming Lecture 13 Genetic Algorithms and Genetic Programming Lecture 13 Gillian Hayes 10th November 2008 Pragmatics of GA Design 1 Selection methods Crossover Mutation Population model and elitism Spatial separation Maintaining

More information

An Analytical Upper Bound on the Minimum Number of. Recombinations in the History of SNP Sequences in Populations

An Analytical Upper Bound on the Minimum Number of. Recombinations in the History of SNP Sequences in Populations An Analytical Upper Bound on the Minimum Number of Recombinations in the History of SNP Sequences in Populations Yufeng Wu Department of Computer Science and Engineering University of Connecticut Storrs,

More information

Metaheuristics and Cognitive Models for Autonomous Robot Navigation

Metaheuristics and Cognitive Models for Autonomous Robot Navigation Metaheuristics and Cognitive Models for Autonomous Robot Navigation Raj Korpan Department of Computer Science The Graduate Center, CUNY Second Exam Presentation April 25, 2017 1 / 31 Autonomous robot navigation

More information

Multi-Plant Multi-Product Aggregate Production Planning Using Genetic Algorithm

Multi-Plant Multi-Product Aggregate Production Planning Using Genetic Algorithm Multi-Plant Multi-Product Aggregate Production Planning Using Genetic Algorithm Fahron Dakka, Muhammad Aswin, Bambang Siswojo Abstract Aggregate production planning (APP) is a mid-term planning tool used

More information

Human SNP haplotypes. Statistics 246, Spring 2002 Week 15, Lecture 1

Human SNP haplotypes. Statistics 246, Spring 2002 Week 15, Lecture 1 Human SNP haplotypes Statistics 246, Spring 2002 Week 15, Lecture 1 Human single nucleotide polymorphisms The majority of human sequence variation is due to substitutions that have occurred once in the

More information

Pusan National University, Busandaehak-ro, Geumjeong-gu, Busan, , Korea

Pusan National University, Busandaehak-ro, Geumjeong-gu, Busan, , Korea A GENETIC ALGORITHM-BASED HEURISTIC FOR NETWORK DESIGN OF SERVICE CENTERS WITH PICK-UP AND DELIVERY VISITS OF MANDATED VEHICLES IN EXPRESS DELIVERY SERVICE INDUSTRY by Friska Natalia Ferdinand 1, Hae Kyung

More information

Bio-inspired Active Vision. Martin Peniak, Ron Babich, John Tran and Davide Marocco

Bio-inspired Active Vision. Martin Peniak, Ron Babich, John Tran and Davide Marocco Bio-inspired Active Vision Martin Peniak, Ron Babich, John Tran and Davide Marocco GPU Computing Lab Traditional Computer Vision 3 Traditional Computer Vision Teaching a computer to classify objects has

More information

Genetic Algorithms and Genetic Programming Lecture 14

Genetic Algorithms and Genetic Programming Lecture 14 Genetic Algorithms and Genetic Programming Lecture 14 Gillian Hayes 13th November 2007 GAs: Representation, Fitness, Searching the Space Representation binary, real, plans, trees Operators for non-binary

More information

Chapter 1: GENETIC ALGORITHMS AN INTRODUCTION

Chapter 1: GENETIC ALGORITHMS AN INTRODUCTION Chapter 1: GENETIC ALGORITHMS AN INTRODUCTION In recent years, Genetic Algorithms are gaining wide attention by the research community. Genetic algorithm (GA) is rapidly growing area of Artificial Intelligence.

More information

UNIT 4: EVOLUTION Chapter 11: The Evolution of Populations

UNIT 4: EVOLUTION Chapter 11: The Evolution of Populations CORNELL NOTES Directions: You must create a minimum of 5 questions in this column per page (average). Use these to study your notes and prepare for tests and quizzes. Notes will be stamped after each assigned

More information

Genetic Algorithms in Matrix Representation and Its Application in Synthetic Data

Genetic Algorithms in Matrix Representation and Its Application in Synthetic Data Genetic Algorithms in Matrix Representation and Its Application in Synthetic Data Yingrui Chen *, Mark Elliot ** and Joe Sakshaug *** * ** University of Manchester, yingrui.chen@manchester.ac.uk University

More information

Developing Safe Autonomous Vehicles for Innovative Transportation Experiences

Developing Safe Autonomous Vehicles for Innovative Transportation Experiences Developing Safe Autonomous Vehicles for Innovative Transportation Experiences CIMdata Commentary Key takeaways: Siemens PLM Software (Siemens) has a deep understanding of the verification and validation

More information

Cover Page. The handle holds various files of this Leiden University dissertation.

Cover Page. The handle   holds various files of this Leiden University dissertation. Cover Page The handle http://hdl.handle.net/1887/22550 holds various files of this Leiden University dissertation. Author: Yan, Kuan Title: Image analysis and platform development for automated phenotyping

More information

27th Australasian Transport Research Forum, Adelaide, 29 September 1 October 2004

27th Australasian Transport Research Forum, Adelaide, 29 September 1 October 2004 27th Australasian Transport Research Forum, Adelaide, 29 September 1 October 2004 Paper title: Author(s) name(s): Organisation(s): Location modelling: grouping genetic algorithm using a Geographic Information

More information

CapSel GA Genetic Algorithms.

CapSel GA Genetic Algorithms. CapSel GA - 01 Genetic Algorithms keppens@rijnh.nl Typical usage: optimization problems both minimization and maximization of complicated functions completely standard problem with non-standard solution

More information