In computational sciences, optimization problems are frequently encountered in solving inverse problems for computing system parameters based on data measurements at specific sensor locations, or to perform design of system parameters.
Her course, entitled "Exploring Algorithms for Hard Problems in Computer Science," examined optimization problems across engineering disciplines that have been classified by computer scientists as computationally "hard" to solve.
DE with variable scaling factors perform well in both problems, showing potential to be used in other nuclear science and engineering optimization problems.
However, both algorithms have been applied to various science and engineering optimization problems, extensively, the algorithms suffer from premature convergence, unbalanced exploration-exploitation, and sometimes slow convergence speed.
The so-called Ising machine, described in 100-bit and 2000-bit versinns in two reports this week in Science, could tackle optimization problems that require finding the best solution among myriad possibilities, such as predicting how a protein will fold.
Backtracking Search Optimization Algorithm (BSA) is a newly proposed Evolutionary Algorithm (EA) and has been applied to optimize different complex optimization problems in science and engineering.
Particle swarm optimization (PSO) algorithm has been successfully applied to solve various optimization problems in science and engineering.
A large category of important optimization problems in science and engineering comes down to the famous traveling salesman problem (or to its generalizations).
Many engineering, science, information technology and management optimization problems can be considered as non-linear programming real-world problems where all or some of the parameters and variables involved are uncertain in nature.
