CHAPTER 3 RESEARCH METHODOLOGY

Size: px
Start display at page:

Download "CHAPTER 3 RESEARCH METHODOLOGY"

Transcription

1 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 the supply chain, service provided to the customer ultimately gets enhanced. Hence, to ensure minimal cost for the supply chain, the determination of the inventory to be held at various levels in a supply chain is unavoidable. Minimizing the total supply chain cost refers to the reduction of holding and shortage cost in the entire supply chain. Efficient inventory management is a complex process which entails the management of the inventory in the whole supply chain and getting the final solution as optimal, i.e. in the process of supply chain management, the stock level at each member of the supply chain should account to minimum total supply chain cost. The dynamic nature of the excess stock level and shortage level over all the periods is a serious issue when implementation is considered. In addition, consideration of multiple products leads to very complex inventory management process. The complexity of the problem increases when more distribution centers and agents are involved. In this present research, these issues of inventory management have been focused and novel models based on GA and PSO Meta heuristics have been proposed

2 73 in which the most probable excess stock level and shortage level required for inventory optimization in the supply chain is distinctively determined so as to achieve minimum total supply chain cost. 3.1 GENETIC ALGORITHM Genetic algorithm is a randomized search methodology having its roots in the natural selection process. Initially the neighborhood search operators (crossover and mutation) are applied to the preliminary set of solutions to acquire generation of new solutions. Solutions are chosen randomly from the existing set of solutions where the selection probability and the solution s objective function value are proportional to each other and eventually the aforesaid operators are applied on the chosen solutions. Genetic algorithms have aided in the successful implementation of solutions for a wide variety of combinatorial problems. The robustness of the Genetic algorithms as search techniques have been theoretically and empirically proved [95]. The artificial individual is the basic element of a GA. An artificial individual consists of a chromosome and a fitness value, similar to a natural individual. The individual's likelihood for survival and mating is determined by the fitness function [93]. In accordance with the Darwin s principle, individuals superior to their competitors, are more likely to promote their

3 74 genes to the next generations. In accordance with this concept, in Genetic Algorithms, a set of encoded parameters are mapped into a potential solution, named chromosome, to the optimization problem [94]. The population of candidate solutions is obtained through the process of selection, recombination, and mutation performed in an iterative manner. [96]. Chromosomes refer to the random population of encoded candidate solutions with which the Genetic algorithms initiate with. [95]. Then the set (called a population) of possible solutions (called chromosomes) are generated [99]. A function assigns a degree of fitness to each chromosome in every generation in order to use the best individual during the evolutionary process [98]. In accordance to the objective, the fitness function evaluates the individuals [96]. Each chromosome is evaluated using a fitness function and a fitness value is assigned. Then, three different operators- selection, crossover and mutation- are applied to update the population. A generation refers to an iteration of these three operators [97]. The promising areas of the search space are focused in the selection step. The selection process typically keeps solutions with high fitness values in the population and rejects individuals of low quality [96]. Hence, this provides a means for the chromosomes with better fitness to form the mating pool (MP) [99].

4 75 After the process of Selection, the Crossover is performed. In the crossover operation, two new children are formed by exchanging the genetic information between two parent chromosomes (say C1 and C2 which are selected from the selection process) [99]. A crossover point is chosen at random by the crossover operator. At this point, two parent chromosomes break and then exchange the chromosome parts after that point. Consequently, the partial features of two chromosomes are combined to generate two off springs. The chromosome cloning takes place when a pair of chromosomes does not cross over, thus creating off springs that are exact copies of each parent [98]. The ultimate step in each generation is the mutation of individuals through the alteration of parts of their genes [96]. Mutation alters a minute portion of a chromosome and thus institutes variability into the population of the subsequent generation [99]. Mutation, a rarity in nature, denotes the alteration in the gene and assists us in avoiding loss of genetic diversity [96]. Its chief intent is to ensure that the search algorithm is not bound on a local optimum [98]. Evolutionary algorithms like Genetic Algorithms offer practical advantages to several optimization problems. The advantages include: Simplicity of the approach Robust response to dynamic changes

