(3.238.130.97) 您好!臺灣時間:2021/05/13 23:47
字體大小: 字級放大   字級縮小   預設字形  
回查詢結果

詳目顯示:::

我願授權國圖
: 
twitterline
研究生:劉俊宏
研究生(外文):Chun-Long Liu
論文名稱:雞蛋配送路徑之研究-以基隆某盤商為例
論文名稱(外文):A Study on Vehicle Routing Problem - A Case Study of Egg Wholesalers in Keelung
指導教授:朱經武朱經武引用關係
指導教授(外文):Ching-Wu Chu
學位類別:碩士
校院名稱:國立臺灣海洋大學
系所名稱:航運管理學系
學門:運輸服務學門
學類:運輸管理學類
論文種類:學術論文
論文出版年:2012
畢業學年度:100
語文別:中文
論文頁數:57
中文關鍵詞:整數規劃模式車輛途程問題雞蛋盤商
外文關鍵詞:Integer programming modelVehicle routing problemEgg wholesalers
相關次數:
  • 被引用被引用:1
  • 點閱點閱:221
  • 評分評分:系統版面圖檔系統版面圖檔系統版面圖檔系統版面圖檔系統版面圖檔
  • 下載下載:0
  • 收藏至我的研究室書目清單書目收藏:2
本研究主要探討車輛途程規劃於基隆某雞蛋盤商配送之應用。在傳統車輛途程問題中,係指在一個場站下,對數量眾多的客戶配送作業中,尋找總途程距離最短之路徑。然而,如何建構整數規劃模式,將其應用在雞蛋盤商的配送作業中,並在有限的時間內,將雞蛋送達與回收,是雞蛋盤商所需提供的服務品質。更重要的是不讓商家每天一大早就面臨缺貨情形,進而影響顧客消費購買的權益。因此,如何選擇最短之配送路線進而縮短整個配送時間,使後續的工作流程得以延續且更順利的進行下去,對雞蛋盤商的業務來說是很重要的一環。本研究的主要目的為建構整數規劃模式,將其求解結果與目前現況做比較,進而提出具體建議改變雞蛋配送路徑,以達縮短整體配送距離與時間成本之效。研究中經由整數規劃模式之建構後,再以實證分析與現況做比較,結果發現無論在配送距離與配送時間上均有所改善,整體之配送路徑總距離比現況之總距離減少1.07%;配送所花費的總平均時間比現況配送所花費的總平均時間少,於試行後更獲得工作人員的認同與讚賞。
This study focused on vehicle routing planning for an egg wholesalers in Keelung. For a typical vehicle routing problem, it means how to seek for the shortest path of the total routing distances with massive customers served from a depot. However, how to build an integer programming and apply it to delivering and retrieving eggs effectively within a limited time period is the mainly serving quality concern of an egg wholesalers. More importantly, a qualified service by the egg wholesalers should avoid being in short supply when the restaurants are opened every early morning and further avoid not influencing interests of customers. In this regard, with choosing the shortest delivery path and shortening the total delivery time, smoothly following the working procedures should be carefully considered in the daily affairs an egg wholesalers. This thesis mainly aims to construct an integer programming model. A comparison of this model with currently running status is first made and then, a concrete suggestion of improving the delivery path of eggs is proposed and embedded in the model to reach the effectiveness of shorting the total delivery distances. It is found that both delivery distance and time are effectively improved since the totally shortened distance can be decreased by 1.07%. Sound results are also identified and appreciated by employees of the egg wholesalers.
謝辭
摘要
Abstract
目錄
表目錄
圖目錄

第一章 緒論
1.1研究動機
1.2研究目的
1.3研究範圍與假設
1.4研究內容與流程

第二章 文獻探討
2.1車輛途程問題的基本概念
2.1.1車輛途程問題的基本假設
2.1.2各類型車輛途程問題
2.2車輛途程問題求解方法
2.3啟發式的解法
2.3.1傳統演算法
2.3.2萬用演算法
2.4最佳解的解法
2.5 小結

