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

Save this PDF as:

Size: px
Start display at page:

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

## Transcription

1 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 J. S. Sadiku Department of Computer Science University of Ilorin P.M.B. 1515, Ilorin, NIGERIA ABSTRACT Selection is one of the key operations of genetic algorithm (GA). This paper presents a comparative analysis of GA performance in solving multi-objective network design problem (MONDP) using different parent selection methods. Three problem instances were tested and results show that on the average tournament selection is the most effective and most efficient for 10-node network design problem, while Ranking & Scaling is the least effective and least efficient. For 21-node and 36-node network problems, Roulette Wheel is the least effective but most efficient while Ranking & Scaling equals and outperformed tournament in effectiveness and efficiency respectively. eral Terms Evolutionary Algorithms, Combinatorial Optimization, Artificial Intelligence. Keywords etic Algorithm, Selection Methods, Network Design Problem, Performance. 1. INTRODUCTION The selection of individuals for the production of the next generation is a critical process in GA. The individuals that are chosen for reproduction and the number of children each selected individual produces are determined by the selection mechanism. The underlying principle of selection strategy is the fitter an individual is the higher is its chance of being parent. A critical parameter to be determined in GA is the selection pressure which is the process of selecting the fittest individuals for reproduction. If it is set too low, then the rate of convergence towards the optimum solution will be too slow. If the selection pressure is set too high, the algorithm is likely to be stuck in a local optimum due to the lack of diversity in the population. Therefore, the selection methods tune the selection pressure, which in turn determines the convergence rate of the algorithm. The selection mechanism should be chosen such that convergence to the global optimum solution is guaranteed. In addition the selection mechanism should encompass knowledge of the existing data. Different selection schemes will undoubtedly influence the performance of GA differently. This study aims at exploring the performance of GA when using different selection strategies particularly in solving Multi-Objective Network Design Problem (MONDP). MONDP is a typical example of NP-hard optimization problem The remainder of this paper is organized as follows: Section 2 presents a brief review of literature on selection method. Selection 3 presents a brief description of MONDP while section 4 gives an overview of the genetic algorithm for MONDP. Section 5 describes in detail the selection methods that are used in the experiments. Section 6 tests the performance of GA and discusses the experimental results. The Paper is concluded in section LITERATURE REVIEW ON SELECTION METHOD Several researchers have studied the performance of GA using differing selection schemes. However, virtually no of these researchers tested the algorithm on network design problem. The performance of GA is usually evaluated in terms of convergence rate and the number of generations to reach optimal solution [1]. Goldberg and Deb [2] were the first to study the performance of different selection schemes. They investigated the performance of proportional ranking, tournament and itor (steady state) selection schemes using solutions to differential equations as basis. Their investigation aimed at understanding the expected fitness ratio and convergence time. It was found that ranking and tournament selections outperformed proportional selection in terms of maintaining steady pressure towards convergence. They also showed that linear ranking and stochastic binary tournament selections have similar expectations, but recommended binary tournament selection due to its better time complexity. Goh et al. [3] focused on the selection process of GA and study common problems and solution methods of such selection schemes. They further proposed a new selection scheme called sexual selection and compared its performance with commonly used selection methods in solving some scheduling problems. It is claimed that the proposed scheme performed either on-par or better than roulette wheel selection on the average without the use of fitness scaling. In the more difficult test cases when no fitness scaling is used, the new scheme also performed better on the average when compared to tournament selection. Julstrom [4] studied the computing time efficiency of two types of rank-based selection probabilities namely linear ranking and exponential ranking probabilities in comparison with tournament selection. He noted that tournament selection is superior to rank-based selection because repeated tournament selection is faster than sorting the population to assign rank-based probabilities. Mashohor et al [5] analyzed the performance of PCB inspection system with the use of three GA selection methods namely tournament, deterministic and roulette wheel selections. Their findings show that deterministic method 5

