# Genetic Algorithm based Approach to Solve Non Fractional (0/1) Knapsack Optimization Problem

Save this PDF as:

Size: px
Start display at page:

Download "Genetic Algorithm based Approach to Solve Non Fractional (0/1) Knapsack Optimization Problem"

## Transcription

1 Genetic Algorithm based Approach to Solve Non Fractional (0/1) Knapsack Optimization Problem Vikas Thada Asst. Prof (CSE), ASET, Amity University, Gurgaon, India Shivali Dhaka Asst. Prof (CSE), ASET, Amity University, Gurgaon, India ABSTRACT In this paper we solve the non fractional knapsack problem also known as 0-1 knapsack using genetic algorithm. The usual approaches are greedy method and dynamic programming. Its an optimization problem where we try to maximize the values that can be put into a knapsack under the of its weight. We solve the problem using genetic algorithm in matlab using gatool. In this research work different selection schemes have been used like roulette wheel, tournament selection, Stochastic selection etc. Following the introduction of genetic algorithm and knapsack problem, formulation of 0-1 knapsack problem in genetic algorithm is presented. Experimental results using various selection schemes have been analyzed and comparison of genetic algorithm technique is done with greedy method and dynamic programming optimizing techniques. General Terms Weight, value, optimization, problem Keywords Knapsack, genetic, algorithm, 1. INTRODUCTION In this research paper solution of 0-1 knapsack problem is presented using Genetic Algorithm approach. The other approaches for solving are greedy method and dynamic programming. The greedy approach does not always results in an optimal solution and dynamic programming method having time complexity of O(nW) where n is number of items and W is the capacity of the knapsack. The reason for choosing this problem as this research work is that it is the problem that has been studied for almost a century and still finds its place in one of the good combinatorial optimization problem. In the problem number of items each with a weight and value are given. The aim is to find each item to be put in a knapsack so that the total weight of included items is less than or equal to the capacity of the knapsack simultaneous total value of the included items should be maximum. It s a problem that belongs to the NP class of problems. The decision problem form of the knapsack problem is NP-complete whereas optimization problem is NP-hard. As compare to other two methods mentioned above the GA based methods takes very less time and returns results in an efficient manner. 2. GENETIC ALGORITHM GAs is search algorithms that follow the concept of natural selection and genetics [1]. GA are powerful and very efficient search and optimization techniques motivated by the natural selection theory of Darwin [2]. Genetic Algorithms [3] are based on the principle of heredity and evolution which claims in each generation the stronger individual survives and the weaker dies. Therefore, each new generation would contain stronger (fitter) individuals in contrast to its ancestors. The process of GA s is iteration based of constant population size of candidate solutions. In each generation/iteration each chromosome s fitness in the current population is evaluated and new population evolves. Chromosomes with higher fitness values goes through reproduction phase in which selection, crossover and mutation operators are applied to get new population. Chromosomes with lower fitness values are discarded. Again this generated new population is evaluated and selection, crossover, mutation operators are applied. This process continues until we get an optimal solution for the given problem Fig 1: Basic operation of Genetic Algorithm[6] 2.1 Fitness Evaluation Fitness function is a function which is responsible for evaluating some value to indicate among number of solutions which one is optimum. It can also be considered as a measure of performance or fitness to show how fit is the candidate solution. Fitness function for this research work will be discussed in the next section. 21

2 2.2 Selection Once the fitness evaluation process is done next step is to perform selection operation. Process of selection operation is based on the principle of survival of the fittest. Higher fitness valued chromosomes goes through reproduction. Lower fitness valued chromosomes are discarded. There are number of ways to implement this operator, but all relies on the concept that candidates with good fitness values are to be preferred over poor fitness values. The idea is to give preference to better individuals. This selection operation does the replication of candidate chromosomes with good fitness values and eliminating those with poor fitness values [4]. Fig 2: Selection Operator on a Population of 4 Individuals[4] The research work uses roulette wheel selection method, tournament selection method, stochastic uniform, uniform and remainder method as selection operator. 2.3 Crossover[1,5] In the crossover operation mating of two chromosomes is performed that gives birth to two new offspring. This operation of crossover always happens with one parameter that is known as probability of crossover (ProC). When ProC is say 0.8 it means only 80% of the total population goes for crossover operation. Rests 20% chromosomes remain abstain from this operation and has no effect of crossover. Motive behind performing crossover operation is to explore new solutions and exploit use of old solutions. GA forms an optimum solution by mating two fit chromosomes together. Chromosomes with higher fitness will always have good selection probability then others with lower fitness values, thus a good solution moves from one generation to next generation values. After this operation fitness quality of new chromosomes may be high or low then old ones. In case new chromosomes are poor then old ones they are removed during selection process. The motive behind mutation is regaining the lost and discovering varying breeds. For example: randomly mutate chromosome at position 5 Fig 4: Mutation Operation Explained 3. KNAPSACK PROBLEM In the 0-1 knapsack problem given some items say n and a knapsack, the aim is to pack the knapsack to get the maximum total value. Each item has some weight and some value or profit. Total weight that we can carry is no more than some fixed number W that is the maximum weight knapsack can carry. So we must consider weights of items as well as their values. The aim is to fill the knapsack using various items so that the total weight of the items does not exceed the capacity of the knapsack i.e. W simultaneously maximizing the total profit of the included objects. The problem is called a 0-1 problem, because each item must be entirely accepted or rejected. Every object has a weight w i and profit p i. The goal is to maximize the value/profit of the included objects in the knapsack. The value of x i will be 0 if object is not included else x i will be 1. Mathematically the problem can be stated as shown in equation 1. Fig 5: Knapsack problem with knapsack and four items (1) Fig 3: Single Point Crossover Explained 2.4 Mutation[1,5] Mutation involves changing one bit of a chromosome from 0 to 1 or viceversa. This is performed under the parameter called probability of mutation (ProM). For example if ProM is 0.10 then 10% genes of total chromosomes will go for mutation. The concept of mutation is based on this natural theory that varying breeds are possible only by varying gene 22