5 76 Parallelism Hybridization Discovers global optimum Resistant to being trapped in local optima Handles large,complex search spaces easily Perform very well for large-scale optimization problems Used in a variety of optimization problems 3.2 INVENTORY OPTIMIZATION ANALYSIS USING GENETIC ALGORITHM The inventory control for more number of products along with different levels of supply chain is a complex task. To make the inventory control effective, the most primary objective is to predict where, why and how much of the control is required. Such a prediction is to be made here through the methodology proposed. To accomplish the same, Genetic algorithm is used and the optimal number of units of a particular product that needs to be kept in the level of control is determined on the basis of the knowledge of the past records. This leads to an easy estimation of the level of stocks of the respective products to be maintained in the upcoming periods. For instance, a three stage supply chain having seven members is depicted in Fig: 3.1.

6 77 Fig: stage-7 member supply chain As illustrated in Fig: 3.1, a factory is the parent of the chain and it is having two distribution centers, Distribution center 1 and Distribution center 2. Distribution centers further comprise of two agents each. So, in aggregate there are four agents, Agent1 and Agent2 for Distribution center 1 and Agent 3 and Agent 4 for Distribution center 2. The factory manufactures different products that would be supplied to the distribution centers. From the distribution center, the stocks will be moved to the corresponding agents. The methodology adopted is intended to determine the specific product that needs to be concentrated on and the amount of stock levels of the product that has to be maintained by the different members of the supply chain. Also, the methodology analyses whether the stock level of the particular product at each member of the supply chain needs to be in abundance in order to avoid shortage of the product or needs to be held minimal in order to minimize the holding cost.

7 78 The steps involved in the methodology is illustrated in the Fig: 4.2 which would analyze the past records and facilitate efficient inventory management using Genetic Algorithm. Fig: 3.2 Genetic Algorithm flow for the proposed inventory management analysis The process depicted in Fig: 3.2 will be repeated along with the new chromosome obtained from the previous process. In other words, at the end of each of the iteration, a best chromosome will be obtained. This will be included along with a newly generated chromosome for the next iteration. Eventually, an individual which is the optimal one among

8 79 all the possible individuals is obtained. This best chromosome obtained has the information about excess/shortage of stock levels of a particular product corresponding to each member of the supply chain. From the information it can be concluded that the particular product and its corresponding stock levels play a significant role in the increase of supply chain cost. By controlling the stock level of that particular product at every member of the supply chain in the upcoming periods, the total supply chain cost can be minimized. 3.3 PARTICLE SWARM OPTIMIZATION In 1995, Kennedy and Eberhartin, inspired by the choreography of a bird flock, first proposed the Particle Swarm Optimization (PSO). In comparison with the evolutionary algorithm, PSO, relatively recently devised population-based stochastic global optimization algorithm, has many similarities and the robust performance of the proposed method over a variety of difficult optimization problems has been proved [111]. In accordance with PSO, either the best local or the best global individual affects the behavior of each individual in order to help it fly through a hyperspace [106]. Simulation of simplified social models has been employed to develop Particle Swarm Optimization techniques. The following are the features of the method [107]:

9 80 The researches on swarms such as fish schooling and bird flocking are the basis of the method. The computation time is short and it requires little memory as it is based on a simple concept. Nonlinear optimization problems with continuous variables were the initial focus of this method. Nevertheless, problems with discrete variables can be treated by easy expansion of the method. Hence, the mixed integer nonlinear optimization problems with both continuous and discrete variables can be treated with this method. In addition to PSO, several evolutionary paradigms exist which include Genetic algorithms (GA), Genetic programming (GP), Evolutionary strategies (ES) and Evolutionary programming (EP). Biological evolution is simulated by these approaches which are based on population [108]. Genetic algorithm and PSO are two widely used types of evolutionary computation techniques among the various types of Evolutionary Computing paradigms [109]. PSO and evolutionary computation techniques such as Genetic Algorithms (GA) have many similarities between them. A population of random solutions is used to initialize the system which updates

