In this paper, we try to apply Binary System Particle Swarm Optimization (BSPSO) with death Penalty function to solve 0/1 knapsack problem.

 
  • 摘要將帶有死亡罰函數的二進(jìn)制粒子群優(yōu)化算法應用于0/1背包問(wèn)題。
今日熱詞
目錄 附錄 查詞歷史
国内精品美女A∨在线播放xuan