COMPARATIVE ANALYSIS OF THRESHOLD ACCEPTANCE ALGORITHM, SIMULATED ANNEALING ALGORITHM AND GENETIC ALGORITHM FOR FUNCTION OPTIMIZATION

1
Dr. Tejas P Patalia
Dr. Tejas P Patalia
2
Dr. G.R. Kulkarni
Dr. G.R. Kulkarni
1 VVP Engineering College, Rajkot & Singhania University, Rajasthan

Send Message

To: Author

GJRE Volume 12 Issue I1

Article Fingerprint

ReserarchID

5I9MQ

COMPARATIVE ANALYSIS OF THRESHOLD ACCEPTANCE ALGORITHM, SIMULATED ANNEALING ALGORITHM AND GENETIC ALGORITHM FOR FUNCTION OPTIMIZATION Banner
  • English
  • Afrikaans
  • Albanian
  • Amharic
  • Arabic
  • Armenian
  • Azerbaijani
  • Basque
  • Belarusian
  • Bengali
  • Bosnian
  • Bulgarian
  • Catalan
  • Cebuano
  • Chichewa
  • Chinese (Simplified)
  • Chinese (Traditional)
  • Corsican
  • Croatian
  • Czech
  • Danish
  • Dutch
  • Esperanto
  • Estonian
  • Filipino
  • Finnish
  • French
  • Frisian
  • Galician
  • Georgian
  • German
  • Greek
  • Gujarati
  • Haitian Creole
  • Hausa
  • Hawaiian
  • Hebrew
  • Hindi
  • Hmong
  • Hungarian
  • Icelandic
  • Igbo
  • Indonesian
  • Irish
  • Italian
  • Japanese
  • Javanese
  • Kannada
  • Kazakh
  • Khmer
  • Korean
  • Kurdish (Kurmanji)
  • Kyrgyz
  • Lao
  • Latin
  • Latvian
  • Lithuanian
  • Luxembourgish
  • Macedonian
  • Malagasy
  • Malay
  • Malayalam
  • Maltese
  • Maori
  • Marathi
  • Mongolian
  • Myanmar (Burmese)
  • Nepali
  • Norwegian
  • Pashto
  • Persian
  • Polish
  • Portuguese
  • Punjabi
  • Romanian
  • Russian
  • Samoan
  • Scots Gaelic
  • Serbian
  • Sesotho
  • Shona
  • Sindhi
  • Sinhala
  • Slovak
  • Slovenian
  • Somali
  • Spanish
  • Sundanese
  • Swahili
  • Swedish
  • Tajik
  • Tamil
  • Telugu
  • Thai
  • Turkish
  • Ukrainian
  • Urdu
  • Uzbek
  • Vietnamese
  • Welsh
  • Xhosa
  • Yiddish
  • Yoruba
  • Zulu

The goal of this study of threshold acceptance algorithm (TA), simulated annealing algorithm (SA) and genetic algorithm (GA) is to determine strength of Genetic Algorithm over other algorithm. It gives a clear idea of how genetic algorithm works. It gives the idea of various sub methods used in genetic algorithm to improve the results and outcome. Basically genetic algorithm and all traditional heuristic methods are used for optimization. Optimization problems are class NP complete problems. Genetic algorithm can be viewed as an optimization technique which exploits random search within a defined search space to solve a problem by some intelligence ideas of nature. In this work we have done Comparative analysis of Threshold Acceptance Algorithm, Simulated Annealing Algorithm and Genetic Algorithm by considering different test functions and its constraints to minimize the test functions.

12 Cites in Articles

