Multiobjective optimization techniques : simulated annealing versus evolutionary algorithms = 다목적함수 최적화 기법에 대한 연구 : 모의 담금질 방법과 진화 알고리즘 simulated annealing versus evolutionary algorithms

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 146
  • Download : 0
In this dissertation, multiobjective simulated annealing method is introduced and discussed with the evolutionary approach. There have been many researches of using evolutionary algorithms to solve multiobjective problems and many efficient algorithms have been developed. However, though the simulated annealing is also very powerful search algorithm and has shown good results in various optimization fields, it has been seldom used for the multiobjective optimization because it conventionally uses only one search agent, which is inadequate in finding all the solutions of the Pareto set. With the idea that simulated annealing has a uniform state probability over global optima, a new multiobjective simulated annealing method is suggested. The suggested algorithm uses the Pareto-based cost and the mathematical convergence of the algorithm to the global optimum is proved. The preliminary results of the developed algorithms are compared with multiobjective evolutionary algorithms and shows that simulated annealing has good properties in many cases. The first test in the finite state test-beds shows that simulated annealing has a tendency of finding the Pareto optimal solutions with nearly uniform probability. This property was tested on the more complex real-valued continuous problems. For the comparison, multiobjective metrics to test the performances are surveyed and developed. Four categories of metrics are suggested to measure various properties of multiobjective optimization algorithms. The accuracy, coverage, uniformity, and speed metrics are used in the experiment. Also a practical application of voltage reference circuit design is introduced for the real world test problem. The results show that multiobjective simulated annealing outperforms the multiobjective evolutionary algorithms in many times and suggest that simulated annealing can be a good candidate algorithm in solving the real-world multiobjective optimization problems.
Advisors
Park, Cheol-Hoonresearcher박철훈researcher
Description
한국과학기술원 : 전기및전자공학전공,
Publisher
한국과학기술원
Issue Date
2002
Identifier
174609/325007 / 000965126
Language
eng
Description

학위논문(박사) - 한국과학기술원 : 전기및전자공학전공, 2002.2, [ viii, 130 p. ]

Keywords

Evolutionary Algorithm; Simulated Annealing; Multiobjective Optimization; Pareto Optimal Set; 파레토 최적해; 진화 알고리즘; 모의 담금질; 다목적함수 최적화

URI
http://hdl.handle.net/10203/35977
Link
http://library.kaist.ac.kr/search/detail/view.do?bibCtrlNo=174609&flag=dissertation
Appears in Collection
EE-Theses_Ph.D.(박사논문)
Files in This Item
There are no files associated with this item.

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0