3 Each link is bidirectional i.e. a path can be traversed in either direction There is no redundant link in the network 4. GENETIC ALGORITHM FOR MONDP 1 Initialization: randomly generate population of N chromosomes 2 Fitness: calculate the fitness of all chromosomes 3 Create a new population: a. Selection: select 2 chromosomes from the population b. Crossover: produce 2 offsprings from the 2 selected chromosomes c. Mutation: perform mutation on each offspring. 4 Replace: replace the current population with the new population 5 Evaluation: evaluate the objective function 6 Termination: Test if the termination condition is satisfied. If so stop. If not, go to step SELECTION METHODS FOR REPRODUCTION 5.1 Roulette Wheel selection In the Roulette wheel selection method [9], the first step is to calculate the cumulative fitness of the whole population through the sum of the fitness of all individuals. After that, the probability of selection is calculated for each individual as being pseli = fi/pfi. Then, an array is built containing cumulative probabilities of the individuals. So, n random numbers are generated in the range 0 to Pfi and for each random number an array element which can have higher value is searched for. Therefore, individuals are selected according to their probabilities of selection. 5.2 Tournament Selection Tournament selection is probably the most popular selection method in genetic algorithm due to its efficiency and simple implementation [2]. In tournament selection, n individuals are selected randomly from the larger population, and the selected individuals compete against each other. The individual with the highest fitness wins and will be included as one of the next generation population. The number of individuals competing in each tournament is referred to as tournament size, commonly set to 2 (also called binary tournament). Tournament selection also gives a chance to all individuals to be selected and thus it preserves diversity, although keeping diversity may degrade the convergence speed. The tournament selection has several advantages which include efficient time complexity, especially if implemented in parallel, low susceptibility to takeover by dominant individuals, and no requirement for fitness scaling or sorting [2, 10]. In tournament selection, larger values of tournament size lead to higher expected loss of diversity [10, 11]. The larger tournament size means that a smaller portion of the population actually contributes to genetic diversity, making the search increasingly greedy in nature. There might be two factors that lead to the loss of diversity in regular tournament selection; some individuals might not get sampled to participate in a tournament at all while other individuals might not be selected for the intermediate population because they lost a tournament 5.3 Ranking and Scaling Selection The scaling method maps raw objective function values to positive real values, and the survival probability for each chromosome is determined according to these values. Fitness scaling has a twofold intention: to maintain a reasonable differential between relative fitness ratings of chromosomes; and to prevent too-rapid takeover by some dominant chromosomes to meet the requirement to limit competition early but to stimulate it later. 6. COMPUTATIONAL EXPERIMENTS AND RESULTS Table 1:Results for 10-node network problem

4 Table 2: Results for 21-node network problem Table 3: Results for 36-node network problem CONCLUSION In this paper three types of selection strategy in the GA procedure to solve network topology design problem are described. Their relative performances in terms of solution quality and computation time are compared. From the results of experiment on three randomly generated networks. On the average, tournament selection returns the best solution both in quality and computation time while the solution returned by Ranking & Scaling is the worst both in quality and computation time for 10-node network. For 21-node and 36- node networks, Ranking & Scaling performed as well as tournament selection in solution quality but outperformed tournament in computation time. Roulette wheel has the worst solution quality but the best computation time 8. ACKNOWLEDGEMENT The authors acknowledge Hammed Sanusi who has offered programming assistance. 9. REFERENCES [1] Razali, N. M., Geraghty, J etic Algorithm Performance with Different Selection Strategies in Solving TSP. In Proceedings of the World Congress on Engineering, vol. II, London, UK. [2] Goldberg, D. E. and Deb Kalyanmoy A Comparative Analysis of Selection Schemes Used in etic Algorithms. In: G.J.E. Rawlins (Ed), Foundations of etic Algorithms, Morgan Kaufmann, Los Altos, [3] Goh, K. S., Lim, A., Rodrigues, B Sexual Selection for etic Algorithms. Artificial Intelligence Review 19: , Kluwer Academic Publishers. [4] Julstrom, B. A It s All the Same to Me: Revisiting Rank-Based Probabilities and Tournaments, Department of Computer Science, St. Cloud State University. [5] Mashohor, S.Evans, J. R., Arslan, T Elitist Selection Schemes for etic Algorithm based Printed Circuit Board Inspection System, Department of Electronics and Electrical Engineering, University of Edinburgh, [6] Zhong, J., Hu, X., Gu, M., Zhang, J Comparison of Performance between Different Selection Strategies on Simple etic Algorithms. In Proceeding of the International Conference on Computational Intelligence for Modelling, Control and automation, and International Conference of Intelligent Agents, Web Technologies and Internet Commerce. [7] Jadaan, O.A., Rajamani, L., Rao, C. R Improved Selection Operator for GA. Journal of Theoretical and Applied Information Technology. 8