10 81 generations to search for optima. Nevertheless, PSO does not have evolution operators such as crossover and mutation that are available in GA. In PSO, the potential solutions, called particles follow the current optimum particles to fly through the problem space. Every particle represents a candidate solution to the optimization problem. The best position visited by the particle and the position of the best particle in the particle s neighborhood influences its position. Particles would retain part of their previous state using their memory. The particles would still remember the best positions they ever had even as there are no restrictions for particles to know the positions of other particles in the multidimensional spaces. An initial random velocity and two randomly weighted influences: individuality (the tendency to return to the particle s best previous position), and sociality (the tendency to move towards the neighborhood s best previous position) form each particle s movement [110]. When the neighborhood of a particle is the entire swarm, the global best particle refers to the best position in the neighborhood and in this case, gbest PSO refers the resulting algorithm. Generally, lbest PSO

11 82 refers the algorithm in cases when smaller neighborhoods are used [109]. A fitness function that is to be optimized evaluates the fitness values of all the particles [110]. PSO uses individual and group experiences to search the optimal solutions. Nevertheless, previous solutions may not provide the solution of the optimization problem. The optimal solution is changed by adjusting certain parameters and putting random variables. The ability of the particles to remember the best position that they have seen is an advantage of PSO [110]. 3.4 PREDICTION ANALYSIS BASED ON PARTICLE SWARM OPTIMIZATION ALGORITHM The supply chain cost increases because of the influence of lead times for supplying the stocks as well as the raw materials. Practically, the lead times will not be same through out all the periods. Maintaining abundant stocks in order to avoid the impact of high lead time increases the holding cost. Similarly, maintaining fewer stocks because of ballpark lead time may lead to shortage of stocks. This also happens in the case of lead time involved in supplying raw materials. A better optimization methodology would consider all these above mentioned factors in the prediction of the optimal stock levels to be maintained such that the total

12 83 supply chain cost can be minimized. Here, an optimization methodology that utilizes the Particle Swarm Optimization algorithm, one of the best optimization algorithms, is proposed to overcome the impasse in maintaining the optimal stock levels in each member of the supply chain. Taking into account the stock levels thus obtained from the proposed methodology, an appropriate stock levels to be maintained in the approaching periods that will minimize the supply chain inventory cost can be arrived at. The methodology proposed here will minimize the total supply chain cost by predicting optimal stock levels, not only by considering the past stock levels but also considering the lead time of the products to reach each supply chain member from its previous stage as well as the lead time involved in supplying the raw materials to the factory. Usually, shortage for a particular stock at a particular member, excess stock levels at a particular member, time required to transport stock from one supply chain member to another i.e. lead time of a stock in a member, time taken to supply raw materials to the factory to manufacture certain products i.e. lead time of raw materials in factory are some of the key factors that play a vital role in deciding the supply chain cost. A better optimization methodology should consider all these factors. In the proposed methodology, all the above mentioned key factors in predicting

13 84 the desired stock levels for the purpose of minimizing the supply chain inventory cost are considered. Also, different priorities are assigned to those above factors. As per the priority given, the corresponding factors will influence the prediction of optimal stock levels. Hence as per the desired requirement, the optimal stock level will be maintained by setting or changing the priority levels in the optimization procedure. Supply chain model is broadly divided into four stages in which the optimization is going to be performed. The supply chain model is illustrated in the Fig: 3.3. Fig: 3.3 Four stage supply chain model

14 85 Now, the particle Swarm Optimization (PSO) is utilized to predict the optimal stock levels to be maintained in the future so as to minimize the supply chain cost. The steps involved in determining the optimal stock levels are illustrated in Fig: 3.4 Fig: 3.4 Particle swarm optimization in optimizing the stock levels