3 Table 1: Different Solutions to 0-1Knapsack Instance shown in table 1. x1 x2 x3 x4 x Here i denotes ith item, pi is profit of ith item, wi is weight of the ith item, xi is either 0 or 1 and W is capacity of knapsack Example of 0-1 Knapsack Problem Let s consider the knapsack problem instance as given in table 1. The capacity W of knapsack in this instance is 6. Mathematically stating this instance of knapsack we have Here each xi is either 0 or 1. Subject to Constraint Again each xi is either 0 or 1. Table 2: An Instance of 0-1 Knapsack Problem Item i Profit pi Weight wi In the table 1 total possible solutions 2 5 =32 are shown. The red marked solution violates the in which total weight of included item exceeds capacity of knapsack. Optimal solution for this instance of 0-1 knapsack problem is 65 where item 3 and 5 are included in the knapsack. 23

4 4. MATLAB IMPLEMENTATION For implementation of 0-1 knapsack problem in matlab the research work uses gatool built-in matlab. This is shown in figure: 4.2 Constraint Function The function will try to minimize the total weights of the included objects so that it is less than equal to capacity of the knapsack. The function for the instance of the knapsack shown in table 1 is given as: function [c, ceq] = simple KS(x) c = [3*x(1)+2*x(2)+1*x(3)+4*x(4)+5*x(5)-6]; ceq = []; end Similarly to the input to fitness function vector is passed as input to function. Again values for x are taken from the initial population as supplied by creation function. 4.3 Creation Function In order to write your own creation function for gatool you must write it as par the syntax as listed in the documentation of matlab. The function is given below: Fig 6: MATLAB GA optimization tool The tool can be invoked in matlab using command: optimtool( ga ) For the implementation of this research problem 3 separate functions are to be written: First function is for maximizing profit, second is for satisfaction and third function is for creating initial population. All three functions are listed here; 4.1 Fitness Function The fitness function will try to maximize total profit as obtained by including the items in the knapsack following the. function y = simple_ks(x) y = (25*x(1)+20*x(2)+15*x(3)+40*x(4)+50*x(5)); end Here x is a vector that takes values from the creation function. All binary values (total 32) constitute the population of the problem to be solved by GA. function rtn = KPop1(genomeLength, fitnessfn, options ) x=[ ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ]; rtn=x; end You simply need to pass the parameters as shown in the above manner and return the population as binary vector. 4.4 Termination Criteria The terminating condition for the process is to either predefined number of generations reached or 97% of the population have same fitness value. 4.4 Results The research work supplied the discussed functions to the gatool as shown below in figure X. The selection function was varied from one type to another and results were obtained. Different subsections of this section are solely because of different selection operators the research work used. 24

5 4.4.1 Stochastic Uniform Selection Operator Figures for the remaining selection operators are same so we do not repeat the figures X1 and Y Remainder Selection Operator Results obtained as on command window: Fig 7: Sample Run and output for 0-1 knapsack problem From the final point in the figure it is easily visible that for maximum profit item number 3 rd and 5 th should be selected so that maximum profit obtained in 65 and weight of the included object is 6 which satisfy the capacity Uniform Selection Operator Results obtained as on command window: Roulette Selection Operator This selection operator didn t give us good results in the first run and process terminated after just 2 iterations but running the tool again for subsequent time gave us desired results as obtained using other selection operator. Fig 8: Current Best Individual using Stochastic Operator From the figure it is also shown that current best individuals are item number 3 and 5 with value 1. This was also clear from display result on command window. 25

