Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/4450
PIRA download icon_1.1View/Download Full Text
DC FieldValueLanguage
dc.contributorDepartment of Logistics and Maritime Studies-
dc.creatorChan, HL-
dc.creatorPang, A-
dc.creatorLi, KW-
dc.date.accessioned2014-12-11T08:25:55Z-
dc.date.available2014-12-11T08:25:55Z-
dc.identifier.isbn978-0-9808251-0-7-
dc.identifier.urihttp://hdl.handle.net/10397/4450-
dc.language.isoenen_US
dc.publisherIEOM Research Solutions Pty Ltd.en_US
dc.rights© 2011 IEOM Research Solutions Pty Ltd. Posted by permission of the publisher.en_US
dc.subjectWarehousing operationsen_US
dc.subjectStorage location assignment problemen_US
dc.subjectOrder pickingen_US
dc.subjectData miningen_US
dc.subjectAssociation rulesen_US
dc.titleAssociation rule based approach for improving operation efficiency in a randomized warehouseen_US
dc.typeConference Paperen_US
dc.description.otherinformationAuthor name used in this publication: King Wah Pangen_US
dc.description.otherinformationRefereed conference paperen_US
dcterms.abstractData mining has long been used in relationship extraction from large amount of data for a wide range of applications such as consumer behavior analysis in marketing. Some research studies have also extended the usage of this concept in warehousing operations management to determine the order picking policy by batching the orders to minimize the picking distance. Yet, not many research studies have considered the application of the data mining approach on storage location assignment decision to minimize the manual effort on put-away execution which is also a significant factor to the constituent of warehousing operation cost. We present a data mining approach for the storage location assignment problem in a randomized warehouse using association rules extraction algorithm. Result of the preliminary experimental study shows that our proposed storage location assignment algorithm is efficient in determining the correlated products storage location that minimizes the total travel distances of both order picking and put-away operations for a randomized less-than-unit-load warehouse.-
dcterms.accessRightsopen accessen_US
dcterms.bibliographicCitation2nd International Conference on Industrial Engineering and Operations Management (IEOM 2011) : January 22-24, 2011, Kuala Lumpur, Malaysia : proceedings, p. 704-710-
dcterms.issued2011-
dc.identifier.rosgroupidr51554-
dc.description.ros2010-2011 > Academic research: refereed > Refereed conference paper-
dc.description.oaOther Versionen_US
dc.identifier.FolderNumberOA_IR/PIRAen_US
dc.description.pubStatusPublisheden_US
Appears in Collections:Conference Paper
Files in This Item:
File Description SizeFormat 
Chan_Association-Rule-Based-Approach.pdf816.45 kBAdobe PDFView/Open
Open Access Information
Status open access
File Version Other Version
Access
View full-text via PolyU eLinks SFX Query
Show simple item record

Page views

184
Last Week
0
Last month
Citations as of Apr 21, 2024

Downloads

201
Citations as of Apr 21, 2024

Google ScholarTM

Check


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.