Adjusted 0-1 knapsack problem in cargo flow by using artificial bee colony algorithm / Siti Hafawati Jamaluddin ... [et al.]

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, t...

Full description

Saved in:
Bibliographic Details
Main Authors: Jamaluddin, Siti Hafawati (Author), Md Jani, Nor Zuliiziati (Author), Mahmud, Norwaziah (Author), Muhammat Pazil, Nur Syuhada (Author)
Format: Book
Published: Universiti Teknologi MARA, Perlis, 2022.
Subjects:
Online Access:Link Metadata
Tags: Add Tag
No Tags, Be the first to tag this record!

MARC

LEADER 00000 am a22000003u 4500
001 repouitm_68913
042 |a dc 
100 1 0 |a Jamaluddin, Siti Hafawati  |e author 
700 1 0 |a Md Jani, Nor Zuliiziati  |e author 
700 1 0 |a Mahmud, Norwaziah  |e author 
700 1 0 |a Muhammat Pazil, Nur Syuhada  |e author 
245 0 0 |a Adjusted 0-1 knapsack problem in cargo flow by using artificial bee colony algorithm / Siti Hafawati Jamaluddin ... [et al.] 
260 |b Universiti Teknologi MARA, Perlis,   |c 2022. 
500 |a https://ir.uitm.edu.my/id/eprint/68913/1/68913.pdf 
500 |a  Adjusted 0-1 knapsack problem in cargo flow by using artificial bee colony algorithm / Siti Hafawati Jamaluddin ... [et al.]. (2022) Journal of Computing Research and Innovation (JCRINN) <https://ir.uitm.edu.my/view/publication/Journal_of_Computing_Research_and_Innovation_=28JCRINN=29/>, 7 (2): 19. pp. 186-195. ISSN 2600-8793  
520 |a 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. 
546 |a en 
690 |a Sporting goods industry. Recreational equipment 
690 |a Algorithms 
655 7 |a Article  |2 local 
655 7 |a PeerReviewed  |2 local 
787 0 |n https://ir.uitm.edu.my/id/eprint/68913/ 
787 0 |n https://crinn.conferencehunter.com/index.php/jcrinn 
787 0 |n 10.24191/jcrinn.v7i2.303 
856 4 1 |u https://ir.uitm.edu.my/id/eprint/68913/  |z Link Metadata