A New Artificial Fish Swarm Algorithm for the Multiple Knapsack Problem

被引：10

作者：

Liu, Qing ^{[1
]}

Odaka, Tomohiro ^{[1
]}

Kuroiwa, Jousuke ^{[1
]}

Shirai, Haruhiko ^{[1
]}

Ogura, Hisakazu ^{[1
]}

机构：

[1] Univ Fukui, Fukui 9108501, Japan

来源：

IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS | 2014年 / E97D卷 / 03期

关键词：

artificial fish swarm algorithm; multiple knapsack problem; constraint boundary; search region; BOUNDS;

D O I：

10.1587/transinf.E97.D.455

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

A new artificial fish swarm algorithm (AFSA) for solving the multiple knapsack problem (MKP) is introduced in this paper. In the proposed AFSA, artificial fish (AF) individuals are only allowed to search the region near constraint boundaries of the problem to be solved. For this purpose, several behaviors to be performed by AF individuals, including escaping behavior, randomly moving behavior, preying behavior and following behavior, were specially designed. Exhaustive experiments were implemented in order to investigate the proposed AFSA's performance. The results demonstrated the proposed AFSA has the ability of finding high-quality solutions with very fast speed, as compared with some other versions of AFSA based on different constraint-handling methods. This study is also meaningful for solving other constrained problems.

引用

页码：455 / 468

页数：14

共 31 条

[1]

[Anonymous], NEW INTELLIGENCE OPT

[2]

[Anonymous], 2009, P INT C COMP MATH ME

[3]

[Anonymous], 2002, XITONG GONGCHENG LIL, DOI DOI 10.12011/1000-6788(2002)11-32

[4]

[Anonymous], 1972, P COMPLEXITY COMPUTE