博碩士論文 88426022 詳細資訊




以作者查詢圖書館館藏 以作者查詢臺灣博碩士 以作者查詢全國書目 勘誤回報 、線上人數:53 、訪客IP:3.15.240.236
姓名 羅國書(Guo-Shu Lo )  查詢紙本館藏   畢業系所 工業管理研究所
論文名稱 電子零售商的最佳化貨品揀取
(Optimizing Order Picking in an e-Tailer Company)
相關論文
★ 佈置變更專案工程的執行研究 -以H公司研發單位為例★ MIL-STD-1916、MIL-STD-105E與結合製程能力指標之抽樣檢驗計畫
★ 建構客戶導向的製造品質資訊系統--以某筆記型電腦專業代工廠商為例★ GMP藥廠設施佈置規劃的探討--以E公司為研究對象
★ 應用Fuzzy c-Means演算法之物流中心位址決策模式研究★ 品質資訊系統之規劃與建構 -- 以某光碟製造公司為研究對象
★ 從製程特性的觀點探討生產過程中SPC管制圖監控運用的適切性 -- 以Wafer Level 封裝公司為例★ 六標準差之應用個案研究-以光學薄膜包裝流程改善為例
★ 利用六標準差管理提昇中小企業之製程品質-以錦絲線添加防銹蠟改善為例★ 專業半導體測試廠MES 系統導入狀況、成果及問題之探討-以A 公司為例
★ 以RFID技術為基礎進行安全管理導入-以A公司為例★ 如何提昇產品品質及降低成本—以光碟壓片廠A公司為例
★ ERP導入專案個案分析—以半導體封裝廠A公司為例★ 石英元件製造業之延遲策略應用— 以T公司為研究對象
★ 十二吋晶圓廠自動化搬運系統規劃與導入—以A公司為例★ 半導體封裝產業之生產革新改善活動-A半導體股份有限公司導入經驗探討-
檔案 [Endnote RIS 格式]    [Bibtex 格式]    [相關文章]   [文章引用]   [完整記錄]   [館藏目錄]   [檢視]  [下載]
  1. 本電子論文使用權限為同意立即開放。
  2. 已達開放權限電子全文僅授權使用者為學術研究之目的,進行個人非營利性質之檢索、閱讀、列印。
  3. 請遵守中華民國著作權法之相關規定,切勿任意重製、散佈、改作、轉貼、播送,以免觸法。

