A METAEVOLUTIONARY APPROACH IN SEARCHING OF THE BEST COMBINATION OF CROSSOVER OPERATORS FOR THE TSP
|
|
- Phoebe Briggs
- 6 years ago
- Views:
Transcription
1 A METAEOLTIONAY AOAC IN SEACING OF TE BEST COMBINATION OF COSSOE OEATOS FO TE TS MAJAN MENI, MATEJ ý5(3,1â(.iljem ä80(5 niversity of Maribor Faculty of Electrical Engineering and Computer Science Smetanova 17, 2000 Maribor, Slovenia {marjan.mernik, matej.crepinsek, Abstract In the paper the metaevolutionary approach in searching of the best combination of crossover operators for traveling salesman problem is described. Since different crossover operators preserve different useful properties the combination of operators may out-perform single operator. ather than randomly search for best combination of crossover operators the metaevolutionary approach is used. reliminary results confirm this hypothesis. eywords evolution algorithm, genetic algorithm, traveling salesman problem, metaevolutionary approach 1. Introduction Evolution algorithm [Bäck 1996, Michalewicz 1996] is a search and optimization technique based on the principles and mechanisms of natural selection and survival of the fittest. Evolution algorithms (genetic algorithm, evolution strategies, evolutionary programming, and genetic programming) have been successfully used in a wide variety of combinatorial optimization problems such as boolean satisfiability problem, traveling salesman problem, scheduling problems, etc. Generally, the evolution algorithm consists of three genetic operators: selection, crossover, and mutation. The selection operator uses fitness values to select individuals that will be parents of the next generation. arent individuals are mated and used to produce offspring by the crossover and mutation operators. It is widely recognized, that the crossover operator has a great influence on performance of evolution algorithms. For the traveling salesman problem many crossover operators, such as MX, OX, CX, EX, SSX, DX, CSEX have been proposed. The question is which of the proposed crossover operator is superior to others and if combination of operators is superior to single operator. To answer this question we used a metaevolutionary approach. The basic idea of metaevolutionary approach is to consider the search for the best evolutionary algorithm as an optimization problem and use another evolutionary algorithm to solve it. In other words, to determine the best evolutionary algorithms, that means to determine the best evolutionary operators and their parameters settings such as: population size, the crossover probability, and the mutation probability, another evolutionary algorithm is used. This paper is organized as follows. In the section 2 the traveling salesman problem is described. The metaevolutionary approach in searching of the best combination of crossover operators for traveling salesman problem is described in section 3. esults and conclusions are presented in section 4 and Traveling salesman problem (TS) The objective of the traveling salesman problem is to find the shortest amiltonian path or cycle in a complete graph of N-nodes. The size of the search space of the traveling salesman problem is N! This problem is a classic example of an N-hard problem. In the case when N is very large, it is important to have approximation algorithms that can find near-optimal or optimal solution within reasonable computation times. For the traveling salesman problem many approximation algorithms, such as the 2-opt, 3-opt, randomized arbitrary insertion [Brest 1999] and other approximation approaches such as simulated annealing, tabu search, ant colony, neural networks and evolutionary algorithms, have been proposed. In this paper only genetic algorithm for traveling salesman problem has been investigated. Standard genetic algorithm assume that the problem can be represented as a binary string. This allowed us to use binary mutation and crossover. owever, this is not a case for traveling salesman problem. There is no practical way to encode a traveling salesman problem as a binary string that does not require some sort of repair algorithm. To solve this problem some variation on standard genetic crossover must be used. Therefore, several other more suitable representations for chromosomes have been developed such as vector and matrix representation. ector representation can be further divided into adjacency, ordinal and path representation. Each of these representations has its own crossover operators. Among
2 these representations the path representation is the most natural and successful. For path representation many different crossover operators have been proposed such as partially mapped crossover (MX), order crossover (OX), cycle crossover (CX), and edge recombination crossover (EX). The MX operator [Goldberg 1985] builds an offspring by choosing a subsequence of a tour from one parent and preserving the order and position of as many cities as possible from the other parent. The OX operator [Oliver 1987] builds an offspring by choosing a subsequence of a tour from one parent and preserving the relative order of cities from the other parent. The CX operator [Oliver 1987] builds an offspring in such a way that each city and its position come from one of the parents. The EX operator [Whitley 1989] builds an offspring preserving edges from both parents. After this initial crossover operators many new and modified operators which out-perform above operators have been developed such as SSX, DX, CSEX. In this study we are looking for the best combination of crossover operators for traveling salesman problem among MX, OX, CX, and EX operators. In [Oliver 1987] authors reported that among MX, OX and CX operators for traveling salesman problem the best performance was achieved by OX, followed by MX, with CX as the poorest among them. Further, in [Whitley 1989] authors reported that the EX operator out-performs above three operators. Before, we start with this study the performances of these operators have already been known. Since the quest for an evolution program for the traveling salesman problem, which would include the best representation and best genetic operators is still going on [Michalewicz 1996], our idea was that some combinations of these operators may out-perform single operator. ather than randomly search for best combination of crossover operators we decided to use metaevolutionary approach. 3. Metaevolutionary approach It has long been acknowledged that the parameters that control an evolution algorithm can have significant impact on its performance. Therefore, the designer of evolutionary algorithm has a problem with deciding what operators and control parameters settings are likely to produce best results. esearchers usually used experience from previous similar application scenarios. A more promising approach is to consider the search for the best evolutionary algorithm for a given problem as an optimization problem itself which can be solved by evolutionary algorithm, leading to metaevolutionary approach. Several metaevolutionary approaches have already been proposed. In [Grefenstette 1986] the metaevolutionary approach was used to determine population size, crossover probability, mutation rate, generation gap, scaling window, and selection strategy. In [Freisleben 1993] the metaevolutionary approach was used to determine a large set of 20 components of genetic algorithm for traveling salesman problem, divided into decisions (selection method, elitist model, crossover method, mutation method, etc) and parameters (population size, crossover probability, mutation probability, etc). The crossover method can be chosen between MX, CX and OX operators. The OX operator clearly out-perform MX and CX operators. The experiment [Freisleben 1993] show that the choice of crossover method is far less significant than the choice of the mutation method or the use of the elitist model. To our knowledge none of the previous (meta)evolutionary approaches were used to determine the best combination of crossover operators for the traveling salesman problem. The pseudocode which we used for evolutionary algorithm that implements metaevolutionary approach is given in fig. 1. In metaevolutionary approach two populations exists: a meta-level population and a base-level population (fig. 2). Both populations undergo evolutionary process. owever, the base-level population undergo evolutionary process which is controlled by meta-level population. arameters needed for evolutionary process can be encoded in the meta-level population such as: population size, crossover probability, mutation probability, crossover operators, etc. Since in our case the goal is to determine the best combination of crossover operators for traveling salesman problem, a chromosome of meta-level population determine which crossover operators, chosen from MX, OX, CX and EX operators, are going to be applied to base-level population. For example in the chromosome ABDD of meta-level population the following information is encoded. In the first generation the MX operator, in the second generation the OX operator and in the last two generations the EX operator are going to be applied. Therefore, the number of generations for base-level population define also the length of a chromosome in a meta-level population, while the length of chromosome in a base-level is determined by the number of cities which traveling salesman has to visit. The fitness of the best chromosome of base-level population in the entire run is taken to be the fitness of the chromosome in meta-level population. Other parameters of evolutionary process: population size (pop_size_ml, pop_size_bl), number of generations (G_ml, G_bl), crossover probability (pc_ml, pc_bl) and mutation probability (pm_ml, pm_bl) are defined separately for both populations. For solving traveling salesman problem with metaevolutionary approach a tool METATSGA is developed, where users can define parameters for evolutionary process, select a traveling salesman problem from the TSLIB library [einelt 1991], and define parameters for reports. In the tool METATSGA also graphical presentation of previously best known solution from TSLIB and founded solution are presented.
3 procedure Meta_Evolutionary_Algorithm t_ml 0 0_bl initialize _bl // base-level population initialize _ml(t_ml) // meta-level population while (not ml_termination-condition) do //evaluate _ml(t_ml) t_bl 0 _bl(t_bl) 0_bl evaluate _bl(t_bl) while (not bl_termination-condition) do t_bl t_bl + 1 select _bl(t_bl) from _bl(t_bl-1) alter _bl(t_bl, _ml(t_ml)) evaluate _bl(t_bl) // evaluate _ml(t_ml) t_ml t_ml + 1 select _ml(t_ml) from _ml(t_ml-1) alter _ml(t_ml) Fig.1. Evolutionary algorithm which implements metaevolutionary approach WDÃÃOYO E parameters for meta - level : pop_size _ml G_ml pc_ml pm_ml number of crossover operators meta GA Control WDÃÃOYOÃSSXODWLQ YDOXDWLQ A A A... A A B B B... B B B D D... A B Ã*Q ILWQ Ã$ÃÃ30; Ã%ÃÃ2; Ã&ÃÃ&; Ã'ÃÃ(5; OQJWÃFÃ Ã*BE, Objective function meta - level = crossover method parameters for base - level pop_size _bl G_bl pc_bl pm_bl E GA &QWO EDÃÃOYOÃÃSSXODWLQ ÃÃÃÃÃÃÃÃÃÃFDSLWDOÃIÃWÃ(XS ÃÃÃÃÃÃÃÃÃÃÃÃÃÃÃÃFLWLÃÃ$ÃÃ. A E I J G D F B C E J C D F B A G I YDOXDWLQ ILWQ Objective function base - level EDÃÃOYO Fig. 2. Base-level and meta-level populations for traveling salesman problem
4 4. esults The proposed metaevolutionary approach is very flexible and enable us to test different scenarios in a single framework. Different scenarios (a-d) are achieved simply by appropriate settings of parameters for metalevel population, where number of generation is 0 means just initial random generation. The following experiments were performed: a) single run of genetic algorithm b) multiple runs of genetic algorithm c) searching for the best combination of crossover operators by random search d) searching for the best combination of crossover operators by evolutionary approach. Since the metaevolutionary approach require high amount of computation time we tested very small traveling salesman problems (11 and 48 cities). esults show that applying different crossover operators in different generations are better then applying single crossover operator all the time. The explanation of this is very intuitive since different crossover operators preserve different properties, which could be very useful for search in different directions in the problem space. While the MX operator preserves the order and positions, the OX operator preserves the relative order, and CX operator preserves the absolute positions, the EX operator preserves the edges. From table 1 and 2 (scenarios a and b) and fig. 3 we can notice that EX and OX operators out-perform MX and CX operators. Similar results were obtained from other experiments [Oliver 1987, Whitley 1989, Freisleben 1993]. Surprisingly random combination of crossover operators have better performance than MX and CX operators (table 2 scenario c). For small problems (11 cities) random combination even out-perform EX and OX operators (table 1, scenario c). When combination of crossover operators is tuning by evolutionary process (table 1 and 2, scenario d), such combination clearly outperform all included crossover operators (MX, CX, OX, EX). The best chromosome in base-level population is obtained when chromosome in meta-level have much more occurrences of EX and OX operators than MX and CX operators (14 occurrences of MX, 20 occurrences of OX, 14 occurrences of CX, and 27 occurrences of EX). This findings found by evolutionary process also confirm that EX and OX operators are better than MX and CX operators. owever, there is still need for MX and CX operators for searching in different directions. From table 1 (scenario a) we can notice that the best chromosome is found very early, in generations between 17 and 28. After that, the search was going in wrong directions and no better chromosome was found. This is another evidence, that we need search in other directions too. By combination of crossover operators (table 1, scenario c and d) the exact solution is found by random combination in 47 th generation and in 14 th generation by evolutionary combination. Further, more than 200 different test were performed, where different parameters are used: pc_bl: 0% to 100% by 10%, pm_bl: 0% to 10% by 1%, pop_size_bl: 50 do 125 by 25, G_bl:50 to 250 by 25. In table 3 the best results from different test are presented and again the best result is achieved with evolutionary combination of operators. 5. Conclusions In this paper an experimental study on determining the best combination of crossover operators among MX, OX, CX and EX for traveling salesman problem is presented. The proposed approach was based on the idea that some combinations of crossover operators may outperform single operator. ather to random search for best combination of crossover operators the metaevolutionary approach is used. esults show that applying different crossover operators in different generations are better then applying single crossover operator all the time. The explanation of this is very intuitive since different crossover operators preserve different properties, which could be very useful for search in different directions in the problem space. eferences [Bäck 1996] Bäck T., Fogel D.B., Michalewicz Z. andbook of Evolutionary Computations. niversity Oxford ress, New York, %W - äyqln - $Q $SS[LDWLQ Algorithm for the Asymmetric Traveling Salesman roblem. icerca Operativa, vol. 28, pp , [Freisleben 1993] Freisleben B., ärtfelder M. In search of the best genetic algorithm for the traveling salesman problem. roceedings of 9 th International Conference on Control Systems and Computer Science, Bucharest, pp , [Goldberg 1985] Goldberg D.E., Lingle. Alleles, Loci, and the TS. roceedings of the First International Conference on Genetic Algorithms, pp , [Grefenstette 1986] Grefenstette J.J. Optimization of Control arameters for Genetic Algorithms. IEEE Transactions on Systems, Man & Cybernetics SMC-16, No. 1, pp , [Michalewicz 1996] Michalewicz Z. Genetic Algorithms + Data Structures = Evolution rograms. Third Edition. Springer-erlag, [Oliver 1987] Oliver I.M., Smith D.J., olland J..C. A Study of ermutation Crossover Operators on the Traveling Salesman roblem. roceedings of the Second International Conference on Genetic Algorithms, pp , [einelt 1991] einelt G. TSLIB a Traveling Salesman roblem Library. European Journal of Operations esearch, ol. 52, pp. 125, [Whitley 1989] Whitley D., Starkweather T., Fuquay D'A. Scheduling roblems and Traveling Salesman: The Genetic Edge ecombination Operator. roceedings of the Third International Conference on Genetic Algorithms pp , 1989.
5 Table 1: Fitness of the best chromosomes and their generations (11 cities, pop_size_bl=100, G_bl=50, pc_bl=60%, pm_bl=5%) scenario a) scenario b) scenario c) scenario d) G_bl fitness G_bl fitness G_bl fitness G_bl fitness MX OX CX EX combination Table 2: Fitness of the best chromosomes and their generations (48 cities, pop_size_bl=100, G_bl=75, pc_bl=60%, pm_bl=5%) scenario a) scenario b) scenario c) scenario d) G_bl fitness G_bl fitness G_bl fitness G_bl fitness MX OX CX EX combination Table 3: Best results from different tests (48 cities) pc_bl pm_bl pop_size_bl G_bl pop_size_ml G_ml fitness MX 60% 5% OX 100% 7% CX 100% 10% EX 70% 3% random combin. 100% 3% evol. combin. 70% 5% ÃE IÃW Ã ILWQ 30; 2; &; (5; FÃFQDL GÃFQDL *QDWLQ Fig 3: The comparison of scenarios b, c and d for 48 cities (table 2)
Logistics. Final exam date. Project Presentation. Plan for this week. Evolutionary Algorithms. Crossover and Mutation
Logistics Crossover and Mutation Assignments Checkpoint -- Problem Graded -- comments on mycourses Checkpoint --Framework Mostly all graded -- comments on mycourses Checkpoint -- Genotype / Phenotype Due
More informationThe 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 informationA Comparison of Recombination Operators for Capacitate Vehicle Routing Problem. Abstract
A Comparison of Recombination Operators for Capacitate Vehicle Routing Problem Graglia P. 1, Stark N. 2, Salto C. 2, Alfonso H. 2 Laboratorio de Investigación en Sistemas Inteligentes Facultad de Ingeniería
More informationGENETIC 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 informationImplementation of Genetic Algorithm for Agriculture System
Implementation of Genetic Algorithm for Agriculture System Shweta Srivastava Department of Computer science Engineering Babu Banarasi Das University,Lucknow, Uttar Pradesh, India Diwakar Yagyasen Department
More informationEvolutionary 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 informationCEng 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 informationMachine 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 informationMachine 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 informationA Study of Crossover Operators for Genetic Algorithms to Solve VRP and its Variants and New Sinusoidal Motion Crossover Operator
International Journal of Computational Intelligence Research ISSN 0973-1873 Volume 13, Number 7 (2017), pp. 1717-1733 Research India Publications http://www.ripublication.com A Study of Crossover Operators
More informationIMPLEMENTATION 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 informationWhat 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 informationChanging Mutation Operator of Genetic Algorithms for optimizing Multiple Sequence Alignment
International Journal of Information and Computation Technology. ISSN 0974-2239 Volume 3, Number 11 (2013), pp. 1155-1160 International Research Publications House http://www. irphouse.com /ijict.htm Changing
More informationComputational Intelligence Lecture 20:Intorcution to Genetic Algorithm
Computational Intelligence Lecture 20:Intorcution to Genetic Algorithm Farzaneh Abdollahi Department of Electrical Engineering Amirkabir University of Technology Fall 2012 Farzaneh Abdollahi Computational
More informationIntro. 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 informationGenetic Algorithms. Part 3: The Component of Genetic Algorithms. Spring 2009 Instructor: Dr. Masoud Yaghini
Genetic Algorithms Part 3: The Component of Genetic Algorithms Spring 2009 Instructor: Dr. Masoud Yaghini Outline Genetic Algorithms: Part 3 Representation of Individuals Mutation Recombination Population
More informationGenetic 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 informationTIMETABLING 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 informationA 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 informationVISHVESHWARAIAH 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 informationGenetic Algorithm. Presented by Shi Yong Feb. 1, 2007 Music McGill University
Genetic Algorithm Presented by Shi Yong Feb. 1, 2007 Music Tech @ McGill University Outline Background: Biological Genetics & GA Two Examples Some Applications Online Demos* (if the time allows) Introduction
More informationGENETIC 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 informationIntroduction 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 informationEvolutionary 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 informationA Novel Genetic Algorithm Based on Immunity
552 IEEE TRANSACTIONS ON SYSTEMS, MAN, AND CYBERNETICS PART A: SYSTEMS AND HUMANS, VOL. 30, NO. 5, SEPTEMBER 2000 A Novel Genetic Algorithm Based on Immunity Licheng Jiao, Senior Member, IEEE, and Lei
More information10. 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 informationFacePrints, Maze Solver and Genetic algorithms
Machine Learning CS579 FacePrints, Maze Solver and Genetic algorithms by Jacob Blumberg Presentation Outline Brief reminder genetic algorithms FacePrints a system that evolves faces Improvements and future
More informationIntelligent 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 informationEvolutionary Algorithms - Introduction and representation Jim Tørresen
INF3490 - Biologically inspired computing Lecture 2: Eiben and Smith, chapter 1-4 Evolutionary Algorithms - Introduction and representation Jim Tørresen Evolution Biological evolution: Lifeforms adapt
More informationPARALLEL 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 informationTRAINING FEED FORWARD NEURAL NETWORK USING GENETIC ALGORITHM TO PREDICT MEAN TEMPERATURE
IJRRAS 29 (1) October 216 www.arpapress.com/volumes/vol29issue1/ijrras_29_1_3.pdf TRAINING FEED FORWARD NEURAL NETWORK USING GENETIC ALGORITHM TO PREDICT MEAN TEMPERATURE Manal A. Ashour 1,*, Somia A.
More informationHybridization of Genetic Algorithm and Neural Network for Optimization Problem
Hybridization of Genetic Algorithm and Neural Network for Optimization Problem Gaurang Panchal, Devyani Panchal Abstract The use of both, genetic algorithms and artificial neural networks, were originally
More informationEvolutionary Algorithms and Simulated Annealing in the Topological Configuration of the Spanning Tree
Evolutionary Algorithms and Simulated Annealing in the Topological Configuration of the Spanning Tree A. SADEGHEIH Department of Industrial Engineering University of Yazd, P.O.Box: 89195-741 IRAN, YAZD
More informationA Comparison between Genetic Algorithms and Evolutionary Programming based on Cutting Stock Problem
Engineering Letters, 14:1, EL_14_1_14 (Advance online publication: 12 February 2007) A Comparison between Genetic Algorithms and Evolutionary Programming based on Cutting Stock Problem Raymond Chiong,
More informationA Viral Systems Algorithm for the Traveling Salesman Problem
Proceedings of the 2012 International Conference on Industrial Engineering and Operations Management Istanbul, Turkey, July 3 6, 2012 A Viral Systems Algorithm for the Traveling Salesman Problem Dedy Suryadi,
More informationPermutation Free Encoding Technique for Evolving Neural Networks
Permutation Free Encoding Technique for Evolving Neural Networks Anupam Das, Md. Shohrab Hossain, Saeed Muhammad Abdullah, and Rashed Ul Islam Department of Computer Science and Engineering, Bangladesh
More informationEFFECT 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 informationRule Minimization in Predicting the Preterm Birth Classification using Competitive Co Evolution
Indian Journal of Science and Technology, Vol 9(10), DOI: 10.17485/ijst/2016/v9i10/88902, March 2016 ISSN (Print) : 0974-6846 ISSN (Online) : 0974-5645 Rule Minimization in Predicting the Preterm Birth
More informationDeterministic Crowding, Recombination And Self-Similarity
Deterministic Crowding, Recombination And Self-Similarity Bo Yuan School of Information Technology and Electrical Engineering The University of Queensland Brisbane, Queensland 4072 Australia E-mail: s4002283@student.uq.edu.au
More informationRecessive Trait Cross Over Approach of GAs Population Inheritance for Evolutionary Optimisation
Recessive Trait Cross Over Approach of GAs Population Inheritance for Evolutionary Optimisation Amr Madkour, Alamgir Hossain, and Keshav Dahal Modeling Optimization Scheduling And Intelligent Control (MOSAIC)
More informationGENETIC ALGORITHM CHAPTER 2
CHAPTER 2 GENETIC ALGORITHM Genetic algorithm is basically a method for solving constrained and unconstrained optimization problems. GA is based on the Darwin s theory of natural evolution specified in
More informationGenetic Algorithms in Matrix Representation and Its Application in Synthetic Data
Genetic Algorithms in Matrix Representation and Its Application in Synthetic Data Yingrui Chen *, Mark Elliot ** and Joe Sakshaug *** * ** University of Manchester, yingrui.chen@manchester.ac.uk University
More informationA new idea for train scheduling using ant colony optimization
Computers in Railways X 601 A new idea for train scheduling using ant colony optimization K. Ghoseiri School of Railway Engineering, Iran University of Science and Technology, Iran Abstract This paper
More informationIntegration of Process Planning and Job Shop Scheduling Using Genetic Algorithm
Proceedings of the 6th WSEAS International Conference on Simulation, Modelling and Optimization, Lisbon, Portugal, September 22-24, 2006 1 Integration of Process Planning and Job Shop Scheduling Using
More informationCSE 590 DATA MINING. Prof. Anita Wasilewska SUNY Stony Brook
CSE 590 DATA MINING Prof. Anita Wasilewska SUNY Stony Brook 1 References D. E. Goldberg, Genetic Algorithm In Search, Optimization And Machine Learning, New York: Addison Wesley (1989) John H. Holland
More informationGENETIC ALGORITHM BASED APPROACH FOR THE SELECTION OF PROJECTS IN PUBLIC R&D INSTITUTIONS
GENETIC ALGORITHM BASED APPROACH FOR THE SELECTION OF PROJECTS IN PUBLIC R&D INSTITUTIONS SANJAY S, PRADEEP S, MANIKANTA V, KUMARA S.S, HARSHA P Department of Human Resource Development CSIR-Central Food
More informationHours of service regulations in road freight transport: an optimization-based international assessment. Thibaut Vidal
Hours of service regulations in road freight transport: an optimization-based international assessment Thibaut Vidal Seminar, Universidade Federal Fluminense, March 15 th, 2013 Context of this research
More informationFaculty of Cognitive Sciences and Human Development
Faculty of Cognitive Sciences and Human Development A COMBINATORIAL OPTIMIZATION TECHNIQUE USING GENETIC ALGORITHM: A CASE STUDY IN MACHINE LAYOUT PROBLEM Lau Siew Yung Kota Samarahan 2007 A COMBINATORIAL
More informationEVOLUTIONARY ALGORITHM T := 0 // start with an initial time INITPOPULATION P(T) // initialize a usually random population of individuals EVALUATE P(T)
Evolutionary exploration of search spaces A.E. Eiben gusz@wi.leidenuniv.nl Leiden University, Department of Computer Science Abstract. Exploration and exploitation are the two cornerstones of problem solving
More informationPerformance Analyses on ODV-EV Technique for Capacitated Vehicle Routing Problem using Genetic Algorithm
Performance Analyses on ODV-EV Technique for Capacitated Vehicle Routing Problem using Genetic Algorithm A. Ramalingam 1 and K. Vivekanandan 2 1 Department of MCA, Sri Manakula Vinayagar Engineering College,
More informationAn evolutionary algorithm for a real vehicle routing problem
Int. Journal of Business Science and Applied Management, Volume 7, Issue 3, 2012 An evolutionary algorithm for a real vehicle routing problem Panagiotis Adamidis Alexander TEI of Thessaloniki, Department
More informationGenetic 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 informationChapter 6: SELECTION. 6.1 Introduction
Chapter 6: SELECTION 6.1 Introduction Selection is the first genetic operation in the reproductive phase of genetic algorithm. The objective of selection is to choose the fitter individuals in the population
More informationMetaheuristics 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 informationA GENETIC ALGORITHM FOR POLYTECHNIC TIME TABLING (EEPIS Timetabling Case Study)
A GENETIC ALGORITHM FOR POLYTECHNIC TIME TABLING (EEPIS Timetabling Case Study) Son Kuswadi 1, Achmad Basuki 1,Mohammad NUH 1,2, Osami Saito 3 1 Electronic Engineering Polytechnic Institute of Surabaya
More informationOPTIMIZATION OF THE WATER DISTRIBUTION NETWORKS WITH SEARCH SPACE REDUCTION
OPTIMIZATION OF THE WATER DISTRIBUTION NETWORKS WITH SEARCH SPACE REDUCTION Milan Čistý, Zbyněk Bajtek Slovak University of Technology Bratislava, Faculty of the Civil Engineering Abstract A water distribution
More informationTransactions on the Built Environment vol 33, 1998 WIT Press, ISSN
Effects of designated time on pickup/delivery truck routing and scheduling E. Taniguchf, T. Yamada\ M. Tamaishi*, M. Noritake^ "Department of Civil Engineering, Kyoto University, Yoshidahonmachi, Sakyo-kyu,
More informationDerivative-based Optimization (chapter 6)
Soft Computing: Derivative-base Optimization Derivative-based Optimization (chapter 6) Bill Cheetham cheetham@cs.rpi.edu Kai Goebel goebel@cs.rpi.edu used for neural network learning used for multidimensional
More informationAn Improved Immune Genetic Algorithm for Capacitated Vehicle Routing Problem
Send Orders for Reprints to reprints@benthamscience.ae 560 The Open Cybernetics & Systemics Journal, 2014, 8, 560-565 Open Access An Improved Immune Genetic Algorithm for Capacitated Vehicle Routing Problem
More informationJournal 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 informationDesigning High Thermal Conductive Materials Using Artificial Evolution MICHAEL DAVIES, BASKAR GANAPATHYSUBRAMANIAN, GANESH BALASUBRAMANIAN
Designing High Thermal Conductive Materials Using Artificial Evolution MICHAEL DAVIES, BASKAR GANAPATHYSUBRAMANIAN, GANESH BALASUBRAMANIAN The Problem Graphene is one of the most thermally conductive materials
More informationEnergy 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 informationModeling and optimization of ATM cash replenishment
Modeling and optimization of ATM cash replenishment PETER KURDEL, JOLANA SEBESTYÉNOVÁ Institute of Informatics Slovak Academy of Sciences Bratislava SLOVAKIA peter.kurdel@savba.sk, sebestyenova@savba.sk
More informationGenetic Algorithms using Populations based on Multisets
Genetic Algorithms using Populations based on Multisets António Manso 1, Luís Correia 1 1 LabMAg - Laboratório de Modelação de Agentes Faculdade de Ciências da Universidade de Lisboa Edifício C6, Piso
More informationPreventive Maintenance Optimization of Critical Equipments in Process Plant using Heuristic Algorithms
Proceedings of the 200 International Conference on Industrial Engineering and Operations Management Dhaka, Bangladesh, January 9 0, 200 Preventive Maintenance Optimization of Critical Equipments in Process
More informationA Particle Swarm Optimization Algorithm for Multi-depot Vehicle Routing problem with Pickup and Delivery Requests
A Particle Swarm Optimization Algorithm for Multi-depot Vehicle Routing problem with Pickup and Delivery Requests Pandhapon Sombuntham and Voratas Kachitvichayanukul Abstract A particle swarm optimization
More informationChapter 5: ENCODING. 5.1 Prologue
Chapter 5: ENCODING 5.1 Prologue In real world applications, the search space is defined by a set of objects, each of which has different parameters. The objective of optimisation problem working on these
More informationStorage Allocation and Yard Trucks Scheduling in Container Terminals Using a Genetic Algorithm Approach
Storage Allocation and Yard Trucks Scheduling in Container Terminals Using a Genetic Algorithm Approach Z.X. Wang, Felix T.S. Chan, and S.H. Chung Abstract Storage allocation and yard trucks scheduling
More information9 Genetic Algorithms. 9.1 Introduction
9 Genetic Algorithms Genetic algorithms are good at taking large, potentially huge search spaces and navigating them, looking for optimal combinations of things, solutions you might not otherwise find
More informationEvolutionary Computation
Evolutionary Computation Dean F. Hougen w/ contributions from Pedro Diaz-Gomez & Brent Eskridge Robotics, Evolution, Adaptation, and Learning Laboratory (REAL Lab) School of Computer Science University
More informationParameter identification in the activated sludge process
Parameter identification in the activated sludge process Päivi Holck, Aki Sorsa and Kauko Leiviskä Control Engineering Laboratory, University of Oulu P.O.Box 4300, 90014 Oulun yliopisto, Finland e-mail:
More informationKeywords Genetic algorithm, Premature convergence, DGCA, Elitist, Diversity
Volume 4, Issue 6, June 2014 ISSN: 2277 128X International Journal of Advanced Research in Computer Science and Software Engineering Research Paper Available online at: www.ijarcsse.com Preventing Premature
More informationGenetic Algorithm with Upgrading Operator
Genetic Algorithm with Upgrading Operator NIDAPAN SUREERATTANAN Computer Science and Information Management, School of Advanced Technologies, Asian Institute of Technology, P.O. Box 4, Klong Luang, Pathumthani
More informationForecasting Euro United States Dollar Exchange Rate with Gene Expression Programming
Forecasting Euro United States Dollar Exchange Rate with Gene Expression Programming Maria Α. Antoniou 1, Efstratios F. Georgopoulos 1,2, Konstantinos A. Theofilatos 1, and Spiridon D. Likothanassis 1
More informationGenetic Algorithms and Sensitivity Analysis in Production Planning Optimization
Genetic Algorithms and Sensitivity Analysis in Production Planning Optimization CECÍLIA REIS 1,2, LEONARDO PAIVA 2, JORGE MOUTINHO 2, VIRIATO M. MARQUES 1,3 1 GECAD Knowledge Engineering and Decision Support
More informationImprovement of Control System Responses Using GAs PID Controller
International Journal of Industrial and Manufacturing Systems Engineering 2017; 2(2): 11-18 http://www.sciencepublishinggroup.com/j/ijimse doi: 10.11648/j.ijimse.20170202.12 Case Report Improvement of
More informationGenetic Algorithm and Neural Network
Proceedings of the 7th WSEAS International Conference on Applied Informatics and Communications, Athens, Greece, August 24-26, 2007 345 Genetic Algorithm and Neural Network JIRI STASTNY*, VLADISLAV SKORPIL**
More informationThe Use of Explicit Building Blocks in Evolutionary Computation
The Use of Explicit Building Blocks in Evolutionary Computation Chalermsub Sangkavichitr Department of Computer Engineering, Chulalongkorn University, Bangkok 10330, Thailand, Tel: +66-(0)2-218-6956, 2186957,
More informationEnhancing genetic algorithms using multi mutations
Enhancing genetic algorithms using multi mutations Ahmad B Hassanat Corresp., 1, Esra a Alkafaween 1, Nedal A Alnawaiseh 2, Mohammad A Abbadi 1, Mouhammd Alkasassbeh 1, Mahmoud B Alhasanat 3 1 IT, Mutah
More informationINTEGRATING VEHICLE ROUTING WITH CROSS DOCK IN SUPPLY CHAIN
INTEGRATING VEHICLE ROUTING WITH CROSS DOCK IN SUPPLY CHAIN Farshad Farshchi Department of Industrial Engineering, Parand Branch, Islamic Azad University, Parand, Iran Davood Jafari Department of Industrial
More informationResearch on the Distribution System Simulation of Large Company s Logistics under Internet of Things Based on Traveling Salesman Problem Solution
BULGARIAN ACADEMY OF SCIENCES CYBERNETICS AND INFORMATION TECHNOLOGIES Volume 16, No 5 Special Issue on Application of Advanced Computing and Simulation in Information Systems Sofia 2016 Print ISSN: 1311-9702;
More informationAn Evolutionary Algorithm Based On The Aphid Life Cycle
International Journal of Computer Information Systems and Industrial Management Applications. ISSN 2150-7988 Volume 8 (2016) pp. 155 162 c MIR Labs, www.mirlabs.net/ijcisim/index.html An Evolutionary Algorithm
More informationEvaluation of Genetic Algorithm Approach for Scheduling Optimization of Flexible Manufacturing Systems
Evaluation of Genetic Algorithm Approach for Scheduling Optimization of Flexible Manufacturing Systems Nidhish Mathew Nidhiry 1 Dr. R. Saravanan 2 1. (Research scholar, Department of Mechanical Engineering,
More informationFoundations 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 informationPath Optimization for Mobile RFID Reader Using Particle Swarm Optimization and Genetic Algorithm
Path Optimization for Mobile RFID Reader Using Particle Swarm Optimization and Genetic Algorithm Mohd Zaki Zakaria 1 and Mohd Yusoff Jamaluddin 2 1 Faculty of Computer and Mathematic University Technology
More informationJobshop scheduling in a shipyard
Jobshop scheduling in a shipyard Thomas Stidsen 1, Lars V. Kragelund and Oana Mateescu Abstract. Jobshop scheduling is considered a standard problem to solve by means of Genetic Algorithms (GA) and a number
More informationGENOMIC COMPUTING: A POTENTIAL SOLUTION TO THE DATA MINING AND PREDICTIVE MODELLING CHALLENGE TODAY?
This is a manuscript version of the article Kell, D.B. (2002) Defence against the flood (a solution to the data mining and predictive modelling challenges of today). Bioinformatics World (part of Scientific
More informationEvolutionary computing
Information Processing Letters 82 (2002) 1 6 www.elsevier.com/locate/ipl Evolutionary computing A.E. Eiben a,, M. Schoenauer b a Faculty of Sciences, Free University Amsterdam, De Boelelaan 1081a, 1081
More informationA Hybrid Multiobjective Evolutionary Algorithm for Solving Vehicle Routing Problem with Time Windows
A Hybrid Multiobjective Evolutionary Algorithm for Solving Vehicle Routing Problem with Time Windows Abstract. Vehicle routing problem with time windows (VRPTW) involves the routing of a set of vehicles
More informationPLANNING OF ORDER PICKING PROCESSES USING SIMULATION AND A GENETIC ALGORITHM IN MULTI-CRITERIA SCHEDULING OPTIMIZATION
PLANNING OF ORDER PICKING PROCESSES USING SIMULATION AND A GENETIC ALGORITHM IN MULTI-CRITERIA SCHEDULING OPTIMIZATION Balázs Molnár Budapest University of Technology and Economics Department of Transportation
More informationEconomic Design of Control Chart
A Project Report on Economic Design of Control Chart In partial fulfillment of the requirements of Bachelor of Technology (Mechanical Engineering) Submitted By Debabrata Patel (Roll No.10503031) Session:
More informationReal-Coded Evolutionary Algorithms with Parent-Centric Recombination
Real-Coded Evolutionary Algorithms with Parent-Centric Recombination Kalyanmoy Deb, Dhiraj Joshi and Ashish Anand Kanpur Genetic Algorithms Laboratory (KanGAL) Department of Mechanical Engineering Indian
More informationCOMPARISON BETWEEN GENETIC ALGORITHM, PARTICLE SWARM OPTIMIZATION AND ANT COLONY OPTIMIZATION TECHNIQUES FOR NOX EMISSION FORECASTING IN IRAN
International Journal on Technical and Physical Problems of Engineering (IJTPE) Published by International Organization of IOTPE ISSN 2077-3528 IJTPE Journal www.iotpe.com ijtpe@iotpe.com September 2013
More informationA New Approach to Solve Multiple Traveling Salesmen Problem by Clonal Selection Algorithm
International Journal of Applied Engineering Research ISSN 0973-4562 Volume 9, Number 21 (2014) pp. 11005-11017 Research India Publications http://www.ripublication.com A New Approach to Solve Multiple
More informationAdaptive Genetic Programming applied to Classification in Data Mining
Adaptive Genetic Programming applied to Classification in Data Mining Nailah Al-Madi and Simone A. Ludwig Department of Computer Science North Dakota State University Fargo, ND, USA nailah.almadi@my.ndsu.edu,
More informationOptimizing Genetic Algorithms for Time Critical Problems
Master Thesis Software Engineering Thesis no: MSE-2003-09 June 2003 Optimizing Genetic Algorithms for Time Critical Problems Christian Johansson Gustav Evertsson Department of Software Engineering and
More informationSOLVING TRAVELLING SALESMAN PROBLEM IN A SIMULATION OF GENETIC ALGORITHMS WITH DNA. Angel Goñi Moreno
International Journal "Information Theories & Applications" Vol.15 / 2008 357 SOLVING TRAVELLING SALESMAN PROBLEM IN A SIMULATION OF GENETIC ALGORITHMS WITH DNA Angel Goñi Moreno Abstract: In this paper
More informationThe Making of the Fittest: Natural Selection in Humans
POPULATION GENETICS, SELECTION, AND EVOLUTION INTRODUCTION A common misconception is that individuals evolve. While individuals may have favorable and heritable traits that are advantageous for survival
More informationReproduction Strategy Based on Self-Organizing Map for Real-coded Genetic Algorithms
Neural Information Processing - Letters and Reviews Vol. 5, No. 2, November 2004 LETTER Reproduction Strategy Based on Self-Organizing Map for Real-coded Genetic Algorithms Ryosuke Kubota Graduate School
More informationMulti-depot Vehicle Routing Problem with Pickup and Delivery Requests
Multi-depot Vehicle Routing Problem with Pickup and Delivery Requests Pandhapon Sombuntham a and Voratas Kachitvichyanukul b ab Industrial and Manufacturing Engineering, Asian Institute of Technology,
More information