中大機構典藏-NCU Institutional Repository-提供博碩士論文、考古題、期刊論文、研究計畫等下載:Item 987654321/91818
English  |  正體中文  |  简体中文  |  全文筆數/總筆數 : 80990/80990 (100%)
造訪人次 : 41685498      線上人數 : 2829
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
搜尋範圍 查詢小技巧:
  • 您可在西文檢索詞彙前後加上"雙引號",以獲取較精準的檢索結果
  • 若欲以作者姓名搜尋,建議至進階搜尋限定作者欄位,可獲得較完整資料
  • 進階搜尋


    請使用永久網址來引用或連結此文件: http://ir.lib.ncu.edu.tw/handle/987654321/91818


    題名: 分區式揀貨倉庫系統之訂單批次化問題研究
    作者: 呂柏嫻;Lu-Po-Hsien
    貢獻者: 工業管理研究所
    關鍵詞: 物流中心;分區式揀貨系統;訂單批次化;固定式揀貨路徑;Distribution Center;Zone Picking System;Order Batching;Order Batch Selection;Fixed Order Picking Route
    日期: 2023-07-14
    上傳時間: 2024-09-19 14:14:43 (UTC+8)
    出版者: 國立中央大學
    摘要: 近年來,因網路購物的迅速發展,促使消費模式改變,消費管道由實體店面轉移至電商平台,更因COVID-19(新冠肺炎)疫情的關係,網路零售業銷售額創新高,網購商家所主打的24小時快速到貨及免運費等促銷活動,使得配送量與日俱增,也考驗著物流中心的效率與產能。因此,如何在迅速滿足客戶的需求下,同時降低成本,儼然成為物流中心需面對的一大挑戰。
    物流中心的作業流程可歸類為以下九項:進貨、搬運、儲存、盤點、訂單、揀貨、補貨、出貨、輸配送,其中揀貨作業為最具客戶敏感度的一環,同時也是人力消耗以及作業量最大的一項工作。目前大多數的物流中心是屬於「勞力密集」的產業,揀貨作業占物流中心運營總成本的50到75%,為物流中心「成本最高的作業流程」,且揀貨作業時間約佔整個物流作業時間的30到40%。因此,優化揀貨流程成為物流中心的首要目標。
    以往,物流中心常見的揀貨方式為「個別揀取」,即一位揀貨員一次揀取一張訂單,此方法的優點為簡單明瞭,缺點是效率較低。對此,常見的解決方式為「批次揀取」,意即將相似訂單做合併處理,一個揀貨員同時對多張相似訂單進行揀貨,減少所需揀貨時間與行走距離。由此可知,訂單批次化方法的優劣對揀貨效率有關鍵的影響,若能找到適合的訂單批次化方法能對揀貨效率有顯著的提升。
    然而,過往的訂單批次化文獻,鮮少探討物流業常見的「分區式揀貨系統」。此揀貨系統的優點為揀貨行走路線流暢,相對的動線較為複雜,因此搭配優良的揀貨策略顯得格外重要。基於上述原因,本研究將針對分區式揀貨系統中的批次化問題進行研究,並搭配揀貨路徑方法,期望透過完整的模擬實驗與績效分析,找出最適合的訂單批次化方法,並能對此類問題有更深入的了解,亦對未來類似的研究能有所貢獻。
    ;In recent years, due to the rapid development of online shopping, consumption patterns have changed, and consumption channels have shifted from physical stores to e-commerce platforms. Due to COVID-19, online retail sales have reached a new high point. Online shopping merchants focus on 24-hour fast arrival free shipping and free shipping make the distribution volume increase day by day, and also test the efficiency and production capacity of the distribution center. Therefore, how to meet the needs of customers while reducing costs has become a major challenge for distribution centers.
    In the operation of the distribution center, the picking operation is the most customer-sensitive part, and it is also the work that consumes the most manpower and the largest amount of operation. At present, most distribution centers are "labor-intensive" industries. Picking operations account for 50 to 75% of the total distribution center operating costs, and the picking operation time accounts for about 30 to 40% of the entire distribution operation time. Therefore, optimizing the picking process becomes the primary goal of the distribution center.
    The common picking method in the distribution center is "individual picking". The advantage of this method is that it is simple and clear, but the disadvantage is that it is less efficient. The solution to this is "batch picking", which means combining similar orders to reduce the required picking time and travel distance. It can be seen that the quality of the order batching method has a key impact on the picking efficiency. If a suitable order batching method can be found, the picking efficiency can be significantly improved.
    In the past literature, there is little discussion on the common "partition picking system" in the distribution industry. The advantage of this picking system is that the picking route is smooth, but the relative moving line is relatively complicated. Therefore, this research will study the batching problem in the partition picking system, and with the picking path method, it is hoped that through a complete Simulation experiments and performance analysis can find out the most suitable order batching method, and can have a deeper understanding of such problems, and can also contribute to similar research in the future.
    顯示於類別:[工業管理研究所 ] 博碩士論文

    文件中的檔案:

    檔案 描述 大小格式瀏覽次數
    index.html0KbHTML21檢視/開啟


    在NCUIR中所有的資料項目都受到原著作權保護.

    社群 sharing

    ::: Copyright National Central University. | 國立中央大學圖書館版權所有 | 收藏本站 | 設為首頁 | 最佳瀏覽畫面: 1024*768 | 建站日期:8-24-2009 :::
    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - 隱私權政策聲明