5 [8] Banerjee, N., Kumar, R Multiobjective Network Design for Realistic Traffic Models. In Proc. etic and Evolutionary Computations Conference (GECCO- 07), [9] Holland, J. H Adaptation in Natural and Artificial Systems, 2nd Ed, MIT Press. [10] Blickle, T, Thiele, L. A Comparison of Selection Schemes used in etic Algorithms. TIK-Report, Zurich.. [11] Whitley, D The genitor algorithm and selection pressure: Why rank-based allocation of reproductive trials is the best. In Proceeding of the 3rd International Conference on etic Algorithms. [12] Sivaraj, R.,Ravichandran, T A Review of Selection Methods in etic Algorithm. International Journal of Engineering Science and Technology (IJEST). Vol.3, no. 5,

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

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

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

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

### Multi-objective Optimization

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

### Genetic Algorithms. Chapter 3

Chapter 3 1 Contents of this Chapter 2 Introductory example. Representation of individuals: Binary, integer, real-valued, and permutation. Mutation operator. Mutation for binary, integer, real-valued,

### Meta- Heuristic based Optimization Algorithms: A Comparative Study of Genetic Algorithm and Particle Swarm Optimization

2017 2 nd International Electrical Engineering Conference (IEEC 2017) May. 19 th -20 th, 2017 at IEP Centre, Karachi, Pakistan Meta- Heuristic based Optimization Algorithms: A Comparative Study of Genetic

### ARTIFICIAL INTELLIGENCE (CSCU9YE ) LECTURE 5: EVOLUTIONARY ALGORITHMS

ARTIFICIAL INTELLIGENCE (CSCU9YE ) LECTURE 5: EVOLUTIONARY ALGORITHMS Gabriela Ochoa http://www.cs.stir.ac.uk/~goc/ OUTLINE Optimisation problems Optimisation & search Two Examples The knapsack problem

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

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

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

### Job Shop Scheduling Problem (JSSP) Genetic Algorithms Critical Block and DG distance Neighbourhood Search

A JOB-SHOP SCHEDULING PROBLEM (JSSP) USING GENETIC ALGORITHM (GA) Mahanim Omar, Adam Baharum, Yahya Abu Hasan School of Mathematical Sciences, Universiti Sains Malaysia 11800 Penang, Malaysia Tel: (+)