6 4.4.6 Tournament Selection Operator Results obtained as on command window: 5. CONCLUSION The research work did not take into account croosover and mutation probability and used their default values from gatool. All the selection operators except roulette operator performed very well and optimal result was obtained in just 5 iterations. All the operators selected item 3 and 5 as item to be included in the knapsack. Thus it can be concluded that any selection operator except roulette wheel can be used for getting optimal results for 0-1 knapsack problem using gatool in matlab. Comparing the technique with traditional dynamic programming approach it is concluded that even for more number of items knapsack problem can be easily solved without much complexity whereas dynamic programming method takes more amount of time and is less efficient. 6. REFERENCES [1] B.Klabbankoh, O.Pinngern. applied genetic algorithms in information retrieval Proceeding of IEEE,pp ,Nov 2004 [2] S.S.Satya and P.Simon, "Review on Applicability of Genetic Algorithm to Web Search," International Journal of Computer Theory and Engineering, vol. 1, no. 4, pp , [3] Shokouhi, M.; Chubak, P.; Raeesy, Z Enhancing focused crawling with genetic algorithms Vol: 4-6, pp ,2005. [4] M.A.Kauser, M. Nasar, S.K.Singh, A Detailed Study on Information Retrieval using Genetic Algorithm, Journal of Industrial and Intelligent Information vol. 1, no. 3, pp Sep [5] J.R. Koza, Survey Of Genetic Algorithms And Genetic Programming, Proceedings of the Wescon, pp ,1995 [6] V.Thada, V.Jaglan, Use of Genetic Algorithm in Web Information Retrieval, International Journal of Emerging Technologies in Computational and Applied Sciences, vol.7,no.3,pp , Feb,2014 IJCA TM : 26

### Design of Web Ranking Module using Genetic Algorithm

Design of Web Ranking Module using Genetic Algorithm Vikas Thada Research Scholar Dr.K.N.M. University Newai, India Vivek Jaglan, Ph.D Asst.Prof(CSE),ASET Amity University Gurgaon, India ABSTRACT Crawling

### 11/14/2010 Intelligent Systems and Soft Computing 1

Lecture 9 Evolutionary Computation: Genetic algorithms Introduction, or can evolution be intelligent? Simulation of natural evolution Genetic algorithms Case study: maintenance scheduling with genetic

### Lecture 9 Evolutionary Computation: Genetic algorithms

Lecture 9 Evolutionary Computation: Genetic algorithms Introduction, or can evolution be intelligent? Simulation of natural evolution Genetic algorithms Case study: maintenance scheduling with genetic

### A Robust Method for Solving Transcendental Equations

www.ijcsi.org 413 A Robust Method for Solving Transcendental Equations Md. Golam Moazzam, Amita Chakraborty and Md. Al-Amin Bhuiyan Department of Computer Science and Engineering, Jahangirnagar University,

### A very brief introduction to genetic algorithms

A very brief introduction to genetic algorithms Radoslav Harman Design of experiments seminar FACULTY OF MATHEMATICS, PHYSICS AND INFORMATICS COMENIUS UNIVERSITY IN BRATISLAVA 25.2.2013 Optimization problems:

### Alpha Cut based Novel Selection for Genetic Algorithm

Alpha Cut based Novel for Genetic Algorithm Rakesh Kumar Professor Girdhar Gopal Research Scholar Rajesh Kumar Assistant Professor ABSTRACT Genetic algorithm (GA) has several genetic operators that can

### Optimizing CPU Scheduling Problem using Genetic Algorithms

Optimizing CPU Scheduling Problem using Genetic Algorithms Anu Taneja Amit Kumar Computer Science Department Hindu College of Engineering, Sonepat (MDU) anutaneja16@gmail.com amitkumar.cs08@pec.edu.in

### Evolutionary SAT Solver (ESS)

Ninth LACCEI Latin American and Caribbean Conference (LACCEI 2011), Engineering for a Smart Planet, Innovation, Information Technology and Computational Tools for Sustainable Development, August 3-5, 2011,

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

### Genetic Algorithms and Evolutionary Computation

Genetic Algorithms and Evolutionary Computation Matteo Matteucci and Andrea Bonarini {matteucci,bonarini}@elet.polimi.it Department of Electronics and Information Politecnico di Milano Genetic Algorithms

### Memory Allocation Technique for Segregated Free List Based on Genetic Algorithm

Journal of Al-Nahrain University Vol.15 (2), June, 2012, pp.161-168 Science Memory Allocation Technique for Segregated Free List Based on Genetic Algorithm Manal F. Younis Computer Department, College

### Genetic Algorithm for Solving Simple Mathematical Equality Problem

Genetic Algorithm for Solving Simple Mathematical Equality Problem Denny Hermawanto Indonesian Institute of Sciences (LIPI), INDONESIA Mail: denny.hermawanto@gmail.com Abstract This paper explains genetic

### Genetic Algorithm Performance with Different Selection Strategies in Solving TSP

Proceedings of the World Congress on Engineering Vol II WCE, July 6-8,, London, U.K. Genetic Algorithm Performance with Different Selection Strategies in Solving TSP Noraini Mohd Razali, John Geraghty

### Evolutionary Computation

Evolutionary Computation Cover evolutionary computation theory and paradigms Emphasize use of EC to solve practical problems Compare with other techniques - see how EC fits in with other approaches Definition:

### Genetic Algorithm an Approach to Solve Global Optimization Problems

Genetic Algorithm an Approach to Solve Global Optimization Problems PRATIBHA BAJPAI Amity Institute of Information Technology, Amity University, Lucknow, Uttar Pradesh, India, pratibha_bajpai@rediffmail.com

### Genetic Algorithms. Part 2: The Knapsack Problem. Spring 2009 Instructor: Dr. Masoud Yaghini

Genetic Algorithms Part 2: The Knapsack Problem Spring 2009 Instructor: Dr. Masoud Yaghini Outline Genetic Algorithms: Part 2 Problem Definition Representations Fitness Function Handling of Constraints