摘要(中) 本研究將在不同的揀貨區域設計、與不同的「顧客選取貨品送達時間的選擇」模式之下,就如HomeGrocer.com或Webvan.com等電子零售商的貨品揀取與處理問題,加以探討並設計其有效的解決方法。HomeGrocer.com或Webvan.com皆是所謂「網路上的超級市場」,由於販賣的東西與經營模式的不同,他們的貨品揀取及處理問題,也有別於傳統物流中心或其他不同性質的電子零售商(如:Amazone.com)。近年來,由於網路科技的進步,個人電腦的普及,與上網的方便性等因素,成就了今日電子商務的發達。至今,已有許多公司加入電子商務的行列,他們均希望藉著電子商務來提昇其競爭力。在這一波電子商務革命中,首先興起的是如Amazon.com與eToy.com等B2C電子零售商。比起傳統有實體店面的零售商,這些無實體商店的電子零售商,雖然可以節省許多與實體店面經營有關的成本,但卻有其獨特的經營管理問題。例如:網頁的維護與更新、貨品揀取與包裝作業、貨品運送、與相關的後勤管理等問題。雖然最近網路電子商店的流行似乎有退燒的現象,甚至有些網路公司因經營不善而倒閉,但吾人相信這是個去蕪存菁的階段,具有創新力、競爭力、與成本效率的公司,將會繼續生存與成長。根據過去的研究=V指出,電子零售商有很大部份的成本是起源於貨品的揀取與處理操作;因此,提昇其貨品揀取與處理操作的效率,是電子零售商提昇其競爭力與降低成本的有效方法之一。另一方面,不同性質的電子零售商,由於所販售的商品項目或經營模式的不同,其貨品揀取與處理問題也會有所差異。例如:Amazon.com與HomeGrocer.com所面對的貨品揀取與處理問題將不完全相同,這是因為HomeGrocer.Com販賣的東西包括生鮮食品,所以在揀貨時、以及揀貨後的包裝運送過程,都需特別注意食品新鮮度,這個考量將影響其貨品揀取與處理的方法。
摘要(英) In this research, we are going to investigate the order picking and processing problems of an e-tailer company like HomeGrocer.com or Webvan.com under different order-picking area designs and different delivery-time slot selection modes. Different order picking and processing methods will be proposed. In recent years, due to the development of internet and computer technologies, a new way of doing business over internet has emerged. And, this also leads to the birth of E-Commerce. The first batch of internet companies includes those B2C e-tailers like Amazon.com and eToy.com. Unlike traditional retailers like Wal-Mart or K-Mark, e-tailers do not have physical retailer stores. As a result, e-tailers save a lot of money that has to do with the operations of physical stores. Despite of this advantage, e-tailers have their own unique problems. For example, an e-tailer has to maintain its web page and make sure the information on the web page is updated accurately. In addition, an e-tailer has to pick the merchant items in every order and ship them to customers. Many companies have joined the rank of e-commerce companies over the past few years. They might have done so for different reasons. But, one can all be sure that they expect to boost their competitive advantage through e-commerce. Recently, it seems that the enthusiasm for e-commerce has subsided because of the closure of many internet companies. Some people begin to doubt whether conducting business is really the way of the future. However, we believe these unsuccessful stories is part of the selection process in which the best, strongest, and the most competitive companies will survive and continue to grow. For e-tailers, there are many ways that they can do to increase their competitiveness. One of them is to cut down their operation costs. Researchers have showed that a large percentage of cost of an e-tailer is due to the order picking, processing, and shopping operations. Furthermore, many factors can cause the ordering picking and processing problem of an e-tailer to be different from that of another e-tailer. For example, HomeGrocer.com offers fresh meat and produce to its customers, but not Amazone.com. It is obvious that HomeGrocer.com has to ensure that the freshness of its products will not be sacrificed in its order picking, but not Amazone.com.
關鍵字(中) ★ 後勤管理
★  物流倉儲揀貨作業
★  物流管理
★  系統模擬
★  訂單選取法則
★  貨品揀取與處理
★  電子商務
★  電子零售商
關鍵字(英) ★ B2C
★  e-commerce
★  e-Tailer
★  Logistics Management
★  Order Picking Process
★  Order Selection Policy/Rules
★  Simulation
★  Warehouse
論文目次 摘 要.......................................................I
目 錄.......................................................III
圖 目 錄....................................................VI
表 目 錄....................................................VIII
第一章 緒 論..............................................1
1.1 研究背景.................................................1
1.2 HomeGrocer與Webvan.com簡介...............................3
1.2.1 HomeGrocer.com 簡介....................................3
1.2.2 Webvan.com 簡介........................................5
1.2.3 HomeGrocer.com與Webvan.com的顧客訂貨流程與貨品揀取與處理流程...........................................................6
1.2.4 本研究問題環境的特色...................................8
1.3 研究動機.................................................9
1.4 論文架構與流程...........................................11
第二章 文 獻 探 討...........................................12
2.1 訂單揀貨問題(Order-Picking Problems)...................13
2.1.1 自動存取機(Man-on-Board S/R Machine)揀貨方式的揀貨...13
2.1.2 揀貨員(Order Picker)揀貨方式的揀貨問題................14
2.1.3 無人搬運車(AGV)的途程規劃問題........................16
2.1.4 銷售員旅行問題(Traveling salesman problems; TSP).......17
2.2 訂單批次化問題(Order Batching)...........................18
2.3 AS/R系統的存取貨問題.....................................22
第三章 研 究 方 法...........................................26
3.1 揀貨區域設計.............................................26
3.2 方法架構與流程...........................................26
3.3 訂單選取法則.............................................29
3.3.1 種子訂單選取...........................................29
3.3.2 選取配合訂單...........................................30
3.3.3 切割種子訂單與配合訂單.................................31
3.4 揀取路線規劃.............................................32
3.4.1 啟發式演算法...........................................33
3.4.1.1 啟發式演算法流程.....................................34
3.4.1.2 釋例說明.............................................34
3.4.2 模擬退火法.............................................38
第四章 實驗分析..............................................40
4.1 模擬實驗設計.............................................40
4.1.1 倉儲環境設計...........................................40
4.1.2 品項單位容積之考量.....................................41
4.1.3 訂單池初始訂單總數.....................................42
4.1.4 揀取車輛負載量.........................................42
4.2 訂單選取方式.............................................42
4.3 環境假設與限制條件.......................................43
4.4 績效評估準則.............................................44
4.4.1 完成訂單的總時間、總距離...............................44
4.4.2 總揀取次數.............................................44
4.4.3 實驗因子組合...........................................44
4.5 模擬結果分析.............................................46
4.5.1 模擬結果...............................................46
4.5.1.1 400筆初始訂單的結果分析..............................46
4.5.1.2 800筆初始訂單的結果分析..............................55
4.5.1.3 1200筆初始訂單的結果分析.............................63
4.6 實驗結論.................................................71
第五章 結論與建議............................................72
5.1 研究結論.................................................72
5.1 後續研究建議.............................................73
參考文獻.....................................................74
附錄A、系統畫面介紹..........................................79
附錄C、實驗數據資料..........................................86
參考文獻 Armstrong, R. D., Cook, W. D., and Saipe, A. L., 1979, “Optimal batching in a semi-automated order picking system,” Journal of the operational research society, vol. 30, no. 8, pp. 711-720.
Barrett, B. G., 1977, “A further digression on the over-automated warehouse: some evidence,” Interfaces, vol. 8, no.1, pp. 46-49.
Bartholdi, J. J. and Platzman, L. K., 1986, “Retrieval strategies for a carousel conveyor,” IIE Transactions, vol. 18, no. 2, pp. 166-173.
Bartholdi, J. J. and Platzman, L. K., 1989, “Decentralized control of automated guided vehicles on a simple loop,” IIE Transactions, vol. 21, no. 1, pp.76-81.
Berg, J. P., 1999, “A literature survey on planning and control of warehousing systems,” IIE Transactions, vol. 31, no. 8, pp. 751-762.
Bozer, Y. A. and White, J. A., 1984, “Travel-time models for automated storage/retrieval systems,” IIE Transactions, vol. 16, no.4, pp. 329-338.
Bozer, Y. A., 1986, “Optimizing throughput performance in designing order picking systems,” Ph.D. Dissertation, Georgia Institute of Technology, Atlanta, G.A.
Bramel, J., and Simchi-Levi, D., 1997, “The logic of logistics: theory, algorithms, and applications for logistics management,” Springer-Verlag, New York.
Chang, D. T., Wen, U. P., and Lin, J. T., 1993, “Picking strategies to the two-carousel-single-server system in an automated warehouse,” Journal of the Chinese Institute of Engineers, vol. 16, no. 6, pp. 817-824.
Cormier, G., 1992, “A review of warehouse models,” European Journal of Operational Research, vol. 58, no.1, pp. 3-13.
Crowder, H., and Padberg, M.W., 1980, “Solving large-scale symmetric traveling salesman problems to optimality,” Management Science, vol. 26, no. 5, pp. 495-509.
Dantzig, G., Fulkerson, R., and Johnson, S., 1954, “Solution of large scale TSP,” Operations Research, vol. 2, no. 4, pp. 393-410.
Danuels, R. L., Rummel, J. L., and Schantz, R., 1998, “A model for warehouse order picking,” European Journal of Operational Research, vol. 105, no.1, pp. 1-17.
Elsayed, E. A., 1981, “Algorithm for optimal material handling in automatic warehousing systems,” International Journal of Production Research, vol. 19, no. 5, pp. 525-535.
Elasyed, E. A., and Unal, O. I., 1989, “Order batching algorithms and travel-time estimation for automated storage/retrieval systems,” International Journal of Production Research,” vol. 27, no.7, pp. 1097-1114.
Elasyed, E. A. and Lee, M. K., 1996, “Order processing in automated storage/retrieval systems with due dates,” IIE Transactions, vol. 28, no. 7, pp. 567-577.
Elasyed, E. A., Lee, M.-K., and Scherer, E., 1993, “Sequencing and batching procedures for minimizing earliness and tardiness penalty of order retrievals,” International Journal of Production Research, vol. 31, no. 3, pp. 727-738.
Elsayed, E. A. and Stern, R. G., 1983, “Computer algorithms for order processing in automated warehousing systems,” International Journal of Production Research, vol. 21, no. 4, pp. 579-586.
Gibson, D. R. and Sharp, G. P., 1992, “Order batching procedures,” European Journal of Operational Research, vol. 58, no.1, pp. 57-67.
Goetschalckx, M. and Ratliff, H. D., 1988a, “Order picking in an aisle,” IIE Transactions, vol. 20, no.1, pp. 53-62.
Goetschalckx, M. and Ratliff, H. D., 1988b, “An efficient algorithm to cluster order picking items in a wide aisle,” Engineering Costs and Production Economics, vol.13, no. 1, 263-271.
Graves, S. C., Hausman, W. H., and Schwarz, L. B., 1977, “Storage-retrieval interleaving in automatic warehousing systems,” Management Science, vol. 23, no. 9, pp. 935-945.
Hall, R. W., 1993, “Distance approximations for routing manual pickers in a warehouse,” IIE Transactions. vol. 25, no. 4, pp. 76-87.
Han, M. H., McGinnis, l. F., Shien, J. S., White, J. A., 1987, “On sequencing retrievals in automated storage/retrieval system,” IIE Transactions, vol. 19, No. 1, pp. 56-66.
Han, M. H., McGinnis, White, J. A., 1988, “Analysis of rotary rack operation,” Material Flow, vol. 4, no. 1, pp. 283-293.
Hausman, W. H., Schwarz, L. B., and Graves, S. C., 1976, “Optimal storage assignment in automatic warehousing systems,” Management Science, vol. 22, no. 6, pp. 629-638.
Held, M. and Kary, R. M., 1992, “A dynamic programming approach to sequencing problem,” SIAM, vol. 10, no. 3, pp. 254-273.
Hodgson, T. J., King, R. E., Monteith, S. K., and Schultz, S. R., 1987, “Developing control rules for an AGVS using markov decision processes,” Material Flow, vol. 4, no. 1, pp.85-96.
Hwang, H., Bake, W., and Lee, M. K., 1988, “Clustering algorithms for order picking in an automated storage and retrieval systems,” International Journal of Production Research, vol. 26, no. 2, pp. 189-201.
Hwang, H. and Lee, M. K., 1988, “Order batching algorithms for a man-on-board automated storage and retrieval system,” Engineering Costs and Production Economics, vol. 13, no. 1, pp. 285-294.
Hwang, H. and Song, J. Y., 1993, “Sequencing picking operations and travel time models for man-on-board storage retrieval system,” International Journal of Production Economics, vol. 29, no. 1, pp. 75-88.
Kirkpatrick, S., 1984, “Optimization by simulated annealing: quantitative studies,” Journal of Statistical Physics, vol. 34, no. 5, pp. 975-986.
Koster, R. D. and Poort, E. V. D., 1998, “Routing orderpickers in a warehouse: a comparison between optimal and heuristic solutions,” IIE Transactions, vol. 30, no.5, pp.469-480.
Lawler, E. L., Lenstra, J.K., Kan, A. H. G. R., and Shmoys D.B. (1985) “The traveling salesman problem: a guided tour of combinatorial optimization,” John Wiley and Sons, New York, 1996.
Lee, H. F. and Schaefer, S. K., 1996, “Retrieval sequencing for unit-load automated storage and retrieval systems with multiple openings,” International Journal of Production Research, vol. 34, no. 10, pp. 2943-2962.
Lee, H. F., and Schaefer, S. K., 1997, “Sequencing methods for automated storage and retrieval systems with dedicated storage,” Computer and Industrial Engineering, vol. 32, no. 2, pp. 351-362.
Lee, J., Tangjarukij, M., and Zhu, Z., 1996, “Load selection of automated guided vehicles in flexible manufacturing systems,” International Journal of Production Research, vol.34, no. 12, pp.3388-3400.
Lee, M. -K., and Kim, S. -Y., 1995, ”Scheduling of storage/retrieval orders under a just-in-time environment,” International Journal of Production Research, vol. 33, no. 12, pp. 3331-3348.
Lin, C. H., and Lu, I. Y., 1999, “The procedure of determining the order picking strategies in distribution center,” International Journal of Production Economics, vol.60, no. 1, 301-307.
Little, J. D. C., Murty, K. G., Sweeney, D. W., and Karel, C., 1963, “An algorithm for the traveling salesman problem,” Operations Research, vol. 11, no. 5, pp.927-989.
Miller, C.E., Tucker, A. W., and Zemlin, R. A., 1960, “Integer programming formulation of traveling salesman problem,” Journal of Association for computing machinery, vol. 7, no. 4, 326-329.
Murty, K. G., 1968, “An algorithm for ranking all the assignments in order of increasing cost,” Operations Research, vol. 16, no. 3, pp. 682-687.
O’Briant, E., 2000, “Webvan revs up,” IIE Solutions, vol. 32, no. 9, pp. 26-33.
Padberg, M. and Rinaldi, G., 1987, “Optimization of a 532-city symmetric traveling salesman problem by branch and cut,” Operations Research Letters, vol. 6, no. 1, pp. 1-7.
Pan, C. H. and Liu, S. Y., 1995, “A comparative study of order batching algorithms,” Omega, vol. 23, no. 6, pp. 691-700.
Petersen, C. G., 1997, “An evaluation of order picking routeing policies,” International Journal of Operations & Production Management, vol. 17, no. 11, pp. 1098-1111.
Ratliff, H. D., and Rosenthal, A. S., 1983, “Order-picking in a rectangular warehouse: a solvable case of the traveling salesman problem,” Operations Research, vol. 31, no. 3, pp. 507-521.
Rosenkrantz, D. J., Stearns, R. E., and Lewis II, P. M. (1977), “An analysis of several heuristics for the traveling salesman problem,” SIAM, Vol. 6, pp. 563-581.
Rosenwein, M. B., 1996, “A comparison of heuristics for the problem of batching orders for warehouse selection,” International Journal of Production Research, vol. 34, no. 6, pp. 657-664.
Rouwenhorst, B., Reuter, B., Stockrahm, V., Houtum, G. J., Mantel, R. J., and Zijm, W. H. M., 2000, “Warehouse design and control: Framework and literature review,” European Journal of Operational Research, vol. 122, no. 3, pp. 515-533.
Sarker, B. R., and Babu, P. S., 1995, “Travel time models in automated storage/retrieval systems: a critical review,” International Journal of Production Economics, vol. 40, no. 1, pp. 173-184.
Taghaboni, F., and Tanchoco, J. M. A., 1988, “A LISP-based controller for free-ranging automated guided vehicle system,” International Journal of Production Research, vol. 26, no. 2, pp.173-188.
Taghaboni, F., and Tanchoco, J. M. A., 1995, “Comparison of dynamic routeing techniques for automated guided vehicle system,” International Journal of Production Research, vol. 33, no. 10, pp. 2653-2669.
Tang, L. C., and Chew, E. P., 1997, “Order picking systems: batching and storage assignment strategies,” Computers and Industrial Engineering, vol. 33, no. 3, pp. 817-820.
Witt, C. E., 1987, “Auto parts supplier uses consolidation to save distribution dilemma,” Material Handling Engineering, vol. 42, no. 11, pp. 83-88.
物流中心揀貨作業,1995年9月,經濟部商業自動化系列叢書,台北:經濟部商業司。
黃峰蕙、施勵行、林秉山 著,1997年3月,生產與作業管理,台北:三民書局。
董福慶、陳明德 著,1995年,物流中心揀貨作業,機械工業雜誌。
吳俊榮,1998年,啟發式訂單批次揀取方法之研究發展與績效評估,國立中正大學企業管理研究所碩士學位論文。
指導教授 何應欽(Ying-Chin Ho) 審核日期 2001-7-12
推文 facebook   plurk   twitter   funp   google   live   udn   HD   myshare   reddit   netvibes   friend   youpush   delicious   baidu   
網路書籤 Google bookmarks   del.icio.us   hemidemi   myshare   

若有論文相關問題,請聯絡國立中央大學圖書館推廣服務組 TEL:(03)422-7151轉57407,或E-mail聯絡  - 隱私權政策聲明