Advanced Search Genetic algorithm Yingyu Liang yliang@cs.wisc.edu Computer Sciences Department University of Wisconsin, Madison [Based on slides from Jerry Zhu, Andrew Moore http://www.cs.cmu.edu/~awm/tutorials

### NCGA : Neighborhood Cultivation Genetic Algorithm for Multi-Objective Optimization Problems

: Neighborhood Cultivation Genetic Algorithm for Multi-Objective Optimization Problems Shinya Watanabe Graduate School of Engineering, Doshisha University 1-3 Tatara Miyakodani,Kyo-tanabe, Kyoto, 10-031,

### Lamarckian Repair and Darwinian Repair in EMO Algorithms for Multiobjective 0/1 Knapsack Problems

Repair and Repair in EMO Algorithms for Multiobjective 0/ Knapsack Problems Shiori Kaige, Kaname Narukawa, and Hisao Ishibuchi Department of Industrial Engineering, Osaka Prefecture University, - Gakuen-cho,

### Adaptive Elitist-Population Based Genetic Algorithm for Multimodal Function Optimization

Adaptive Elitist-Population Based Genetic Algorithm for Multimodal Function ptimization Kwong-Sak Leung and Yong Liang Department of Computer Science & Engineering, The Chinese University of Hong Kong,

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

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

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

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

### Network Routing Protocol using Genetic Algorithms

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

### Adaptive Crossover in Genetic Algorithms Using Statistics Mechanism

in Artificial Life VIII, Standish, Abbass, Bedau (eds)(mit Press) 2002. pp 182 185 1 Adaptive Crossover in Genetic Algorithms Using Statistics Mechanism Shengxiang Yang Department of Mathematics and Computer

### Multi-objective Optimization

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

### The Genetic Algorithm for finding the maxima of single-variable functions

Research Inventy: International Journal Of Engineering And Science Vol.4, Issue 3(March 2014), PP 46-54 Issn (e): 2278-4721, Issn (p):2319-6483, www.researchinventy.com The Genetic Algorithm for finding

### CHAPTER 6 REAL-VALUED GENETIC ALGORITHMS

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

### Grid Scheduling Strategy using GA (GSSGA)

F Kurus Malai Selvi et al,int.j.computer Technology & Applications,Vol 3 (5), 8-86 ISSN:2229-693 Grid Scheduling Strategy using GA () Dr.D.I.George Amalarethinam Director-MCA & Associate Professor of Computer

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

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

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

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

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

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

### The Study of Genetic Algorithm-based Task Scheduling for Cloud Computing

The Study of Genetic Algorithm-based Task Scheduling for Cloud Computing Sung Ho Jang, Tae Young Kim, Jae Kwon Kim and Jong Sik Lee School of Information Engineering Inha University #253, YongHyun-Dong,

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

### A HYBRID APPROACH IN GENETIC ALGORITHM: COEVOLUTION OF THREE VECTOR SOLUTION ENCODING. A CASE-STUDY

A HYBRID APPROACH IN GENETIC ALGORITHM: COEVOLUTION OF THREE VECTOR SOLUTION ENCODING. A CASE-STUDY Dmitriy BORODIN, Victor GORELIK, Wim DE BRUYN and Bert VAN VRECKEM University College Ghent, Ghent, Belgium

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

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

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

### CLOSED LOOP SYSTEM IDENTIFICATION USING GENETIC ALGORITHM

CLOSED LOOP SYSTEM IDENTIFICATION USING GENETIC ALGORITHM Lucchesi Alejandro (a), Campomar Guillermo (b), Zanini Aníbal (c) (a,b) Facultad Regional San Nicolás Universidad Tecnológica Nacional (FRSN-UTN),

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

### Evolutionary Computation Part 2

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

### Optimization of Function by using a New MATLAB based Genetic Algorithm Procedure

Optimization of Function by using a New MATLAB based Genetic Algorithm Procedure G.N Purohit Banasthali University Rajasthan Arun Mohan Sherry Institute of Management Technology Ghaziabad, (U.P) Manish

### AN EVOLUTIONARY APPROACH TO DISTANCE VECTOR ROUTING

International Journal of Latest Research in Science and Technology Volume 3, Issue 3: Page No. 201-205, May-June 2014 http://www.mnkjournals.com/ijlrst.htm ISSN (Online):2278-5299 AN EVOLUTIONARY APPROACH

### GT HEURISTIC FOR SOLVING MULTI OBJECTIVE JOB SHOP SCHEDULING PROBLEMS

GT HEURISTIC FOR SOLVING MULTI OBJECTIVE JOB SHOP SCHEDULING PROBLEMS M. Chandrasekaran 1, D. Lakshmipathy 1 and P. Sriramya 2 1 Department of Mechanical Engineering, Vels University, Chennai, India 2

### The Simple Genetic Algorithm Performance: A Comparative Study on the Operators Combination

INFOCOMP 20 : The First International Conference on Advanced Communications and Computation The Simple Genetic Algorithm Performance: A Comparative Study on the Operators Combination Delmar Broglio Carvalho,

### Using Genetic Algorithm with Triple Crossover to Solve Travelling Salesman Problem

Proc. 1 st International Conference on Machine Learning and Data Engineering (icmlde2017) 20-22 Nov 2017, Sydney, Australia ISBN: 978-0-6480147-3-7 Using Genetic Algorithm with Triple Crossover to Solve

### Solving the Travelling Salesman Problem in Parallel by Genetic Algorithm on Multicomputer Cluster

Solving the Travelling Salesman Problem in Parallel by Genetic Algorithm on Multicomputer Cluster Plamenka Borovska Abstract: The paper investigates the efficiency of the parallel computation of the travelling

### Genetic Algorithms For Vertex. Splitting in DAGs 1

Genetic Algorithms For Vertex Splitting in DAGs 1 Matthias Mayer 2 and Fikret Ercal 3 CSC-93-02 Fri Jan 29 1993 Department of Computer Science University of Missouri-Rolla Rolla, MO 65401, U.S.A. (314)

### DERIVATIVE-FREE OPTIMIZATION

DERIVATIVE-FREE OPTIMIZATION Main bibliography J.-S. Jang, C.-T. Sun and E. Mizutani. Neuro-Fuzzy and Soft Computing: A Computational Approach to Learning and Machine Intelligence. Prentice Hall, New Jersey,

### Heuristic Optimisation

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

### A Genetic Algorithm for Multiprocessor Task Scheduling

A Genetic Algorithm for Multiprocessor Task Scheduling Tashniba Kaiser, Olawale Jegede, Ken Ferens, Douglas Buchanan Dept. of Electrical and Computer Engineering, University of Manitoba, Winnipeg, MB,

### [Premalatha, 4(5): May, 2015] ISSN: (I2OR), Publication Impact Factor: (ISRA), Journal Impact Factor: 2.114

IJESRT INTERNATIONAL JOURNAL OF ENGINEERING SCIENCES & RESEARCH TECHNOLOGY GENETIC ALGORITHM FOR OPTIMIZATION PROBLEMS C. Premalatha Assistant Professor, Department of Information Technology Sri Ramakrishna

### A Real Coded Genetic Algorithm for Data Partitioning and Scheduling in Networks with Arbitrary Processor Release Time

A Real Coded Genetic Algorithm for Data Partitioning and Scheduling in Networks with Arbitrary Processor Release Time S. Suresh 1, V. Mani 1, S. N. Omkar 1, and H. J. Kim 2 1 Department of Aerospace Engineering,

### Genetic Algorithms for Vision and Pattern Recognition

Genetic Algorithms for Vision and Pattern Recognition Faiz Ul Wahab 11/8/2014 1 Objective To solve for optimization of computer vision problems using genetic algorithms 11/8/2014 2 Timeline Problem: Computer

### Topological Machining Fixture Layout Synthesis Using Genetic Algorithms

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

### CHAPTER 2 CONVENTIONAL AND NON-CONVENTIONAL TECHNIQUES TO SOLVE ORPD PROBLEM

20 CHAPTER 2 CONVENTIONAL AND NON-CONVENTIONAL TECHNIQUES TO SOLVE ORPD PROBLEM 2.1 CLASSIFICATION OF CONVENTIONAL TECHNIQUES Classical optimization methods can be classified into two distinct groups:

### Introduction to Genetic Algorithms. Based on Chapter 10 of Marsland Chapter 9 of Mitchell

Introduction to Genetic Algorithms Based on Chapter 10 of Marsland Chapter 9 of Mitchell Genetic Algorithms - History Pioneered by John Holland in the 1970s Became popular in the late 1980s Based on ideas

### Binary Representations of Integers and the Performance of Selectorecombinative Genetic Algorithms

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

### Genetic Algorithm for optimization using MATLAB

Volume 4, No. 3, March 2013 (Special Issue) International Journal of Advanced Research in Computer Science RESEARCH PAPER Available Online at www.ijarcs.info Genetic Algorithm for optimization using MATLAB

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

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

### An Integrated Genetic Algorithm with Clone Operator

International Journal of Pure and Applied Mathematical Sciences. ISSN 0972-9828 Volume 9, Number 2 (2016), pp. 145-164 Research India Publications http://www.ripublication.com An Integrated Genetic Algorithm

### Time Complexity Analysis of the Genetic Algorithm Clustering Method

Time Complexity Analysis of the Genetic Algorithm Clustering Method Z. M. NOPIAH, M. I. KHAIRIR, S. ABDULLAH, M. N. BAHARIN, and A. ARIFIN Department of Mechanical and Materials Engineering Universiti

### Finding a preferred diverse set of Pareto-optimal solutions for a limited number of function calls

Finding a preferred diverse set of Pareto-optimal solutions for a limited number of function calls Florian Siegmund, Amos H.C. Ng Virtual Systems Research Center University of Skövde P.O. 408, 541 48 Skövde,

### Using Genetic Algorithms to optimize ACS-TSP

Using Genetic Algorithms to optimize ACS-TSP Marcin L. Pilat and Tony White School of Computer Science, Carleton University, 1125 Colonel By Drive, Ottawa, ON, K1S 5B6, Canada {mpilat,arpwhite}@scs.carleton.ca

### Evolution of the Discrete Cosine Transform Using Genetic Programming

Res. Lett. Inf. Math. Sci. (22), 3, 117-125 Available online at http://www.massey.ac.nz/~wwiims/research/letters/ Evolution of the Discrete Cosine Transform Using Genetic Programming Xiang Biao Cui and

### Escaping Local Optima: Genetic Algorithm

Artificial Intelligence Escaping Local Optima: Genetic Algorithm Dae-Won Kim School of Computer Science & Engineering Chung-Ang University We re trying to escape local optima To achieve this, we have learned

### Khushboo Arora, Samiksha Agarwal, Rohit Tanwar

International Journal of Scientific & Engineering Research, Volume 7, Issue 1, January-2016 1014 Solving TSP using Genetic Algorithm and Nearest Neighbour Algorithm and their Comparison Khushboo Arora,

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

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

### Extending MATLAB and GA to Solve Job Shop Manufacturing Scheduling Problems

Extending MATLAB and GA to Solve Job Shop Manufacturing Scheduling Problems Hamidullah Khan Niazi 1, Sun Hou-Fang 2, Zhang Fa-Ping 3, Riaz Ahmed 4 ( 1, 4 National University of Sciences and Technology

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

### Search Algorithms for Regression Test Suite Minimisation

School of Physical Sciences and Engineering King s College London MSc in Advanced Software Engineering Search Algorithms for Regression Test Suite Minimisation By Benjamin Cook Supervised by Prof. Mark

### Optimization of Constrained Function Using Genetic Algorithm

Optimization of Constrained Function Using Genetic Algorithm Afaq Alam Khan 1* Roohie Naaz Mir 2 1. Department of Information Technology, Central University of Kashmir 2. Department of Computer Science

### Genetic Algorithms Variations and Implementation Issues

Genetic Algorithms Variations and Implementation Issues CS 431 Advanced Topics in AI Classic Genetic Algorithms GAs as proposed by Holland had the following properties: Randomly generated population Binary

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

### Genetic Algorithm for Dynamic Capacitated Minimum Spanning Tree

28 Genetic Algorithm for Dynamic Capacitated Minimum Spanning Tree 1 Tanu Gupta, 2 Anil Kumar 1 Research Scholar, IFTM, University, Moradabad, India. 2 Sr. Lecturer, KIMT, Moradabad, India. Abstract Many

### Solving ISP Problem by Using Genetic Algorithm

International Journal of Basic & Applied Sciences IJBAS-IJNS Vol:09 No:10 55 Solving ISP Problem by Using Genetic Algorithm Fozia Hanif Khan 1, Nasiruddin Khan 2, Syed Inayatulla 3, And Shaikh Tajuddin

### arxiv: v1 [cs.ai] 12 Feb 2017

GENETIC AND MEMETIC ALGORITHM WITH DIVERSITY EQUILIBRIUM BASED ON GREEDY DIVERSIFICATION ANDRÉS HERRERA-POYATOS 1 AND FRANCISCO HERRERA 1,2 arxiv:1702.03594v1 [cs.ai] 12 Feb 2017 1 Research group Soft

### Genetic Algorithms and Genetic Programming Lecture 7

Genetic Algorithms and Genetic Programming Lecture 7 Gillian Hayes 13th October 2006 Lecture 7: The Building Block Hypothesis The Building Block Hypothesis Experimental evidence for the BBH The Royal Road

### Lecture 6: The Building Block Hypothesis. Genetic Algorithms and Genetic Programming Lecture 6. The Schema Theorem Reminder

Lecture 6: The Building Block Hypothesis 1 Genetic Algorithms and Genetic Programming Lecture 6 Gillian Hayes 9th October 2007 The Building Block Hypothesis Experimental evidence for the BBH The Royal

### Computational Intelligence

Computational Intelligence Module 6 Evolutionary Computation Ajith Abraham Ph.D. Q What is the most powerful problem solver in the Universe? ΑThe (human) brain that created the wheel, New York, wars and

### Comparative Study on VQ with Simple GA and Ordain GA

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

### Incorporation of Scalarizing Fitness Functions into Evolutionary Multiobjective Optimization Algorithms

H. Ishibuchi, T. Doi, and Y. Nojima, Incorporation of scalarizing fitness functions into evolutionary multiobjective optimization algorithms, Lecture Notes in Computer Science 4193: Parallel Problem Solving

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

### Using Genetic Algorithms in Integer Programming for Decision Support

Doi:10.5901/ajis.2014.v3n6p11 Abstract Using Genetic Algorithms in Integer Programming for Decision Support Dr. Youcef Souar Omar Mouffok Taher Moulay University Saida, Algeria Email:Syoucef12@yahoo.fr

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

### Usage of of Genetic Algorithm for Lattice Drawing

Usage of of Genetic Algorithm for Lattice Drawing Sahail Owais, Petr Gajdoš, Václav Snášel Suhail Owais, Petr Gajdoš and Václav Snášel Department of Computer Science, VŠB Department - Technical ofuniversity

### Partitioning Sets with Genetic Algorithms

From: FLAIRS-00 Proceedings. Copyright 2000, AAAI (www.aaai.org). All rights reserved. Partitioning Sets with Genetic Algorithms William A. Greene Computer Science Department University of New Orleans

### An Evolutionary Algorithm for the Over-constrained Airport Baggage Sorting Station Assignment Problem

An Evolutionary Algorithm for the Over-constrained Airport Baggage Sorting Station Assignment Problem Amadeo Ascó 1, Jason A. D. Atkin 1, and Edmund K. Burke 2 1 School of Computer Science, University

### ROULETTE ANT WHEEL SELECTION (RAWS) FOR GENETIC ALGORITHM FUZZY SHORTEST PATH PROBLEM

International Journal of Mathematics and Computer Applications Research (IJMCAR) ISSN(P): 2249-6955; ISSN(E): 2249-8060 Vol. 5, Issue 2, Apr 2015, 1-14 TJPRC Pvt. Ltd. ROULETTE ANT WHEEL SELECTION (RAWS)

### Introduction to Optimization

Introduction to Optimization Approximation Algorithms and Heuristics November 6, 2015 École Centrale Paris, Châtenay-Malabry, France Dimo Brockhoff INRIA Lille Nord Europe 2 Exercise: The Knapsack Problem

### NODE PLACEMENT FOR A WIRELESS SENSOR NETWORK USING A MULTIOBJECTIVE GENETIC ALGORITHM

NODE PLACEMENT FOR A WIRELESS SENSOR NETWORK USING A MULTIOBJECTIVE GENETIC ALGORITHM DAMIEN JOURDAN, PhD candidate, Department of Aeronautics and Astronautics Massachusetts Institute of Technology Cambridge,

### Genetic Algorithms: Setting Parmeters and Incorporating Constraints OUTLINE OF TOPICS: 1. Setting GA parameters. 2. Constraint Handling (two methods)

Genetic Algorithms: Setting Parmeters and Incorporating Constraints OUTLINE OF TOPICS: 1. Setting GA parameters general guidelines for binary coded GA (some can be extended to real valued GA) estimating

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

### Santa Fe Trail Problem Solution Using Grammatical Evolution

2012 International Conference on Industrial and Intelligent Information (ICIII 2012) IPCSIT vol.31 (2012) (2012) IACSIT Press, Singapore Santa Fe Trail Problem Solution Using Grammatical Evolution Hideyuki

### A Web-Based Evolutionary Algorithm Demonstration using the Traveling Salesman Problem

A Web-Based Evolutionary Algorithm Demonstration using the Traveling Salesman Problem Richard E. Mowe Department of Statistics St. Cloud State University mowe@stcloudstate.edu Bryant A. Julstrom Department

### A GENETIC ALGORITHM FOR CLUSTERING ON VERY LARGE DATA SETS

A GENETIC ALGORITHM FOR CLUSTERING ON VERY LARGE DATA SETS Jim Gasvoda and Qin Ding Department of Computer Science, Pennsylvania State University at Harrisburg, Middletown, PA 17057, USA {jmg289, qding}@psu.edu

### Genetic Model Optimization for Hausdorff Distance-Based Face Localization

c In Proc. International ECCV 2002 Workshop on Biometric Authentication, Springer, Lecture Notes in Computer Science, LNCS-2359, pp. 103 111, Copenhagen, Denmark, June 2002. Genetic Model Optimization

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

### Experimental Study on Bound Handling Techniques for Multi-Objective Particle Swarm Optimization

Experimental Study on Bound Handling Techniques for Multi-Objective Particle Swarm Optimization adfa, p. 1, 2011. Springer-Verlag Berlin Heidelberg 2011 Devang Agarwal and Deepak Sharma Department of Mechanical

### A Queue-Based Genetic Algorithm (QGA)

A Queue-Based Genetic Algorithm (QGA) Asanobu KITAMOTO Research and Development Department National Center for Science Information Systems (NACSIS) 3-29-1, Otsuka, Bunkyo-ku, Tokyo 112-8640, JAPAN TEL:

### Inducing Parameters of a Decision Tree for Expert System Shell McESE by Genetic Algorithm

Inducing Parameters of a Decision Tree for Expert System Shell McESE by Genetic Algorithm I. Bruha and F. Franek Dept of Computing & Software, McMaster University Hamilton, Ont., Canada, L8S4K1 Email:

### GENETIC ALGORITHM METHOD FOR COMPUTER AIDED QUALITY CONTROL

3 rd Research/Expert Conference with International Participations QUALITY 2003, Zenica, B&H, 13 and 14 November, 2003 GENETIC ALGORITHM METHOD FOR COMPUTER AIDED QUALITY CONTROL Miha Kovacic, Miran Brezocnik