Research article · 2016
Research articlePublished 2022
Analysing and integrating evolutionary algorithms towards optimum solution
Abstract
Select any words in the title or abstract, or press this and choose a sentence.
In the theory of evolutionary algorithms (EAs), computational time complexity is an essential problem. This study reports on the average time complexity of EAs. Researchers have been studying the computational time complexity of evolutionary algorithms since the mid1990s (EAs). The earliest findings were based on toy problems using extremely simple algorithms like the (1+1)-EA. This work resulted in a better knowledge of how EAs perform on various types of fitness landscapes, as well as generic mathematical methods that could be used to analyse increasingly complex EAs on more realistic challenges. In reality, it has been able to study the (1+1)-EA on combinatorial optimization problems with real-world applications, as well as more realistic population-based EAs on structured toy problems in recent years. The results of these two study lines have been surveyed in this report. The most prevalent mathematical procedures are presented, as well as the essential ideas that underpin them and their various applications.
Keywords
Subjects
Computer Science & ITAsk about this article
Answers come only from this article's title, abstract and keywords, each sentence pointing to where it comes from. Your question is sent to OpenAI to write the answer. Scholars Central does not store it.
Similar by topic
Commentary · 7 Aug 2023
Evolutionary Computation: Adapting Biological Processes for Algorithmic Innovation
Article · 29 May 2024
Swarm Behavior and Evolutionary Algorithms: Future of Nature-Inspired Computing
Commentary · 29 Dec 2023
Evolutionary Algorithms in the Digital Age: A Deep Dive into Computational Evolution
Research article · 2020
Estimation of First Passage Time Probabilities at Second Transition respecting Evolutionary MCMC Algorithms
More from this journal
The newest in International Journal of Computer Science and Mobile Applications.
Article · 16 Dec 2024
Ai-Driven Wound Healing Analysis and Progression Tracking in Mobile Applications:A Scalable Approach for Healthcare Accessibility
Article · 2 Dec 2024
Bounded Number Theory: A Study on the Negation of Infinite Numbers in Parts or Completely
Article · 13 Nov 2024
Diversity of Thought Elicits Stronger Reasoning Capabilities in Multi-Agent Debate Frameworks
Conferences in this field
Upcoming conferences in this field.
Follow
New articles from what you follow go into your email digest, once you agree to alert emails.
- JournalInternational Journal of Computer Science and Mobile Applications
- SubjectComputer Science & IT
- BylineArticles whose byline prints “Debdutta Burman”
- BylineArticles whose byline prints “Sandip Sarkar”
- BylineArticles whose byline prints “Anirban Bhar”
- BylineArticles whose byline prints “Sujata Kundu”
