Staff View: Determining the shortest path for inner transportation in warehouse by dynamic programming method / Nurdiana Mohd Razif, Nurul Najiha Mohammed Hairul and Ungku Sofi Dayana Ungku Iskandar Zukarnine

Determining the shortest path for inner transportation in warehouse by dynamic programming method / Nurdiana Mohd Razif, Nurul Najiha Mohammed Hairul and Ungku Sofi Dayana Ungku Iskandar Zukarnine

This study was conducted to detennine the shortest path for an order picker to collect all of the ordered items in a warehouse. This study focusing only on one forklift. Dynamic Programming Method was chosen to conduct this study in order to solve the shortest path problem. The shortest path problem...

Full description

Saved in:

Bibliographic Details
Main Authors:	Mohd Razif, Nurdiana, Mohammed Hairul, Nurul Najiha, Ungku Iskandar Zukarnine, Ungku Sofi Dayana
Format:	Student Project
Language:	English
Published:	2019
Subjects:	Mathematical statistics. Probabilities Analytical methods used in the solution of physical problems
Online Access:	http://ir.uitm.edu.my/id/eprint/39475/1/39475.pdf http://ir.uitm.edu.my/id/eprint/39475/
Tags:	Add Tag No Tags, Be the first to tag this record!

id	my.uitm.ir.39475
record_format	eprints
spelling	my.uitm.ir.394752020-12-27T02:01:12Z http://ir.uitm.edu.my/id/eprint/39475/ Determining the shortest path for inner transportation in warehouse by dynamic programming method / Nurdiana Mohd Razif, Nurul Najiha Mohammed Hairul and Ungku Sofi Dayana Ungku Iskandar Zukarnine Mohd Razif, Nurdiana Mohammed Hairul, Nurul Najiha Ungku Iskandar Zukarnine, Ungku Sofi Dayana Mathematical statistics. Probabilities Analytical methods used in the solution of physical problems This study was conducted to detennine the shortest path for an order picker to collect all of the ordered items in a warehouse. This study focusing only on one forklift. Dynamic Programming Method was chosen to conduct this study in order to solve the shortest path problem. The shortest path problem has an optimal substructure so it is suitable to solve by Dynamic Programming since it is a method that break complex problems into simple subproblems. Few problems faced in the warehouse are such as the order pickers have a hard time in finding the shortest path to collect the order items. Next, the picking time is limited which all of the customers' orders have to be picked during normal working hours only. Due to this, the main objective of this study is to determine the shortest path to be passed to collect all of the customers' orders in the warehouse within normal working hours. There are four stages involved in this study which are the brief description of Dynamic Programming Method, analysis of data, find the shortest path by using Dynamic Programming Method and perfonnance evaluation using Microsoft Excel. For the process of finding the results, the layout of the warehouse is executed into the distance matrix table for better understanding. The shortest route distance is calculated by manual calculation and a system in Microsoft Excel. This study helps to minimize the costs involved in transportation in the warehouse. 2019 Student Project NonPeerReviewed text en http://ir.uitm.edu.my/id/eprint/39475/1/39475.pdf Mohd Razif, Nurdiana and Mohammed Hairul, Nurul Najiha and Ungku Iskandar Zukarnine, Ungku Sofi Dayana (2019) Determining the shortest path for inner transportation in warehouse by dynamic programming method / Nurdiana Mohd Razif, Nurul Najiha Mohammed Hairul and Ungku Sofi Dayana Ungku Iskandar Zukarnine. [Student Project] (Unpublished)
institution	Universiti Teknologi Mara
building	Tun Abdul Razak Library
collection	Institutional Repository
continent	Asia
country	Malaysia
content_provider	Universiti Teknologi Mara
content_source	UiTM Institutional Repository
url_provider	http://ir.uitm.edu.my/
language	English
topic	Mathematical statistics. Probabilities Analytical methods used in the solution of physical problems
spellingShingle	Mathematical statistics. Probabilities Analytical methods used in the solution of physical problems Mohd Razif, Nurdiana Mohammed Hairul, Nurul Najiha Ungku Iskandar Zukarnine, Ungku Sofi Dayana Determining the shortest path for inner transportation in warehouse by dynamic programming method / Nurdiana Mohd Razif, Nurul Najiha Mohammed Hairul and Ungku Sofi Dayana Ungku Iskandar Zukarnine
description	This study was conducted to detennine the shortest path for an order picker to collect all of the ordered items in a warehouse. This study focusing only on one forklift. Dynamic Programming Method was chosen to conduct this study in order to solve the shortest path problem. The shortest path problem has an optimal substructure so it is suitable to solve by Dynamic Programming since it is a method that break complex problems into simple subproblems. Few problems faced in the warehouse are such as the order pickers have a hard time in finding the shortest path to collect the order items. Next, the picking time is limited which all of the customers' orders have to be picked during normal working hours only. Due to this, the main objective of this study is to determine the shortest path to be passed to collect all of the customers' orders in the warehouse within normal working hours. There are four stages involved in this study which are the brief description of Dynamic Programming Method, analysis of data, find the shortest path by using Dynamic Programming Method and perfonnance evaluation using Microsoft Excel. For the process of finding the results, the layout of the warehouse is executed into the distance matrix table for better understanding. The shortest route distance is calculated by manual calculation and a system in Microsoft Excel. This study helps to minimize the costs involved in transportation in the warehouse.
format	Student Project
author	Mohd Razif, Nurdiana Mohammed Hairul, Nurul Najiha Ungku Iskandar Zukarnine, Ungku Sofi Dayana
author_facet	Mohd Razif, Nurdiana Mohammed Hairul, Nurul Najiha Ungku Iskandar Zukarnine, Ungku Sofi Dayana
author_sort	Mohd Razif, Nurdiana
title	Determining the shortest path for inner transportation in warehouse by dynamic programming method / Nurdiana Mohd Razif, Nurul Najiha Mohammed Hairul and Ungku Sofi Dayana Ungku Iskandar Zukarnine
title_short	Determining the shortest path for inner transportation in warehouse by dynamic programming method / Nurdiana Mohd Razif, Nurul Najiha Mohammed Hairul and Ungku Sofi Dayana Ungku Iskandar Zukarnine
title_full	Determining the shortest path for inner transportation in warehouse by dynamic programming method / Nurdiana Mohd Razif, Nurul Najiha Mohammed Hairul and Ungku Sofi Dayana Ungku Iskandar Zukarnine
title_fullStr	Determining the shortest path for inner transportation in warehouse by dynamic programming method / Nurdiana Mohd Razif, Nurul Najiha Mohammed Hairul and Ungku Sofi Dayana Ungku Iskandar Zukarnine
title_full_unstemmed	Determining the shortest path for inner transportation in warehouse by dynamic programming method / Nurdiana Mohd Razif, Nurul Najiha Mohammed Hairul and Ungku Sofi Dayana Ungku Iskandar Zukarnine
title_sort	determining the shortest path for inner transportation in warehouse by dynamic programming method / nurdiana mohd razif, nurul najiha mohammed hairul and ungku sofi dayana ungku iskandar zukarnine
publishDate	2019
url	http://ir.uitm.edu.my/id/eprint/39475/1/39475.pdf http://ir.uitm.edu.my/id/eprint/39475/
_version_	1687396782983610368
score	13.211869

Determining the shortest path for inner transportation in warehouse by dynamic programming method / Nurdiana Mohd Razif, Nurul Najiha Mohammed Hairul and Ungku Sofi Dayana Ungku Iskandar Zukarnine

Similar Items