A rank-based ant system algorithm for solving 0/1 knapsack problem

Chen, Shi, Gao, Chao, Li, Xianghua, Lu, Yitong and Zhang, Zili 2015, A rank-based ant system algorithm for solving 0/1 knapsack problem, Journal of computational information systems, vol. 11, no. 20, pp. 7423-7430, doi: 10.12733/jcis15663.

Attached Files
Name Description MIMEType Size Downloads

Title A rank-based ant system algorithm for solving 0/1 knapsack problem
Author(s) Chen, Shi
Gao, Chao
Li, Xianghua
Lu, Yitong
Zhang, ZiliORCID iD for Zhang, Zili orcid.org/0000-0002-8721-9333
Journal name Journal of computational information systems
Volume number 11
Issue number 20
Start page 7423
End page 7430
Total pages 8
Publisher Binary Information Press
Place of publication [Danbury, Conn.]
Publication date 2015
ISSN 1553-9105
Keyword(s) 0/1 knapsack problem
Summary The 0/1 Knapsack Problem (KP), which is a classical NP-complete problem, has been widely applied to solving many real world problems. Ant system (AS), as one of the earliest ant colony optimization (ACO) algorithms, provides approximate solutions to 0/1 KPs. However, there are some shortcomings such as low efficiency and premature convergence in most AS algorithms. In order to overcome the shortcomings of AS, this paper proposes a rank-based AS algorithm, denoted as RAS to solve 0/1 KP. Taking advantages of the ranked ants with a higher profit, the pheromone of items will be updated with better solutions in RAS. Experimental results in different datasets show that this new kind of AS algorithm can obtain a higher efficiency and robustness when solving 0/1 KP.
Language eng
DOI 10.12733/jcis15663
Field of Research 080503 Networking and Communications
Socio Economic Objective 890205 Information Processing Services (incl. Data Entry and Capture)
HERDC Research category C1 Refereed article in a scholarly journal
ERA Research output type C Journal article
Copyright notice ©2015, Binary Information Press
Persistent URL http://hdl.handle.net/10536/DRO/DU:30082154

Connect to link resolver
Unless expressly stated otherwise, the copyright for items in DRO is owned by the author, with all rights reserved.

Version Filter Type
Citation counts: TR Web of Science Citation Count  Cited 0 times in TR Web of Science
Scopus Citation Count Cited 1 times in Scopus
Google Scholar Search Google Scholar
Access Statistics: 303 Abstract Views, 3 File Downloads  -  Detailed Statistics
Created: Mon, 14 Mar 2016, 10:35:22 EST

Every reasonable effort has been made to ensure that permission has been obtained for items included in DRO. If you believe that your rights have been infringed by this repository, please contact drosupport@deakin.edu.au.