15 LIMITATIONS Inventory at unit levels is considered instead of cost levels to maintain generalization of the approach. Usually the inventory cost of a unit is expressed as a percentage of the unit price which will vary from one product to another. Though there are many costs like transaction cost, transportation cost, facility cost, information cost etc., inventory cost is contributing maximum towards total supply chain cost. So by taking care of the emerging excess/shortage inventory levels in the forthcoming period, the inventory cost can be minimized and thus the total supply chain cost. The algorithms are not implemented by different meta heuristic techniques for comparison but instead implemented by popular techniques found suitable for the purpose. Similarly different types of cross over operators or mutation operators are not attempted in this study and again the popular operators of each one of them is chosen for implementation of GA. The algorithm and the technique is applied on the simulated data set to maintain generality of the approach and is not confined to any particular company/industry/product. These areas provide ample scope for prospective future researchers in the area of supply chain inventory optimization.

16 CONCLUDING REMARKS A brief overview of two popular Meta heuristics GA and PSO together with the advantages of the same is presented in this chapter. Also the methodology of these two methods to predict the optimal stock levels to facilitate optimal inventory to be maintained in the supply chain in the future to minimize the supply chain cost is illustrated. In addition, the limitations of the proposed research work have also been outlined.

Applying Computational Intelligence in Software Testing

Applying Computational Intelligence in Software Testing www.stmjournals.com Applying Computational Intelligence in Software Testing Saumya Dixit*, Pradeep Tomar School of Information and Communication Technology, Gautam Buddha University, Greater Noida, India

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

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

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

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

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

CHAPTER 4 PROPOSED HYBRID INTELLIGENT APPROCH FOR MULTIPROCESSOR SCHEDULING

CHAPTER 4 PROPOSED HYBRID INTELLIGENT APPROCH FOR MULTIPROCESSOR SCHEDULING 79 CHAPTER 4 PROPOSED HYBRID INTELLIGENT APPROCH FOR MULTIPROCESSOR SCHEDULING The present chapter proposes a hybrid intelligent approach (IPSO-AIS) using Improved Particle Swarm Optimization (IPSO) with

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

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

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

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

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

Improving Differential Evolution Algorithm with Activation Strategy

Improving Differential Evolution Algorithm with Activation Strategy 2009 International Conference on Machine Learning and Computing IPCSIT vol.3 (2011) (2011) IACSIT Press, Singapore Improving Differential Evolution Algorithm with Activation Strategy Zhan-Rong Hsu 1, Wei-Ping

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

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

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

Optimizing Dynamic Flexible Job Shop Scheduling Problem Based on Genetic Algorithm

Optimizing Dynamic Flexible Job Shop Scheduling Problem Based on Genetic Algorithm International Journal of Current Engineering and Technology E-ISSN 2277 4106, P-ISSN 2347 5161 2017 INPRESSCO, All Rights Reserved Available at http://inpressco.com/category/ijcet Research Article Optimizing

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

COMBINED-OBJECTIVE OPTIMIZATION IN IDENTICAL PARALLEL MACHINE SCHEDULING PROBLEM USING PSO

COMBINED-OBJECTIVE OPTIMIZATION IN IDENTICAL PARALLEL MACHINE SCHEDULING PROBLEM USING PSO COMBINED-OBJECTIVE OPTIMIZATION IN IDENTICAL PARALLEL MACHINE SCHEDULING PROBLEM USING PSO Bathrinath S. 1, Saravanasankar S. 1 and Ponnambalam SG. 2 1 Department of Mechanical Engineering, Kalasalingam

More information

CEng 713 Evolutionary Computation, Lecture Notes

CEng 713 Evolutionary Computation, Lecture Notes CEng 713 Evolutionary Computation, Lecture Notes Introduction to Evolutionary Computation Evolutionary Computation Elements of Evolution: Reproduction Random variation Competition Selection of contending

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

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

What is Genetic Programming(GP)?

What is Genetic Programming(GP)? Agenda What is Genetic Programming? Background/History. Why Genetic Programming? How Genetic Principles are Applied. Examples of Genetic Programs. Future of Genetic Programming. What is Genetic Programming(GP)?

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

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

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

