کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
1707168 1012509 2007 10 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
Continuous functions minimization by dynamic random search technique
موضوعات مرتبط
مهندسی و علوم پایه سایر رشته های مهندسی مکانیک محاسباتی
پیش نمایش صفحه اول مقاله
Continuous functions minimization by dynamic random search technique
چکیده انگلیسی

Random search technique is the simplest one of the heuristic algorithms. It is stated in the literature that the probability of finding global minimum is equal to 1 by using the basic random search technique, but it takes too much time to reach the global minimum. Improving the basic random search technique may decrease the solution time. In this study, in order to obtain the global minimum fastly, a new random search algorithm is suggested. This algorithm is called as the Dynamic Random Search Technique (DRASET). DRASET consists of two phases, which are general search and local search based on general solution. Knowledge related to the best solution found in the process of general search is kept and then that knowledge is used as initial value of local search. DRASET’s performance was experimented with 15 test problems and satisfactory results were obtained.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Applied Mathematical Modelling - Volume 31, Issue 10, October 2007, Pages 2189–2198
نویسندگان
, ,