### Evolutionary Computation

Evolutionary Computation BIO-INSPIRED OPTIMIZATION TECHNIQUES IN PARALLEL AND DISTRIBUTED SYSTEMS Inspiration Darwin Transmutation of species Evolution Origin of species 1809 Altering of one species into

### CHAPTER 3 SECURITY CONSTRAINED OPTIMAL SHORT-TERM HYDROTHERMAL SCHEDULING

60 CHAPTER 3 SECURITY CONSTRAINED OPTIMAL SHORT-TERM HYDROTHERMAL SCHEDULING 3.1 INTRODUCTION Optimal short-term hydrothermal scheduling of power systems aims at determining optimal hydro and thermal generations

### A Hybrid Tabu Search Method for Assembly Line Balancing

Proceedings of the 7th WSEAS International Conference on Simulation, Modelling and Optimization, Beijing, China, September 15-17, 2007 443 A Hybrid Tabu Search Method for Assembly Line Balancing SUPAPORN

### Stillwater, November 2010

A Hybrid Genetic Algorithm for the Periodic Vehicle Routing Problem with Time Windows Michel Toulouse 1,2 Teodor Gabriel Crainic 2 Phuong Nguyen 2 1 Oklahoma State University 2 Interuniversity Research

### Solving Timetable Scheduling Problem by Using Genetic Algorithms

Solving Timetable Scheduling Problem by Using Genetic Algorithms Branimir Sigl, Marin Golub, Vedran Mornar Faculty of Electrical Engineering and Computing, University of Zagreb Unska 3, 1 Zagreb, Croatia

### Keywords: Travelling Salesman Problem, Map Reduce, Genetic Algorithm. I. INTRODUCTION

ISSN: 2321-7782 (Online) Impact Factor: 6.047 Volume 4, Issue 6, June 2016 International Journal of Advance Research in Computer Science and Management Studies Research Article / Survey Paper / Case Study

### A Review And Evaluations Of Shortest Path Algorithms

A Review And Evaluations Of Shortest Path Algorithms Kairanbay Magzhan, Hajar Mat Jani Abstract: Nowadays, in computer networks, the routing is based on the shortest path problem. This will help in minimizing

### PROCESS OF LOAD BALANCING IN CLOUD COMPUTING USING GENETIC ALGORITHM

PROCESS OF LOAD BALANCING IN CLOUD COMPUTING USING GENETIC ALGORITHM Md. Shahjahan Kabir 1, Kh. Mohaimenul Kabir 2 and Dr. Rabiul Islam 3 1 Dept. of CSE, Dhaka International University, Dhaka, Bangladesh

### ISSN: 2319-5967 ISO 9001:2008 Certified International Journal of Engineering Science and Innovative Technology (IJESIT) Volume 2, Issue 3, May 2013

Transistor Level Fault Finding in VLSI Circuits using Genetic Algorithm Lalit A. Patel, Sarman K. Hadia CSPIT, CHARUSAT, Changa., CSPIT, CHARUSAT, Changa Abstract This paper presents, genetic based algorithm

### Volume 3, Issue 2, February 2015 International Journal of Advance Research in Computer Science and Management Studies

Volume 3, Issue 2, February 2015 International Journal of Advance Research in Computer Science and Management Studies Research Article / Survey Paper / Case Study Available online at: www.ijarcsms.com

### Model-based Parameter Optimization of an Engine Control Unit using Genetic Algorithms

Symposium on Automotive/Avionics Avionics Systems Engineering (SAASE) 2009, UC San Diego Model-based Parameter Optimization of an Engine Control Unit using Genetic Algorithms Dipl.-Inform. Malte Lochau

### A Parallel Processor for Distributed Genetic Algorithm with Redundant Binary Number

A Parallel Processor for Distributed Genetic Algorithm with Redundant Binary Number 1 Tomohiro KAMIMURA, 2 Akinori KANASUGI 1 Department of Electronics, Tokyo Denki University, 07ee055@ms.dendai.ac.jp

### Self-Learning Genetic Algorithm for a Timetabling Problem with Fuzzy Constraints

Self-Learning Genetic Algorithm for a Timetabling Problem with Fuzzy Constraints Radomír Perzina, Jaroslav Ramík perzina(ramik)@opf.slu.cz Centre of excellence IT4Innovations Division of the University

### A Genetic Algorithm Approach for Solving a Flexible Job Shop Scheduling Problem

A Genetic Algorithm Approach for Solving a Flexible Job Shop Scheduling Problem Sayedmohammadreza Vaghefinezhad 1, Kuan Yew Wong 2 1 Department of Manufacturing & Industrial Engineering, Faculty of Mechanical

### Lab 4: 26 th March 2012. Exercise 1: Evolutionary algorithms

Lab 4: 26 th March 2012 Exercise 1: Evolutionary algorithms 1. Found a problem where EAs would certainly perform very poorly compared to alternative approaches. Explain why. Suppose that we want to find

### Numerical Research on Distributed Genetic Algorithm with Redundant

