Loading…

Modelling the Shortest Path for Inner Warehouse Travelling Using the Floyd–Warshall Algorithm

Order picking is referred as a critical process of selecting items requested by a customer in a warehouse. Meeting the demand of every customer is the main objective in this area. Large warehouses pose a challenge since the order-picking process is slowed considerably by the lengthy time it takes to...

Full description

Saved in:
Bibliographic Details
Published in:Mathematics (Basel) 2024-09, Vol.12 (17), p.2698
Main Authors: Nordin, Noraimi Azlin Mohd, Shariff, S. Sarifah Radiah, Supadi, Siti Suzlin, Masudin, Ilyas
Format: Article
Language:English
Subjects:
Citations: Items that this one cites
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
cited_by
cites cdi_FETCH-LOGICAL-c254t-f5f28626f86363c998441ad128bb8947d9760ed56c417c6fef3503ae466206a13
container_end_page
container_issue 17
container_start_page 2698
container_title Mathematics (Basel)
container_volume 12
creator Nordin, Noraimi Azlin Mohd
Shariff, S. Sarifah Radiah
Supadi, Siti Suzlin
Masudin, Ilyas
description Order picking is referred as a critical process of selecting items requested by a customer in a warehouse. Meeting the demand of every customer is the main objective in this area. Large warehouses pose a challenge since the order-picking process is slowed considerably by the lengthy time it takes to transport items across the warehouse. Throughout the study, the system is hoped to develop proper procedures in the order-picking process. In handling this scenario, the decision-makers need to take any possible action to ensure the warehouses can keep operating and meeting the requirements and satisfaction of the customers. Due to this, the study’s main objective is to determine whether the Floyd–Warshall algorithm or the dynamic programming method will give the most accurate shortest path and minimum travel distance for order pickers. Two data sets (nine nodes and nineteen nodes) are used to determine the optimal path and minimum travel distance for the order picker to meet and satisfy customer orders for the warehouse. The two models were modified and applied to address real-world case studies from the automotive manufacturing company in Malaysia. The results show a big difference between the total distance by 113.48% for 19 nodes. Through this finding, the company may choose which method suits their preferences. Concurrently, this study may also contribute to problem-solving issues in any warehouse operation with a similar procedure.
doi_str_mv 10.3390/math12172698
format article
fullrecord <record><control><sourceid>proquest_doaj_</sourceid><recordid>TN_cdi_doaj_primary_oai_doaj_org_article_28e104efceb34c1cad3f736639773034</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><doaj_id>oai_doaj_org_article_28e104efceb34c1cad3f736639773034</doaj_id><sourcerecordid>3104066261</sourcerecordid><originalsourceid>FETCH-LOGICAL-c254t-f5f28626f86363c998441ad128bb8947d9760ed56c417c6fef3503ae466206a13</originalsourceid><addsrcrecordid>eNpNUc1KAzEQXkTBor35AAteXc3f5udYitVCRcEWjyHNJt0t6aYmW6E338E39ElMbZXOZYaZ72eYybIrCG4xFuBupboaIsgQFfwk6yGEWMHS4PSoPs_6MS5BCgExJ6KXySdfGeeadpF3tclfax86E7v8Janl1od83LYm5G8qmNpvosmnQX0cCLP4Rxs5v62-P78SLNbKuXzgFj40Xb26zM6sctH0D_kim43up8PHYvL8MB4OJoVGJekKW1rEKaKWU0yxFoITAlUFEZ_PuSCsEowCU5VUE8g0tcbiEmBlCKUIUAXxRTbe61ZeLeU6NCsVttKrRv42fFhIFbpGOyMRNxAQY7WZY6KhVhW2DFOKBWMYYJK0rvda6-DfN-kacuk3oU3rS5yYIHnSnePNHqWDjzEY--8Kgdx9RB5_BP8AMpV-NA</addsrcrecordid><sourcetype>Open Website</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>3104066261</pqid></control><display><type>article</type><title>Modelling the Shortest Path for Inner Warehouse Travelling Using the Floyd–Warshall Algorithm</title><source>Publicly Available Content Database</source><creator>Nordin, Noraimi Azlin Mohd ; Shariff, S. Sarifah Radiah ; Supadi, Siti Suzlin ; Masudin, Ilyas</creator><creatorcontrib>Nordin, Noraimi Azlin Mohd ; Shariff, S. Sarifah Radiah ; Supadi, Siti Suzlin ; Masudin, Ilyas</creatorcontrib><description>Order picking is referred as a critical process of selecting items requested by a customer in a warehouse. Meeting the demand of every customer is the main objective in this area. Large warehouses pose a challenge since the order-picking process is slowed considerably by the lengthy time it takes to transport items across the warehouse. Throughout the study, the system is hoped to develop proper procedures in the order-picking process. In handling this scenario, the decision-makers need to take any possible action to ensure the warehouses can keep operating and meeting the requirements and satisfaction of the customers. Due to this, the study’s main objective is to determine whether the Floyd–Warshall algorithm or the dynamic programming method will give the most accurate shortest path and minimum travel distance for order pickers. Two data sets (nine nodes and nineteen nodes) are used to determine the optimal path and minimum travel distance for the order picker to meet and satisfy customer orders for the warehouse. The two models were modified and applied to address real-world case studies from the automotive manufacturing company in Malaysia. The results show a big difference between the total distance by 113.48% for 19 nodes. Through this finding, the company may choose which method suits their preferences. Concurrently, this study may also contribute to problem-solving issues in any warehouse operation with a similar procedure.</description><identifier>ISSN: 2227-7390</identifier><identifier>EISSN: 2227-7390</identifier><identifier>DOI: 10.3390/math12172698</identifier><language>eng</language><publisher>Basel: MDPI AG</publisher><subject>Algorithms ; Automation ; Customer satisfaction ; Customer services ; Customers ; Dynamic programming ; Electronic commerce ; Floyd–Warshall algorithm ; inner warehouse transportation ; Literature reviews ; Nodes ; order picker ; Order picking ; Overtime ; Productivity ; Shortest-path problems ; Warehouses</subject><ispartof>Mathematics (Basel), 2024-09, Vol.12 (17), p.2698</ispartof><rights>2024 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (https://creativecommons.org/licenses/by/4.0/). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><cites>FETCH-LOGICAL-c254t-f5f28626f86363c998441ad128bb8947d9760ed56c417c6fef3503ae466206a13</cites><orcidid>0000-0002-0153-4560 ; 0000-0001-9895-5742</orcidid></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://www.proquest.com/docview/3104066261/fulltextPDF?pq-origsite=primo$$EPDF$$P50$$Gproquest$$Hfree_for_read</linktopdf><linktohtml>$$Uhttps://www.proquest.com/docview/3104066261?pq-origsite=primo$$EHTML$$P50$$Gproquest$$Hfree_for_read</linktohtml><link.rule.ids>314,780,784,25753,27924,27925,37012,44590,74998</link.rule.ids></links><search><creatorcontrib>Nordin, Noraimi Azlin Mohd</creatorcontrib><creatorcontrib>Shariff, S. Sarifah Radiah</creatorcontrib><creatorcontrib>Supadi, Siti Suzlin</creatorcontrib><creatorcontrib>Masudin, Ilyas</creatorcontrib><title>Modelling the Shortest Path for Inner Warehouse Travelling Using the Floyd–Warshall Algorithm</title><title>Mathematics (Basel)</title><description>Order picking is referred as a critical process of selecting items requested by a customer in a warehouse. Meeting the demand of every customer is the main objective in this area. Large warehouses pose a challenge since the order-picking process is slowed considerably by the lengthy time it takes to transport items across the warehouse. Throughout the study, the system is hoped to develop proper procedures in the order-picking process. In handling this scenario, the decision-makers need to take any possible action to ensure the warehouses can keep operating and meeting the requirements and satisfaction of the customers. Due to this, the study’s main objective is to determine whether the Floyd–Warshall algorithm or the dynamic programming method will give the most accurate shortest path and minimum travel distance for order pickers. Two data sets (nine nodes and nineteen nodes) are used to determine the optimal path and minimum travel distance for the order picker to meet and satisfy customer orders for the warehouse. The two models were modified and applied to address real-world case studies from the automotive manufacturing company in Malaysia. The results show a big difference between the total distance by 113.48% for 19 nodes. Through this finding, the company may choose which method suits their preferences. Concurrently, this study may also contribute to problem-solving issues in any warehouse operation with a similar procedure.</description><subject>Algorithms</subject><subject>Automation</subject><subject>Customer satisfaction</subject><subject>Customer services</subject><subject>Customers</subject><subject>Dynamic programming</subject><subject>Electronic commerce</subject><subject>Floyd–Warshall algorithm</subject><subject>inner warehouse transportation</subject><subject>Literature reviews</subject><subject>Nodes</subject><subject>order picker</subject><subject>Order picking</subject><subject>Overtime</subject><subject>Productivity</subject><subject>Shortest-path problems</subject><subject>Warehouses</subject><issn>2227-7390</issn><issn>2227-7390</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2024</creationdate><recordtype>article</recordtype><sourceid>PIMPY</sourceid><sourceid>DOA</sourceid><recordid>eNpNUc1KAzEQXkTBor35AAteXc3f5udYitVCRcEWjyHNJt0t6aYmW6E338E39ElMbZXOZYaZ72eYybIrCG4xFuBupboaIsgQFfwk6yGEWMHS4PSoPs_6MS5BCgExJ6KXySdfGeeadpF3tclfax86E7v8Janl1od83LYm5G8qmNpvosmnQX0cCLP4Rxs5v62-P78SLNbKuXzgFj40Xb26zM6sctH0D_kim43up8PHYvL8MB4OJoVGJekKW1rEKaKWU0yxFoITAlUFEZ_PuSCsEowCU5VUE8g0tcbiEmBlCKUIUAXxRTbe61ZeLeU6NCsVttKrRv42fFhIFbpGOyMRNxAQY7WZY6KhVhW2DFOKBWMYYJK0rvda6-DfN-kacuk3oU3rS5yYIHnSnePNHqWDjzEY--8Kgdx9RB5_BP8AMpV-NA</recordid><startdate>20240901</startdate><enddate>20240901</enddate><creator>Nordin, Noraimi Azlin Mohd</creator><creator>Shariff, S. Sarifah Radiah</creator><creator>Supadi, Siti Suzlin</creator><creator>Masudin, Ilyas</creator><general>MDPI AG</general><scope>AAYXX</scope><scope>CITATION</scope><scope>3V.</scope><scope>7SC</scope><scope>7TB</scope><scope>7XB</scope><scope>8AL</scope><scope>8FD</scope><scope>8FE</scope><scope>8FG</scope><scope>8FK</scope><scope>ABJCF</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>ARAPS</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>FR3</scope><scope>GNUQQ</scope><scope>HCIFZ</scope><scope>JQ2</scope><scope>K7-</scope><scope>KR7</scope><scope>L6V</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope><scope>M0N</scope><scope>M7S</scope><scope>P62</scope><scope>PIMPY</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PRINS</scope><scope>PTHSS</scope><scope>Q9U</scope><scope>DOA</scope><orcidid>https://orcid.org/0000-0002-0153-4560</orcidid><orcidid>https://orcid.org/0000-0001-9895-5742</orcidid></search><sort><creationdate>20240901</creationdate><title>Modelling the Shortest Path for Inner Warehouse Travelling Using the Floyd–Warshall Algorithm</title><author>Nordin, Noraimi Azlin Mohd ; Shariff, S. Sarifah Radiah ; Supadi, Siti Suzlin ; Masudin, Ilyas</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c254t-f5f28626f86363c998441ad128bb8947d9760ed56c417c6fef3503ae466206a13</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2024</creationdate><topic>Algorithms</topic><topic>Automation</topic><topic>Customer satisfaction</topic><topic>Customer services</topic><topic>Customers</topic><topic>Dynamic programming</topic><topic>Electronic commerce</topic><topic>Floyd–Warshall algorithm</topic><topic>inner warehouse transportation</topic><topic>Literature reviews</topic><topic>Nodes</topic><topic>order picker</topic><topic>Order picking</topic><topic>Overtime</topic><topic>Productivity</topic><topic>Shortest-path problems</topic><topic>Warehouses</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Nordin, Noraimi Azlin Mohd</creatorcontrib><creatorcontrib>Shariff, S. Sarifah Radiah</creatorcontrib><creatorcontrib>Supadi, Siti Suzlin</creatorcontrib><creatorcontrib>Masudin, Ilyas</creatorcontrib><collection>CrossRef</collection><collection>ProQuest Central (Corporate)</collection><collection>Computer and Information Systems Abstracts</collection><collection>Mechanical &amp; Transportation Engineering Abstracts</collection><collection>ProQuest Central (purchase pre-March 2016)</collection><collection>Computing Database (Alumni Edition)</collection><collection>Technology Research Database</collection><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>ProQuest Central (Alumni) (purchase pre-March 2016)</collection><collection>Materials Science &amp; Engineering Collection</collection><collection>ProQuest Central (Alumni)</collection><collection>ProQuest Central UK/Ireland</collection><collection>Advanced Technologies &amp; Aerospace Database‎ (1962 - current)</collection><collection>ProQuest Central Essentials</collection><collection>AUTh Library subscriptions: ProQuest Central</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central</collection><collection>Engineering Research Database</collection><collection>ProQuest Central Student</collection><collection>SciTech Premium Collection (Proquest) (PQ_SDU_P3)</collection><collection>ProQuest Computer Science Collection</collection><collection>Computer Science Database</collection><collection>Civil Engineering Abstracts</collection><collection>ProQuest Engineering Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts – Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><collection>Computing Database</collection><collection>ProQuest Engineering Database</collection><collection>ProQuest Advanced Technologies &amp; Aerospace Collection</collection><collection>Publicly Available Content Database</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>ProQuest Central China</collection><collection>Engineering Collection</collection><collection>ProQuest Central Basic</collection><collection>Directory of Open Access Journals</collection><jtitle>Mathematics (Basel)</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Nordin, Noraimi Azlin Mohd</au><au>Shariff, S. Sarifah Radiah</au><au>Supadi, Siti Suzlin</au><au>Masudin, Ilyas</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Modelling the Shortest Path for Inner Warehouse Travelling Using the Floyd–Warshall Algorithm</atitle><jtitle>Mathematics (Basel)</jtitle><date>2024-09-01</date><risdate>2024</risdate><volume>12</volume><issue>17</issue><spage>2698</spage><pages>2698-</pages><issn>2227-7390</issn><eissn>2227-7390</eissn><abstract>Order picking is referred as a critical process of selecting items requested by a customer in a warehouse. Meeting the demand of every customer is the main objective in this area. Large warehouses pose a challenge since the order-picking process is slowed considerably by the lengthy time it takes to transport items across the warehouse. Throughout the study, the system is hoped to develop proper procedures in the order-picking process. In handling this scenario, the decision-makers need to take any possible action to ensure the warehouses can keep operating and meeting the requirements and satisfaction of the customers. Due to this, the study’s main objective is to determine whether the Floyd–Warshall algorithm or the dynamic programming method will give the most accurate shortest path and minimum travel distance for order pickers. Two data sets (nine nodes and nineteen nodes) are used to determine the optimal path and minimum travel distance for the order picker to meet and satisfy customer orders for the warehouse. The two models were modified and applied to address real-world case studies from the automotive manufacturing company in Malaysia. The results show a big difference between the total distance by 113.48% for 19 nodes. Through this finding, the company may choose which method suits their preferences. Concurrently, this study may also contribute to problem-solving issues in any warehouse operation with a similar procedure.</abstract><cop>Basel</cop><pub>MDPI AG</pub><doi>10.3390/math12172698</doi><orcidid>https://orcid.org/0000-0002-0153-4560</orcidid><orcidid>https://orcid.org/0000-0001-9895-5742</orcidid><oa>free_for_read</oa></addata></record>
fulltext fulltext
identifier ISSN: 2227-7390
ispartof Mathematics (Basel), 2024-09, Vol.12 (17), p.2698
issn 2227-7390
2227-7390
language eng
recordid cdi_doaj_primary_oai_doaj_org_article_28e104efceb34c1cad3f736639773034
source Publicly Available Content Database
subjects Algorithms
Automation
Customer satisfaction
Customer services
Customers
Dynamic programming
Electronic commerce
Floyd–Warshall algorithm
inner warehouse transportation
Literature reviews
Nodes
order picker
Order picking
Overtime
Productivity
Shortest-path problems
Warehouses
title Modelling the Shortest Path for Inner Warehouse Travelling Using the Floyd–Warshall Algorithm
url http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-07T17%3A20%3A15IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_doaj_&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Modelling%20the%20Shortest%20Path%20for%20Inner%20Warehouse%20Travelling%20Using%20the%20Floyd%E2%80%93Warshall%20Algorithm&rft.jtitle=Mathematics%20(Basel)&rft.au=Nordin,%20Noraimi%20Azlin%20Mohd&rft.date=2024-09-01&rft.volume=12&rft.issue=17&rft.spage=2698&rft.pages=2698-&rft.issn=2227-7390&rft.eissn=2227-7390&rft_id=info:doi/10.3390/math12172698&rft_dat=%3Cproquest_doaj_%3E3104066261%3C/proquest_doaj_%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-c254t-f5f28626f86363c998441ad128bb8947d9760ed56c417c6fef3503ae466206a13%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_pqid=3104066261&rft_id=info:pmid/&rfr_iscdi=true