Differential Evolution: A survey of theoretical analyses
Differential Evolution (DE) is a state-of-the art global optimization technique. Considerable
research effort has been made to improve this algorithm and apply it to a variety of practical …
research effort has been made to improve this algorithm and apply it to a variety of practical …
Path planning optimization in unmanned aerial vehicles using meta-heuristic algorithms: A systematic review
HS Yahia, AS Mohammed - Environmental Monitoring and Assessment, 2023 - Springer
Unmanned aerial vehicles (UAVs) have recently been increasingly popular in various areas,
fields, and applications. Military, disaster management, rescue operations, public services …
fields, and applications. Military, disaster management, rescue operations, public services …
[图书][B] Design of modern heuristics: principles and application
F Rothlauf - 2011 - Springer
Most textbooks on modern heuristics provide the reader with detailed descriptions of the
functionality of single examples like genetic algorithms, genetic programming, tabu search …
functionality of single examples like genetic algorithms, genetic programming, tabu search …
[图书][B] Analyzing evolutionary algorithms: The computer science perspective
T Jansen - 2013 - Springer
Analyzing Evolutionary Algorithms: The Computer Science Perspective | SpringerLink Skip to
main content Advertisement SpringerLink Log in Menu Find a journal Publish with us Search …
main content Advertisement SpringerLink Log in Menu Find a journal Publish with us Search …
Level-based analysis of genetic algorithms and other search processes
Understanding how the time complexity of evolutionary algorithms (EAs) depend on their
parameter settings and characteristics of fitness landscapes is a fundamental problem in …
parameter settings and characteristics of fitness landscapes is a fundamental problem in …
Randomized local search, evolutionary algorithms, and the minimum spanning tree problem
F Neumann, I Wegener - Theoretical Computer Science, 2007 - Elsevier
Randomized search heuristics, among them randomized local search and evolutionary
algorithms, are applied to problems whose structure is not well understood, as well as to …
algorithms, are applied to problems whose structure is not well understood, as well as to …
A study of drift analysis for estimating computation time of evolutionary algorithms
J He, X Yao - Natural Computing, 2004 - Springer
This paper introduces drift analysis and its applications in estimating average computation
time of evolutionary algorithms. Firstly, drift conditions for estimating upper and lower …
time of evolutionary algorithms. Firstly, drift conditions for estimating upper and lower …
Time complexity of evolutionary algorithms for combinatorial optimization: A decade of results
PS Oliveto, J He, X Yao - International Journal of Automation and …, 2007 - Springer
Computational time complexity analyzes of evolutionary algorithms (EAs) have been
performed since the mid-nineties. The first results were related to very simple algorithms …
performed since the mid-nineties. The first results were related to very simple algorithms …
Running time analysis of multiobjective evolutionary algorithms on pseudo-boolean functions
This paper presents a rigorous running time analysis of evolutionary algorithms on pseudo-
Boolean multiobjective optimization problems. We propose and analyze different population …
Boolean multiobjective optimization problems. We propose and analyze different population …
Time-line based model for software project scheduling with genetic algorithms
Effective management of complex software projects depends on the ability to solve complex,
subtle optimization problems. Most studies on software project management do not pay …
subtle optimization problems. Most studies on software project management do not pay …