Numerical Research on Distributed Genetic Algorithm with Redundant Binary Number 1 Sayori Seto, 2 Akinori Kanasugi 1,2 Graduate School of Engineering, Tokyo Denki University, Japan 10kme41@ms.dendai.ac.jp,

### Simulating the Multiple Time-Period Arrival in Yield Management

Simulating the Multiple Time-Period Arrival in Yield Management P.K.Suri #1, Rakesh Kumar #2, Pardeep Kumar Mittal #3 #1 Dean(R&D), Chairman & Professor(CSE/IT/MCA), H.C.T.M., Kaithal(Haryana), India #2

### Genetic Algorithms. What is Evolutionary Computation? The Argument. 22c: 145, Chapter 4.3

Genetic Algorithms 22c: 145, Chapter 4.3 What is Evolutionary Computation? An abstraction from the theory of biological evolution that is used to create optimization procedures or methodologies, usually

### A Non-Linear Schema Theorem for Genetic Algorithms

A Non-Linear Schema Theorem for Genetic Algorithms William A Greene Computer Science Department University of New Orleans New Orleans, LA 70148 bill@csunoedu 504-280-6755 Abstract We generalize Holland

### A Genetic Algorithm Processor Based on Redundant Binary Numbers (GAPBRBN)

ISSN: 2278 1323 All Rights Reserved 2014 IJARCET 3910 A Genetic Algorithm Processor Based on Redundant Binary Numbers (GAPBRBN) Miss: KIRTI JOSHI Abstract A Genetic Algorithm (GA) is an intelligent search

### ECONOMIC GENERATION AND SCHEDULING OF POWER BY GENETIC ALGORITHM

ECONOMIC GENERATION AND SCHEDULING OF POWER BY GENETIC ALGORITHM RAHUL GARG, 2 A.K.SHARMA READER, DEPARTMENT OF ELECTRICAL ENGINEERING, SBCET, JAIPUR (RAJ.) 2 ASSOCIATE PROF, DEPARTMENT OF ELECTRICAL ENGINEERING,

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

### EFFICIENT GENETIC ALGORITHM ON LINEAR PROGRAMMING PROBLEM FOR FITTEST CHROMOSOMES

Volume 3, No. 6, June 2012 Journal of Global Research in Computer Science RESEARCH PAPER Available Online at www.jgrcs.info EFFICIENT GENETIC ALGORITHM ON LINEAR PROGRAMMING PROBLEM FOR FITTEST CHROMOSOMES

### International Journal of Software and Web Sciences (IJSWS) www.iasir.net

International Association of Scientific Innovation and Research (IASIR) (An Association Unifying the Sciences, Engineering, and Applied Research) ISSN (Print): 2279-0063 ISSN (Online): 2279-0071 International

### Comparison of Major Domination Schemes for Diploid Binary Genetic Algorithms in Dynamic Environments

Comparison of Maor Domination Schemes for Diploid Binary Genetic Algorithms in Dynamic Environments A. Sima UYAR and A. Emre HARMANCI Istanbul Technical University Computer Engineering Department Maslak

### A hybrid Approach of Genetic Algorithm and Particle Swarm Technique to Software Test Case Generation

A hybrid Approach of Genetic Algorithm and Particle Swarm Technique to Software Test Case Generation Abhishek Singh Department of Information Technology Amity School of Engineering and Technology Amity

### International Journal of Software and Web Sciences (IJSWS) Web Log Mining Based on Improved FCM Algorithm using Multiobjective

International Association of Scientific Innovation and Research (IASIR) (An Association Unifying the Sciences, Engineering, and Applied Research) ISSN (Print): 2279-0063 ISSN (Online): 2279-0071 International

### Comparison of Optimization Techniques in Large Scale Transportation Problems

Journal of Undergraduate Research at Minnesota State University, Mankato Volume 4 Article 10 2004 Comparison of Optimization Techniques in Large Scale Transportation Problems Tapojit Kumar Minnesota State

### The Applications of Genetic Algorithms in Stock Market Data Mining Optimisation

The Applications of Genetic Algorithms in Stock Market Data Mining Optimisation Li Lin, Longbing Cao, Jiaqi Wang, Chengqi Zhang Faculty of Information Technology, University of Technology, Sydney, NSW

### Keywords revenue management, yield management, genetic algorithm, airline reservation

Volume 4, Issue 1, January 2014 ISSN: 2277 128X International Journal of Advanced Research in Computer Science and Software Engineering Research Paper Available online at: www.ijarcsse.com A Revenue Management

### Original Article Efficient Genetic Algorithm on Linear Programming Problem for Fittest Chromosomes

International Archive of Applied Sciences and Technology Volume 3 [2] June 2012: 47-57 ISSN: 0976-4828 Society of Education, India Website: www.soeagra.com/iaast/iaast.htm Original Article Efficient Genetic

### An Efficient load balancing using Genetic algorithm in Hierarchical structured distributed system

An Efficient load balancing using Genetic algorithm in Hierarchical structured distributed system Priyanka Gonnade 1, Sonali Bodkhe 2 Mtech Student Dept. of CSE, Priyadarshini Instiute of Engineering and

### Feb. 28 International Journal of advanced studies in Computer Science and Engineering

