WEKO3
アイテム
物流倉庫のためのパズルベースソーティングシステムに関する研究
https://doi.org/10.18997/00008919
https://doi.org/10.18997/000089199f07fbd1-402b-43a4-b4cf-63eebb2609b1
| 名前 / ファイル | ライセンス | アクション |
|---|---|---|
sei_k_436.pdf (5.4 MB)
|
|
| Item type | 学位論文 = Thesis or Dissertation(1) | |||||||
|---|---|---|---|---|---|---|---|---|
| 公開日 | 2022-06-20 | |||||||
| 資源タイプ | ||||||||
| 資源タイプ識別子 | http://purl.org/coar/resource_type/c_db06 | |||||||
| 資源タイプ | doctoral thesis | |||||||
| タイトル | ||||||||
| タイトル | A Puzzle-Based Products Sorting Strategy for Logistics Warehouses | |||||||
| 言語 | en | |||||||
| タイトル | ||||||||
| タイトル | 物流倉庫のためのパズルベースソーティングシステムに関する研究 | |||||||
| 言語 | ja | |||||||
| 言語 | ||||||||
| 言語 | eng | |||||||
| 著者 |
Alahmad, Raji
× Alahmad, Raji
|
|||||||
| 抄録 | ||||||||
| 内容記述タイプ | Abstract | |||||||
| 内容記述 | The new challenging demands of the current market including space should be satisfied by designing modern material flow systems, with higher levels of flexibility and reliability. Designing warehouses using effective material handling equipment such as multi-directional conveyors significantly reduces the cost towards efficient space utilization and time-saving. Several storage strategies can be applied depending on service concerns and products storage conditions, for instance, for storing frozen items that need specific temperature conditions, the zoning strategy is applied. On the other hand, different order picking policies might be used such as Batch picking where the orders would be batched together and the picking process carried out for whole required orders in a single picking round. Under batch and/or zoning picking policy, which is applied in most online retailers’ warehouses, products necessitate further processes such as consolidation, sorting, and sequencing. Sequencing of items is one of the important processes that lead to enhancing logistic operations. However, current approaches are not capable of fully fulfilling the dynamic changes, and therefore puzzle-based sequencing system with very high density and highly efficient floor space utilization has been successfully developed. Accordingly, two puzzle-solving methods are investigated; the game tree and the pathfinding algorithms. A-star is chosen based on pathfinding algorithms in order to find the shortest solution of the puzzle in which the sequencing time is decreased. Furthermore, the pre-sorting process is proposed to overcome the unsolvable configuration issue. The shape of the puzzle is discussed with several factors that affect the sorting steps, and numerically we found that the square shape is better than the rectangular one in terms of solution steps. Three introduced technical solutions strategies are proposed to increase the limitation of the puzzle; increasing the puzzle size, using multi-boards with the same puzzle boards sizes, and adding buffer conveyor. These strategies are explained and discussed in terms of the area used by the system and the total solution steps. Using multi-boards with the 8-puzzle board size was superior to other strategies. An arbitrary number of blanks in the puzzle was discussed with their effect on the puzzle capacity and maximum solution steps. Moreover, by carrying out double switching in one step with applying the block movement concept, the solution steps are minimized by a minimum of 1 step, an average of 4 steps, and a maximum of 10 steps in an 8-puzzle with 2 blanks placed in the corner of the puzzle, and the average reduction percentage of solution steps was 25%. The best strategy to sequence more than 8 boxes in one sequencing time is using multi-boards along with the main feeding conveyor with the shape and size of 8-puzzle with 2 blanks. The findings suggest that a puzzle-based sequencing system would be preferred for highly efficient floor space utilization as well as lower sequencing time compared to other systems. | |||||||
| 言語 | en | |||||||
| 目次 | ||||||||
| 内容記述タイプ | TableOfContents | |||||||
| 内容記述 | 1 Introduction||2 Research Methodology||3 Results and Discussion||4 Conclusion and Future Work | |||||||
| 備考 | ||||||||
| 内容記述タイプ | Other | |||||||
| 内容記述 | 九州工業大学博士学位論文 学位記番号: 生工博甲第436号 学位授与年月日: 令和4年3月25日 | |||||||
| キーワード | ||||||||
| 主題Scheme | Other | |||||||
| 主題 | Warehouse | |||||||
| キーワード | ||||||||
| 主題Scheme | Other | |||||||
| 主題 | Sequencing | |||||||
| キーワード | ||||||||
| 主題Scheme | Other | |||||||
| 主題 | 8-puzzle | |||||||
| キーワード | ||||||||
| 主題Scheme | Other | |||||||
| 主題 | A-star algorithm | |||||||
| アドバイザー | ||||||||
| 石井, 和男 | ||||||||
| 学位授与番号 | ||||||||
| 学位授与番号 | 甲第436号 | |||||||
| 学位名 | ||||||||
| 学位名 | 博士（工学） | |||||||
| 学位授与年月日 | ||||||||
| 学位授与年月日 | 2022-03-25 | |||||||
| 学位授与機関 | ||||||||
| 学位授与機関識別子Scheme | kakenhi | |||||||
| 学位授与機関識別子 | 17104 | |||||||
| 学位授与機関名 | 九州工業大学 | |||||||
| 学位授与年度 | ||||||||
| 内容記述タイプ | Other | |||||||
| 内容記述 | 令和3年度 | |||||||
| 出版タイプ | ||||||||
| 出版タイプ | VoR | |||||||
| 出版タイプResource | http://purl.org/coar/version/c_970fb48d4fbd8a85 | |||||||
| アクセス権 | ||||||||
| アクセス権 | open access | |||||||
| アクセス権URI | http://purl.org/coar/access_right/c_abf2 | |||||||
| ID登録 | ||||||||
| ID登録 | 10.18997/00008919 | |||||||
| ID登録タイプ | JaLC | |||||||
