Intelligent Reduction of Tire Noise
|
|
- Rosalind Martin
- 6 years ago
- Views:
Transcription
1 Intelligent Reduction of Tire Noise Matthias Becker and Helena Szczerbicka University Hannover Welfengarten 3067 Hannover, Germany Abstract. In this paper we report about deployment of intelligent optimisation algorithms for noice reduction in tire manufacturing. Since the complexity of the problem grows exponentially (the search space is typically of the order of a 65-dimensional vector space), a complete search for the optimal tread profile is not possible even with today s computers. Thus heuristic optimization algorithms such as Genetic Algorithms and Simulated Annealing are an appropriate means to find (near) optimal tread profiles. We discuss approaches of speeding up the generation and analysis of tread profiles, and results using various optimization algorithms. Introduction Modern tires have to fulfill a lot of basic requirements concerning adhesion, abrasion, stability, etc. If the basic design of a tire is finished, there are still some fine points to be taken into account. One area of research is the noise characteristics of a tire. This paper is concerned with application of intelligent optimization algorithms in order to find designs of tread profiles for tires, that will produce a low, unobtrusive noise inside a car. Though the noise design comes after determination of the basic functional properties, the noise characteristics are an important marketing issue. The subjective impression of the quality of a car is highly influenced by a nice low sound inside the car. This lets the car appear comfortable and of high quality, thus car manufacturers are interested to choose a tire for their cars that makes them appear more valuable. It is therefor important for tire manufacturers to design low noise tires, in order to get a share of the large market of supplying car manufacturers. Problem Statement A tread profile usually consists out of a number of given basic building blocks (called pitches, normally an elevated part followed by a hole ). There is a set of different pitch types (two to approx. ten different types). Pitches of different types normally have the same structure, but vary in their length. The length is B. Gabrys, R.J. Howlett, and L.C. Jain (Eds.): KES 006, Part I, LNAI 45, pp , 006. c Springer-Verlag Berlin Heidelberg 006
2 Intelligent Reduction of Tire Noise 707 usually given as a length ratio, the first pitch type is assigned length, the second e.g. length. etc. Typically a tread profile consists out of 50 to 70 pitches. This is called a pitch sequence (of length n). A tread profile (or the corresponding (,,,,,... ) Fig.. Mathematical representation of a tread profile... pitch sequence of length n) can be represented by an n-dimensional vector (see fig. ), thus the problem can be mathematically formulated as a search in an n-dimensional vector space. Let k be the number of different pitch types, then the number of different possible pitch sequences is equal to k n. Such search space is too large for an exhaustive search in a reasonable amount of time, even with todays computers. The pure generation (without evaluation) of sequences reaches rates of millions of pitch sequences per second, however even at this rate the complete search would last thousands of years. The rest of the paper is organized as follows. In the next section we will show how to make the generation and analysis of pitch sequences more efficient. This is to be used for enumerative search. In section 4, a more directed search using heuristic optimization algorithms is presented. rotational symmetry mirror symmetry Fig.. Symmetry of pitch sequences 3 Efficient Analysis and Generation of Pitch Sequences The prediction of the noise characteristics of a pitch sequence is done by spectral analysis using the Fourier transform (cf. e.g. [3] or any mathematical standard
3 708 M. Becker and H. Szczerbicka literature). Roughly the noise model assumes that each pitch issues a noise impulse when hitting the ground. The details of the noise model vary among the tire manufacturers and are confidential or covered by patents (e.g. tire designs where the individual pitch lengths do not have a common divisor, or are prime numbers, EP 08059/3.0.84, EP / ). Some works about details of noise models have been published at international conferences such as the regular Internoise, or on national workshops (cf. e.g. [] for a study of physical mechanisms of noise generation by moving tires on the road). 3. Efficient Generation Since the noise model results in a periodic function whose spectrum is then analyzed, two rotational symmetric pitch sequences result in the same spectrum. Furthermore the noise spectrum remains the same, if the tire is moved forward or backward, or in other words, two pitch sequences that are mirror symmetric result in the same noise spectrum (see fig. ). Thus for efficiency, it is enough to generate only one representative pitch sequence for each equivalence class of rotational and mirror symmetry. Algorithms for that can be found in mathematical books of permutation theory, under the keyword bracelet and necklace, e.g. in []. Other keywords are Lyndon word (= an aperiodic necklace representative). It is important to use an algorithm that produces exactly one (and only one) representative of each equivalence class, instead of e.g. generating all sequences and checking for symmetry afterwards, and throwing equivalent sequences away then. Furthermore there are a number of constraints to be taken into account. Common constraints on pitch sequences are a maximal number of pitches of the same time in series, or how many pitches of each type should occur in a pitch sequence maximally/minimally, etc. 3. Efficient Analysis The assessment of the quality of a given pitch sequence (analysis) is based on Fourier analysis, i.e. the noise spectrum of the tire is estimated. The noise model for a pitch sequence is an irregular rectangular function, that results in an impulse function, if discretized via sampling. Fourier analysis of that function yields the frequency spectrum, i.e. the value of the Fourier coefficients that indicates how much the corresponding frequency contributes to the overall sound. Since the noise of pitch sequences are roughly rectangular functions (See upper part of fig. 3 for an example of a rectangular function with amplitude A over time t.), the noise spectrum of a sequence has the peak around the Fourier coefficient equal to the number of pitches, and sub-peaks at multiples of it (harmonics) (See lower part of fig. 3 where the amplitude A for the corresponding fourier coefficients FC is shown.). Ideally there should not be one peak frequency but the energy of the noise should be distributed rather equally over all frequencies.
4 Intelligent Reduction of Tire Noise 709 A t A FC Fig. 3. Square function and Fourier spectrum Evaluation Order of Fourier Coefficients. Since we are interested in a pitch sequence that has the lowest maximal Fourier coefficient (that mostly is located around the basic period equal to the pitch sequence length) one obvious improvement of efficiency is not to calculate the Fourier coefficients from to lets say 00, but to start with the nth Fourier coefficient, then evaluate n + / etc. (given a pitch sequence length of n). Sine Table. The calculation of each Fourier coefficient is a sum of sines. We achieve a significant speed up when using a table with pre-calculated values for sines, instead of calculating each value again and again with much too high precision. Re-use of Partial Sums. If pitch sequences are enumerated, so that the ith pitch sequence differs only in one or two digits from the i th, then we can re-use most of the calculations/of the sum evaluated for the ith sequence. This measure also increase efficiency a lot. Note that this is not possible if pitch sequences are generated randomly. 4 Heuristic Optimization of Pitch Sequences Often, there exists a pitch sequence that is in use already, and tire manufacturers would like to improve the existing pitch sequence. This can be done by local heuristic optimization algorithms, such as hill-climbing. Global heuristic optimization algorithms can also be used as alternative to random search or enumeration of pitch sequences. For more information on heuristic optimization algorithms see standard books on optimization algorithms, e.g. [4]. 4. Local Optimization In order to increase the quality of existing pitch sequences, we implemented local optimization algorithms, namely hill-climbing variants. The basic mechanism of hill-climbing is to check all neighbors of the momentarily best solution, and advance to the next better neighbor. If no better neighbor is found, then
5 70 M. Becker and H. Szczerbicka the algorithm ends. The crucial step in this case is the efficient generation of neighbors. When checking the neighborhood of one pitch sequence for better solutions, it is again important not to generate lots of invalid pitch sequences and test constraints after generation, but to generate only valid pitch sequences. We evaluated three variants of hill-climbing: SAHC:Steepest ascent hill-climbing proceeds from one vector to the best of all of its neighbors. NAHC:Next ascent hill-climbing proceeds from one vector to the next best found neighbor. RMHC:Random mutation hill-climbing modifies the current vector randomly and proceeds to the next best found vector which, different to NAHC, does not have to be a neighbor of the current vector. RMHC is not a strictly local search anymore, since by the random mutations also not direct neighbors might be chosen as next vector. 4. Global and Combined Optimization Local heuristic algorithms get stuck easily in a local optimum. Thus global heuristic algorithms are an alternative, if not a local optimization is wanted, but a global search (more intelligent than random search) should be accomplished. We implemented Simulated Annealing (SA), Genetic Algorithms (GA), and also combined algorithms, that first do a global search via random search/sa/ga, and afterwards do a local optimization using hill-climbing. These combined algorithms are known to achieve good results in terms of quality of solution, and execution speed quite often (see. e.g. [5]). We studied hill-climbing, SA, GA and two hybrid variants of both GA and RMHC. In the first variant a hill-climber is used for fine-tuning after the global search stops, and in the second a hill-climber is used to generate fine-tune new points during one step of the global search. All parameters used in the algorithms cannot be given. However we point out some import ones for GA: gene size of three, gene drift and crossover has been used, population size was 500. In detail, the algorithms used in the following test cases were: RMHC SAHC 3 NAHC 4SA 5GA 6 RMHC with SAHC for optimizing each new neighbor 7 RMHC with SAHC after RMHC has stopped 8 GA with SAHC for optimizing new members of the population 9 GA with SAHC after GA has stopped 4.3 Test Cases We tested the optimization algorithms on two problems, one smaller problem (pitch vector size of ) where the optimal solutions is known, and on a large problem (pitch vector size of 66).
6 Intelligent Reduction of Tire Noise 7 Small Vector Size. This is a small test problem which is not very realistic, but which is small enough to search the complete search space for the global optimum, giving a known reference point for the performance of the individual algorithms. The vector size is, and there are three different types of pitches. Constraints were that each element should occur between one and seven times, each pitch type may occur maximal six times in a row. The global optimum is with a value of Each heuristic optimization algorithm has been run 50 times, with different random seeds. Results for Small Problem. Fig. 4 shows the results. It shows that often HC based algorithms have difficulties to find valid neighbors with regard to the constraints, therefore they get stuck and stop with a bad result (this explains the large standard deviation in the right graph for some of the HC based results.). Best results showed the GA based algorithms, in 8% the global optimum has been reached, the median is only.% away from the optimum. Pure GA was slightly better than hybrid GA. SA performed well, the found vectors were about 7.7% away from the optimum. NAHC performed worst, being around 6.6% away from the optimum, and getting stuck very often because of the constraints. # evaluations goal function value Fig. 4. Performance of algorithms. Left graph shows the number of evaluations of the goal function (minimum, median, maximum). Right graph shows the found optima (cross), median of found solution (circle), and standard deviation.,,3,6,7 are algorithms based on hill-climbing, 4 is SA, 5 is pure GA, 8 and 9 are hybrid algorithms based on GA. Large Vector Size. Here the vector size is 66 with three different types of pitches. There are several constraints. Each vector should contain exactly 6 elements of type one, of type two and 8 of type three. For each pitch type, there should not be more than six in a row. Pitches of type one and three may not be neighbors.
7 7 M. Becker and H. Szczerbicka Results for Large Problem. The global optimum is not known, we tried to find the best vector by a very long search prior to the 5 (shorter) test for each algorithm. The best found vector is with a value of 4.3. The outcome is shown in fig. 5. Best results showed again GA, finding a vector only 0.9% away from the optimum (mean distance to optimum is 4.%). Second was RMHC, the best solution was 5.9% away (mean distance to optimum 5.9%). Both algorithms yielded good results with a small standard deviation in short time. Hybrid algorithms of GA and RMHC let the standard deviation become larger, but also increase the quality of the best found solution. SA got stuck in the same local optimum, despite including randomness in the search. Obviously this optimization problem was relatively hard, regarding the structure of the search space. Some very attractive suboptimal solutions exist and make it harder to find the best solution # evaluations goal function value Fig. 5. Performance of algorithms. Left graph shows the number of evaluations of the goal function (min, med, max). Left graph shows the found optima (cross), the median of the found solutions (circle), and the standard deviation. Again,,,3,6,7 are algorithms based on hill-climbing, 4 is SA, 5 is GA, 8 and 9 are hybrids based on GA. 5 Conclusion In this work, we studied the applicability of heuristic optimization algorithms in order to design low noise tire profiles. It showed that this particular problem should be best approached with genetic algorithms. We furthermore give hints on how to improve efficiency of generation and analysis of pitch sequences. We implemented a prototype software from scratch with regard to efficiency (see fig. 6), and we achieved a speed that is several magnitudes faster (in terms of generated and analyzed pitch sequences per second) than a grown bundle of existing software.
8 Intelligent Reduction of Tire Noise 73 Fig. 6. Screen shot of prototype In the future, we will try to exploit the mathematical properties of the Fourier analysis to possibly find good pitch sequences by construction. References. Combinatorical object server. cos/inf/neck/necklaceinfo.html. Beckenbauer, T.: Reifen-Fahrbahn-Geräusche Minderungspotentiale der Strassenoberfläche. In: Proceedings of the Deutsche Arbeitsgemeinschaft für Akustik (DAGA 03), Aachen, Germany, Briggs, W., Henson, V.E.: The DFT. SIAM, Philadelphia, Michalewicz, Z., Fogel, D.: How to solve it: Modern Heuristics. Springer, London., Szczerbicka, H., Syrjakow, M., Becker, M.: Genetic algorithms, a tool for modelling, simulation and optimization of complex systems. Cybernetics and Systems: An International Journal, Special Issue: Intelligent modelling and simulation for complex systems, II(7): , 998
Genetic Algorithms and Genetic Programming Lecture 7
Genetic Algorithms and Genetic Programming Lecture 7 Gillian Hayes 13th October 2006 Lecture 7: The Building Block Hypothesis The Building Block Hypothesis Experimental evidence for the BBH The Royal Road
More informationLecture 6: The Building Block Hypothesis. Genetic Algorithms and Genetic Programming Lecture 6. The Schema Theorem Reminder
Lecture 6: The Building Block Hypothesis 1 Genetic Algorithms and Genetic Programming Lecture 6 Gillian Hayes 9th October 2007 The Building Block Hypothesis Experimental evidence for the BBH The Royal
More informationArtificial Intelligence
Artificial Intelligence Informed Search and Exploration Chapter 4 (4.3 4.6) Searching: So Far We ve discussed how to build goal-based and utility-based agents that search to solve problems We ve also presented
More informationNon-deterministic Search techniques. Emma Hart
Non-deterministic Search techniques Emma Hart Why do local search? Many real problems are too hard to solve with exact (deterministic) techniques Modern, non-deterministic techniques offer ways of getting
More information5. Computational Geometry, Benchmarks and Algorithms for Rectangular and Irregular Packing. 6. Meta-heuristic Algorithms and Rectangular Packing
1. Introduction 2. Cutting and Packing Problems 3. Optimisation Techniques 4. Automated Packing Techniques 5. Computational Geometry, Benchmarks and Algorithms for Rectangular and Irregular Packing 6.
More informationAlgorithm Design (4) Metaheuristics
Algorithm Design (4) Metaheuristics Takashi Chikayama School of Engineering The University of Tokyo Formalization of Constraint Optimization Minimize (or maximize) the objective function f(x 0,, x n )
More informationPARAMETER OPTIMIZATION FOR AUTOMATED SIGNAL ANALYSIS FOR CONDITION MONITORING OF AIRCRAFT SYSTEMS. Mike Gerdes 1, Dieter Scholz 1
AST 2011 Workshop on Aviation System Technology PARAMETER OPTIMIZATION FOR AUTOMATED SIGNAL ANALYSIS FOR CONDITION MONITORING OF AIRCRAFT SYSTEMS Mike Gerdes 1, Dieter Scholz 1 1 Aero - Aircraft Design
More informationAr#ficial)Intelligence!!
Introduc*on! Ar#ficial)Intelligence!! Roman Barták Department of Theoretical Computer Science and Mathematical Logic We know how to use heuristics in search BFS, A*, IDA*, RBFS, SMA* Today: What if the
More informationCS:4420 Artificial Intelligence
CS:4420 Artificial Intelligence Spring 2018 Beyond Classical Search Cesare Tinelli The University of Iowa Copyright 2004 18, Cesare Tinelli and Stuart Russell a a These notes were originally developed
More informationRandom Search Report An objective look at random search performance for 4 problem sets
Random Search Report An objective look at random search performance for 4 problem sets Dudon Wai Georgia Institute of Technology CS 7641: Machine Learning Atlanta, GA dwai3@gatech.edu Abstract: This report
More information3.6.2 Generating admissible heuristics from relaxed problems
3.6.2 Generating admissible heuristics from relaxed problems To come up with heuristic functions one can study relaxed problems from which some restrictions of the original problem have been removed The
More informationCHAPTER 6 ORTHOGONAL PARTICLE SWARM OPTIMIZATION
131 CHAPTER 6 ORTHOGONAL PARTICLE SWARM OPTIMIZATION 6.1 INTRODUCTION The Orthogonal arrays are helpful in guiding the heuristic algorithms to obtain a good solution when applied to NP-hard problems. This
More informationJob Shop Scheduling Problem (JSSP) Genetic Algorithms Critical Block and DG distance Neighbourhood Search
A JOB-SHOP SCHEDULING PROBLEM (JSSP) USING GENETIC ALGORITHM (GA) Mahanim Omar, Adam Baharum, Yahya Abu Hasan School of Mathematical Sciences, Universiti Sains Malaysia 11800 Penang, Malaysia Tel: (+)
More informationHeuristic Optimisation
Heuristic Optimisation Part 2: Basic concepts Sándor Zoltán Németh http://web.mat.bham.ac.uk/s.z.nemeth s.nemeth@bham.ac.uk University of Birmingham S Z Németh (s.nemeth@bham.ac.uk) Heuristic Optimisation
More informationArtificial Intelligence
Artificial Intelligence Information Systems and Machine Learning Lab (ISMLL) Tomáš Horváth 16 rd November, 2011 Informed Search and Exploration Example (again) Informed strategy we use a problem-specific
More informationSPATIAL OPTIMIZATION METHODS
DELMELLE E. (2010). SPATIAL OPTIMIZATION METHODS. IN: B. WHARF (ED). ENCYCLOPEDIA OF HUMAN GEOGRAPHY: 2657-2659. SPATIAL OPTIMIZATION METHODS Spatial optimization is concerned with maximizing or minimizing
More informationINF Biologically inspired computing Lecture 1: Marsland chapter 9.1, Optimization and Search Jim Tørresen
INF3490 - Biologically inspired computing Lecture 1: Marsland chapter 9.1, 9.4-9.6 2017 Optimization and Search Jim Tørresen Optimization and Search 2 Optimization and Search Methods (selection) 1. Exhaustive
More informationSingle Candidate Methods
Single Candidate Methods In Heuristic Optimization Based on: [3] S. Luke, "Essentials of Metaheuristics," [Online]. Available: http://cs.gmu.edu/~sean/book/metaheuristics/essentials.pdf. [Accessed 11 May
More informationLocal Search (Ch )
Local Search (Ch. 4-4.1) Local search Before we tried to find a path from the start state to a goal state using a fringe set Now we will look at algorithms that do not care about a fringe, but just neighbors
More information4 INFORMED SEARCH AND EXPLORATION. 4.1 Heuristic Search Strategies
55 4 INFORMED SEARCH AND EXPLORATION We now consider informed search that uses problem-specific knowledge beyond the definition of the problem itself This information helps to find solutions more efficiently
More informationLocal Search and Optimization Chapter 4. Mausam (Based on slides of Padhraic Smyth, Stuart Russell, Rao Kambhampati, Raj Rao, Dan Weld )
Local Search and Optimization Chapter 4 Mausam (Based on slides of Padhraic Smyth, Stuart Russell, Rao Kambhampati, Raj Rao, Dan Weld ) 1 Outline Local search techniques and optimization Hill-climbing
More informationMeta- Heuristic based Optimization Algorithms: A Comparative Study of Genetic Algorithm and Particle Swarm Optimization
2017 2 nd International Electrical Engineering Conference (IEEC 2017) May. 19 th -20 th, 2017 at IEP Centre, Karachi, Pakistan Meta- Heuristic based Optimization Algorithms: A Comparative Study of Genetic
More informationArtificial Intelligence
Artificial Intelligence Information Systems and Machine Learning Lab (ISMLL) Tomáš Horváth 10 rd November, 2010 Informed Search and Exploration Example (again) Informed strategy we use a problem-specific
More informationLocal Search and Optimization Chapter 4. Mausam (Based on slides of Padhraic Smyth, Stuart Russell, Rao Kambhampati, Raj Rao, Dan Weld )
Local Search and Optimization Chapter 4 Mausam (Based on slides of Padhraic Smyth, Stuart Russell, Rao Kambhampati, Raj Rao, Dan Weld ) 1 2 Outline Local search techniques and optimization Hill-climbing
More informationLocal Search and Optimization Chapter 4. Mausam (Based on slides of Padhraic Smyth, Stuart Russell, Rao Kambhampati, Raj Rao, Dan Weld )
Local Search and Optimization Chapter 4 Mausam (Based on slides of Padhraic Smyth, Stuart Russell, Rao Kambhampati, Raj Rao, Dan Weld ) 1 2 Outline Local search techniques and optimization Hill-climbing
More informationMetaheuristic Optimization with Evolver, Genocop and OptQuest
Metaheuristic Optimization with Evolver, Genocop and OptQuest MANUEL LAGUNA Graduate School of Business Administration University of Colorado, Boulder, CO 80309-0419 Manuel.Laguna@Colorado.EDU Last revision:
More informationHeuristic Optimisation
Heuristic Optimisation Revision Lecture Sándor Zoltán Németh http://web.mat.bham.ac.uk/s.z.nemeth s.nemeth@bham.ac.uk University of Birmingham S Z Németh (s.nemeth@bham.ac.uk) Heuristic Optimisation University
More informationWelfare Navigation Using Genetic Algorithm
Welfare Navigation Using Genetic Algorithm David Erukhimovich and Yoel Zeldes Hebrew University of Jerusalem AI course final project Abstract Using standard navigation algorithms and applications (such
More informationBinary Representations of Integers and the Performance of Selectorecombinative Genetic Algorithms
Binary Representations of Integers and the Performance of Selectorecombinative Genetic Algorithms Franz Rothlauf Department of Information Systems University of Bayreuth, Germany franz.rothlauf@uni-bayreuth.de
More informationTeaching a robot to perform a basketball shot using EM-based reinforcement learning methods
Teaching a robot to perform a basketball shot using EM-based reinforcement learning methods Tobias Michels TU Darmstadt Aaron Hochländer TU Darmstadt Abstract In this paper we experiment with reinforcement
More informationCS 188: Artificial Intelligence
CS 188: Artificial Intelligence Constraint Satisfaction Problems II and Local Search Instructors: Sergey Levine and Stuart Russell University of California, Berkeley [These slides were created by Dan Klein
More informationThe 32nd International Congress and Exposition on Noise Control Engineering Jeju International Convention Center, Seogwipo, Korea, August 25-28, 2003
The 32nd International Congress and Exposition on Noise Control Engineering Jeju International Convention Center, Seogwipo, Korea, August 25-28, 2003 [N996] Tyre/road noise modelling: the road from a tyre's
More informationCS 188: Artificial Intelligence
CS 188: Artificial Intelligence CSPs II + Local Search Prof. Scott Niekum The University of Texas at Austin [These slides based on those of Dan Klein and Pieter Abbeel for CS188 Intro to AI at UC Berkeley.
More informationHybridization EVOLUTIONARY COMPUTING. Reasons for Hybridization - 1. Naming. Reasons for Hybridization - 3. Reasons for Hybridization - 2
Hybridization EVOLUTIONARY COMPUTING Hybrid Evolutionary Algorithms hybridization of an EA with local search techniques (commonly called memetic algorithms) EA+LS=MA constructive heuristics exact methods
More informationGenetic Model Optimization for Hausdorff Distance-Based Face Localization
c In Proc. International ECCV 2002 Workshop on Biometric Authentication, Springer, Lecture Notes in Computer Science, LNCS-2359, pp. 103 111, Copenhagen, Denmark, June 2002. Genetic Model Optimization
More informationSimultaneous Perturbation Stochastic Approximation Algorithm Combined with Neural Network and Fuzzy Simulation
.--- Simultaneous Perturbation Stochastic Approximation Algorithm Combined with Neural Networ and Fuzzy Simulation Abstract - - - - Keywords: Many optimization problems contain fuzzy information. Possibility
More informationOutline of the module
Evolutionary and Heuristic Optimisation (ITNPD8) Lecture 2: Heuristics and Metaheuristics Gabriela Ochoa http://www.cs.stir.ac.uk/~goc/ Computing Science and Mathematics, School of Natural Sciences University
More informationWhat is Search For? CSE 473: Artificial Intelligence. Example: N-Queens. Example: N-Queens. Example: Map-Coloring 4/7/17
CSE 473: Artificial Intelligence Constraint Satisfaction Dieter Fox What is Search For? Models of the world: single agent, deterministic actions, fully observed state, discrete state space Planning: sequences
More informationIntroduction to Optimization
Introduction to Optimization Approximation Algorithms and Heuristics November 6, 2015 École Centrale Paris, Châtenay-Malabry, France Dimo Brockhoff INRIA Lille Nord Europe 2 Exercise: The Knapsack Problem
More informationFast Efficient Clustering Algorithm for Balanced Data
Vol. 5, No. 6, 214 Fast Efficient Clustering Algorithm for Balanced Data Adel A. Sewisy Faculty of Computer and Information, Assiut University M. H. Marghny Faculty of Computer and Information, Assiut
More informationHill Climbing. Assume a heuristic value for each assignment of values to all variables. Maintain an assignment of a value to each variable.
Hill Climbing Many search spaces are too big for systematic search. A useful method in practice for some consistency and optimization problems is hill climbing: Assume a heuristic value for each assignment
More information3 SOLVING PROBLEMS BY SEARCHING
48 3 SOLVING PROBLEMS BY SEARCHING A goal-based agent aims at solving problems by performing actions that lead to desirable states Let us first consider the uninformed situation in which the agent is not
More informationThe Genetic Algorithm for finding the maxima of single-variable functions
Research Inventy: International Journal Of Engineering And Science Vol.4, Issue 3(March 2014), PP 46-54 Issn (e): 2278-4721, Issn (p):2319-6483, www.researchinventy.com The Genetic Algorithm for finding
More informationEvolutionary Algorithms: Perfecting the Art of Good Enough. Liz Sander
Evolutionary Algorithms: Perfecting the Art of Good Enough Liz Sander Source: wikipedia.org Source: fishbase.org Source: youtube.com Sometimes, we can t find the best solution. Sometimes, we can t find
More informationUsing Genetic Algorithms to optimize ACS-TSP
Using Genetic Algorithms to optimize ACS-TSP Marcin L. Pilat and Tony White School of Computer Science, Carleton University, 1125 Colonel By Drive, Ottawa, ON, K1S 5B6, Canada {mpilat,arpwhite}@scs.carleton.ca
More informationCS 331: Artificial Intelligence Local Search 1. Tough real-world problems
CS 331: Artificial Intelligence Local Search 1 1 Tough real-world problems Suppose you had to solve VLSI layout problems (minimize distance between components, unused space, etc.) Or schedule airlines
More informationA Binary Model on the Basis of Cuckoo Search Algorithm in Order to Solve the Problem of Knapsack 1-0
22 International Conference on System Engineering and Modeling (ICSEM 22) IPCSIT vol. 34 (22) (22) IACSIT Press, Singapore A Binary Model on the Basis of Cuckoo Search Algorithm in Order to Solve the Problem
More informationx n+1 = x n f(x n) f (x n ), (1)
1 Optimization The field of optimization is large and vastly important, with a deep history in computer science (among other places). Generally, an optimization problem is defined by having a score function
More informationOn the Security of the 128-Bit Block Cipher DEAL
On the Security of the 128-Bit Block Cipher DAL Stefan Lucks Theoretische Informatik University of Mannheim, 68131 Mannheim A5, Germany lucks@th.informatik.uni-mannheim.de Abstract. DAL is a DS-based block
More informationEscaping Local Optima: Genetic Algorithm
Artificial Intelligence Escaping Local Optima: Genetic Algorithm Dae-Won Kim School of Computer Science & Engineering Chung-Ang University We re trying to escape local optima To achieve this, we have learned
More informationOptimised corrections for finite-difference modelling in two dimensions
Optimized corrections for 2D FD modelling Optimised corrections for finite-difference modelling in two dimensions Peter M. Manning and Gary F. Margrave ABSTRACT Finite-difference two-dimensional correction
More informationHEURISTICS FOR THE NETWORK DESIGN PROBLEM
HEURISTICS FOR THE NETWORK DESIGN PROBLEM G. E. Cantarella Dept. of Civil Engineering University of Salerno E-mail: g.cantarella@unisa.it G. Pavone, A. Vitetta Dept. of Computer Science, Mathematics, Electronics
More informationIntroduction to Optimization
Introduction to Optimization Approximation Algorithms and Heuristics November 21, 2016 École Centrale Paris, Châtenay-Malabry, France Dimo Brockhoff Inria Saclay Ile-de-France 2 Exercise: The Knapsack
More informationREAL-CODED GENETIC ALGORITHMS CONSTRAINED OPTIMIZATION. Nedim TUTKUN
REAL-CODED GENETIC ALGORITHMS CONSTRAINED OPTIMIZATION Nedim TUTKUN nedimtutkun@gmail.com Outlines Unconstrained Optimization Ackley s Function GA Approach for Ackley s Function Nonlinear Programming Penalty
More informationImage Processing algorithm for matching horizons across faults in seismic data
Image Processing algorithm for matching horizons across faults in seismic data Melanie Aurnhammer and Klaus Tönnies Computer Vision Group, Otto-von-Guericke University, Postfach 410, 39016 Magdeburg, Germany
More informationDigital Image Processing. Prof. P. K. Biswas. Department of Electronic & Electrical Communication Engineering
Digital Image Processing Prof. P. K. Biswas Department of Electronic & Electrical Communication Engineering Indian Institute of Technology, Kharagpur Lecture - 21 Image Enhancement Frequency Domain Processing
More informationMachine Learning for Software Engineering
Machine Learning for Software Engineering Single-State Meta-Heuristics Prof. Dr.-Ing. Norbert Siegmund Intelligent Software Systems 1 2 Recap: Goal is to Find the Optimum Challenges of general optimization
More informationK-Consistency. CS 188: Artificial Intelligence. K-Consistency. Strong K-Consistency. Constraint Satisfaction Problems II
CS 188: Artificial Intelligence K-Consistency Constraint Satisfaction Problems II Instructor: Marco Alvarez University of Rhode Island (These slides were created/modified by Dan Klein, Pieter Abbeel, Anca
More informationOutline. Best-first search. Greedy best-first search A* search Heuristics Local search algorithms
Outline Best-first search Greedy best-first search A* search Heuristics Local search algorithms Hill-climbing search Beam search Simulated annealing search Genetic algorithms Constraint Satisfaction Problems
More informationFirst-improvement vs. Best-improvement Local Optima Networks of NK Landscapes
First-improvement vs. Best-improvement Local Optima Networks of NK Landscapes Gabriela Ochoa 1, Sébastien Verel 2, and Marco Tomassini 3 1 School of Computer Science, University of Nottingham, Nottingham,
More informationTwo-Dimensional Fitting of Brightness Profiles in Galaxy Images with a Hybrid Algorithm
Two-Dimensional Fitting of Brightness Profiles in Galaxy Images with a Hybrid Algorithm Juan Carlos Gomez, Olac Fuentes, and Ivanio Puerari Instituto Nacional de Astrofísica Óptica y Electrónica Luis Enrique
More informationComplexity. Congestion Games. Algorithmic Game Theory. Alexander Skopalik Algorithmic Game Theory 2013 Congestion Games
Algorithmic Game Theory Complexity of pure Nash equilibria We investigate the complexity of finding Nash equilibria in different kinds of congestion games. Our study is restricted to congestion games with
More informationAn Empirical Investigation of Meta-heuristic and Heuristic Algorithms for a 2D Packing Problem
European Journal of Operational Research 128/1, 34-57, 2000. An Empirical Investigation of Meta-heuristic and Heuristic Algorithms for a 2D Packing Problem E. Hopper and B. C. H. Turton School of Engineering,
More informationOptimized Watermarking Using Swarm-Based Bacterial Foraging
Journal of Information Hiding and Multimedia Signal Processing c 2009 ISSN 2073-4212 Ubiquitous International Volume 1, Number 1, January 2010 Optimized Watermarking Using Swarm-Based Bacterial Foraging
More informationGeneralized Coordinates for Cellular Automata Grids
Generalized Coordinates for Cellular Automata Grids Lev Naumov Saint-Peterburg State Institute of Fine Mechanics and Optics, Computer Science Department, 197101 Sablinskaya st. 14, Saint-Peterburg, Russia
More informationTowards Automatic Recognition of Fonts using Genetic Approach
Towards Automatic Recognition of Fonts using Genetic Approach M. SARFRAZ Department of Information and Computer Science King Fahd University of Petroleum and Minerals KFUPM # 1510, Dhahran 31261, Saudi
More informationDETERMINING PARETO OPTIMAL CONTROLLER PARAMETER SETS OF AIRCRAFT CONTROL SYSTEMS USING GENETIC ALGORITHM
DETERMINING PARETO OPTIMAL CONTROLLER PARAMETER SETS OF AIRCRAFT CONTROL SYSTEMS USING GENETIC ALGORITHM Can ÖZDEMİR and Ayşe KAHVECİOĞLU School of Civil Aviation Anadolu University 2647 Eskişehir TURKEY
More informationGenetic Algorithms and Image Search Pavel Mrázek
Genetic Algorithms and Image Search Pavel Mrázek Department of Computer Science, Faculty of Electrical Engineering, Czech Technical University (»VUT), Karlovo nám. 13, 12135 Praha 2, Czech Republic e-mail:
More informationFuzzy Inspired Hybrid Genetic Approach to Optimize Travelling Salesman Problem
Fuzzy Inspired Hybrid Genetic Approach to Optimize Travelling Salesman Problem Bindu Student, JMIT Radaur binduaahuja@gmail.com Mrs. Pinki Tanwar Asstt. Prof, CSE, JMIT Radaur pinki.tanwar@gmail.com Abstract
More informationStudy on GA-based matching method of railway vehicle wheels
Available online www.jocpr.com Journal of Chemical and Pharmaceutical Research, 2014, 6(4):536-542 Research Article ISSN : 0975-7384 CODEN(USA) : JCPRC5 Study on GA-based matching method of railway vehicle
More informationEXECUTION PLAN OPTIMIZATION TECHNIQUES
EXECUTION PLAN OPTIMIZATION TECHNIQUES Július Štroffek Database Sustaining Engineer Sun Microsystems, Inc. Tomáš Kovařík Faculty of Mathematics and Physics, Charles University, Prague PostgreSQL Conference,
More informationComputational Intelligence
Computational Intelligence Module 6 Evolutionary Computation Ajith Abraham Ph.D. Q What is the most powerful problem solver in the Universe? ΑThe (human) brain that created the wheel, New York, wars and
More informationPredicting Diabetes using Neural Networks and Randomized Optimization
Predicting Diabetes using Neural Networks and Randomized Optimization Kunal Sharma GTID: ksharma74 CS 4641 Machine Learning Abstract This paper analysis the following randomized optimization techniques
More informationMINIMAL EDGE-ORDERED SPANNING TREES USING A SELF-ADAPTING GENETIC ALGORITHM WITH MULTIPLE GENOMIC REPRESENTATIONS
Proceedings of Student/Faculty Research Day, CSIS, Pace University, May 5 th, 2006 MINIMAL EDGE-ORDERED SPANNING TREES USING A SELF-ADAPTING GENETIC ALGORITHM WITH MULTIPLE GENOMIC REPRESENTATIONS Richard
More informationFoundations of AI. 4. Informed Search Methods. Heuristics, Local Search Methods, Genetic Algorithms
Foundations of AI 4. Informed Search Methods Heuristics, Local Search Methods, Genetic Algorithms Luc De Raedt and Wolfram Burgard and Bernhard Nebel Contents Best-First Search A* and IDA* Local Search
More informationAI Programming CS S-08 Local Search / Genetic Algorithms
AI Programming CS662-2013S-08 Local Search / Genetic Algorithms David Galles Department of Computer Science University of San Francisco 08-0: Overview Local Search Hill-Climbing Search Simulated Annealing
More informationAn Evolutionary Algorithm for Minimizing Multimodal Functions
An Evolutionary Algorithm for Minimizing Multimodal Functions D.G. Sotiropoulos, V.P. Plagianakos and M.N. Vrahatis University of Patras, Department of Mamatics, Division of Computational Mamatics & Informatics,
More informationCS 188: Artificial Intelligence
CS 188: Artificial Intelligence Constraint Satisfaction Problems II Instructors: Dan Klein and Pieter Abbeel University of California, Berkeley [These slides were created by Dan Klein and Pieter Abbeel
More informationinter.noise 2000 The 29th International Congress and Exhibition on Noise Control Engineering August 2000, Nice, FRANCE
Copyright SFA - InterNoise 2000 1 inter.noise 2000 The 29th International Congress and Exhibition on Noise Control Engineering 27-30 August 2000, Nice, FRANCE I-INCE Classification: 7.6 EFFICIENT ACOUSTIC
More informationC 1 Modified Genetic Algorithm to Solve Time-varying Lot Sizes Economic Lot Scheduling Problem
C 1 Modified Genetic Algorithm to Solve Time-varying Lot Sizes Economic Lot Scheduling Problem Bethany Elvira 1, Yudi Satria 2, dan Rahmi Rusin 3 1 Student in Department of Mathematics, University of Indonesia,
More informationGeometric Mean Algorithms Based on Harmonic and Arithmetic Iterations
Geometric Mean Algorithms Based on Harmonic and Arithmetic Iterations Ben Jeuris and Raf Vandebril KU Leuven, Dept. of Computer Science, 3001 Leuven(Heverlee), Belgium {ben.jeuris,raf.vandebril}@cs.kuleuven.be
More informationTime Complexity Analysis of the Genetic Algorithm Clustering Method
Time Complexity Analysis of the Genetic Algorithm Clustering Method Z. M. NOPIAH, M. I. KHAIRIR, S. ABDULLAH, M. N. BAHARIN, and A. ARIFIN Department of Mechanical and Materials Engineering Universiti
More informationIntroduction to Artificial Intelligence 2 nd semester 2016/2017. Chapter 4: Beyond Classical Search
Introduction to Artificial Intelligence 2 nd semester 2016/2017 Chapter 4: Beyond Classical Search Mohamed B. Abubaker Palestine Technical College Deir El-Balah 1 Outlines local search algorithms and optimization
More informationSolving the Traveling Salesman Problem using Reinforced Ant Colony Optimization techniques
Solving the Traveling Salesman Problem using Reinforced Ant Colony Optimization techniques N.N.Poddar 1, D. Kaur 2 1 Electrical Engineering and Computer Science, University of Toledo, Toledo, OH, USA 2
More informationInformed search algorithms. Chapter 4
Informed search algorithms Chapter 4 Material Chapter 4 Section 1 - Exclude memory-bounded heuristic search 3 Outline Best-first search Greedy best-first search A * search Heuristics Local search algorithms
More informationVariable Neighborhood Search for Solving the Balanced Location Problem
TECHNISCHE UNIVERSITÄT WIEN Institut für Computergraphik und Algorithmen Variable Neighborhood Search for Solving the Balanced Location Problem Jozef Kratica, Markus Leitner, Ivana Ljubić Forschungsbericht
More informationIntroduction to Computer Science and Programming for Astronomers
Introduction to Computer Science and Programming for Astronomers Lecture 9. István Szapudi Institute for Astronomy University of Hawaii March 21, 2018 Outline Reminder 1 Reminder 2 3 Reminder We have demonstrated
More informationScheduling Mixed-Model Assembly Lines with Cost Objectives by a Hybrid Algorithm
Scheduling Mixed-Model Assembly Lines with Cost Objectives by a Hybrid Algorithm Binggang Wang, Yunqing Rao, Xinyu Shao, and Mengchang Wang The State Key Laboratory of Digital Manufacturing Equipment and
More information4.1 QUANTIZATION NOISE
DIGITAL SIGNAL PROCESSING UNIT IV FINITE WORD LENGTH EFFECTS Contents : 4.1 Quantization Noise 4.2 Fixed Point and Floating Point Number Representation 4.3 Truncation and Rounding 4.4 Quantization Noise
More informationA Late Acceptance Hill-Climbing algorithm the winner of the International Optimisation Competition
The University of Nottingham, Nottingham, United Kingdom A Late Acceptance Hill-Climbing algorithm the winner of the International Optimisation Competition Yuri Bykov 16 February 2012 ASAP group research
More informationTHE Multiconstrained 0 1 Knapsack Problem (MKP) is
An Improved Genetic Algorithm for the Multiconstrained 0 1 Knapsack Problem Günther R. Raidl Abstract This paper presents an improved hybrid Genetic Algorithm (GA) for solving the Multiconstrained 0 1
More informationJournal of Asian Scientific Research FEATURES COMPOSITION FOR PROFICIENT AND REAL TIME RETRIEVAL IN CBIR SYSTEM. Tohid Sedghi
Journal of Asian Scientific Research, 013, 3(1):68-74 Journal of Asian Scientific Research journal homepage: http://aessweb.com/journal-detail.php?id=5003 FEATURES COMPOSTON FOR PROFCENT AND REAL TME RETREVAL
More informationReview: Final Exam CPSC Artificial Intelligence Michael M. Richter
Review: Final Exam Model for a Learning Step Learner initially Environm ent Teacher Compare s pe c ia l Information Control Correct Learning criteria Feedback changed Learner after Learning Learning by
More informationGrid Scheduling Strategy using GA (GSSGA)
F Kurus Malai Selvi et al,int.j.computer Technology & Applications,Vol 3 (5), 8-86 ISSN:2229-693 Grid Scheduling Strategy using GA () Dr.D.I.George Amalarethinam Director-MCA & Associate Professor of Computer
More informationAdaptive Robotics - Final Report Extending Q-Learning to Infinite Spaces
Adaptive Robotics - Final Report Extending Q-Learning to Infinite Spaces Eric Christiansen Michael Gorbach May 13, 2008 Abstract One of the drawbacks of standard reinforcement learning techniques is that
More informationHeuristic Optimization Introduction and Simple Heuristics
Heuristic Optimization Introduction and Simple Heuristics José M PEÑA (jmpena@fi.upm.es) (Universidad Politécnica de Madrid) 1 Outline 1. What are optimization problems? 2. Exhaustive vs. Heuristic approaches
More informationOPTIMISATION OF PIN FIN HEAT SINK USING TAGUCHI METHOD
CHAPTER - 5 OPTIMISATION OF PIN FIN HEAT SINK USING TAGUCHI METHOD The ever-increasing demand to lower the production costs due to increased competition has prompted engineers to look for rigorous methods
More informationA SIMULATED ANNEALING ALGORITHM FOR SOME CLASS OF DISCRETE-CONTINUOUS SCHEDULING PROBLEMS. Joanna Józefowska, Marek Mika and Jan Węglarz
A SIMULATED ANNEALING ALGORITHM FOR SOME CLASS OF DISCRETE-CONTINUOUS SCHEDULING PROBLEMS Joanna Józefowska, Marek Mika and Jan Węglarz Poznań University of Technology, Institute of Computing Science,
More informationSolving the Capacitated Single Allocation Hub Location Problem Using Genetic Algorithm
Solving the Capacitated Single Allocation Hub Location Problem Using Genetic Algorithm Faculty of Mathematics University of Belgrade Studentski trg 16/IV 11 000, Belgrade, Serbia (e-mail: zoricast@matf.bg.ac.yu)
More information