Genetic algorithm: an overview and its application Vijay Kumar Verma 1 Biresh Kumar 2 Asst. Professor Dept. of CSE NSIT, Bihta, Patna Research Scholar NIT Patna Abstract: There exist many problems for

### Solving the Vehicle Routing Problem with Genetic Algorithms

Solving the Vehicle Routing Problem with Genetic Algorithms Áslaug Sóley Bjarnadóttir April 2004 Informatics and Mathematical Modelling, IMM Technical University of Denmark, DTU Printed by IMM, DTU 3 Preface

### Genetic Algorithms for Bridge Maintenance Scheduling. Master Thesis

Genetic Algorithms for Bridge Maintenance Scheduling Yan ZHANG Master Thesis 1st Examiner: Prof. Dr. Hans-Joachim Bungartz 2nd Examiner: Prof. Dr. rer.nat. Ernst Rank Assistant Advisor: DIPL.-ING. Katharina

### Genetic algorithms. Maximise f(x), xi Code every variable using binary string Eg.(00000) (11111)

Genetic algorithms Based on survival of the fittest. Start with population of points. Retain better points Based on natural selection. ( as in genetic processes) Genetic algorithms L u Maximise f(x), xi

### Query Optimization by Genetic Algorithm

JOURNAL OF INFORMATION TECHNOLOGY AND ENGINEERING Vol.3 No.1 Jan-June 2012 pp. 44-51 ISSN: 2229-7421 International Science Press www.ispjournals.com Query Optimization by Genetic Algorithm Dr. P.K.Butey

### GENETIC ALGORITHMS. Introduction to Genetic Algorithms

Introduction to genetic algorithms with Java applets Introduction to Genetic Algorithms GENETIC ALGORITHMS Main page Introduction Biological Background Search Space Genetic Algorithm GA Operators GA Example

### Evolutionary Algorithms using Evolutionary Algorithms

Evolutionary Algorithms using Evolutionary Algorithms Neeraja Ganesan, Sowmya Ravi & Vandita Raju S.I.E.S GST, Mumbai, India E-mail: neer.ganesan@gmail.com, Abstract A subset of AI is, evolutionary algorithm

### International Journal of Advanced Research in Electrical, Electronics and Instrumentation Engineering

DOI: 10.15662/ijareeie.2014.0307061 Economic Dispatch of Power System Optimization with Power Generation Schedule Using Evolutionary Technique Girish Kumar 1, Rameshwar singh 2 PG Student [Control system],

### A SURVEY ON GENETIC ALGORITHM FOR INTRUSION DETECTION SYSTEM

A SURVEY ON GENETIC ALGORITHM FOR INTRUSION DETECTION SYSTEM MS. DIMPI K PATEL Department of Computer Science and Engineering, Hasmukh Goswami college of Engineering, Ahmedabad, Gujarat ABSTRACT The Internet

### Effect of Using Neural Networks in GA-Based School Timetabling

Effect of Using Neural Networks in GA-Based School Timetabling JANIS ZUTERS Department of Computer Science University of Latvia Raina bulv. 19, Riga, LV-1050 LATVIA janis.zuters@lu.lv Abstract: - The school

### Wireless Sensor Networks Coverage Optimization based on Improved AFSA Algorithm

, pp. 99-108 http://dx.doi.org/10.1457/ijfgcn.015.8.1.11 Wireless Sensor Networks Coverage Optimization based on Improved AFSA Algorithm Wang DaWei and Wang Changliang Zhejiang Industry Polytechnic College

### A Brief Study of the Nurse Scheduling Problem (NSP)

A Brief Study of the Nurse Scheduling Problem (NSP) Lizzy Augustine, Morgan Faer, Andreas Kavountzis, Reema Patel Submitted Tuesday December 15, 2009 0. Introduction and Background Our interest in the

### Differential Evolution Particle Swarm Optimization for Digital Filter Design

Differential Evolution Particle Swarm Optimization for Digital Filter Design Bipul Luitel, and Ganesh K. Venayagamoorthy, Abstract In this paper, swarm and evolutionary algorithms have been applied for

### Evolutionary Detection of Rules for Text Categorization. Application to Spam Filtering

Advances in Intelligent Systems and Technologies Proceedings ECIT2004 - Third European Conference on Intelligent Systems and Technologies Iasi, Romania, July 21-23, 2004 Evolutionary Detection of Rules

### Using Segment-based Genetic Algorithm with Local Search to Find Approximate Solution for Multi-Stage Supply Chain Network Design Problem

Çankaya University Journal of Science and Engineering Volume 10 (2013), No 2, 185-201. Using Segment-based Genetic Algorithm with Local Search to Find Approximate Solution for Multi-Stage Supply Chain

### GA as a Data Optimization Tool for Predictive Analytics

GA as a Data Optimization Tool for Predictive Analytics Chandra.J 1, Dr.Nachamai.M 2,Dr.Anitha.S.Pillai 3 1Assistant Professor, Department of computer Science, Christ University, Bangalore,India, chandra.j@christunivesity.in

### A Strategic Capacity Planning Model: A Genetic Algorithm Approach

www.ijecs.in International Journal Of Engineering And Computer Science ISSN:2319-7242 Volume 2 Issue 12 Dec,2013 Page No. 3455-3464 A Strategic Capacity Planning Model: A Genetic Algorithm Approach N.

