查詢結果分析
來源資料
頁籤選單縮合
題 名 | 物流中心物品儲位指派之研究=A Study of Item Assignment to Storage Locations in Distribution Centers |
---|---|
作 者 | 潘昭賢; 林國傑; | 書刊名 | 管理與系統 |
卷 期 | 6:2 1999.04[民88.04] |
頁 次 | 頁131-149 |
分類號 | 563.82 |
關鍵詞 | 物流中心; 儲位指派; 訂單體積指標; 模擬退火法; Distribution center; Location assignment; Cube-per-order index; Simulated annealing; |
語 文 | 中文(Chinese) |
中文摘要 | 儲位規劃與揀貨作業的良窳,影響物流中心的績效甚巨。一般在減少揀貨作業的時間、成本或行走路徑的前提下,不是從揀貨路徑的設計著手,就是從物品的儲位指派規劃下功夫。物品的儲位指派通常以其暢銷性為主要的依據;然而,除了個別物品的因素外,儲位指派亦需考慮同一訂單物品的相關性。本論文提出一個兩階段的演算法,求解物流中心儲位指派的問題。演算法的第一階段以訂單體積指標(Cube-Per-Order Index; CPOI or COI)為基礎,計算物品空間需求與暢銷性的關係,以建構物品的初始儲位指派。第二階段利用模擬退火法,加入物品間的相關性考量,修正第一階段所得的儲位指派,以減少訂單上物品總體的揀取距離。 |
英文摘要 | Order picking is one of the most costly activities among the operations in a distribution center. This paper proposes a two-phase heuristic method to improve the efficiency of picking operations through item-storage allocations. The proposed algorithm constructs an initial solution by Cube-Per- Order Index (CPOI, or COI), then applies Simulated Annealing approach to further reduce the picking distance by taking the joint demand of the items into consideration. Numerical experiments were conducted on an illustrative example to investigate the effects on paramenters of the algorithm. The rsults revealed that the storage assignment generated by the proposed algorithm significantly reduced the picking distance compared to that by the traditional CPOI index. |
本系統中英文摘要資訊取自各篇刊載內容。