SWARM-BASED OPTIMISATION

SWARM-BASED OPTIMISATION KVALITA INOVÁCIA PROSPERITA / QUALITY INNOVATION PROSPERITY XIII/1 2009 45 SWARM-BASED OPTIMISATION LENKA RAUDENSKÁ 1 INTRODUCTION Swarm intelligence is based on nature-inspired behaviour and is successfully

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

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

Supplemental Digital Content. A new severity of illness scale using a subset of APACHE data elements shows comparable predictive accuracy

Supplemental Digital Content. A new severity of illness scale using a subset of APACHE data elements shows comparable predictive accuracy Supplemental Digital Content A new severity of illness scale using a subset of APACHE data elements shows comparable predictive accuracy Alistair E. W. Johnson, BS Centre for Doctoral Training in Healthcare

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

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

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

A HYBRID GENETIC ALGORITHM FOR JOB SHOP SCHEUDULING

A HYBRID GENETIC ALGORITHM FOR JOB SHOP SCHEUDULING A HYBRID GENETIC ALGORITHM FOR JOB SHOP SCHEUDULING PROF. SARVADE KISHORI D. Computer Science and Engineering,SVERI S College Of Engineering Pandharpur,Pandharpur,India KALSHETTY Y.R. Assistant Professor

More information

PARALLEL LINE AND MACHINE JOB SCHEDULING USING GENETIC ALGORITHM

PARALLEL LINE AND MACHINE JOB SCHEDULING USING GENETIC ALGORITHM PARALLEL LINE AND MACHINE JOB SCHEDULING USING GENETIC ALGORITHM Dr.V.Selvi Assistant Professor, Department of Computer Science Mother Teresa women s University Kodaikanal. Tamilnadu,India. Abstract -

More information

Foundations of Artificial Intelligence

Foundations of Artificial Intelligence Foundations of Artificial Intelligence 21. Combinatorial Optimization: Advanced Techniques Malte Helmert University of Basel April 9, 2018 Combinatorial Optimization: Overview Chapter overview: combinatorial

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

Metaheuristics. Approximate. Metaheuristics used for. Math programming LP, IP, NLP, DP. Heuristics

Metaheuristics. Approximate. Metaheuristics used for. Math programming LP, IP, NLP, DP. Heuristics Metaheuristics Meta Greek word for upper level methods Heuristics Greek word heuriskein art of discovering new strategies to solve problems. Exact and Approximate methods Exact Math programming LP, IP,

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

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

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

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

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

GENETIC ALGORITHM A NOBLE APPROACH FOR ECONOMIC LOAD DISPATCH

GENETIC ALGORITHM A NOBLE APPROACH FOR ECONOMIC LOAD DISPATCH International Journal of Engineering Research and Applications (IJERA) ISSN: 48-96 National Conference on Emerging Trends in Engineering & Technology (VNCET-30 Mar 1) GENETIC ALGORITHM A NOBLE APPROACH

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

Mrs. Shahana Gajala Qureshi 1, Mrs. Uzma Arshi Ansari 2

Mrs. Shahana Gajala Qureshi 1, Mrs. Uzma Arshi Ansari 2 IOSR Journal of Computer Engineering (IOSRJCE) ISSN: 2278-0661 Volume 4, Issue 1 (Sep-Oct. 2012), PP 06-13 An efficient and powerful advanced algorithm for solving real coded numerical optimization problem:

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

Multi-product inventory optimization in a multiechelon supply chain using Genetic Algorithm

Multi-product inventory optimization in a multiechelon supply chain using Genetic Algorithm Multi-product inventory optimization in a multiechelon supply chain using Genetic Algorithm T.V.S.R.K.Prasad 1, Sk.Abdul Saleem 3, C.Srinivas 2,Kolla srinivas 4 1 Associate Professor, 3 Assistant Professor,

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

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

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

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

