禁忌搜尋法應用於車輛路線問題之研究 陳勝男、林燦煌
E-mail: [email protected]
摘 要
配送活動在物流行業中扮演著一個重要的角色，同時如何將配送作業 電腦化在商業自動化中為相當重要的一環，然而 配送作業的重點在於如何 有效的使用車輛以及決定其最經濟的行駛路線。由於目前能源日漸短缺， 因此如何降低車輛行 駛所耗費的能源日益重要；同時，路線愈經濟則愈可 節省車輛路線所造成的營運成本。 本研究針對台灣馬路普遍狹小 的特 徵，探討需求點可接受的車種有噸位大小限制之車輛路線問題，本研究使 用兩階段法進行求解，第一階段利用空間 填滿曲線產生一個起始解，第二 階段以禁忌搜尋法為主幹，結合插入法及路線間節點交換法作為改善法。 以本研究 的方法求解文獻上的10個單車種問題，可得到4個現有的最 佳解；但是需求需求點增多時（大於100個需求點），解的品質 會下降。 同時，我們產生三個雙車種且需求點可接受之車輛有噸位大小限制之例題 進行測試，其中有兩個解的品質和我 們預估的相同，而需求點最多的那個 例題（需求點個數94）的路線距離比上限值還小。最後我們探討各車種之 車輛數變 化時對路線總距離的影響，結果發現使用越多容量較小的車輛時 ，路線距離會增加。
關鍵詞 : 車輛路線問題 ; 禁忌搜尋法 ; 空間填滿曲線
目錄
目錄 中文摘要...iii 英文摘要...iv 誌謝...v 目 錄...vi 圖目錄...ix 表目錄...x 第一章 緒 論...1 1.1 研究背景與機...1 1.2 研究目的...3 1.3 研究範 圍與問題定義...4 1.3.1 研究範圍...4 1.3.2 問題定義與描述...4 1.3.3 數學模式...5 1.4 研究架構...8 第二章 文獻探討...10 2.1 典 型車輛路線問題...10 2.1.1 典型車輛路線問題數學模式...11 2.1.2 車輛路線問題之求解方 法...12 2.1.2.1 掃描法(Sweep Procedure)...15 2.1.2.2 節省法...16 2.1.2.3 交換 法(2-opt/3-opt & k-opt)...18 2.1.2.4 一般化指派問題啟發式解法...20 2.2 空間填滿曲
線...23 2.3禁忌搜尋法(Tabu Search)...27 2.3.1 禁忌搜尋法之基本模組...27 2.3.2 禁忌搜尋法之運作流程...28 2.4 禁忌搜尋法於典型車輛路線問題之應用...29 第三章 車輛路線問題 之禁忌搜尋法...31 3.1 路線建構階段...32 3.2 路線改善階段...34 3.2.1 移 步之決定...34 3.2.2 移步值之評估...36 3.2.3 禁忌名單之設計...38 3.2.4 免禁準則(Aspiration Level)...40 3.2.5 候選名單之設計...40 3.2.6 搜尋停止準
則...42 3.2.7 禁忌搜尋法之作業流程...42 第四章 結果分析...45 4.1 參數 分析與設定...48 4.1.1 參數分析...48 4.1.2 關於參數設定...54 4.2 結 果分析與比較...54 4.2.1 單一車種的結果...54 4.2.1.1 各種車輛路線問題之禁忌搜尋法之 比較...55 4.2.2 禁忌搜尋法vs 模擬退火法...57 4.3 需求點有車種大小限制之車輛路線問題...59 4.3.1 雙 車種之例題...59 4.3.2 車隊大小對距離之影響...59 第五章 結論與建
議...64 5.1 結論...64 5.2 建議...66 參考文 獻...69 附錄一 GSFH演算法...75 附錄二 多車種測試例
題...76 附錄三 各例題參數分析之ANOVA表...80 附錄四 各例題之最佳結 果...83
參考文獻
1.邱佩諄，"快地運務元動態調派之模擬分析"國立交通大學，土研所運工管組碩士論文，民國八十一年六月 2.陳正元，"節省法與路線間 交換改善法在車輛路線問題(VRP)上之研究"，國立交通大學，交通運輸研究所碩士論文，民國八十年六月 3.張祖明，"多車種車輛路線 問題啟發式解法之研究"，國立交通大學，土研所運工管組碩士論文，民國八十三年六月 4.Alfa, A.S.,S.S.Heragu, and M.Chen, "A 3-opt based simulated annealing algorithm for vehicle routing problems", Computers & Industrial Engineering, 21,635-639,1991 5. Bartholdi, J. J., and L. K. Platzman, "Heuristic based on spacefilling curves for combinatorial problems in Euclidean space", Management Science, 34, 291-305, 1988 6. Bodin, L., and B. Golden, "Classification in vehicle routing and scheduling", Networks, 11, 97-108, 1981 7. Bodin, L., B. Golden, A. Assad, and
M. Ball, "Routing and scheduling of vehicles and crews: the state of the art", Computers & Operations Research 10, 63-211, 1983 8. Bowerman, R.L., P.H. Calamai, and G.B. Hall, "The spacefilling curve with optimal partitioning heuristic for the vehicle routing problem", European Journal of Operational Research 76 (1994) 128-142. 9. Christofides, N., and S. Eilon, "An algorithm for the vehicle dispatching problems", Operational Research Quarterly, 20, 309-318, 1969 10. Christofides, N., A. Mingozzi, P. Toth, and C. Sandi, Combinatorial Optimization, John Wiley & Sons, 318-338, 1979 11. Christofides, N., A. Mingozzi, and P. Toth, "Exact algorithms for the vehicle routing problem based spanning tree and shortest path relaxations", Mathematics Programming, 20, 255-282, 1980 12. Christofides, N., A. Mingozzi, and P. Toth, "State-space relaxation
procedures for the computation of bounds to routing problems", Networks, 11, 145-164, 1981 13. Clarke, G. and J. Wright "Scheduling of vehicles from a central depot to a number of delivery points", Operations Research, 12, 568-581, 1964 14. Dantzig, G. and J. H. Ramser, "The truck dispatching problem", Management Science, 6, 80-91, 1959 15. Daskin, M.S., "Logistics: An overview of the state of the art and perspectives on future research", Transportation Research, 19, 383-398, 1985 16. Fisher, M. L., and R. Jaikumar, "A generalized assignment heuristic for vehicle routing problems", Networks, 11, 109-124, 1981 17. Fisher, M.L., "Optimal solution of vehicle routing problems using minimum k-trees", Operations Research, 42, 626-642, 1994 18. Frizzell, P.W., and J.W. Giffin, "The split delivery vehicle scheduling problem with time windows and grid network distances", Computers & Operations Research, 22, 655-667, 1995 19. Garcia, B.L., J.Y. Potvin, and J.M. Rousseau, "A parallel implementation of the tabu search heuristic for vehicle routing problems with time window constraints", Computers & Operations Research, 21, 1025-1033, 1994 20. Gaskell, T.J., "Bases for vehicle fleet scheduling", Operational Research Quarterly, 18, 281-295, 1967 21. Gendreau, M., A.
Hertz, and G.Laporte, "A tabu search heuristic for the vehicle routing problem", Management Science, 40, 1276~1290, 1994 22. Gendreau, M., A. Hertz, and , G. Laporte, "New insertion and Post-optimization procedures for the traveling salesman problem", Operations Research, 40,1086-1094 23. Gillet,B.,and L.Miller,A Heuristic algorithm for the vehicle dispatch problem,Operations Research,22,340-349,1974 24.
Glover,F.,Tabu Search:A Tutorial,Interfaces,20,74-94,1990 25. Glover,F.,Tabu Search:Part I,ORSA Journal on Computing,1,190-206,1989 26.
Glover,F.,Tabu Search:Part II,ORSA Journal on Computing,2,4-32,1990 27. Glover,F.,J.P.Kelly,and M.Laguna,Genetic algorithms and tabu search:Hybrids for optimization,Computers & Operations Research,22,111-134,1995 28. Glover,F.,E.Taillard,and D.de Werra,A user's guide to tabu search,Annals of operations Research,41,3-28,1993 29. Goetschlckx,M.,and C.Jacobs-Blecha,The vehicle routing problem with
backhauls,European Journal of Operational Research,42,39-51,1989 30. Golden,B.,A.Assad,L.Levy,and F.Cheysens,The fleet size and mix vehicle routing problem,Computers & Operations Research,11,49-66,1984 31. Karamcheti,V.,and M.Malek,A TSP engine for performing tabu
search,International Conference on Application Specific Array Processors,309-321,1991 32. Kelly,J.P.,M.Laguna,and F.Glover,A Study of diversification strategies for the quadratic assignment problem,Computers&Operations Research,21,885-893,1994 33. Knox,J.,Tabu search performance on the symmetric traveling salesman problem,Computers&Operations Research 34. Krolak,P.,W.Felts,and J.Nelson,A man-machine approach toward solving the generalized truck dispatching problem,Transporation Science,6,149-170,1972 35. Laursen,P.S.,Simulated annealing for the QAP-optimal tradeoff between simulation time and solution quality,European Journal of Operational Research,69,238-243,1993 36.
Lawer,E.L.,J.K.Lenstra,A.H.G.Rinnooy Kan,and D.B.Shmoys,The Traveling Salesman Problem,John Wiley&Sons,1985 37. Lin,S.,Computers solutions of the traveling salesman problem,BellSystem Tech.J.,.44,2245-2269,1965 38. Lin,S.,and B.Kernighan,An Effective Heuristics algorithm for the traveling salesman problem,Operations Research 21,498-516,1973 39. Malek,M.,M.Guruswamy,and M.Pandya,Serial and Parallel simulated annealing and tabu search algorithms for the traveling salesman problem,Annals of Operations Research,59-84,1989 40.
Osman,I.H.,Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem,Annals of
OperationsResearch,41,421-451,1993 41. Pureza,V.M.and P.M.Franca,Vehicle routing problems via tabu search metaheuristic,Publication CRT747,Center de recherche surles transports,Montreal,1991 42. Sjorin-Kapov,J.,Extensions of a tabu search adaptation to the quadratic assignment problem,Computers & Operations Research,21,855-865,1994 43. Semet,F.and E.Taillard,Solving real-life vehicle routing problems efficiently using taboo search,Annals of Operations Research,41,469-488,1993 44. Taillard,E.Robust taboo search for the quadratic assignment problem,Parallel Computing,17,443-445,1991 45. Taillard,E.Parallel iterative search for vehicle routing problem,Working paper ORWP 92/03,1991 46. Willard,J.A.G.,Vehicle routing using r-optimal tabu search,M.Sc.Disseration.The management school,Imperial
College,London,1989
