A Study of a Genetic Algorithm for Polydisperse Spray Flames
- URL: http://arxiv.org/abs/2008.07397v1
- Date: Tue, 11 Aug 2020 10:17:42 GMT
- Title: A Study of a Genetic Algorithm for Polydisperse Spray Flames
- Authors: Daniel Engelsman
- Abstract summary: The Genetic Algorithm (GA) is a powerful tool which enables the generation of high-quality solutions to optimization problems.
In this piece of work, I would like to harness the GA capabilities to examine optimality with respect to a unique combustion problem.
To be more precise, I would like to utilize it to answer the question : What form of an initial droplet size distribution (iDSD) will guarantee an optimal flame.
- Score: 0.0
- License: http://creativecommons.org/publicdomain/zero/1.0/
- Abstract: Modern technological advancements constantly push forward the human-machine
interaction. Evolutionary Algorithms (EA) are an machine learning (ML) subclass
inspired by the process of natural selection - Survival of the Fittest, as
stated by the Darwinian Theory of Evolution. The most notable algorithm in that
class is the Genetic Algorithm (GA) - a powerful heuristic tool which enables
the generation of a high-quality solutions to optimization problems. In recent
decades the algorithm underwent remarkable improvement, which adapted it into a
wide range of engineering problems, by heuristically searching for the optimal
solution. Despite being well-defined, many engineering problems may suffer from
heavy analytical entanglement when approaching the derivation process, as
required in classic optimization methods. Therefore, the main motivation here,
is to work around that obstacle. In this piece of work, I would like to harness
the GA capabilities to examine optimality with respect to a unique combustion
problem, in a way that was never performed before. To be more precise, I would
like to utilize it to answer the question : What form of an initial droplet
size distribution (iDSD) will guarantee an optimal flame ? To answer this
question, I will first provide a general introduction to the GA method, then
develop the combustion model, and eventually merge both into an optimization
problem.
Related papers
- Genetic Engineering Algorithm (GEA): An Efficient Metaheuristic
Algorithm for Solving Combinatorial Optimization Problems [1.8434042562191815]
Genetic Algorithms (GAs) are known for their efficiency in solving optimization problems.
This paper proposes a new metaheuristic algorithm called the Genetic Engineering Algorithm (GEA) that draws inspiration from genetic engineering concepts.
arXiv Detail & Related papers (2023-09-28T13:05:30Z) - Accelerating Cutting-Plane Algorithms via Reinforcement Learning
Surrogates [49.84541884653309]
A current standard approach to solving convex discrete optimization problems is the use of cutting-plane algorithms.
Despite the existence of a number of general-purpose cut-generating algorithms, large-scale discrete optimization problems continue to suffer from intractability.
We propose a method for accelerating cutting-plane algorithms via reinforcement learning.
arXiv Detail & Related papers (2023-07-17T20:11:56Z) - An Empirical Evaluation of Zeroth-Order Optimization Methods on
AI-driven Molecule Optimization [78.36413169647408]
We study the effectiveness of various ZO optimization methods for optimizing molecular objectives.
We show the advantages of ZO sign-based gradient descent (ZO-signGD)
We demonstrate the potential effectiveness of ZO optimization methods on widely used benchmark tasks from the Guacamol suite.
arXiv Detail & Related papers (2022-10-27T01:58:10Z) - Applications of Gaussian Mutation for Self Adaptation in Evolutionary
Genetic Algorithms [0.0]
In 1960, the first genetic algorithm was developed by John H. Holland and his student.
We explore the mathematical intuition of the genetic algorithm in developing systems capable of evolving using Gaussian mutation.
arXiv Detail & Related papers (2022-01-02T04:18:25Z) - An Accelerated Variance-Reduced Conditional Gradient Sliding Algorithm
for First-order and Zeroth-order Optimization [111.24899593052851]
Conditional gradient algorithm (also known as the Frank-Wolfe algorithm) has recently regained popularity in the machine learning community.
ARCS is the first zeroth-order conditional gradient sliding type algorithms solving convex problems in zeroth-order optimization.
In first-order optimization, the convergence results of ARCS substantially outperform previous algorithms in terms of the number of gradient query oracle.
arXiv Detail & Related papers (2021-09-18T07:08:11Z) - Evolving Evolutionary Algorithms using Linear Genetic Programming [0.0]
The model is based on the Linear Genetic Programming (LGP) technique.
Several Evolutionary Algorithms for function optimization, the Traveling Salesman Problem, and the Quadratic Assignment Problem are evolved by using the considered model.
arXiv Detail & Related papers (2021-08-21T19:15:07Z) - Learning Primal Heuristics for Mixed Integer Programs [5.766851255770718]
We investigate whether effective primals can be automatically learned via machine learning.
We propose a new method to represent an optimization problem as a graph, and train a Graph Conal Network on solved problem instances with known optimal solutions.
The prediction of variable solutions is then leveraged by a novel configuration of the B&B method, Probabilistic Branching with guided Depth-first Search.
arXiv Detail & Related papers (2021-07-02T06:46:23Z) - A Bi-Level Framework for Learning to Solve Combinatorial Optimization on
Graphs [91.07247251502564]
We propose a hybrid approach to combine the best of the two worlds, in which a bi-level framework is developed with an upper-level learning method to optimize the graph.
Such a bi-level approach simplifies the learning on the original hard CO and can effectively mitigate the demand for model capacity.
arXiv Detail & Related papers (2021-06-09T09:18:18Z) - Learning to Optimize: A Primer and A Benchmark [94.29436694770953]
Learning to optimize (L2O) is an emerging approach that leverages machine learning to develop optimization methods.
This article is poised to be the first comprehensive survey and benchmark of L2O for continuous optimization.
arXiv Detail & Related papers (2021-03-23T20:46:20Z) - AdaLead: A simple and robust adaptive greedy search algorithm for
sequence design [55.41644538483948]
We develop an easy-to-directed, scalable, and robust evolutionary greedy algorithm (AdaLead)
AdaLead is a remarkably strong benchmark that out-competes more complex state of the art approaches in a variety of biologically motivated sequence design challenges.
arXiv Detail & Related papers (2020-10-05T16:40:38Z) - Devolutionary genetic algorithms with application to the minimum
labeling Steiner tree problem [0.0]
This paper characterizes and discusses devolutionary genetic algorithms and evaluates their performances in solving the minimum labeling Steiner tree (MLST) problem.
We define devolutionary algorithms as the process of reaching a feasible solution by devolving a population of super-optimal unfeasible solutions over time.
We show how classical evolutionary concepts, such as crossing, mutation and fitness can be adapted to aim at reaching an optimal or close-to-optimal solution.
arXiv Detail & Related papers (2020-04-18T13:27:28Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.