A Genetic Algorithm for Order Picking in Automated Storage and Retrieval Systems with Multiple Stock Locations

A Genetic Algorithm for Order Picking in Automated Storage and Retrieval Systems with Multiple Stock Locations IEMS Vol. 4, No. 2, pp. 36-44, December 25. A Genetic Algorithm for Order Picing in Automated Storage and Retrieval Systems with Multiple Stoc Locations Yaghoub Khojasteh Ghamari Graduate School of Systems

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

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

A Simulation-based Multi-level Redundancy Allocation for a Multi-level System

A Simulation-based Multi-level Redundancy Allocation for a Multi-level System International Journal of Performability Engineering Vol., No. 4, July 205, pp. 357-367. RAMS Consultants Printed in India A Simulation-based Multi-level Redundancy Allocation for a Multi-level System YOUNG

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

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

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

MINIMIZE THE MAKESPAN FOR JOB SHOP SCHEDULING PROBLEM USING ARTIFICIAL IMMUNE SYSTEM APPROACH

MINIMIZE THE MAKESPAN FOR JOB SHOP SCHEDULING PROBLEM USING ARTIFICIAL IMMUNE SYSTEM APPROACH MINIMIZE THE MAKESPAN FOR JOB SHOP SCHEDULING PROBLEM USING ARTIFICIAL IMMUNE SYSTEM APPROACH AHMAD SHAHRIZAL MUHAMAD, 1 SAFAAI DERIS, 2 ZALMIYAH ZAKARIA 1 Professor, Faculty of Computing, Universiti Teknologi

More information

Structured System Analysis Methodology for Developing a Production Planning Model

Structured System Analysis Methodology for Developing a Production Planning Model Structured System Analysis Methodology for Developing a Production Planning Model Mootaz M. Ghazy, Khaled S. El-Kilany, and M. Nashaat Fors Abstract Aggregate Production Planning (APP) is a medium term

More information

Fig Flowchart of bacterial evolutionary algorithm

Fig Flowchart of bacterial evolutionary algorithm Activity: Draw the flowchart of bacterial evolutionary algorithm Explain the two bacterial operators with your own words Draw the figure of the two bacterial operators The original Genetic Algorithm (GA)

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

Multi-objective Evolutionary Optimization of Cloud Service Provider Selection Problems

Multi-objective Evolutionary Optimization of Cloud Service Provider Selection Problems Multi-objective Evolutionary Optimization of Cloud Service Provider Selection Problems Cheng-Yuan Lin Dept of Computer Science and Information Engineering Chung-Hua University Hsin-Chu, Taiwan m09902021@chu.edu.tw

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

Automated Test Case Generation: Metaheuristic Search

Automated Test Case Generation: Metaheuristic Search Automated Test Case Generation: Metaheuristic Search CSCE 747 - Lecture 21-03/29/2016 Testing as a Search Problem Do you have a goal in mind when testing? Can that goal be measured? Then you are searching

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

Comp215: Genetic Algorithms - Part 1

Comp215: Genetic Algorithms - Part 1 Comp215: Genetic Algorithms - Part 1 Mack Joyner, Dan S. Wallach (Rice University) Copyright 2016, Mack Joyner, Dan S. Wallach. All rights reserved. Darwin s Theory of Evolution Individual organisms differ

More information

A Study on Transportation Algorithm of Bi-Level Logistics Nodes Based on Genetic Algorithm

A Study on Transportation Algorithm of Bi-Level Logistics Nodes Based on Genetic Algorithm A Study on Transportation Algorithm of Bi-Level Logistics Nodes Based on Genetic Algorithm Jiacheng Li 1 and Lei Li 1 1 Faculty of Science and Engineering, Hosei University, Tokyo, Japan Abstract: To study

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

A Tabu Genetic algorithm with Search Area Adaptation for the Job-Shop Scheduling Problem

