Study on Multi-Knapsack Problem Based on Improved Artificial Fish School Algorithm

DOI

10.2991/icismme-15.2015.214How to use a DOI?

Keywords

Multi-knapsack problem; Artificial Fish School Algorithm; coding.

Abstract

Multi-knapsack problem (MKP) is one of the typical NP problem in optimization field, because the computing complexities of the traditional algorithms are high or they have slow convergence speeds, this paper proposes an improved artificial fish school algorithm (IAFSA) for MKP. Firstly, the integer coding was used in the input ways of knapsacks, secondly, IAFSA adopted the strategy of "random repair" to repair infeasible artificial fish coding and inadequate artificial fish coding, and the coding after taking behaviors were improved and repaired, finally, IAFSA was verified by an example. Experimental results show that the advantage of IAFSA over other AFSA algorithms mainly lies in its faster convergence speed, stronger robustness, and its convergence to the optimal solution with greater probability.

Copyright

© 2015, the Authors. Published by Atlantis Press.

Open Access

This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Download article (PDF)

TY  - CONF
AU  - Lei Qin
AU  - Kang Zhou
PY  - 2015/07
DA  - 2015/07
TI  - Study on Multi-Knapsack Problem Based on Improved Artificial Fish School Algorithm
BT  - Proceedings of the First International Conference on Information Sciences, Machinery, Materials and Energy
PB  - Atlantis Press
SP  - 1013
EP  - 1017
SN  - 1951-6851
UR  - https://doi.org/10.2991/icismme-15.2015.214
DO  - 10.2991/icismme-15.2015.214
ID  - Qin2015/07
ER  -