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

Siti Hafawati Jamaluddin; Norwaziah Mahmud; Nur Syuhada Muhammat Pazil

doi:10.24191/jcrinn.v7i2.303

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

Authors

Siti Hafawati Jamaluddin Faculty of Computer and Mathematical Sciences, Universiti Teknologi MARA Perlis Branch
Norwaziah Mahmud Faculty of Computer and Mathematical Sciences, Universiti Teknologi MARA Perlis Branch
Nur Syuhada Muhammat Pazil Faculty of Computer and Mathematical Sciences, Universiti Teknologi MARA Melaka Branch

DOI:

https://doi.org/10.24191/jcrinn.v7i2.303

Keywords:

knapsack problem, ABC Algorithm, Flow Volume, Modified Artificial Bee Colony Algorithm

Abstract

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, the number of items that may become less or at least equal to or equal to the limit. Therefore, the aim of this study is to determine the minimum total cost of 30 shipments based on volume by using Artificial Bee Colony (ABC) algorithm in order to achieving the highest profit. ABC algorithm was derived from the bee colony which consists of four phases of initialisation, employed bees, onlooker bees and scout bees. Based on the result obtained, the total cost of the shipment is 402.377 tons per km which starting from the Shipment 25 with 2 560 000 tons per year for 0.111 tons per km and ends with Shipment 21 with 2 250 000 tons per year for 0.129 tons per km.

Downloads

Download data is not yet available.

References

Akay, B., & Karaboga, D. (2012). A modified artificial bee colony algorithm for real-parameter optimization. Information sciences, 192, 120-142.

Guo, Y., Li, X, Tang, Y., & Li, J. (2017). Heuristic artificial bee colony algorithm for uncovering community in complex networks. Mathematical Problems in Engineering, 2017.

He, Y., Xie, H., Wong, T. L., & Wang, X. (2018). A novel binary artificial bee colony algorithm for the set-union knapsack problem. Future Generation Computer Systems, 78, 77-86.

Le Dinh, L., aNgoc, D., & Vasant, P. (2013). Artificial bee colony algorithm for solving optimal power flow problem. the scientific world journal, 2013.

Lin, B., Liu, S., Lin, R., Wu, J., Wang, J., & Liu, C. (2017). Modeling the 0-1 Knapsack Problem in Cargo Flow Adjustment. Symmetry, 9(7), 118.

Pandiri, V., & Singh, A. (2019). An artificial bee colony algorithm with variable degree of perturbation for the generalized covering traveling salesman problem. Applied Soft Computing, 78, 481-495.