文章基本信息

标题：Ant Colony System Algorithm with Dynamic Pheromone Updating for 0/1 Knapsack Problem
本地全文：下载
作者：Abdullah Alzaqebah ; Ahmad Adel Abu-Shareha
期刊名称：International Journal of Intelligent Systems and Applications
印刷版ISSN：2074-904X
电子版ISSN：2074-9058
出版年度：2019
卷号：11
期号：2
页码：9-17
DOI：10.5815/ijisa.2019.02.02
出版社：MECS Publisher
摘要：The 0/1 Knapsack (KP) is a combinatorial optimization problem that can be solved using various optimization algorithms. Ant Colony System (ACS) is one of these algorithms that is operated iteratively and converged emphatically to a matured solution. The convergence of the ACS depends mainly on the heuristic patterns that are used to update the pheromone trails throughout the optimization cycles. Although, ACS has significant advantages, it suffers from a slow convergence, as the pheromones, which are used to initiate the searching process are initialized randomly at the beginning. In this paper, a new heuristic pattern is proposed to speed up the convergence of ACS with 0/1 KP. The proposed heuristic enforces an order-critical item selection. As such, the proposed heuristic depends on considering the profit added by each item, as similar to the existing heuristics, besides the order of item selection. Accordingly, the proposed heuristic allows the items that are added at the end to get more value in order to be considered in the beginning of the next round. As such, with each cycle, the selected items are varied substantially and the pheromones are vastly updated in order to avoid long trapping with the initial values that are initialized randomly. The experiments showed that the proposed heuristic is converged more rapidly compared to the existing heuristics by reducing up to 30% of the cycles required to reach the optimal solution using difficult 0/1 KP datasets. Accordingly, the times required for convergence have been reduced significantly in the proposed work compared to the time required by the existing algorithms.
关键词：Ant Colony System;Heuristic Optimization;Combinatorial Optimization;Knapsack Problem;0/1 Knapsack Problem