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, Md Jani, Nor Zuliiziati, Mahmud, Norwaziah, Muhammat Pazil, Nur Syuhada
Format: Article
Language:en
Published: Universiti Teknologi MARA, Perlis 2022
Subjects:
Online Access:https://ir.uitm.edu.my/id/eprint/68913/1/68913.pdf
https://ir.uitm.edu.my/id/eprint/68913/
https://crinn.conferencehunter.com/index.php/jcrinn
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1833074151397523456
author Jamaluddin, Siti Hafawati
Md Jani, Nor Zuliiziati
Mahmud, Norwaziah
Muhammat Pazil, Nur Syuhada
author_facet Jamaluddin, Siti Hafawati
Md Jani, Nor Zuliiziati
Mahmud, Norwaziah
Muhammat Pazil, Nur Syuhada
author_sort Jamaluddin, Siti Hafawati
building Tun Abdul Razak Library
collection Institutional Repository
content_provider Universiti Teknologi Mara
content_source UiTM Institutional Repository
continent Asia
country Malaysia
description 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.
format Article
id my.uitm.ir-68913
institution Universiti Teknologi Mara
language en
publishDate 2022
publisher Universiti Teknologi MARA, Perlis
record_format eprints
spelling my.uitm.ir-689132023-01-18T08:04:25Z https://ir.uitm.edu.my/id/eprint/68913/ Adjusted 0-1 knapsack problem in cargo flow by using artificial bee colony algorithm / Siti Hafawati Jamaluddin ... [et al.] jcrinn Jamaluddin, Siti Hafawati Md Jani, Nor Zuliiziati Mahmud, Norwaziah Muhammat Pazil, Nur Syuhada Sporting goods industry. Recreational equipment Algorithms 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. Universiti Teknologi MARA, Perlis 2022 Article PeerReviewed text en https://ir.uitm.edu.my/id/eprint/68913/1/68913.pdf 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 https://crinn.conferencehunter.com/index.php/jcrinn 10.24191/jcrinn.v7i2.303 10.24191/jcrinn.v7i2.303 10.24191/jcrinn.v7i2.303
spellingShingle Sporting goods industry. Recreational equipment
Algorithms
Jamaluddin, Siti Hafawati
Md Jani, Nor Zuliiziati
Mahmud, Norwaziah
Muhammat Pazil, Nur Syuhada
Adjusted 0-1 knapsack problem in cargo flow by using artificial bee colony algorithm / Siti Hafawati Jamaluddin ... [et al.]
title Adjusted 0-1 knapsack problem in cargo flow by using artificial bee colony algorithm / Siti Hafawati Jamaluddin ... [et al.]
title_full Adjusted 0-1 knapsack problem in cargo flow by using artificial bee colony algorithm / Siti Hafawati Jamaluddin ... [et al.]
title_fullStr Adjusted 0-1 knapsack problem in cargo flow by using artificial bee colony algorithm / Siti Hafawati Jamaluddin ... [et al.]
title_full_unstemmed Adjusted 0-1 knapsack problem in cargo flow by using artificial bee colony algorithm / Siti Hafawati Jamaluddin ... [et al.]
title_short Adjusted 0-1 knapsack problem in cargo flow by using artificial bee colony algorithm / Siti Hafawati Jamaluddin ... [et al.]
title_sort adjusted 0-1 knapsack problem in cargo flow by using artificial bee colony algorithm / siti hafawati jamaluddin ... [et al.]
topic Sporting goods industry. Recreational equipment
Algorithms
url https://ir.uitm.edu.my/id/eprint/68913/1/68913.pdf
https://ir.uitm.edu.my/id/eprint/68913/
https://crinn.conferencehunter.com/index.php/jcrinn
url_provider http://ir.uitm.edu.my/