Optimal Retrieval in Puzzle-Based Storage Systems Using Automated Mobile Robots

Puzzle-based storage (PBS) systems store unit loads at very high density, without consuming space for transport aisles. In such systems, each load is stored on a moving device (conveyor module or transport vehicle), making these systems very expensive to build and maintain. This paper studies a new...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Transportation science 2023-03, Vol.57 (2), p.424-443
1. Verfasser: Raviv, Tal
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page 443
container_issue 2
container_start_page 424
container_title Transportation science
container_volume 57
creator Raviv, Tal
description Puzzle-based storage (PBS) systems store unit loads at very high density, without consuming space for transport aisles. In such systems, each load is stored on a moving device (conveyor module or transport vehicle), making these systems very expensive to build and maintain. This paper studies a new type of PBS system where loads are moved by a small number of autonomous mobile robots (AMRs). The AMRs (or vehicles) can travel freely underneath loads and lift a specific load and carry it to a neighboring vacant space. These systems are hard to analyze, as all the AMRs can move simultaneously with or without loads. We formulate an integer linear programming model that minimizes the retrieval time and the number of load and vehicle movements. The proposed model can handle single-load movements as well as block movements, multiple input/output points, and various constraints on simultaneous vehicle movements. The integer linear programming formulation can solve relatively small problems (a grid with up to about 50 cells) and a sufficient number of empty cells. For larger systems or those with few empty cells, a three-phase heuristic (3PH) is developed, which significantly outperforms the heuristic methods known to date and solves large instances sufficiently fast. The 3PH and an additional hybrid heuristic yield relatively small gaps from a lower bound provided by the integer linear programming model. We find that increasing the number of vehicles has a diminishing return effect on the retrieval times. Using a relatively small number of vehicles makes retrieval times only slightly longer than those obtained when having a vehicle under each load (which is equivalent to the traditional PBS systems). With single-load movement, more vehicles are needed compared with block movement to reach short retrieval times. Also, the marginal contribution of extra empty slots appears to decrease rapidly, which implies high storage densities can be obtained in practice.
doi_str_mv 10.1287/trsc.2022.1169
format Article
fullrecord <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_journals_2802977225</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2802977225</sourcerecordid><originalsourceid>FETCH-LOGICAL-c362t-eacd4afbb58d4a2955e3b610d58c2b7065b6accf1154260fcbf63b4c52862ca03</originalsourceid><addsrcrecordid>eNqFkN1LwzAUxYMoOKevPgd8bk1um7R7nOIXTCabew5Jlo6OtplJKmx_vSkVfPTpXri_cw73IHRLSUqhLO6D8zoFApBSymdnaEIZ8ITleXGOJoTkNKGcsUt05f2eEMoKyiZouTyEupUNXpngavMdt7rDH_3p1JjkQXqzxetgndwZvD76YFqPN77udnjeB9vKEO_vVtWNwSurbPDX6KKSjTc3v3OKNs9Pn4-vyWL58vY4XyQ64xASI_U2l5VSrIwTZoyZTHFKtqzUoArCmeJS64pSlgMnlVYVz1SuGZQctCTZFN2Nvgdnv3rjg9jb3nUxUkBJYFYUACxS6UhpZ713phIHF791R0GJGEoTQ2liKE0MpUUBHgVG2672f3gZkzNKCI9IMiJ1V1nX-v8sfwBE83mn</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2802977225</pqid></control><display><type>article</type><title>Optimal Retrieval in Puzzle-Based Storage Systems Using Automated Mobile Robots</title><source>Informs</source><source>EBSCOhost Business Source Complete</source><creator>Raviv, Tal</creator><creatorcontrib>Raviv, Tal</creatorcontrib><description>Puzzle-based storage (PBS) systems store unit loads at very high density, without consuming space for transport aisles. In such systems, each load is stored on a moving device (conveyor module or transport vehicle), making these systems very expensive to build and maintain. This paper studies a new type of PBS system where loads are moved by a small number of autonomous mobile robots (AMRs). The AMRs (or vehicles) can travel freely underneath loads and lift a specific load and carry it to a neighboring vacant space. These systems are hard to analyze, as all the AMRs can move simultaneously with or without loads. We formulate an integer linear programming model that minimizes the retrieval time and the number of load and vehicle movements. The proposed model can handle single-load movements as well as block movements, multiple input/output points, and various constraints on simultaneous vehicle movements. The integer linear programming formulation can solve relatively small problems (a grid with up to about 50 cells) and a sufficient number of empty cells. For larger systems or those with few empty cells, a three-phase heuristic (3PH) is developed, which significantly outperforms the heuristic methods known to date and solves large instances sufficiently fast. The 3PH and an additional hybrid heuristic yield relatively small gaps from a lower bound provided by the integer linear programming model. We find that increasing the number of vehicles has a diminishing return effect on the retrieval times. Using a relatively small number of vehicles makes retrieval times only slightly longer than those obtained when having a vehicle under each load (which is equivalent to the traditional PBS systems). With single-load movement, more vehicles are needed compared with block movement to reach short retrieval times. Also, the marginal contribution of extra empty slots appears to decrease rapidly, which implies high storage densities can be obtained in practice.</description><identifier>ISSN: 0041-1655</identifier><identifier>EISSN: 1526-5447</identifier><identifier>DOI: 10.1287/trsc.2022.1169</identifier><language>eng</language><publisher>Baltimore: INFORMS</publisher><subject>autonomous vehicles ; Density ; Electric vehicles ; Empty ; Heuristic ; Heuristic methods ; Information retrieval ; Integer programming ; Linear programming ; Lower bounds ; puzzle-based storage ; Retrieval ; retrieval scheduling ; Robotics ; Robots ; Storage systems ; Transport vehicles ; Transportation ; Unit loads ; Vehicles</subject><ispartof>Transportation science, 2023-03, Vol.57 (2), p.424-443</ispartof><rights>Copyright Institute for Operations Research and the Management Sciences Mar/Apr 2023</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c362t-eacd4afbb58d4a2955e3b610d58c2b7065b6accf1154260fcbf63b4c52862ca03</citedby><cites>FETCH-LOGICAL-c362t-eacd4afbb58d4a2955e3b610d58c2b7065b6accf1154260fcbf63b4c52862ca03</cites><orcidid>0000-0002-7827-2888 ; 0000-0002-1740-7822 ; 0000-0002-5960-2386</orcidid></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://pubsonline.informs.org/doi/full/10.1287/trsc.2022.1169$$EHTML$$P50$$Ginforms$$H</linktohtml><link.rule.ids>315,781,785,3693,27929,27930,62621</link.rule.ids></links><search><creatorcontrib>Raviv, Tal</creatorcontrib><title>Optimal Retrieval in Puzzle-Based Storage Systems Using Automated Mobile Robots</title><title>Transportation science</title><description>Puzzle-based storage (PBS) systems store unit loads at very high density, without consuming space for transport aisles. In such systems, each load is stored on a moving device (conveyor module or transport vehicle), making these systems very expensive to build and maintain. This paper studies a new type of PBS system where loads are moved by a small number of autonomous mobile robots (AMRs). The AMRs (or vehicles) can travel freely underneath loads and lift a specific load and carry it to a neighboring vacant space. These systems are hard to analyze, as all the AMRs can move simultaneously with or without loads. We formulate an integer linear programming model that minimizes the retrieval time and the number of load and vehicle movements. The proposed model can handle single-load movements as well as block movements, multiple input/output points, and various constraints on simultaneous vehicle movements. The integer linear programming formulation can solve relatively small problems (a grid with up to about 50 cells) and a sufficient number of empty cells. For larger systems or those with few empty cells, a three-phase heuristic (3PH) is developed, which significantly outperforms the heuristic methods known to date and solves large instances sufficiently fast. The 3PH and an additional hybrid heuristic yield relatively small gaps from a lower bound provided by the integer linear programming model. We find that increasing the number of vehicles has a diminishing return effect on the retrieval times. Using a relatively small number of vehicles makes retrieval times only slightly longer than those obtained when having a vehicle under each load (which is equivalent to the traditional PBS systems). With single-load movement, more vehicles are needed compared with block movement to reach short retrieval times. Also, the marginal contribution of extra empty slots appears to decrease rapidly, which implies high storage densities can be obtained in practice.</description><subject>autonomous vehicles</subject><subject>Density</subject><subject>Electric vehicles</subject><subject>Empty</subject><subject>Heuristic</subject><subject>Heuristic methods</subject><subject>Information retrieval</subject><subject>Integer programming</subject><subject>Linear programming</subject><subject>Lower bounds</subject><subject>puzzle-based storage</subject><subject>Retrieval</subject><subject>retrieval scheduling</subject><subject>Robotics</subject><subject>Robots</subject><subject>Storage systems</subject><subject>Transport vehicles</subject><subject>Transportation</subject><subject>Unit loads</subject><subject>Vehicles</subject><issn>0041-1655</issn><issn>1526-5447</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2023</creationdate><recordtype>article</recordtype><recordid>eNqFkN1LwzAUxYMoOKevPgd8bk1um7R7nOIXTCabew5Jlo6OtplJKmx_vSkVfPTpXri_cw73IHRLSUqhLO6D8zoFApBSymdnaEIZ8ITleXGOJoTkNKGcsUt05f2eEMoKyiZouTyEupUNXpngavMdt7rDH_3p1JjkQXqzxetgndwZvD76YFqPN77udnjeB9vKEO_vVtWNwSurbPDX6KKSjTc3v3OKNs9Pn4-vyWL58vY4XyQ64xASI_U2l5VSrIwTZoyZTHFKtqzUoArCmeJS64pSlgMnlVYVz1SuGZQctCTZFN2Nvgdnv3rjg9jb3nUxUkBJYFYUACxS6UhpZ713phIHF791R0GJGEoTQ2liKE0MpUUBHgVG2672f3gZkzNKCI9IMiJ1V1nX-v8sfwBE83mn</recordid><startdate>20230301</startdate><enddate>20230301</enddate><creator>Raviv, Tal</creator><general>INFORMS</general><general>Institute for Operations Research and the Management Sciences</general><scope>OQ6</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>8BJ</scope><scope>FQK</scope><scope>JBE</scope><orcidid>https://orcid.org/0000-0002-7827-2888</orcidid><orcidid>https://orcid.org/0000-0002-1740-7822</orcidid><orcidid>https://orcid.org/0000-0002-5960-2386</orcidid></search><sort><creationdate>20230301</creationdate><title>Optimal Retrieval in Puzzle-Based Storage Systems Using Automated Mobile Robots</title><author>Raviv, Tal</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c362t-eacd4afbb58d4a2955e3b610d58c2b7065b6accf1154260fcbf63b4c52862ca03</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2023</creationdate><topic>autonomous vehicles</topic><topic>Density</topic><topic>Electric vehicles</topic><topic>Empty</topic><topic>Heuristic</topic><topic>Heuristic methods</topic><topic>Information retrieval</topic><topic>Integer programming</topic><topic>Linear programming</topic><topic>Lower bounds</topic><topic>puzzle-based storage</topic><topic>Retrieval</topic><topic>retrieval scheduling</topic><topic>Robotics</topic><topic>Robots</topic><topic>Storage systems</topic><topic>Transport vehicles</topic><topic>Transportation</topic><topic>Unit loads</topic><topic>Vehicles</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Raviv, Tal</creatorcontrib><collection>ECONIS</collection><collection>CrossRef</collection><collection>International Bibliography of the Social Sciences (IBSS)</collection><collection>International Bibliography of the Social Sciences</collection><collection>International Bibliography of the Social Sciences</collection><jtitle>Transportation science</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Raviv, Tal</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Optimal Retrieval in Puzzle-Based Storage Systems Using Automated Mobile Robots</atitle><jtitle>Transportation science</jtitle><date>2023-03-01</date><risdate>2023</risdate><volume>57</volume><issue>2</issue><spage>424</spage><epage>443</epage><pages>424-443</pages><issn>0041-1655</issn><eissn>1526-5447</eissn><abstract>Puzzle-based storage (PBS) systems store unit loads at very high density, without consuming space for transport aisles. In such systems, each load is stored on a moving device (conveyor module or transport vehicle), making these systems very expensive to build and maintain. This paper studies a new type of PBS system where loads are moved by a small number of autonomous mobile robots (AMRs). The AMRs (or vehicles) can travel freely underneath loads and lift a specific load and carry it to a neighboring vacant space. These systems are hard to analyze, as all the AMRs can move simultaneously with or without loads. We formulate an integer linear programming model that minimizes the retrieval time and the number of load and vehicle movements. The proposed model can handle single-load movements as well as block movements, multiple input/output points, and various constraints on simultaneous vehicle movements. The integer linear programming formulation can solve relatively small problems (a grid with up to about 50 cells) and a sufficient number of empty cells. For larger systems or those with few empty cells, a three-phase heuristic (3PH) is developed, which significantly outperforms the heuristic methods known to date and solves large instances sufficiently fast. The 3PH and an additional hybrid heuristic yield relatively small gaps from a lower bound provided by the integer linear programming model. We find that increasing the number of vehicles has a diminishing return effect on the retrieval times. Using a relatively small number of vehicles makes retrieval times only slightly longer than those obtained when having a vehicle under each load (which is equivalent to the traditional PBS systems). With single-load movement, more vehicles are needed compared with block movement to reach short retrieval times. Also, the marginal contribution of extra empty slots appears to decrease rapidly, which implies high storage densities can be obtained in practice.</abstract><cop>Baltimore</cop><pub>INFORMS</pub><doi>10.1287/trsc.2022.1169</doi><tpages>20</tpages><orcidid>https://orcid.org/0000-0002-7827-2888</orcidid><orcidid>https://orcid.org/0000-0002-1740-7822</orcidid><orcidid>https://orcid.org/0000-0002-5960-2386</orcidid></addata></record>
fulltext fulltext
identifier ISSN: 0041-1655
ispartof Transportation science, 2023-03, Vol.57 (2), p.424-443
issn 0041-1655
1526-5447
language eng
recordid cdi_proquest_journals_2802977225
source Informs; EBSCOhost Business Source Complete
subjects autonomous vehicles
Density
Electric vehicles
Empty
Heuristic
Heuristic methods
Information retrieval
Integer programming
Linear programming
Lower bounds
puzzle-based storage
Retrieval
retrieval scheduling
Robotics
Robots
Storage systems
Transport vehicles
Transportation
Unit loads
Vehicles
title Optimal Retrieval in Puzzle-Based Storage Systems Using Automated Mobile Robots
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-13T05%3A00%3A49IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Optimal%20Retrieval%20in%20Puzzle-Based%20Storage%20Systems%20Using%20Automated%20Mobile%20Robots&rft.jtitle=Transportation%20science&rft.au=Raviv,%20Tal&rft.date=2023-03-01&rft.volume=57&rft.issue=2&rft.spage=424&rft.epage=443&rft.pages=424-443&rft.issn=0041-1655&rft.eissn=1526-5447&rft_id=info:doi/10.1287/trsc.2022.1169&rft_dat=%3Cproquest_cross%3E2802977225%3C/proquest_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=2802977225&rft_id=info:pmid/&rfr_iscdi=true