A ROBUST GLOBAL OPTIMIZATION METHOD BASED ON SIMULATED ANNEALING

2001 ◽  
Vol 33 (3) ◽  
pp. 373-398
Author(s):  
JAU-SUNG MOH ◽  
DAR-YUN CHIANG
2021 ◽  
Author(s):  
Siyu Wu ◽  
Qinwei An ◽  
Yugang Sun

The involvement of heterogeneous solid/liquid reaction in growing colloidal nanoparticles makes it challenging to quantitatively understand the fundamental steps that determine nanoparticles' growth kinetics. A global optimization protocol relying on...


Author(s):  
ANDOJO ONGKODJOJO ONG ◽  
FRANCIS E. H. TAY

In this paper we present a global optimization method for multiple objective functions using the Pareto Simulated Annealing (SA). This novel optimization method is very useful and promising for design and application in the field of Micro-Electro-Mechanical Systems (MEMS). Previously published global optimization method has been reported by us for only single objective function. The proposed method automatically assigns different objective weights to each objective functions so that it can generate multiple solutions simultaneously. It also offers the trade-off between the objective functions so that we will be able to select the most suitable solution for MEMS design and applications. Based on the global Pareto ranking of the solutions, the optimization method can provide the best solution (the first Pareto ranking) as well.


Author(s):  
Hiroyuki Kawagishi ◽  
Kazuhiko Kudo

A new optimization method which can search for the global optimum solution and decrease the number of iterations was developed. The performance of the new method was found to be effective in finding the optimum solution for single- and multi-peaked functions for which the global optimum solution was known in advance. According to the application of the method to the optimum design of turbine stages, it was shown that the method can search the global optimum solution at approximately one seventh of the iterations of GA (Genetic Algorithm) or SA (Simulated Annealing).


Sign in / Sign up

Export Citation Format

Share Document