A Tabu Genetic algorithm with Search Area Adaptation for the Job-Shop Scheduling Problem Proceedings of the 6th WSEAS Int. Conf. on Artificial Intelligence, Knowledge Engineering and Data Bases, Corfu Island, Greece, February 16-19, 2007 76 A Tabu Genetic algorithm with Search Area Adaptation

More information

TOLERANCE ALLOCATION OF MECHANICAL ASSEMBLIES USING PARTICLE SWARM OPTIMIZATION

TOLERANCE ALLOCATION OF MECHANICAL ASSEMBLIES USING PARTICLE SWARM OPTIMIZATION 115 Chapter 6 TOLERANCE ALLOCATION OF MECHANICAL ASSEMBLIES USING PARTICLE SWARM OPTIMIZATION This chapter discusses the applicability of another evolutionary algorithm, named particle swarm optimization

More information

An Adaptive Immune System Applied to Task Scheduling on NOC

An Adaptive Immune System Applied to Task Scheduling on NOC 3rd International Conference on Electric and Electronics (EEIC 2013) An Adaptive Immune System Applied to Task Scheduling on NOC Wei Gao, Yubai Li, Song Chai, Jian Wang School of Commutation and Information

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

A systematic review of bio-inspired service concretization

A systematic review of bio-inspired service concretization University of Wollongong Research Online Faculty of Engineering and Information Sciences - Papers: Part A Faculty of Engineering and Information Sciences 2014 A systematic review of bio-inspired service

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

CONTROL OF PITCH ANGLES TO OPTIMIZE THE AERODYNAMIC USING PARTICLE SWARM OPTIMIZATION

CONTROL OF PITCH ANGLES TO OPTIMIZE THE AERODYNAMIC USING PARTICLE SWARM OPTIMIZATION CONTROL OF PITCH ANGLES TO OPTIMIZE THE AERODYNAMIC USING PARTICLE SWARM OPTIMIZATION BELGHAZI OUISSAM, DOUIRI MOULAY RACHID CHERKAOUI MOHAMED Abstract The main objective of this paper is to maximize the

More information

Gene Fragment Programming Master thesis

Gene Fragment Programming Master thesis Gene Fragment Programming Master thesis Piotr Holubowicz October 17, 2008 Promotor: dr hab. inż. Krzysztof Krawiec Poznań University of Technology, Faculty of Management and Computing, Institute of Computer

More information

A Particle Swarm Optimization Approach for Workflow Scheduling on Cloud Resources Priced by CPU Frequency

A Particle Swarm Optimization Approach for Workflow Scheduling on Cloud Resources Priced by CPU Frequency A Particle Swarm Optimization Approach for Workflow Scheduling on Cloud Resources Priced by CPU Frequency Thiago A. L. Genez, Ilia Pietri, Rizos Sakellariou, Luiz F. Bittencourt and Edmundo R. M. Madeira

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

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

An Effective Genetic Algorithm for Large-Scale Traveling Salesman Problems

An Effective Genetic Algorithm for Large-Scale Traveling Salesman Problems An Effective Genetic Algorithm for Large-Scale Traveling Salesman Problems Son Duy Dao, Kazem Abhary, and Romeo Marian Abstract Traveling salesman problem (TSP) is an important optimization problem in

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

Implementation of CSP Cross Over in Solving Travelling Salesman Problem Using Genetic Algorithms

Implementation of CSP Cross Over in Solving Travelling Salesman Problem Using Genetic Algorithms Implementation of CSP Cross Over in Solving Travelling Salesman Problem Using Genetic Algorithms Karishma Mendiratta #1, Ankush Goyal *2 #1 M.Tech. Scholar, *2 Assistant Professor, Department of Computer

More information

L R m. Bibliographic Information. Copyright Information. Contact Information

L R m. Bibliographic Information. Copyright Information. Contact Information L R m Laboratory for Responsible Manufacturing Bibliographic Information Ilgin, M. A. and Gupta, S. M., "The Effect of Disassembly Process on Spare Parts Inventory Management in Post Product Life Cycle",

More information

