ダウンロード数: 171
このアイテムのファイル:
ファイル | 記述 | サイズ | フォーマット | |
---|---|---|---|---|
j.cor.2018.02.019.pdf | 495.41 kB | Adobe PDF | 見る/開く |
タイトル: | An exact algorithm for the unrestricted block relocation problem |
著者: | Tanaka, Shunji https://orcid.org/0000-0002-0181-743X (unconfirmed) Mizuno, Fumitaka |
著者名の別形: | 田中, 俊二 水野, 史崇 |
キーワード: | Block relocation problem Container relocation problem Exact algorithm Dominance properties Lower bound |
発行日: | Jul-2018 |
出版者: | Elsevier Ltd |
誌名: | Computers & Operations Research |
巻: | 95 |
開始ページ: | 12 |
終了ページ: | 31 |
抄録: | The purpose of this study is to propose an exact algorithm for the unrestricted block relocation problem with distinct priorities. In this problem, a storage area is considered where blocks of the same size are stacked vertically in tiers. Because we can access only topmost blocks, relocations of blocks are required when other blocks are retrieved. The objective is to minimize the total number of such relocations necessary for retrieving all the blocks one by one according to a specified order. In the restricted version of this problem, only the topmost block above the target block is relocatable. On the other hand, no such restriction is imposed on the unrestricted problem, which is considered in this study. We also assume that each block is assigned a distinct retrieval priority and the retrieval order of blocks is unique. To improve the efficiency of a branch-and-bound algorithm for this problem, we propose several dominance properties to eliminate unnecessary nodes in the search tree. Furthermore, we propose a new lower bound of the total number of relocations. The effectiveness of the proposed exact algorithm is verified by numerical experiments for benchmark instances in the literature. |
著作権等: | © <2018>. This manuscript version is made available under the CC-BY-NC-ND 4.0 license http://creativecommons.org/licenses/by-nc-nd/4.0/. The full-text file will be made open to the public on 01 July 2021 in accordance with publisher's 'Terms and Conditions for Self-Archiving'. この論文は出版社版でありません。引用の際には出版社版をご確認ご利用ください。 This is not the published version. Please cite only the published version. |
URI: | http://hdl.handle.net/2433/236096 |
DOI(出版社版): | 10.1016/j.cor.2018.02.019 |
出現コレクション: | 学術雑誌掲載論文等 |
このリポジトリに保管されているアイテムはすべて著作権により保護されています。