ダウンロード数: 589
このアイテムのファイル:
ファイル | 記述 | サイズ | フォーマット | |
---|---|---|---|---|
00207540701644177.pdf | 1.74 MB | Adobe PDF | 見る/開く |
タイトル: | Routing problem under the shared storage policy for unit-load automated storage and retrieval systems with separate input and output points |
著者: | Tanaka, Shunji ![]() ![]() Araki, Mituhiko |
著者名の別形: | 田中, 俊二 |
キーワード: | AS/RS Math programming Optimisation Scheduling Transportation |
発行日: | Jan-2009 |
出版者: | Taylor & Francis |
誌名: | International Journal of Production Research |
巻: | 47 |
号: | 9 |
開始ページ: | 2391 |
終了ページ: | 2408 |
抄録: | In this study the routing problem for unit-load automated storage and retrieval systems (AS/RSs) with separate input and output points is considered under the shared storage policy. The problem is to find an optimal travel route of a S/R (storage and retrieval) machine to process given storage and retrieval requests so that the total travel time is minimised, where the input and output points are possibly separate and the shared storage policy is assumed. We first give two types of formulations as 0-1 integer linear programming problems corresponding to two types of dwell point settings: the dwell point is the input point and the output point. Next, we propose a simple but efficient exact solution algorithm based on the formulations that utilises a general MILP (Mixed Integer Linear Programming) solver. Its efficiency is then demonstrated by numerical experiments. Instances with 400 items (200 for each storage and retrieval) are solved within 100s. |
著作権等: | c 2009 Taylor & Francis. 許諾条件により本文は2010-02-01に公開. この論文は出版社版でありません。引用の際には出版社版をご確認ご利用ください。 This is not the published version. Please cite only the published version. |
URI: | http://hdl.handle.net/2433/88084 |
DOI(出版社版): | 10.1080/00207540701644177 |
出現コレクション: | 学術雑誌掲載論文等 |
![](/dspace/image/articlelinker.gif)
このリポジトリに保管されているアイテムはすべて著作権により保護されています。