Chapter 6 Evolutionary Computation and Evolving Connectionist Systems

Chapter 6 Evolutionary Computation and Evolving Connectionist Systems Chapter 6 Evolutionary Computation and Evolving Connectionist Systems Prof. Nik Kasabov nkasabov@aut.ac.nz http://www.kedri.info 12/16/2002 Nik Kasabov - Evolving Connectionist Systems Overview Evolutionary

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

The Impact of Population Size on Knowledge Acquisition in Genetic Algorithms Paradigm: Finding Solutions in the Game of Sudoku

The Impact of Population Size on Knowledge Acquisition in Genetic Algorithms Paradigm: Finding Solutions in the Game of Sudoku The Impact of Population Size on Knowledge Acquisition in Genetic Algorithms Paradigm: Finding Solutions in the Game of Sudoku Nordin Abu Bakar, Muhammad Fadhil Mahadzir Faculty of Computer & Mathematical

More information

A Gene Based Adaptive Mutation Strategy for Genetic Algorithms

A Gene Based Adaptive Mutation Strategy for Genetic Algorithms A Gene Based Adaptive Mutation Strategy for Genetic Algorithms Sima Uyar, Sanem Sariel, and Gulsen Eryigit Istanbul Technical University, Electrical and Electronics Faculty Department of Computer Engineering,

More information

AGGREGATE PRODUCTION PLANNING OF WOODEN TOYS USING MODIFIED PARTICLE SWARM OPTIMIZATION

AGGREGATE PRODUCTION PLANNING OF WOODEN TOYS USING MODIFIED PARTICLE SWARM OPTIMIZATION ISSN : 1978-774X Proceeding of 9 th International Seminar on Industrial Engineering and Management AGGREGATE PRODUCTION PLANNING OF WOODEN TOYS USING MODIFIED PARTICLE SWARM OPTIMIZATION, Syarif Hidayat

More information

Prof. Prakash Girwal Dept of Mechanical Engineering VITM Indor,India

Prof. Prakash Girwal Dept of Mechanical Engineering VITM Indor,India Improvement Productivity in Balancing Assembly Line by using Pso Algorithm M.Tech.Scholar Nikhil Porwal Dept of Mechanical Engineering VITM Indor,India Prof. Prakash Girwal Dept of Mechanical Engineering

More information

Using Multi-chromosomes to Solve. Hans J. Pierrot and Robert Hinterding. Victoria University of Technology

Using Multi-chromosomes to Solve. Hans J. Pierrot and Robert Hinterding. Victoria University of Technology Using Multi-chromosomes to Solve a Simple Mixed Integer Problem Hans J. Pierrot and Robert Hinterding Department of Computer and Mathematical Sciences Victoria University of Technology PO Box 14428 MCMC

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

Swarm Intelligence (SI) for Decision Support of Operations Management Methods and Applications

Swarm Intelligence (SI) for Decision Support of Operations Management Methods and Applications Swarm Intelligence (SI) for Decision Support of Operations Management Methods and Applications Dr. Yi Wang The University of Manchester, Department of engineering and physics, School of materials Oxford

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

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

Designing a New Particle Swarm Optimization for Make-with-Buy Inventory Model

Designing a New Particle Swarm Optimization for Make-with-Buy Inventory Model Proceedings of the 14 International Conference on Industrial Engineering and Operations Management Bali, Indonesia, January 7 9, 14 Designing a New Particle Swarm Optimization for Make-with-Buy Inventory

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

Genetic approach to solve non-fractional knapsack problem S. M Farooq 1, G. Madhavi 2 and S. Kiran 3

Genetic approach to solve non-fractional knapsack problem S. M Farooq 1, G. Madhavi 2 and S. Kiran 3 Genetic approach to solve non-fractional knapsack problem S. M Farooq 1, G. Madhavi 2 and S. Kiran 3 1,2,3 Y. S. R Engineering College, Yogi Vemana University Korrapad Road, Proddatur 516360, India 1 shaikfaroq@gmail.com,

More information