• Login
    View Item 
    •   DSpace@RPI Home
    • Rensselaer Libraries
    • RPI Theses Online (Complete)
    • View Item
    •   DSpace@RPI Home
    • Rensselaer Libraries
    • RPI Theses Online (Complete)
    • View Item
    JavaScript is disabled for your browser. Some features of this site may not work without it.

    Analytical models for retrieving items in dense storage systems and optimizing the location of an open square

    Author
    Climes, Joan
    View/Open
    179427_Climes_rpi_0185N_11181.pdf (1.967Mb)
    Other Contributors
    Pazour, Jennifer A.; Mendonça, David; Sharkey, Thomas C.;
    Date Issued
    2017-12
    Subject
    Industrial and management engineering
    Degree
    MS;
    Terms of Use
    This electronic version is a licensed copy owned by Rensselaer Polytechnic Institute, Troy, NY. Copyright of original work retained by author.;
    Metadata
    Show full item record
    URI
    https://hdl.handle.net/20.500.13015/2325
    Abstract
    Dense storage systems allow for highly effective use of space; however this comes at a cost: dense storage systems can require the repositioning of stored items to retrieve other more densely desired items. These dense storage systems are found in warehouses and distribution centers, and aboard US Navy ships used for sea-based logistics. This research creates mathematical models to determine the value of an empty space in a specific dense storage environment, the double inverted T configuration. Retrieval distance equations are derived for each item in a layout, which is the distance it takes to move the item from its current position to an exit point. Repositioning distance equations calculate the distance it takes to move an item out of the way and back in order to retrieve an item behind it. Repositioning distance equations are dependent on an item’s block, direction of travel, and repositioning location. The benefit of an empty space is defined by the amount by which the total system’s expected repositioning distance is reduced to reach a target item. This project characterizes open spaces in terms of how many items receive benefit and how much benefit each item receives. An optimization problem is presented to select which location should be left open, which is solved using brute force for a single open square. We find the best locations for an open square occur for squares along the aisle, and close to the vertical walls if h > k, or close to the horizontal wall if h = k. Due to the symmetry in repositioning distances, multiple optimal solutions exist.;
    Description
    December 2017; School of Engineering
    Department
    Dept. of Industrial and Systems Engineering;
    Publisher
    Rensselaer Polytechnic Institute, Troy, NY
    Relationships
    Rensselaer Theses and Dissertations Online Collection;
    Access
    Restricted to current Rensselaer faculty, staff and students. Access inquiries may be directed to the Rensselaer Libraries.;
    Collections
    • RPI Theses Online (Complete)

    Browse

    All of DSpace@RPICommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsThis CollectionBy Issue DateAuthorsTitlesSubjects

    My Account

    Login

    DSpace software copyright © 2002-2022  DuraSpace
    Contact Us | Send Feedback
    DSpace Express is a service operated by 
    Atmire NV