Enviar pesquisa
Carregar
35 38
•
0 gostou
•
278 visualizações
Ijarcsee Journal
Seguir
Tecnologia
Denunciar
Compartilhar
Denunciar
Compartilhar
1 de 4
Baixar agora
Baixar para ler offline
Recomendados
Sota
Sota
guesta4fafe
50120140504022
50120140504022
IAEME Publication
Genetic algorithm
Genetic algorithm
Megha V
Optimization of Mechanical Design Problems Using Improved Differential Evolut...
Optimization of Mechanical Design Problems Using Improved Differential Evolut...
IDES Editor
OWA BASED MAGDM TECHNIQUE IN EVALUATING DIAGNOSTIC LABORATORY UNDER FUZZY ENV...
OWA BASED MAGDM TECHNIQUE IN EVALUATING DIAGNOSTIC LABORATORY UNDER FUZZY ENV...
ijfls
[IJCT-V3I2P31] Authors: Amarbir Singh
[IJCT-V3I2P31] Authors: Amarbir Singh
IJET - International Journal of Engineering and Techniques
Genetic Approach to Parallel Scheduling
Genetic Approach to Parallel Scheduling
IOSR Journals
Ravens intelligence test
Ravens intelligence test
Polytechnic University of the Philippines
Recomendados
Sota
Sota
guesta4fafe
50120140504022
50120140504022
IAEME Publication
Genetic algorithm
Genetic algorithm
Megha V
Optimization of Mechanical Design Problems Using Improved Differential Evolut...
Optimization of Mechanical Design Problems Using Improved Differential Evolut...
IDES Editor
OWA BASED MAGDM TECHNIQUE IN EVALUATING DIAGNOSTIC LABORATORY UNDER FUZZY ENV...
OWA BASED MAGDM TECHNIQUE IN EVALUATING DIAGNOSTIC LABORATORY UNDER FUZZY ENV...
ijfls
[IJCT-V3I2P31] Authors: Amarbir Singh
[IJCT-V3I2P31] Authors: Amarbir Singh
IJET - International Journal of Engineering and Techniques
Genetic Approach to Parallel Scheduling
Genetic Approach to Parallel Scheduling
IOSR Journals
Ravens intelligence test
Ravens intelligence test
Polytechnic University of the Philippines
Nakayama Estimation Of Viewers Response For Contextual Understanding Of Tasks...
Nakayama Estimation Of Viewers Response For Contextual Understanding Of Tasks...
Kalle
Meta analysis-sloan
Meta analysis-sloan
John Turner
Chapter3
Chapter3
Yi-Cheng Tsai
Blind Image Quality Assessment with Local Contrast Features
Blind Image Quality Assessment with Local Contrast Features
ijcisjournal
An Information-Theoretic Approach for Clonal Selection Algorithms
An Information-Theoretic Approach for Clonal Selection Algorithms
Mario Pavone
L018147377
L018147377
IOSR Journals
Collocation Extraction Performance Ratings Using Fuzzy logic
Collocation Extraction Performance Ratings Using Fuzzy logic
Waqas Tariq
FOCUS.doc
FOCUS.doc
butest
Diversity-Aware Mutation Adequacy Criterion for Improving Fault Detection Cap...
Diversity-Aware Mutation Adequacy Criterion for Improving Fault Detection Cap...
Donghwan Shin
A Theoretical Framework for Understanding Mutation-Based Testing Methods
A Theoretical Framework for Understanding Mutation-Based Testing Methods
Donghwan Shin
Topic_6
Topic_6
butest
Test for HIV-associated cognitive impairment in India
Test for HIV-associated cognitive impairment in India
Kimberly Schafer
MultiModal Identification System in Monozygotic Twins
MultiModal Identification System in Monozygotic Twins
CSCJournals
Paper Gloria Cea - Goal-Oriented Design Methodology Applied to User Interface...
Paper Gloria Cea - Goal-Oriented Design Methodology Applied to User Interface...
WTHS
2008 JSM - Meta Study Data vs Patient Data
2008 JSM - Meta Study Data vs Patient Data
Terry Liao
ICSM09.ppt
ICSM09.ppt
Ptidej Team
1 5
1 5
Ijarcsee Journal
109 115
109 115
Ijarcsee Journal
41 45
41 45
Ijarcsee Journal
6 11
6 11
Ijarcsee Journal
16 18
16 18
Ijarcsee Journal
20 26
20 26
Ijarcsee Journal
Mais conteúdo relacionado
Mais procurados
Nakayama Estimation Of Viewers Response For Contextual Understanding Of Tasks...
Nakayama Estimation Of Viewers Response For Contextual Understanding Of Tasks...
Kalle
Meta analysis-sloan
Meta analysis-sloan
John Turner
Chapter3
Chapter3
Yi-Cheng Tsai
Blind Image Quality Assessment with Local Contrast Features
Blind Image Quality Assessment with Local Contrast Features
ijcisjournal
An Information-Theoretic Approach for Clonal Selection Algorithms
An Information-Theoretic Approach for Clonal Selection Algorithms
Mario Pavone
L018147377
L018147377
IOSR Journals
Collocation Extraction Performance Ratings Using Fuzzy logic
Collocation Extraction Performance Ratings Using Fuzzy logic
Waqas Tariq
FOCUS.doc
FOCUS.doc
butest
Diversity-Aware Mutation Adequacy Criterion for Improving Fault Detection Cap...
Diversity-Aware Mutation Adequacy Criterion for Improving Fault Detection Cap...
Donghwan Shin
A Theoretical Framework for Understanding Mutation-Based Testing Methods
A Theoretical Framework for Understanding Mutation-Based Testing Methods
Donghwan Shin
Topic_6
Topic_6
butest
Test for HIV-associated cognitive impairment in India
Test for HIV-associated cognitive impairment in India
Kimberly Schafer
MultiModal Identification System in Monozygotic Twins
MultiModal Identification System in Monozygotic Twins
CSCJournals
Paper Gloria Cea - Goal-Oriented Design Methodology Applied to User Interface...
Paper Gloria Cea - Goal-Oriented Design Methodology Applied to User Interface...
WTHS
2008 JSM - Meta Study Data vs Patient Data
2008 JSM - Meta Study Data vs Patient Data
Terry Liao
ICSM09.ppt
ICSM09.ppt
Ptidej Team
Mais procurados
(16)
Nakayama Estimation Of Viewers Response For Contextual Understanding Of Tasks...
Nakayama Estimation Of Viewers Response For Contextual Understanding Of Tasks...
Meta analysis-sloan
Meta analysis-sloan
Chapter3
Chapter3
Blind Image Quality Assessment with Local Contrast Features
Blind Image Quality Assessment with Local Contrast Features
An Information-Theoretic Approach for Clonal Selection Algorithms
An Information-Theoretic Approach for Clonal Selection Algorithms
L018147377
L018147377
Collocation Extraction Performance Ratings Using Fuzzy logic
Collocation Extraction Performance Ratings Using Fuzzy logic
FOCUS.doc
FOCUS.doc
Diversity-Aware Mutation Adequacy Criterion for Improving Fault Detection Cap...
Diversity-Aware Mutation Adequacy Criterion for Improving Fault Detection Cap...
A Theoretical Framework for Understanding Mutation-Based Testing Methods
A Theoretical Framework for Understanding Mutation-Based Testing Methods
Topic_6
Topic_6
Test for HIV-associated cognitive impairment in India
Test for HIV-associated cognitive impairment in India
MultiModal Identification System in Monozygotic Twins
MultiModal Identification System in Monozygotic Twins
Paper Gloria Cea - Goal-Oriented Design Methodology Applied to User Interface...
Paper Gloria Cea - Goal-Oriented Design Methodology Applied to User Interface...
2008 JSM - Meta Study Data vs Patient Data
2008 JSM - Meta Study Data vs Patient Data
ICSM09.ppt
ICSM09.ppt
Destaque
1 5
1 5
Ijarcsee Journal
109 115
109 115
Ijarcsee Journal
41 45
41 45
Ijarcsee Journal
6 11
6 11
Ijarcsee Journal
16 18
16 18
Ijarcsee Journal
20 26
20 26
Ijarcsee Journal
44 49
44 49
Ijarcsee Journal
130 133
130 133
Ijarcsee Journal
116 121
116 121
Ijarcsee Journal
Destaque
(9)
1 5
1 5
109 115
109 115
41 45
41 45
6 11
6 11
16 18
16 18
20 26
20 26
44 49
44 49
130 133
130 133
116 121
116 121
Semelhante a 35 38
Parallel evolutionary approach paper
Parallel evolutionary approach paper
Priti Punia
COMPARISON BETWEEN THE GENETIC ALGORITHMS OPTIMIZATION AND PARTICLE SWARM OPT...
COMPARISON BETWEEN THE GENETIC ALGORITHMS OPTIMIZATION AND PARTICLE SWARM OPT...
IAEME Publication
Comparison between the genetic algorithms optimization and particle swarm opt...
Comparison between the genetic algorithms optimization and particle swarm opt...
IAEME Publication
Biology-Derived Algorithms in Engineering Optimization
Biology-Derived Algorithms in Engineering Optimization
Xin-She Yang
A Non-Revisiting Genetic Algorithm for Optimizing Numeric Multi-Dimensional F...
A Non-Revisiting Genetic Algorithm for Optimizing Numeric Multi-Dimensional F...
ijcsa
Optimization technique genetic algorithm
Optimization technique genetic algorithm
Uday Wankar
Software Testing Using Genetic Algorithms
Software Testing Using Genetic Algorithms
IJCSES Journal
A Genetic Algorithm on Optimization Test Functions
A Genetic Algorithm on Optimization Test Functions
IJMERJOURNAL
Artificial Intelligence in Robot Path Planning
Artificial Intelligence in Robot Path Planning
iosrjce
T01732115119
T01732115119
IOSR Journals
Performance Analysis of Genetic Algorithm as a Stochastic Optimization Tool i...
Performance Analysis of Genetic Algorithm as a Stochastic Optimization Tool i...
paperpublications3
List the problems that can be efficiently solved by Evolutionary P.pdf
List the problems that can be efficiently solved by Evolutionary P.pdf
infomalad
Hc3413121317
Hc3413121317
IJERA Editor
I045046066
I045046066
IJERA Editor
Survey on evolutionary computation tech techniques and its application in dif...
Survey on evolutionary computation tech techniques and its application in dif...
ijitjournal
Optimization of Mechanical Design Problems Using Improved Differential Evolut...
Optimization of Mechanical Design Problems Using Improved Differential Evolut...
IDES Editor
Multi-Population Methods with Adaptive Mutation for Multi-Modal Optimization ...
Multi-Population Methods with Adaptive Mutation for Multi-Modal Optimization ...
ijscai
Dynamic Radius Species Conserving Genetic Algorithm for Test Generation for S...
Dynamic Radius Species Conserving Genetic Algorithm for Test Generation for S...
ijseajournal
Software testing using genetic algorithms
Software testing using genetic algorithms
Nurhussen Menza
E034023028
E034023028
ijceronline
Semelhante a 35 38
(20)
Parallel evolutionary approach paper
Parallel evolutionary approach paper
COMPARISON BETWEEN THE GENETIC ALGORITHMS OPTIMIZATION AND PARTICLE SWARM OPT...
COMPARISON BETWEEN THE GENETIC ALGORITHMS OPTIMIZATION AND PARTICLE SWARM OPT...
Comparison between the genetic algorithms optimization and particle swarm opt...
Comparison between the genetic algorithms optimization and particle swarm opt...
Biology-Derived Algorithms in Engineering Optimization
Biology-Derived Algorithms in Engineering Optimization
A Non-Revisiting Genetic Algorithm for Optimizing Numeric Multi-Dimensional F...
A Non-Revisiting Genetic Algorithm for Optimizing Numeric Multi-Dimensional F...
Optimization technique genetic algorithm
Optimization technique genetic algorithm
Software Testing Using Genetic Algorithms
Software Testing Using Genetic Algorithms
A Genetic Algorithm on Optimization Test Functions
A Genetic Algorithm on Optimization Test Functions
Artificial Intelligence in Robot Path Planning
Artificial Intelligence in Robot Path Planning
T01732115119
T01732115119
Performance Analysis of Genetic Algorithm as a Stochastic Optimization Tool i...
Performance Analysis of Genetic Algorithm as a Stochastic Optimization Tool i...
List the problems that can be efficiently solved by Evolutionary P.pdf
List the problems that can be efficiently solved by Evolutionary P.pdf
Hc3413121317
Hc3413121317
I045046066
I045046066
Survey on evolutionary computation tech techniques and its application in dif...
Survey on evolutionary computation tech techniques and its application in dif...
Optimization of Mechanical Design Problems Using Improved Differential Evolut...
Optimization of Mechanical Design Problems Using Improved Differential Evolut...
Multi-Population Methods with Adaptive Mutation for Multi-Modal Optimization ...
Multi-Population Methods with Adaptive Mutation for Multi-Modal Optimization ...
Dynamic Radius Species Conserving Genetic Algorithm for Test Generation for S...
Dynamic Radius Species Conserving Genetic Algorithm for Test Generation for S...
Software testing using genetic algorithms
Software testing using genetic algorithms
E034023028
E034023028
Mais de Ijarcsee Journal
122 129
122 129
Ijarcsee Journal
104 108
104 108
Ijarcsee Journal
99 103
99 103
Ijarcsee Journal
93 98
93 98
Ijarcsee Journal
88 92
88 92
Ijarcsee Journal
82 87
82 87
Ijarcsee Journal
78 81
78 81
Ijarcsee Journal
73 77
73 77
Ijarcsee Journal
65 72
65 72
Ijarcsee Journal
58 64
58 64
Ijarcsee Journal
52 57
52 57
Ijarcsee Journal
46 51
46 51
Ijarcsee Journal
36 40
36 40
Ijarcsee Journal
28 35
28 35
Ijarcsee Journal
24 27
24 27
Ijarcsee Journal
19 23
19 23
Ijarcsee Journal
12 15
12 15
Ijarcsee Journal
134 138
134 138
Ijarcsee Journal
125 131
125 131
Ijarcsee Journal
114 120
114 120
Ijarcsee Journal
Mais de Ijarcsee Journal
(20)
122 129
122 129
104 108
104 108
99 103
99 103
93 98
93 98
88 92
88 92
82 87
82 87
78 81
78 81
73 77
73 77
65 72
65 72
58 64
58 64
52 57
52 57
46 51
46 51
36 40
36 40
28 35
28 35
24 27
24 27
19 23
19 23
12 15
12 15
134 138
134 138
125 131
125 131
114 120
114 120
Último
Beyond Boundaries: Leveraging No-Code Solutions for Industry Innovation
Beyond Boundaries: Leveraging No-Code Solutions for Industry Innovation
Safe Software
Developer Data Modeling Mistakes: From Postgres to NoSQL
Developer Data Modeling Mistakes: From Postgres to NoSQL
ScyllaDB
Streamlining Python Development: A Guide to a Modern Project Setup
Streamlining Python Development: A Guide to a Modern Project Setup
Florian Wilhelm
Gen AI in Business - Global Trends Report 2024.pdf
Gen AI in Business - Global Trends Report 2024.pdf
Addepto
"Federated learning: out of reach no matter how close",Oleksandr Lapshyn
"Federated learning: out of reach no matter how close",Oleksandr Lapshyn
Fwdays
The Future of Software Development - Devin AI Innovative Approach.pdf
The Future of Software Development - Devin AI Innovative Approach.pdf
SeasiaInfotech2
Install Stable Diffusion in windows machine
Install Stable Diffusion in windows machine
Padma Pradeep
New from BookNet Canada for 2024: BNC CataList - Tech Forum 2024
New from BookNet Canada for 2024: BNC CataList - Tech Forum 2024
BookNet Canada
"Subclassing and Composition – A Pythonic Tour of Trade-Offs", Hynek Schlawack
"Subclassing and Composition – A Pythonic Tour of Trade-Offs", Hynek Schlawack
Fwdays
My INSURER PTE LTD - Insurtech Innovation Award 2024
My INSURER PTE LTD - Insurtech Innovation Award 2024
The Digital Insurer
Commit 2024 - Secret Management made easy
Commit 2024 - Secret Management made easy
Alfredo García Lavilla
Training state-of-the-art general text embedding
Training state-of-the-art general text embedding
Zilliz
DevoxxFR 2024 Reproducible Builds with Apache Maven
DevoxxFR 2024 Reproducible Builds with Apache Maven
Hervé Boutemy
Tampa BSides - Chef's Tour of Microsoft Security Adoption Framework (SAF)
Tampa BSides - Chef's Tour of Microsoft Security Adoption Framework (SAF)
Mark Simos
Designing IA for AI - Information Architecture Conference 2024
Designing IA for AI - Information Architecture Conference 2024
Enterprise Knowledge
CloudStudio User manual (basic edition):
CloudStudio User manual (basic edition):
comworks
Human Factors of XR: Using Human Factors to Design XR Systems
Human Factors of XR: Using Human Factors to Design XR Systems
Mark Billinghurst
Are Multi-Cloud and Serverless Good or Bad?
Are Multi-Cloud and Serverless Good or Bad?
Mattias Andersson
"LLMs for Python Engineers: Advanced Data Analysis and Semantic Kernel",Oleks...
"LLMs for Python Engineers: Advanced Data Analysis and Semantic Kernel",Oleks...
Fwdays
DevEX - reference for building teams, processes, and platforms
DevEX - reference for building teams, processes, and platforms
Sergiu Bodiu
Último
(20)
Beyond Boundaries: Leveraging No-Code Solutions for Industry Innovation
Beyond Boundaries: Leveraging No-Code Solutions for Industry Innovation
Developer Data Modeling Mistakes: From Postgres to NoSQL
Developer Data Modeling Mistakes: From Postgres to NoSQL
Streamlining Python Development: A Guide to a Modern Project Setup
Streamlining Python Development: A Guide to a Modern Project Setup
Gen AI in Business - Global Trends Report 2024.pdf
Gen AI in Business - Global Trends Report 2024.pdf
"Federated learning: out of reach no matter how close",Oleksandr Lapshyn
"Federated learning: out of reach no matter how close",Oleksandr Lapshyn
The Future of Software Development - Devin AI Innovative Approach.pdf
The Future of Software Development - Devin AI Innovative Approach.pdf
Install Stable Diffusion in windows machine
Install Stable Diffusion in windows machine
New from BookNet Canada for 2024: BNC CataList - Tech Forum 2024
New from BookNet Canada for 2024: BNC CataList - Tech Forum 2024
"Subclassing and Composition – A Pythonic Tour of Trade-Offs", Hynek Schlawack
"Subclassing and Composition – A Pythonic Tour of Trade-Offs", Hynek Schlawack
My INSURER PTE LTD - Insurtech Innovation Award 2024
My INSURER PTE LTD - Insurtech Innovation Award 2024
Commit 2024 - Secret Management made easy
Commit 2024 - Secret Management made easy
Training state-of-the-art general text embedding
Training state-of-the-art general text embedding
DevoxxFR 2024 Reproducible Builds with Apache Maven
DevoxxFR 2024 Reproducible Builds with Apache Maven
Tampa BSides - Chef's Tour of Microsoft Security Adoption Framework (SAF)
Tampa BSides - Chef's Tour of Microsoft Security Adoption Framework (SAF)
Designing IA for AI - Information Architecture Conference 2024
Designing IA for AI - Information Architecture Conference 2024
CloudStudio User manual (basic edition):
CloudStudio User manual (basic edition):
Human Factors of XR: Using Human Factors to Design XR Systems
Human Factors of XR: Using Human Factors to Design XR Systems
Are Multi-Cloud and Serverless Good or Bad?
Are Multi-Cloud and Serverless Good or Bad?
"LLMs for Python Engineers: Advanced Data Analysis and Semantic Kernel",Oleks...
"LLMs for Python Engineers: Advanced Data Analysis and Semantic Kernel",Oleks...
DevEX - reference for building teams, processes, and platforms
DevEX - reference for building teams, processes, and platforms
35 38
1.
ISSN: 2277 –
9043 International Journal of Advanced Research in Computer Science and Electronics Engineering Volume 1, Issue 5, July 2012 Optimization of DE Jong’s Function Using Genetic Algorithm Approach Meera Kapoor, Vaishali Wadhwa evaluated on a solution. Similarly, a set of feasible solutions Abstract— Genetic algorithm is a search algorithm based on takes the place of a population of organisms. An individual the mechanics of natural selection and natural genetics. The is a string of binary digits or some other set of symbols purpose of this master thesis is to optimize/maximize de Jong’s drawn from a finite set. Each encoded individual in the function1 in GA using different selection schemes (like roulette population may be viewed as a representation of a particular wheel,random selection, besy fit/elitist fit rank selection, solution to a problem. tournament selection). For our problem the fitness function chosen is from literature of benchmark functions commonly De Jon'g function is popular in genetic algorithm literature. used in order to test optimization procedures dedicated for Is is also known as sphere model. It is continuous, convex multidimensional, continuous optimization task. The and unimodal. terminating Criterion is the number of iterations for which the algorithm runs Function definition: Index Terms— De Jong’s function, roulette wheel selection, elitist fit rank selection F1(x) = , -5.12<=xi <=5.12 I. INTRODUCTION F1(x)=sum(x(i)^2), where, i =1:n and -5.12<=x(i)<=5.12. The genetic algorithm is a search algorithm based on the mechanics of natural selection and natural genetics. As Global minimum is at: f (x)=0, x(i)=0, where, i =1:n. summarized by Tomassini , the main idea is that in order for a population of individuals to adapt to some environment, it should behave like a natural system. This means that II. DIFFERENCE BETWEEN GENETIC ALGORITHM survival and reproduction of an individual is promoted by AND OTHER COVENTIONAL TECHNIQUES the elimination of useless or harmful traits and by rewarding useful behavior. The genetic algorithm belongs to the family GA’s operate with coded versions of the problem of evolutionary algorithms, along with genetic parameters rather than parameters themselves i.e., programming, evolution strategies, and evolutionary GA works with the coding of solution set and not programming. Evolutionary algorithms can be considered as with the solution itself. a broad class of stochastic optimization techniques. Almost all conventional optimization techniques An evolutionary algorithm maintains a population of search from a single point but GA’s always operate candidate solutions for the problem at hand. The population on a whole population of points (strings) i.e., GA is then evolved by the iterative application of a set of uses population of solutions rather than a single stochastic operators. The set of operators usually consists of solution for searching. This plays a major role to mutation, recombination, and selection or something very the robustness of genetic algorithms. It improves similar. Globally satisfactory, if sub-optimal, solutions to the chance of reaching the global optimum and also the problem are found in much the same way as populations helps in avoiding local stationary point. in nature adapt to their surrounding environment. GA uses fitness function for evaluation rather than Using Tomassini’s terms, genetic algorithms (GA’s) derivatives. As a result, they can be applied to any consider an optimization problem as the environment where kind of continuous or discrete optimization feasible solutions are the individuals living in that problems. The key point to give stress here is to environment. The degree of adaptation of an individual to identify and specify a meaningful decoding its environment is the counterpart of the fitness function function. Manuscript received Oct 15, 2011. GA’s use probabilistic transition rules while Meera Kapoor, Computer Science and Engineering deptt., N.C. conventional methods for continuous optimization College of Engineering., (e-mail: meerakapoor03@gmail.com). Panipat, apply deterministic transition rules i.e., GA’s does India, Vaishali Wadhwa, Computer Science and Engineering Deptt., N.C. not use deterministic rules. College of Engineering, Karnal, India, (e-mail: wadhwavaishali@gmail.com ). 35 All Rights Reserved © 2012 IJARCSEE
2.
ISSN: 2277 –
9043 International Journal of Advanced Research in Computer Science and Electronics Engineering Volume 1, Issue 5, July 2012 III. PROBLEM FORMULATION V. ANALYZING SELECTION METHOD PERFORMANCE For our problem the fitness function chosen is from literature of benchmark functions commonly used in order Some chromosomes are randomly chosen and calculated to test optimization procedures dedicated for the fitness value using some selection algorithms. It has multidimensional, continuous optimization task. The quality been shown with the help of table given below that different of optimization procedures are frequently evaluated by algorithm gives different value by applying different using common standard literature benchmarks. number of iterations. There are several classes of such test functions, all of them are continuous: No. Fitness Values (a) Unimodal, convex, multidimensional, of Roulette Random Best Fit/Elitist Iterations Wheel Selection Selection (b) Multimodal, two-dimensional with a small number of Selection local extremes, 10 64.58 60.15 58.64 (c) Multimodal, two-dimensional with huge number of local extremes 20 73.61 67.27 60.82 (d) Multimodal, multidimensional, with huge number of 30 75.64 71.56 63.12 local extremes. The one which is used in this work is De Jong’s function 1, 40 80.76 70.24 69.71 also called as sphere model. The simplest test function is De Jong's function 1. It is also known as sphere model. It is 50 86.78 64.18 70.17 continuous, convex and unimodal. It has the following general definition: 60 88.73 60.74 74.74 70 93.27 68.42 78.36 80 107.38 73.78 84.70 F1(x) = , -5.12<=xi <=5.12 90 116.28 89.92 98.88 F1(x)=sum(x(i)^2), where, i =1:n and -5.12<=x(i)<=5.12. Comparison of fitness values with different selection Global minimum is at: f (x)=0, x(i)=0, where, i =1:n. techniques Here it is shown that, how in different number of iterations the fitness values of different selection techniques changes IV. WHY THIS PROBLEM IS CHOOSEN and one of them finally reaches a maximum value, optimizing the function under processing. Genetic Algorithm has an interest of me. Due to this interest I have chosen this genetic algorithm approach to As it can be seen here the random selection converges to a optimize De jong’s function1. There are several bench mark value which is very less as compared to the other selection functions named de jong's function1, axis parallel hyper- techniques under consideration, whereas the other technique i.e. Best Fit/Elitist usually gives better results as compared ellipsoid function, rotated hyper-ellipsoid function, moved to the other one, but is far less as compared to the roulette axis parallel hyper-ellipsoid function, rosenbrock's valley(de wheel selection. So it is clear that out of the three better one jong's function2), rastrigin's function6, schwefel's function7, is roulette wheel selection. grienwangk's function8, sum of different power function9, ackley's path function10, langermann's function11, michalewicz's function12, branins rcos function, easom's function, goldstein-price's function and six-hump camel VI. CONCLUSION back function. I have selected de jong's function1. I have selected this function because of its simplicity. Three The word Function optimization/maximization is the main point of discussion in this dissertation. Actually this selection algorithm has been used with this function to dissertation is based on implementing De Jong’s function1 optimize this function i.e roulette wheel, random selection, i.e. sphere model using different selection techniques used best fit/elitist fit. I have compared this three selection in Genetic algorithm and making a comparison of them algortihm to show which algorithm gives best result. based on the fitness values of function at different number of iterations. 36 All Rights Reserved © 2012 IJARCSEE
3.
ISSN: 2277 –
9043 International Journal of Advanced Research in Computer Science and Electronics Engineering Volume 1, Issue 5, July 2012 Basically GA is one of the better function optimization Results of various selection techniques for appt. no. of methods generally employed now days. De Jong’s iterations. function1, also known as sphere model is one of the various Then one of the selection techniques has been employed benchmark functions that can be found in the GA’s over the encoded population and after that a special type of literature. crossover is performed, i.e. arithmetic crossover. After the The encoding scheme for this problem of function crossover operation, mutation is performed, but after every maximization is value/real encoding. And so a different type 5 iterations. Then this operation is repeated for the required of crossover method is applied for crossing the number of iterations. The results generated for our problem chromosomes in the population for producing better at hand are shown in Figure below offspring’s. And finally the mutation method used is also The bar graph shown here is about the results showing the different than the usual ones. Uniform mutation is used fitness values of various selection techniques, when applied while implementing this algorithm. for de Jong’s function1. The results that came out are in The main point around which all this work revolves is the favour of the roulette wheel selection technique. With this different selection techniques employed for running this technique for implementing de Jong’s function1 results in algorithm. All other parameters are kept constant, except the convergence towards the maximum attainable value within three selection techniques (Roulette wheel, Random the specified number of iterations. But with other functions selection and Best Fit/Elitist). Termination criteria chosen is the function converges to a less optimal value. So, with the number of iterations and the function reaching its these results it can be interpreted that when de Jong’s maximum value. function1 is being implemented with these three selection techniques (keeping other parameters of a genetic algorithm After all the experimentation and implementation, results as constant), the roulette wheel selection gives better results. that came out are like, out of all these three selection Further these results can be shown using line graphs also, techniques, best one is the roulette wheel selection. Roulette comparing the results for these three selection methods. wheel is a probability based selection technique. VII. FUTURE SCOPE ACKNOWLEDGMENT In future, further other different selection techniques can be We present a great thanks to “N. C. College of employed for maximizing this function. And other prospect Engineering, Israna, Panipat for sponsor and financial in future can be, changing other parts of the genetic support algorithm keeping a particular selection technique fixed which might finally show even better results as compared to that came now. And further a larger size of chromosomes REFERENCES could be used for better results. [1] [BBW09] Birch, J. B. & Wan, W. (2009). An Improved Genetic Algorithm Using a Directional Search. Tech report presented at Virginia Polytechnic Institute and State University, Blacksburg. [2] [BRY00] Bryant, Kylie (2000). Genetic Algorithms and the Traveling VIII. RESULTS Salesman Problem, in Proceedings of 1st GNT Regional Conference on Mathematics, Statistics and Applications. [3] [BFM97] Back, T., Fogel, David B. & Michalewicz, Z. (Eds.) (1997). The procedure followed while implementing it is first Handbook of Evolutionary Computation. Computational Intelligence, started with randomly generating the population of Library Oxford University Press in cooperation with the Institute chromosomes, for this implementation population chosen is of Physics Publishing / CRC Press, Bristol, New York, ring 4 only with each chromosome having length of 5 genes. bound edition. ISBN: 0-7503-0392-1, 978-0-75030-392-7, 0-7503- 0895-8, 978-0-75030-895-3. This process in GA has been called as encoding the input [Partly available online at- population. http://books.google.de/books?id=n5nuiIZvmpAC] [Accessed 2010-12-13] [4] [BKT96] Back, T. (1996). Evolutionary Algorithms in Theory and Practice: Evolution Strategies, Evolutionary Programming, Genetic Algorithms. Oxford University Press US. ISBN: 0-1950-9971-0, 978- 0-19509-971-3. [Partly available online at- http://books.google.de/books?id=EaN7kvl5coYC] [Accessed 2010-12-04] [5] [COC00] Coello, Carlos (2000). An updated survey of GA-based multiobjective optimization techniques, ACM Computing Surveys, vol. 32, no. 2, pp. 109-143. [6] [DHR08] Dehuri, S. et al. (2008). Application of elitist multi- objective genetic algorithm for classification rule generation, Applied Soft Computing, pp. 477–487. [7] [DRP07] Pakhira, M. K. & Rajat, K. De (2007). Generational Pipelined Genetic Algorithm (PLGA) using Stochastic Selection. International journal of computer systems science and engineering vol. 1, no. 1, ISSN 1307-430X [8] [DEG02] Goldberg, D. E. (2002). The Design of Innovation: Lessons from and for Competent Genetic Algorithms. Norwell, MA: Kluwer. 37 All Rights Reserved © 2012 IJARCSEE
4.
ISSN: 2277 –
9043 International Journal of Advanced Research in Computer Science and Electronics Engineering Volume 1, Issue 5, July 2012 [9] [DJN98] Jong, K. De (1998). Learning with Genetic Algorithm: An overview, Machine Learning vol. 3, Kluwar Academic publishers. [10] [DAV91] Davis, L. (1991). Handbook of Genetic Algorithm. Von Nostrand Reinhold, Newyork. [11] [DEG89] Goldberg, D. E. (1989). Genetic Algorithms in Search, Optimization, and Machine Learning. Boston: Addison-Wesley [12] [DAV87] Davis, L. (1987). Genetic algorithm and simulated annealing. Research Notes in AI. [13] [FML00] Lobo, Fernando Miguel (2000).The parameter-less genetic algorithm: rational and automated parameter selection for simplified genetic algorithm operation. Paper submitted in International Conference on Genetic Algorithms, in Lisboa. [14] [HBO06] Omar, M., Baharum, A., & Hasan, Y. Abu (2006). A Job- Shop Scheduling Problem (JSSP) Using Genetic Algorithm ,in Proceedings of 2nd IMT-GT Regional Conference on Mathematics, Statistics and Applications, University Sains Malaysia, Penag. [15] [HAN00] Hanne, Thomas (2000). Global multiobjective optimization using evolutionary algorithms. Journal of Heuristics, vol. 6, no. 3, pp. 347-360. [16] [KHI06] Inazawa, H. & Kitakaze, K. (2006). Locus-Shift Operator for Function Optimization in Genetic Algorithms. Complex Systems Publications, Inc. [17] [KOZ92] Koza, J. R. (1992). Genetic Programming: On the Programming of Computers by Means of Natural Selection. Cambridge, MA: MIT Press. [18] [LTK98] Lau, T. L. & Tsang, E. P. K. (1998). Guided genetic algorithm and its application to the generalized assignment problem, Submitted to Computers and Operations Research. Meera Kapoor obtained the B.Tech degree in Computer Science and Engineering from Kurukshetra University, Kurukshetra, India in 2008. She is presently working as Lecturer in Department of Computer Science and Engineering at N. C. College of Engineering, Israna, Panipat. She is presently pursuing her M.Tech from the same institute. She has guided several B.Tech projects. Her research interests include algorithms, soft computing, and operational research. . Vaishali Wadhwa was born in India, Haryana, in 1980. She received B.Tech. and M.Tech. degrees in Computer Science & Engg. from Mahrishi Dayanand University, Rohtak and Kurukshetra University, Kurukshetra, (India) in 2003 and 2009 respectively. She is currently working toward the Ph.D. degree in Computer Science and engineering at Thapar University, Patiala, India, under the guidance of Dr. Deepak Garg(Astt. Prof. at Thapar University, Patiala, India). Her research interests include algorithms, soft computing, and operational research. Ms. Vaishali is currently a research scholoar of Thapar University proceeding her research work for the promotion of location problems and their optimization methods. . 38 All Rights Reserved © 2012 IJARCSEE
Baixar agora