preindex=index; prebestmember=bestmember; fvalue = eval(strcat(fname ,'(population)')); [fbestval,index] = min(fvalue); bestmember=population(:,index); Best(iteration) =fbestval;

Filename	Size	Update
改进的群搜索优化算法_景书杰.pdf	647098	2018-04-12

• We are an exchange download platform that only provides communication channels. The downloaded content comes from the internet. Except for download issues, please Google on your own.
• The downloaded content is provided for members to upload. If it unintentionally infringes on your copyright, please contact us.
• Please use Winrar for decompression tools
• If download fail, Try it againg or Feedback to us.
• If downloaded content did not match the introduction, Feedback to us，Confirm and will be refund.
• Before downloading, you can inquire through the uploaded person information

Nothing．