(3.235.245.219) 您好!臺灣時間:2021/05/10 02:12
字體大小: 字級放大   字級縮小   預設字形  
回查詢結果

詳目顯示:::

: 
twitterline
研究生:游紹強
研究生(外文):Shau-Chiang Yu
論文名稱:物流業靜態車輛路線問題之研究
論文名稱(外文):Static Vehicle Routing Problem for Logistics
指導教授:吳炎崑吳炎崑引用關係
指導教授(外文):Yan-Kuen Wu
學位類別:碩士
校院名稱:萬能科技大學
系所名稱:經營管理研究所
學門:商業及管理學門
學類:企業管理學類
論文種類:學術論文
論文出版年:2008
畢業學年度:96
語文別:中文
論文頁數:54
中文關鍵詞:車輛途程問題最鄰近點插入法
外文關鍵詞:Vehicle routing problemthe nearest neighbor search method
相關次數:
  • 被引用被引用:2
  • 點閱點閱:458
  • 評分評分:系統版面圖檔系統版面圖檔系統版面圖檔系統版面圖檔系統版面圖檔
  • 下載下載:63
  • 收藏至我的研究室書目清單書目收藏:0
由於經濟全球化與市場全球化的發展,以及網際網路的發明及應用,許多的傳統商店也開始將商品放置於網路上讓人選購,然後將購買到的貨物從銷售者送至購買人的手上。目前已經有許多的電子商務網站與知名的物流公司合作,將商品直接到府服務,來滿足一般民眾對貨物寄送的需求。資訊技術的發達以及競爭市場的白熱化,在國內開始出現以物流運送業務等公司。車輛途程問題中,車輛本身的容量往往是配送貨物時的限制,本研究主要對於將運輸規劃在有運輸容量的限制條件下,收、送貨品不同性質的功能構建一個運輸管理系統,採用最鄰近點插入法為基礎,在各配送區域上的車輛路線規劃來進行討論,規劃各個配送區域裡的車輛路線規劃。
As economic globalization and the globalization of markets development, and the invention of the Internet and applications, many of the traditional stores have begun to place the goods for customer by the way of the Internet. The bought goods from sellers then directly sent to the purchaser. This customer’s expense pattern leads a lot of e-commerce websites cooperating with famous logistics company at present. They serve the goods directly to meet the general people demand by delivering the goods. Due to development of the information technology and fieriness of the competitive market, logistics companies begin to transport such expense pattern as the business in home.

