توجه: محتویات این صفحه به صورت خودکار پردازش شده و مقاله‌های نویسندگانی با تشابه اسمی، همگی در بخش یکسان نمایش داده می‌شوند.
۱Job–Shop Scheduling Using Hybrid Shuffled Frog Leaping
اطلاعات انتشار: چهاردهمین کنفرانس بین المللی سالانه انجمن کامپیوتر ایران، سال
تعداد صفحات: ۶
Job–shop scheduling problem is demonstrated as one of the NP–complete problems. To solve this problem, we propose two types of hybrid shuffled frog leaping algorithm. Hybrid algorithms are generated by combining the shuffled frog leaping and a local search method. Also a new local search method by combining two other simple local searches is proposed. The obtained results demonstrate that our proposed hybrid algorithms have a better performance than their nonhybrid competitors. Also a comparison among proposed hybrid shuffled frog leaping and hybrid genetic algorithms demonstrate that the hybrid shuffled frog leaping algorithms can be generated a better schedule than their genetic algorithm competitors. A caparison of the best obtained results with the results reported in the considered literature shows that our proposed algorithms have a comparable performance<\div>

۲Various Strategies for Partitioning of Memeplexes in Shuffled Frog Leaping Algorithm
نویسنده(ها): ،
اطلاعات انتشار: چهاردهمین کنفرانس بین المللی سالانه انجمن کامپیوتر ایران، سال
تعداد صفحات: ۶
In this paper we propose several methods for partitioning, the process of grouping members of population to different memeplexes, in a shuffled frog leaping algorithm. These proposed methods divide the population in terms of the value of cost function or the geometric position of members or quite random partitioning. The proposed methods are evaluated on several low and high dimensional benchmark functions. The obtained results on low dimensional functions demonstrate that geometric partitioning methods have the best success rate and the fastest performance. Also on high dimensional functions, however using of the geometric partitioning methods for the partitioning stage of the SFL algorithm lead to a better success rate but these methods are more time consuming than other partitioning methods.<\div>
نمایش نتایج ۱ تا ۲ از میان ۲ نتیجه