Abstract
Abstract The order picking function in a warehouse involves selection of items from storage areas in order to satisfy customer demand. It has been identified as the most costly warehouse operations activity. Cluster analysis identifies groups of items that are frequently ordered together. Items within a cluster may be located near one another, and efficient picking tours may, thus, be formed. We formulate the clustering problem as a p-median 0-1 integer program which may efficiently be solved to optimality.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