The vehicle's capacity is often set a restriction in the vehicle routing problem. In this study , we would like to construct one administrative system of transportation to provide a transportation plan for the logistics manager under the limiting conditions of the transportation capacity and the function of accept or send goods. The nearest neighbor search method is employed to provide the road planning for various regional distributions of vehicles.
目  錄
中文摘要 i
英文摘要 ii
誌謝 iii
目錄 iv
圖目錄 vi
表目錄 vii
第一章 緒論 1
1.1 研究背景 1
1.2 研究動機與目的 2
1.3 傳統TSP問題特性 3
1.4 傳統VRP問題特性 3
1.5 研究流程 5
第二章 文獻探討 7
2.1 物流業相關現況 7
2.2 車輛路徑規劃 9
2.3 車輛途程問題與相關問題 10
2.3.1 規劃車輛途程問題 11
2.3.2 收送配貨及時窗限制問題 17
第三章 研究方法 19
3.1 問題描述 19
3.2 問題假設 19
3.3 車輛路線規劃及改善模組 20
3.3.1 路線內交換改善過程 21
3.3.2 路線間交換改善過程 22
第四章 驗證分析 23
4.1 路徑模式驗證 24
4.2 時窗性路徑模式驗證 34
第五章 結論與建議 46
參考文獻 48
1. 韓復華、王國琛,巨集啟發式解法在求解大規模旅行推銷員問題之應用,運輸學刊,第十四卷,第二期,pp. l-14.,民91年。
2. 蘇昭銘、張志鴻、莊子駿,應用GIS 分析宅配業車輛路線排程作業之研究,中華民國運輸學會第十六屆論文研討會,pp. 411-420 .,民90年。
3. 郭國基,林文彬,我國流通業通路變革之實證研究,1996 年國際商業物流管理研討會,pp. 564-581,民85年。
4. 易德華,軟時窗車輛巡迴問題之研究,國立中央大學土木工程研究所,民87年。
5. Anily, S., Bralllel, J., and Hertz, A., “A 5/3 - Approximation Algorithm for the Clustered Traveling Salesman Tour and Path Problems,” Operations Research Letters, Vol. 24, 1999, pp. 29-35.
6. Battiti, R., and Tecchiolli, G., “The Reactive Tabu Search,” ORSA Journal on Computing, Vol. 6, 1994, pp. 126-140.
7. Bodin, L., Golden, B., Assad, A., and Ball, M., “Routing and Scheduling of Vehicle and Crews: the State of the Art,” Special Issue of Computer & Operations Research, Vol. 10, No. 2, 1983, pp. 63-211.
8. Carlton, W.B., and Barnes, J.W., “Solving the Traveling Salesman Problem for the Vehicle Routing Problem with Time Windows,” Operations Research, Vol. 40, 1996, pp. 342-354.
9. Clark, G., and Wright, W., “Scheduling of Vehicles from A Central Depot to A Number of Delivery Points,” Operations Research, Vol. 12, 1964, pp. 569-581.
10. Dueck, G., and Scheuer, T., “Threshold Accepting - A General Purpose Optimization Algorithm Appearing Superior to Simulated Annealing,” Journal of Computational Physics, Vol. 90, 1990, pp. 161-175.
11. Fisher, M., and Jaikumar, R., “A Generalized Assignment Heuristic for Vehicle Routing,” Networks, Vol. 11, 1981, pp. 109-124.
12. Flood, M.M., “The Traveling Salesman Problem,” Operations Research Vol. 4, 1955, pp. 61-75.
13. Gendreau, M., Hertz, A., and Laporte, G., “The Traveling Salesman Problem with Backhauls,” Computers Operations Research, Vol. 23, No. 5, 1996, pp. 501-508.
14. Gillett, B., and Miller, L., “A Heuristic Algorithm for the Vehicle Dispatch Problem,” Operations Research, Vol. 22, 1974, pp. 340-349.
15. Glover, F., “Heuristics for Integer Programming Using Surrogate Constraints,” Decision Science, Vol. 8, 1977, pp. 156-166.
16. Gol’stejin, E.G., and Dempe, S., “A minimax resource allocation problem with variable resources,” European Journal of Operational Research, Vol. 136, 2002, pp. 46-56.
17. Held, M., and Karp, R., “The Traveling Salesman Problem and Minimum Spanning Trees Part II,” Mathematical Programming, Vol. 1, 1971, pp. 6-25.
18. Holland, J.H., “Genetic Algorithms and the Optimal Allocations of Trials,” SIAM Journal of Computing, Vol. 2, 1973, pp. 88-105.
19. Hu, T.L., and Sheu, J.B., “A fuzzy-based customer classification method for demand-responsive logistical distribution operations,” Fuzzy Sets and Systems, Vol. 139, 2003, pp. 431-450.
20. Jongens, K., and Volgenant, T., “The Symmetric Clustered Traveling Salesman Problem,” European Journal of Operational Research, Vol. 19, 1985, pp. 68-75.
21. Lin, S., and Kernighan, B., “An Effective Heuristic Algorithm for the Traveling Salesman Problem,” Operations Research, Vol. 21, 1973, pp. 498-516.
22. Martin, C., “Logistics and supply chain management,” Financial Times Prentice Hall 2nd edition, 1998.
23. Mole, R.H., and Jameson, S.R., “A Sequential Route-Building Algorithm Employing Generalized Saving Criterion,” Operation Research Quarterly, Vol. 27, 1976, pp. 503-527.
24. Mosheiov, G., “The Traveling Salesman Problem with Pick-up and Delivery,” European Journal of Operational Research, Vol. 79, 1994, pp. 299 - 310.
25. Or, I., “Traveling Salesman-Type Combinatorial Problems and their Relation to the Logistics of Blood Banking,” Ph.D. Thesis, Department of Industrial Engineering and Management Science, Northwestern University, Evanston, IL., USA., 1976.
26. Potvin, J.Y., Kervahut, T., Garcia, B.L., and Rousseau, J.M., “The Vehicle Routing Problem with Time Windows Part I: Tabu Search,” Informs Journal on Computing, Vol. 8, No. 2, 1996, pp.158-164.
27. Psaraftis, H.N., “Dynamic Vehicle Routing Problems,” in Golden, B.L. and A.A. Assad (eds), Vehicle Routing: Methods and Studies, Elsevier (North-Holland), Amsterdam, 1998.
28. Renaud, J., Boctor, F.F., and Ouenniche, J., “A Heuristic for the Pickup and Delivery Traveling Salesman Problem,” Computers Operations Research, Vol. 27, 2000, pp. 905 - 916.
29. Savelsbergh, M.W.P., and Sol, M., “The General Pickup and Delivery Problem,” Transportation Science, Vol. 29, No. l, 1995, pp. 17 - 29.
30. Solomon, M., and Desrosiers, J., “Time Windows Constrained Routing and Scheduling Problems,” Transportation Science, Vol. 22, No. 1, 1988, pp. 1-13.
31. Thomas, L.S., Luis, G.V., and Klaus, D., “The allocation of intangible resources:the analytic hierarchy process and linear programming,” Socio-Economic Planning Sciences , Vol. 37, 2003, pp. 169-184.
32. Warren, B.P., and Tassio, A.C., “Dynamic control of multicommodity fleet management problems,” European Journal of Operational Research, Vol. 98, 1997, pp. 522-541.

QRCODE
 
 
 
 
 
                                                                                                                                                                                                                                                                                                                                                                                                               
第一頁 上一頁 下一頁 最後一頁 top
系統版面圖檔 系統版面圖檔