11. Computational fluid dynamic (CFD) modelling of airflows and velocities
during cone sampling with head placement within the cone.
Dynamic modelling
12. Integrated static modeling and dynamic simulation framework for CO2
storage capacity in Upper Qishn Clastics, S1A reservoir, Yemen
Integrated static and Dynamic modelling
16. Genetic algorithm
Refer - https://www.generativedesign.org/02-deeper-dive/02-04_genetic-algorithms/02-04-01_what-is-a-genetic-
algorithm
The genetic algorithm is a method for solving both constrained and
unconstrained optimization problems that is based on natural
selection, the process that drives biological evolution. The genetic
algorithm repeatedly modifies a population of individual solutions.
At each step, the genetic algorithm selects individuals from the
current population to be parents and uses them to produce the
children for the next generation. Over successive generations, the
population "evolves" toward an optimal solution.
18. Simulated annealing
Simulated Annealing (SA) is an effective and general form of optimization. It is useful in
finding global optima in the presence of large numbers of local optima. “Annealing” refers
to an analogy with thermodynamics, specifically with the way that metals cool and
anneal. Simulated annealing uses the objective function of an optimization problem instead
of the energy of a material.
Simulated annealing searching for a
maximum. The objective here is to get to
the highest point. In this example, it is
not enough to use a simple hill climb
algorithm, as there are many local
maxima. By cooling the temperature
slowly the global maximum is found.
20. Particle swarm optimization (PSO) is a population-based optimization technique
inspired by the motion of bird flocks and schooling fish. PSO shares many
similarities with evolutionary computation techniques. The system is initialized with a
population of random solutions, and the search for the optimal solution is performed
by updating generations.
Particle swarm optimization