دوره 1، شماره 2 - ( 3-1390 )
جلد 1 شماره 2 صفحات 355-341 |
برگشت به فهرست نسخه ها
Download citation:
BibTeX | RIS | EndNote | Medlars | ProCite | Reference Manager | RefWorks
Send citation to:
BibTeX | RIS | EndNote | Medlars | ProCite | Reference Manager | RefWorks
Send citation to:
Shahrouzi M. PSEUDO-RANDOM DIRECTIONAL SEARCH: A NEW HEURISTIC FOR OPTIMIZATION. IJOCE 2011; 1 (2) :341-355
URL: http://ijoce.iust.ac.ir/article-1-22-fa.html
URL: http://ijoce.iust.ac.ir/article-1-22-fa.html
PSEUDO-RANDOM DIRECTIONAL SEARCH: A NEW HEURISTIC FOR OPTIMIZATION. عنوان نشریه. 1390; 1 (2) :341-355
چکیده: (25314 مشاهده)
Meta-heuristics have already received considerable attention in various fields of engineering optimization problems. Each of them employes some key features best suited for a specific class of problems due to its type of search space and constraints. The present work develops a Pseudo-random Directional Search, PDS, for adaptive combination of such heuristic operators. It utilizes a short term memory via indirect information share between search agents and the directional search inspired by natural swarms. Treated numerical examples illustrate the PDS performance in continuous and discrete design spaces.
| بازنشر اطلاعات | |
 | این مقاله تحت شرایط Creative Commons Attribution-NonCommercial 4.0 International License قابل بازنشر است. |