第三章 雞蛋產業與物流配送之現況分析
3.1 台灣雞蛋產業現況
3.2 台灣雞蛋中盤商物流配送之現況
3.3 雞蛋物流配送路線圖
3.4 顧客間距離矩陣之建構

第四章 模式建構與實證分析
4.1 模式建構
4.2 實證分析
4.2.1配送現況之路徑與距離
4.2.2模式建構下之配送路徑與距離
4.2.3現況與模式建構之比較

第五章 結論與建議
5.1 結論
5.2 建議

參考文獻

1.中華民國養雞協會(1991),「雞蛋強制換羽業界嚐到苦頭」,中華民國養雞協會會刊,第21期,頁21-23。
2.中華民國養雞協會(2011),「養雞產銷資訊」,蛋雞生產數量出雛數量蛋種歷年統計資料:95年-100年。
3.古世舜(1998),「蛋雞場自動化對雞蛋生產效率影響之計量分析」,國立中興大學農業經濟學研究所未出版論文,頁15-20。
4.行政院農業委員會(2011),「99年畜牧農情概況」,摘要分析,頁3-4。
5.行政院農業委員會(2011),「99年畜牧農情概況」,附表3:99年底各類畜禽飼養戶數及在養量-按縣市別分。
6.李育才(2000),「蛋雞如何生產更多的蛋」,飼料營養雜誌,第五期,頁35-67。
7.陳福祥(1992),「臺灣雞蛋市場失衡模式之計量分析」,國立中興大學農產運銷學系未出版碩士論文。
8.馮俊超(2000),「雞蛋收購短期奏效,後勢仍有壓力」,畜產報導月刊,第3期,頁15-17。
9.黃萬傳(1992),「未實施運銷協議對於現行雞蛋之運銷通路、市場結構與價格形成之綜合分析」,國立中興大學農產運銷系未出版論文。
10.黃萬傳(1994),「雞蛋運銷商經營效率之分析,雜糧與畜產」,第256期,頁11-33。
11.葉子力(2002),「改進雞蛋運銷制度-規劃雞蛋物流中心之構思」,畜產報導月刊,第23期,頁19-34。
12.蔡健雄(1989),「臺灣雞蛋產業風險和福利關聯之計量分析」,中興大學農業經濟研究所未出版論文。
13.Balas, E., (1971), “Intersection Cuts —A New Type of Cutting Plane for Integer Programming,” Operations Research, Vol. 19, pp. 19-39.
14.Bard, J.F., Huang, L., Dror, M., and Jaillet, P., (1998), “A Branch and Cut Algorithm for the VRP with Satellite Facilities,” IIE Transaction, Vol. 30, pp. 821- 834.
15.Bellman, R., (1962), “Dynamic Programming Treatment of the Traveling Salesman Problem,” Journal of the ACM, Vol. 1, pp. 61-63.
16.Bodin, L., Golden, B., Assad, A., and Ball, M. (1983), “ Routing and Scheduling of Vehicle and Crews: The State of the Art," Computers & Operations Research , Vol. 10, pp. 62-212.
17.Christofides, N., and Eilon, S., (1969), “An Algorithm for the Vehicle Dispatching Problems," Operational Research Quarterly, Vol. 20, pp. 309-318.
18.Christofides, N., (1981), “Exact Algorithms for the Vehicles Routing Problems, Based on Spanning Tree and Shortest Path Relaxations," Mathematical. Programming, Vol. 20, pp. 255-282.
19.Christofides, N., Mingozzi, A., and Toth, P., (1979), “The Vehicle Routing Problem," Combinatorial Optimization , Wiley, Chichester, pp. 315-338.
20.Clarke, G., and Wright, J., (1964), “Scheduling of Vehicles from a Central Depot to a Number of Delivery Points," Operations Research, Vol. 12, pp. 568-581.
21.Gaskell, T.J., (1967), “Basis for Vehicle Fleet Scheduling," Operational Research Quarterly, Vol. 18, pp. 281-295.
22.Gendreau, M., Hertz, A., and Laporte, G., (1992), "New Insertion and Post-Optimization Procedures for the Traveling Salesman Problem," Operations Research, Vol. 40, pp. 1086-1094.
23.Gillett, B., and Miller, L., (1974), “A Heuristic Algorithm for the Vehicle Dispatch Problem," Operations Research, Vol. 22, pp. 340-349.
24.Glover, F., (1977) “Heuristic for Integer Programming Using Surrogate constraints,"Decision Science, Vol. 8, pp. 156-166.
25.Golden, B., Assad, A., and Arjang, A., (1988), Vehicle Routing: Methods and Studies , North-Holland, pp. 7-45.
26.Held, M., and Karp, R., (1962), “A Dynamic Programming Approach to Sequencing Problem," SIAM Journal Applied mathematics, Vol. 10, pp. 196-210.
27.Renaud, J., Laporte, G., and Boctor, F., (1996), “A Tabu Search Heuristic for the Multi-Depot Vehicle Routing Problem," Computers & Operations research, Vol. 23, pp. 229-235
28.Kindervater, G.A.P., and Savelsbergh, M.W.P., (1997), “Vehicle Routing: Handling Edge Exchanges," In: Aarts, E.H., Lenstra, J.K., (Eds.), Local Search in Combinatorial Optimization. Wiley, Chichester, 1997.
29.Laporte, G., Nobert, Y., and Desrochers, M., (1985), “Optimal Routing Under Capacity and Distance Restriction," CACM, Vol. 33, pp. 1015-1073.
30.Laporte, G., Gendreau, M., Potvin, J.Y., and Semet, F., (2000), “Classical and Modern Heuristics for the Vehicle Routing Problem," International Transactions in Operational Research, Vol. 7, pp. 285-300.
31.Lin, S., (1965), “Computer Solution of the Traveling Salesman Problem," Bell System Technology Journal, Vol. 44, pp. 2245-2269.
32.Lin, S., and Kernighan, B., (1973), “An Effective Heuristic Algorithm for the Traveling Salesman Problem," Operational Research , Vol. 21, pp. 498-516.
33.Miller, C.E., (1960), “Integer Programming Formulation of Traveling Salemen Problems," Journal of Association for Computing Machinery, Vol. 7, pp. 326-329.
34.Lenstra, J.K., and Rinnooy Kan, A.H.G., (1981), “Complexity of Vehicle Routing and Schedule Programming,” Network, Vol. 11, No. 2, pp. 221-227.
35.Mole, R., and Jameson, S., (1976), “A Sequential Route-Building Algorithm Employing A Generalized Savings Criterion,"Operational Research Quarterly, Vol. 27, pp. 498-516.
36.Psaraftis, H.N., (1980), “A Dynamic Programming Solution to the Single Vehicle Many-to-many Immediate Request Dial-a-ride Problem," Transportation Science, Vol. 14, pp. 130-154.
37.Pureza, V.M., and Franca, P.M., 1991, Vehicle Routing Problems via Tabu Search Metaheuristics. Publication CRT-747. Centre de Recherche sur les Trasnports, Montréal.
38.Stewart, W., and Golden, B., 1979, “A Vehicle Routing Algorithm Based on Generalized Lagrane Mutipliers," Proceedings of the AIDS 1979 Annual Convention, Moore, L., Monore, K., Taylor B., Eds.
39.Tomek, W.G. and K.L. Robinson (1999), Agricultural Product Prices, 3rd ed., Cornell University Press.
40.Van Breedam, A., (2001), “Comparing Descent Heuristics and Metaheuristics for the Vehicle Routing Problem," Computers & Operations Research, Vol. 28, pp. 289-315.
41.Yellow, P., (1970), “A Computational Modification to the Savings Method of Vehicle Scheduling," Operational Research Quarterly, Vol. 21, pp. 281- 283.

連結至畢業學校之論文網頁點我開啟連結
註: 此連結為研究生畢業學校所提供,不一定有電子全文可供下載,若連結有誤,請點選上方之〝勘誤回報〞功能,我們會盡快修正,謝謝!
QRCODE
 
 
 
 
 
                                                                                                                                                                                                                                                                                                                                                                                                               
第一頁 上一頁 下一頁 最後一頁 top
系統版面圖檔 系統版面圖檔