### Exploring Genetic Algorithms and Simulated Annealing for Immobile Location-Allocation Problem

Exploring Genetic Algorithms and Simulated Annealing for Immobile Location-Allocation Problem Ferran TORRENT-FONTBONA a, Víctor MUÑOZ b and Beatriz LÓPEZ a a Universitat de Girona b Newronia S.L. Abstract.

HYBRID GENETIC ALGORITHMS FOR SCHEDULING ADVERTISEMENTS ON A WEB PAGE Subodha Kumar University of Washington subodha@u.washington.edu Varghese S. Jacob University of Texas at Dallas vjacob@utdallas.edu

### Keywords: Beta distribution, Genetic algorithm, Normal distribution, Uniform distribution, Yield management.

Volume 3, Issue 9, September 2013 ISSN: 2277 128X International Journal of Advanced Research in Computer Science and Software Engineering Research Paper Available online at: www.ijarcsse.com Simulating

### Evolutionary Computation

Chapter 3 Evolutionary Computation Inspired by the success of nature in evolving such complex creatures as human beings, researchers in artificial intelligence have developed algorithms which are based

### IJESRT INTERNATIONAL JOURNAL OF ENGINEERING SCIENCES & RESEARCH TECHNOLOGY SOLUTION FOR RUBIK S CUBE BY USING GENETIC ALGORITHM

IJESRT INTERNATIONAL JOURNAL OF ENGINEERING SCIENCES & RESEARCH TECHNOLOGY SOLUTION FOR RUBIK S CUBE BY USING GENETIC ALGORITHM Kulkarni Sameer Anil M.Tech student Dept. of ISE BMS College of Engineering

### Multiple Resource Constraint Time-Cost-Resource Optimization Using Genetic Algorithm

First International Conference on Construction In Developing Countries (ICCIDC I) Advancing and Integrating Construction Education, Research & Practice August -,, Karachi,, Pakistan Multiple Resource Constraint

### Effects of Symbiotic Evolution in Genetic Algorithms for Job-Shop Scheduling

Proceedings of the th Hawaii International Conference on System Sciences - 00 Effects of Symbiotic Evolution in Genetic Algorithms for Job-Shop Scheduling Yasuhiro Tsujimura Yuichiro Mafune Mitsuo Gen

### Estimation of the COCOMO Model Parameters Using Genetic Algorithms for NASA Software Projects

Journal of Computer Science 2 (2): 118-123, 2006 ISSN 1549-3636 2006 Science Publications Estimation of the COCOMO Model Parameters Using Genetic Algorithms for NASA Software Projects Alaa F. Sheta Computers

### APPLICATION OF GENETIC ALGORITHMS IN THE DESIGN OPTIMIZATION OF THREE PHASE INDUCTION MOTOR A.

APPLICATION OF GENETIC ALGORITHMS IN THE DESIGN OPTIMIZATION OF THREE PHASE INDUCTION MOTOR A. Krishnamoorthy Research Scholar, Sathyabama University, Chennai 600 119. Email : ak_sir@yahoo.com Dharmalingam.K.

### Information Theory and Coding Prof. S. N. Merchant Department of Electrical Engineering Indian Institute of Technology, Bombay

Information Theory and Coding Prof. S. N. Merchant Department of Electrical Engineering Indian Institute of Technology, Bombay Lecture - 14 Non-Binary Huffman Code and Other Codes In the last class we

### Solving Banana (Rosenbrock) Function Based on Fitness Function

Available online at www.worldscientificnews.com WSN 6 (2015) 41-56 EISSN 2392-2192 Solving Banana (Rosenbrock) Function Based on Fitness Function Lubna Zaghlul Bashir 1,a, Rajaa Salih Mohammed Hasan 2,b

### the beginning of a run of a GA a large population of random chromosomes is created. Chromosome models depend on the case.

Comparison of Document Similarity in Information Retrieval System by Different Formulation Poltak Sihombing 1, Abdullah Embong 2, Putra Sumari 3 1, 2,3 School of Computer Science, Universiti Sains Malaysia,

### Cellular Automaton: The Roulette Wheel and the Landscape Effect

Cellular Automaton: The Roulette Wheel and the Landscape Effect Ioan Hălălae Faculty of Engineering, Eftimie Murgu University, Traian Vuia Square 1-4, 385 Reşiţa, Romania Phone: +40 255 210227, Fax: +40

### Genetic Algorithms. variables: Discrete vs. continuous

Genetic Algorithms Genetic algorithms imitate natural optimization process, natural selection in evolution Algorithm developed by John Holland at the University of Michigan for machine learning in 1975

### Research Article A Revenue Maximization Approach for Provisioning Services in Clouds

Mathematical Problems in Engineering Volume 2015, Article ID 747392, 9 pages http://dx.doi.org/10.1155/2015/747392 Research Article A Revenue Maximization Approach for Provisioning Services in Clouds Li

### Genetic Algorithm. Based on Darwinian Paradigm. Intrinsically a robust search and optimization mechanism. Conceptual Algorithm

