Adjusted 0-1 knapsack problem in cargo flow by using artificial bee colony algorithm / Nor Zuliiziati Md Jani

Md Jani, Nor Zuliiziati (2021) Adjusted 0-1 knapsack problem in cargo flow by using artificial bee colony algorithm / Nor Zuliiziati Md Jani. [Student Project] (Unpublished)

Download

[thumbnail of 44387.pdf] Text
44387.pdf

Download (103kB)

Abstract

This research 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. The aim of this research is to determine the flow of the shipment based on volume and to determine the total cost based on the flow of shipment by using Artificial Bee Colony (ABC) algorithm. The ABC algorithm consists of four phases of initialisation, employed bees, onlooker bees and scout bees. Data are obtained from Lin et al (2017). There are 30 shipments included in this research and shipments can start with any number of shipments. The result shows, the shipment starts with a Shipment 25 which the volume is 2 560 000 tons per year with cost 0.111 tons per km and ends with a Shipment 21 which volume is 2 250000 tons per year with cost 0.129 tons per km. The flow volume of the shipment can be defined for the purpose of the finding. Next result for the total cost of the shipment is 402.377 tons per km.

Metadata

Item Type: Student Project
Creators:
Creators
Email
Md Jani, Nor Zuliiziati
2017591619
Subjects: H Social Sciences > HE Transportation and Communications > Air transportation. Airlines
Q Science > QA Mathematics > Instruments and machines > Electronic Computers. Computer Science > Algorithms
Divisions: Universiti Teknologi MARA, Perlis > Arau Campus > Faculty of Computer and Mathematical Sciences
Programme: Management Mathematics
Item ID: 44387
Uncontrolled Keywords: Knapsack Problem ; Flow Volume, Total Cost ; ABC Algorithm
URI: https://ir.uitm.edu.my/id/eprint/44387

Fulltext

Fulltext is available at:
  • Bilik Koleksi Akses Terhad | Kampus Arau, Perlis
  • ID Number

    44387

    Indexing


    View in Google Scholar

    Edit Item
    Edit Item