東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

FindBook

Google Book

Amazon

博客來

Flexible High-Density Puzzle Storage Systems

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Flexible High-Density Puzzle Storage Systems /
作者:	Shirazi, Ehsan.
出版者:	Ann Arbor : ProQuest Dissertations & Theses, : 2018,
面頁冊數:	68 p.
附註:	Source: Masters Abstracts International, Volume: 81-03.
Contained By:	Masters Abstracts International81-03.
標題:	Computer engineering. -
電子資源:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=27527045
ISBN:	9781085638494

Flexible High-Density Puzzle Storage Systems
Shirazi, Ehsan.

Flexible High-Density Puzzle Storage Systems - Ann Arbor : ProQuest Dissertations & Theses, 2018 - 68 p.

Source: Masters Abstracts International, Volume: 81-03.

Thesis (M.S.)--West Virginia University, 2018.

This item must not be sold to any third party vendors.

In a traditional storage system, when one of the mechanical or electrical parts or the software fails to operate correctly, it may lead to the failure of the entire system imposing huge costs to the system (Gue et al., 2014). However, in a grid storage network, if a grid fails to operate, the system continues to operate. Therefore, failure of a system component will not jeopardize the whole system functionality. As such, reliability is one of the key advantages of grid storage networks. Another benefit of grid storage systems is flexibility. Various systems such as GridFlow, GridPick, GridStore, are developed that consist of multiple autonomous conveyors to store and move items in different directions. A unit module is capable to work independently. To retrieve an item, empty modules open a temporary aisle to move the item to the retrieval point. This study developed a tote retrieval algorithm for high-density storage systems (HDSS). The algorithm is capable of retrieving totes from all sides of a storage puzzle. This is novel since methodologies of prior studies were confined to retrieving items from a single grid or a single side of a puzzle. The algorithm was decentralized and agent-based where each grid acts as an agent. The study undertook developing algorithms that could minimize the number of movements in the network for tote retrievals and to prevent deadlocks. Deadlock prevention algorithms are capable to resolve a diverse range of situations that cause network deadlocks. An object-oriented software program was developed that implemented the algorithms. The software tool simulated puzzles of various sizes with different number of escorts available for retrieving requested totes. Thousands of iterations of the puzzle configurations were resolved for the analysis. It was found that incremental increase in the number of escorts in the puzzle reduces the number of movements for retrieving totes. However, depending on the puzzle size, there were increments that additional escorts had minimal impact. It was also found that average retrieval movements for 3 totes increase logarithmically with the number of cells in a puzzle. To validate the methodology and its software implementation, results from the simulation were compared with the results from other studies with mathematical solutions. The program replicated the optimum number of movements for a puzzle that contained one escort and retrieved one tote.

ISBN: 9781085638494Subjects--Topical Terms:

621879
Computer engineering.

Flexible High-Density Puzzle Storage Systems
LDR:03522nmm a2200349 4500 001 2347747
005 20230509065452.5
006 m o d
007 cr#unu||||||||
008 241004s2018 ||||||||||||||||| ||eng d
020 $a 9781085638494
035 $a (MiAaPQ)AAI27527045
035 $a (MiAaPQ)WVirginia5110
035 $a AAI27527045
040 $a MiAaPQ $c MiAaPQ
100 1 $a Shirazi, Ehsan. $3 3687041
245 1 0 $a Flexible High-Density Puzzle Storage Systems
260 1 $a Ann Arbor : $b ProQuest Dissertations & Theses, $c 2018
300 $a 68 p.
500 $a Source: Masters Abstracts International, Volume: 81-03.
500 $a Advisor: Currie, Kenneth;Farrokhvar, Leily;Wuest, Thorsten.
502 $a Thesis (M.S.)--West Virginia University, 2018.
506 $a This item must not be sold to any third party vendors.
520 $a In a traditional storage system, when one of the mechanical or electrical parts or the software fails to operate correctly, it may lead to the failure of the entire system imposing huge costs to the system (Gue et al., 2014). However, in a grid storage network, if a grid fails to operate, the system continues to operate. Therefore, failure of a system component will not jeopardize the whole system functionality. As such, reliability is one of the key advantages of grid storage networks. Another benefit of grid storage systems is flexibility. Various systems such as GridFlow, GridPick, GridStore, are developed that consist of multiple autonomous conveyors to store and move items in different directions. A unit module is capable to work independently. To retrieve an item, empty modules open a temporary aisle to move the item to the retrieval point. This study developed a tote retrieval algorithm for high-density storage systems (HDSS). The algorithm is capable of retrieving totes from all sides of a storage puzzle. This is novel since methodologies of prior studies were confined to retrieving items from a single grid or a single side of a puzzle. The algorithm was decentralized and agent-based where each grid acts as an agent. The study undertook developing algorithms that could minimize the number of movements in the network for tote retrievals and to prevent deadlocks. Deadlock prevention algorithms are capable to resolve a diverse range of situations that cause network deadlocks. An object-oriented software program was developed that implemented the algorithms. The software tool simulated puzzles of various sizes with different number of escorts available for retrieving requested totes. Thousands of iterations of the puzzle configurations were resolved for the analysis. It was found that incremental increase in the number of escorts in the puzzle reduces the number of movements for retrieving totes. However, depending on the puzzle size, there were increments that additional escorts had minimal impact. It was also found that average retrieval movements for 3 totes increase logarithmically with the number of cells in a puzzle. To validate the methodology and its software implementation, results from the simulation were compared with the results from other studies with mathematical solutions. The program replicated the optimum number of movements for a puzzle that contained one escort and retrieved one tote.
590 $a School code: 0256.
650 4 $a Computer engineering. $3 621879
650 4 $a Industrial engineering. $3 526216
650 4 $a Systems science. $3 3168411
690 $a 0464
690 $a 0546
690 $a 0790
710 2 $a West Virginia University. $3 1017532
773 0 $t Masters Abstracts International $g 81-03.
790 $a 0256
791 $a M.S.
792 $a 2018
793 $a English
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=27527045