دوره 10، شماره 3 - ( 3-1399 )                   جلد 10 شماره 3 صفحات 389-365 | برگشت به فهرست نسخه ها

XML English Abstract Print


چکیده:   (12215 مشاهده)
Meta-heuristics have received increasing attention in recent years. The present article introduces a novel method in such a class that distinguishes a number of artificial search agents called players within two teams. At each iteration, the active player concerns some other players in both teams to construct its special movements and to get more score. At the end of some iterations (like quarters of a sports game) the teams switch their places for fair play. The algorithm is developed to solve a general purpose optimization problem; however, in this article its application is illustrated on structural sizing design. Switching Teams Algorithm is presented as a parameter-less population-based algorithm utilizing just two control parameters. The proposed method can recover diversity in a novel manner compared to other meta-heuristics in order to capture global optima.
متن کامل [PDF 1424 kb]   (3692 دریافت)    
نوع مطالعه: پژوهشي | موضوع مقاله: Optimal design
دریافت: 1399/3/19 | پذیرش: 1399/3/19 | انتشار: 1399/3/19

بازنشر اطلاعات
Creative Commons License این مقاله تحت شرایط Creative Commons Attribution-NonCommercial 4.0 International License قابل بازنشر است.