Adjusted 0-1 Knapsack Problem in Cargo Flow by Using Artificial Bee Colony Algorithm

Adjusted 0-1 Knapsack Problem in Cargo Flow by Using Artificial Bee Colony Algorithm

Show other versions (1)

This study describes the problem with the knapsack that occurred in the cargo flow. The problem of the knapsack is the problem of optimisation used to illustrate the problem and the solution in which each set of items has its own specific value and weight. With its total value as much as possible,...

Full description

Bibliographic Details
Main Authors: Siti Hafawati Jamaluddin, Norwaziah Mahmud, Nur Syuhada Muhammat Pazil
Format: Article
Language:English
Published: Faculty of Computer and Mathematical Sciences, Universiti Teknologi MARA Perlis 2022-09-01
Series:Journal of Computing Research and Innovation
Subjects:
knapsack problem
ABC Algorithm
Flow Volume
Modified Artificial Bee Colony Algorithm
Online Access:https://jcrinn.com/index.php/jcrinn/article/view/303

Similar Items

Similar Items