24 Genetic Algorithm Based on Darwinian Paradigm Reproduction Competition Survive Selection Intrinsically a robust search and optimization mechanism Slide -47 - Conceptual Algorithm Slide -48 - 25 Genetic

### A Knowledge Based GA Approach for FMS Scheduling

A Knowledge Based GA Approach for FMS Scheduling Prof. Subhash Wadhwa, Anuj Prakash, Prof. S.G. Deshmukh Abstract In this paper, we present a Knowledge Based Genetic Algorithm (KBGA) for the scheduling

### CHAPTER 6 GENETIC ALGORITHM OPTIMIZED FUZZY CONTROLLED MOBILE ROBOT

77 CHAPTER 6 GENETIC ALGORITHM OPTIMIZED FUZZY CONTROLLED MOBILE ROBOT 6.1 INTRODUCTION The idea of evolutionary computing was introduced by (Ingo Rechenberg 1971) in his work Evolutionary strategies.

### Optimizing the Dynamic Composition of Web Service Components

Optimizing the Dynamic Composition of Web Service Components Wei-Chun Chang* Department and Graduate School of Information Management, Shu-Te University, Taiwan changwc@mailstuedutw Ching-Seh Wu Department

### A Binary Model on the Basis of Imperialist Competitive Algorithm in Order to Solve the Problem of Knapsack 1-0

212 International Conference on System Engineering and Modeling (ICSEM 212) IPCSIT vol. 34 (212) (212) IACSIT Press, Singapore A Binary Model on the Basis of Imperialist Competitive Algorithm in Order

### Asexual Versus Sexual Reproduction in Genetic Algorithms 1

Asexual Versus Sexual Reproduction in Genetic Algorithms Wendy Ann Deslauriers (wendyd@alumni.princeton.edu) Institute of Cognitive Science,Room 22, Dunton Tower Carleton University, 25 Colonel By Drive

### Optimizing Testing Efficiency with Error-Prone Path Identification and Genetic Algorithms

Optimizing Testing Efficiency with Error-Prone Path Identification and Genetic Algorithms James R. Birt Renate Sitte Griffith University, School of Information Technology Gold Coast Campus PBM 50 Gold

### Optimal Tuning of PID Controller Using Meta Heuristic Approach

International Journal of Electronic and Electrical Engineering. ISSN 0974-2174, Volume 7, Number 2 (2014), pp. 171-176 International Research Publication House http://www.irphouse.com Optimal Tuning of

### Genetic Algorithms, Part 2

Genetic Algorithms, Part 2 Evolving (and co-evolving) one-dimensional cellular automata to perform a computation One-dimensional cellular automata Rule: One-dimensional cellular automata Rule: One-dimensional

### Holland s GA Schema Theorem

Holland s GA Schema Theorem v Objective provide a formal model for the effectiveness of the GA search process. v In the following we will first approach the problem through the framework formalized by

### Management Science Letters

Management Science Letters 4 (2014) 905 912 Contents lists available at GrowingScience Management Science Letters homepage: www.growingscience.com/msl Measuring customer loyalty using an extended RFM and

### CLOUD DATABASE ROUTE SCHEDULING USING COMBANATION OF PARTICLE SWARM OPTIMIZATION AND GENETIC ALGORITHM

CLOUD DATABASE ROUTE SCHEDULING USING COMBANATION OF PARTICLE SWARM OPTIMIZATION AND GENETIC ALGORITHM *Shabnam Ghasemi 1 and Mohammad Kalantari 2 1 Deparment of Computer Engineering, Islamic Azad University,

### Rating and Generating Sudoku Puzzles Based On Constraint Satisfaction Problems

Rating and Generating Sudoku Puzzles Based On Constraint Satisfaction Problems Bahare Fatemi, Seyed Mehran Kazemi, Nazanin Mehrasa Abstract Sudoku is a logic-based combinatorial puzzle game which people

### Non-Uniform Mapping in Binary-Coded Genetic Algorithms

Non-Uniform Mapping in Binary-Coded Genetic Algorithms Kalyanmoy Deb, Yashesh D. Dhebar, and N. V. R. Pavan Kanpur Genetic Algorithms Laboratory (KanGAL) Indian Institute of Technology Kanpur PIN 208016,

### Using Genetic Programming to Learn Probability Distributions as Mutation Operators with Evolutionary Programming

Using Genetic Programming to Learn Probability Distributions as Mutation Operators with Evolutionary Programming James Bond, and Harry Potter The University of XXX Abstract. The mutation operator is the

### Inventory Optimization in Efficient Supply Chain Management

International Journal of Computer Applications in Engineering Sciences [VOL I, ISSUE IV, DECEMBER 2011] [ISSN: 2231-4946] Inventory Optimization in Efficient Supply Chain Management S.R. Singh 1, Tarun

### COMPARISON OF GENETIC OPERATORS ON A GENERAL GENETIC ALGORITHM PACKAGE HUAWEN XU. Master of Science. Shanghai Jiao Tong University.

COMPARISON OF GENETIC OPERATORS ON A GENERAL GENETIC ALGORITHM PACKAGE By HUAWEN XU Master of Science Shanghai Jiao Tong University Shanghai, China 1999 Submitted to the Faculty of the Graduate College