Skip to main content
Journal ArticleOPEN ACCESS

Ant Colony System Algorithm with Dynamic Pheromone Updating for 0/1 Knapsack Problem

  • Alzaqebah A
  • Abu-Shareha A
International Journal of Intelligent Systems and Applications (2019) 11(2) 9-17
DOI: 10.5815/ijisa.2019.02.02
N/ACitations
Citations of this article
5Readers
Mendeley users who have this article in their library.

Abstract

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 …

Cite

CITATION STYLE

APA

Alzaqebah, A., & Abu-Shareha, A. A. (2019). Ant Colony System Algorithm with Dynamic Pheromone Updating for 0/1 Knapsack Problem. International Journal of Intelligent Systems and Applications, 11(2), 9–17. https://doi.org/10.5815/ijisa.2019.02.02

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free