References

  1. D E Goldberg (1989). Genetic algorithms in search, optimization, and machine learning.
  2. M Bramlette Initialization, mutation and selection methods in genetic algorithm for function optimization.
  3. Morgan Kaufman (1991). Unknown Title.
  4. L Davis Adapting operator probabilities in genetic algorithms.
  5. Morgan Kaufmann (1989). The Morgan Kaufmann Series in Interactive Technologies.
  6. K De,Jong,W Spears (1991). An analysis of interacting roles of population size and crossover in genetic algorithms.
  7. K De,Jong,J Sharma Generation gaps revisited.
  8. Morgan Kaufmann (1992). Unknown Title.
  9. K De,Jong,W Spears (1992). A formal analysis of the role of multi-point crossover in genetic algorithms.
  10. David Fogel (1995). Evolutionary Computation.
  11. D Goldberg,J Richardson (1987). Genetic algorithms with sharing for multimodal function optimization.
  12. M Of Mr,Ghambhava (2002). Pefanis, Julian 88 Smith, Graham 10 Pétillon, Pierre-Yves 32, 34, 36 Starobinski, Jean 80 Picard, Raymond 23 Steiner, George 78 Piemme, Jean-Marie 45 Stock, Brian 34 Poe, Edgar Alan 9, 27 Stourdzé, Yves 45–6 Pompidou, Georges 47 Pontaut, Alain 5 Poole, Roger 40–1 Takemura, Kenichi 1, 16 Pound, Ezra 56 Tassart, Maurice 105 Texier, Jean 38 Theall, Donald 12, 68, 81, 107–8 Reagan, Ronald 79, 116 Thenot, Jean-Paul 74 Resnais, Alain 87 Thibau, Jacques 46 Rickels, Lawrence 53 Todorov, Tzvetan 50 Riesman, Paul 18–19, 22 Torgovnic, M. 106, 108 Rigby, Brian 6, 17, 33, 60 Trudeau, Pierre 5, 46–7, 91, Robbe-Grillet, Alain 87 103–4 Robert, Gilles 118 Rokeby, David 10 Rosenthal, Raymond 2 Vermillac, Michel 25, 27 Vernay, Alain 50 Virilio, Paul 4, 16, 89, 95–7 Said, Edward 22 Sarick, Lila 14 Sarrazin, Jean 105 Watson, Wilfred 119–20 Sartre, Jean-Paul 26 Weinstein, M. A. 12 de Saussure, Ferdinand 80, 90 Weiss, Peter 83 Schaeffer, Pierre 56–8, 60 Williams, Raymond 34 Schafer, R. Murray 83 Wolf, Gary 13 Schwartz, Eugene 15 Wolfe, Tom 104 Sevette, Christian 11 Wolton, Dominique 47 Smart, Barry 94 Zingrone, Frank 9 ŽiŽek, Slavoj 59, 62.

Funding

No external funding was declared for this work.

Conflict of Interest

The authors declare no conflict of interest.

Ethical Approval

No ethics committee approval was required for this article type.

Data Availability

Not applicable for this article.

Dr. Tejas P Patalia. 2012. \u201cCOMPARATIVE ANALYSIS OF THRESHOLD ACCEPTANCE ALGORITHM, SIMULATED ANNEALING ALGORITHM AND GENETIC ALGORITHM FOR FUNCTION OPTIMIZATION\u201d. Global Journal of Research in Engineering - I: Numerical Methods GJRE-I Volume 12 (GJRE Volume 12 Issue I1): .

Download Citation

Journal Specifications

Crossref Journal DOI 10.17406/gjre

Print ISSN 0975-5861

e-ISSN 2249-4596

Classification
Not Found
Version of record

v1.2

Issue date

March 14, 2012

Language

English

Experiance in AR

The methods for personal identification and authentication are no exception.

Read in 3D

The methods for personal identification and authentication are no exception.

Article Matrices
Total Views: 5266
Total Downloads: 2688
2026 Trends
Research Identity (RIN)
Related Research

Published Article

The goal of this study of threshold acceptance algorithm (TA), simulated annealing algorithm (SA) and genetic algorithm (GA) is to determine strength of Genetic Algorithm over other algorithm. It gives a clear idea of how genetic algorithm works. It gives the idea of various sub methods used in genetic algorithm to improve the results and outcome. Basically genetic algorithm and all traditional heuristic methods are used for optimization. Optimization problems are class NP complete problems. Genetic algorithm can be viewed as an optimization technique which exploits random search within a defined search space to solve a problem by some intelligence ideas of nature. In this work we have done Comparative analysis of Threshold Acceptance Algorithm, Simulated Annealing Algorithm and Genetic Algorithm by considering different test functions and its constraints to minimize the test functions.

Our website is actively being updated, and changes may occur frequently. Please clear your browser cache if needed. For feedback or error reporting, please email [email protected]
×

This Page is Under Development

We are currently updating this article page for a better experience.

Request Access

Please fill out the form below to request access to this research paper. Your request will be reviewed by the editorial or author team.
X

Quote and Order Details

Contact Person

Invoice Address

Notes or Comments

This is the heading

Lorem ipsum dolor sit amet, consectetur adipiscing elit. Ut elit tellus, luctus nec ullamcorper mattis, pulvinar dapibus leo.

High-quality academic research articles on global topics and journals.

COMPARATIVE ANALYSIS OF THRESHOLD ACCEPTANCE ALGORITHM, SIMULATED ANNEALING ALGORITHM AND GENETIC ALGORITHM FOR FUNCTION OPTIMIZATION

Dr. Tejas P Patalia
Dr. Tejas P Patalia VVP Engineering College, Rajkot & Singhania University, Rajasthan
Dr. G.R. Kulkarni
Dr. G.R. Kulkarni

Research Journals