Art

J-GLOBAL ID：201402258651753561   Reference number：14A0409144

A New Artificial Fish Swarm Algorithm for the Multiple Knapsack Problem

多重ナップサック問題のための新しい人工魚群アルゴリズム

Author (5)： LIU Qing (Univ. of Fukui) ,  ODAKA Tomohiro (Univ. of Fukui) ,  KUROIWA Jousuke (Univ. of Fukui) ,  SHIRAI Haruhiko (Univ. of Fukui) ,  OGURA Hisakazu (Univ. of Fukui)
Material： IEICE Transactions on Information and Systems (Institute of Electronics, Information and Communication Engineers)  (IEICE Trans Inf Syst (Inst Electron Inf Commun Eng))
Volume： E97-D  Issue： 3  Page： 455-468 (J-STAGE)  Publication year： 2014 
JST Material Number： L1371A  ISSN： 0916-8532  Document type： Article
Article type： 原著論文  Country of issue： Japan (JPN)  Language： ENGLISH (EN)

Thesaurus term： *fish school ,  *knapsack problem ,  *algorithm ,  constraint condition(restriction) ,  escape behavior ,  boundary ,  animal behavior
Semi thesaurus term： constraints ,  predation

JST classification (1)： Numerical computation  (JE02000J)

Reference (31)：

• [1] M. Labbé, G. Laporte, and S. Martello, “Upper bounds and algorithms for the maximum cardinality bin packing problem,” European Journal of Operational Research, vol.149, no.3, pp.490-498, 2003.
• [2] J.R. Kalagnanam, A.J. Davenport, and H.S. Lee, “Computational aspects of clearing continuous call double auctions with assignment constraints and indivisible demand,” Electronic Commerce Research, vol.1, no.3, pp.221-238, 2001.
• [3] S. Eilon and N. Christofides, “The loading problem,” Management Science, vol.17, no.5, pp.259-268, 1971.
• [4] T. Yamada and T. Takeoka, “An exact algorithm for the fixed-charge multiple knapsack problem,” European Journal of Operational Research, vol.192, no.2, pp.700-705, 2009.
• [5] P. Detti, “A polynomial algorithm for the multiple knapsack problem with divisible item sizes,” Information Processing Letters, vol.109, no.11, pp.582-584, 2009.

Terms in the title (4)： 多重 ,  ナップサック問題 ,  人工 ,  アルゴリズム