臺灣博碩士論文加值系統

就物流業者而言，派遣車輛運送至顧客需求點時，通常會有同時取貨與送貨的需求。因此，本研究的基本假設主要是建立在顧客需求點可能同時具有需要送貨及收貨的情況，並且在不違背車容量限制以及顧客開始服務的時刻必須在規定時間區間內的條件下，能夠讓配送車輛以最小的途程距離來服務完所有的需求點。另外，本研究也考量解除車輛途程問題中，需求點僅能被單一配送車輛服務一次之限制情況，俾利進行多趟次之車輛配送任務。
據此，本研究根據上述之情形建構一系列之數學規劃模式，並利用ILOG OPL Studio 3.6.1之套裝軟體來進行測試與求解。雖然目前關於具同時收送貨與多趟次車輛途程問題方面之研究在學術上鮮少被探討，但在實務應用方面，對於企業在物流方面如何能降低營運成本及增進其配送服務效率上，卻是目前企業急欲探究之重要課題。因此，本研究擬透過構建數學規劃模式與廣泛之實驗設計與案例設計來進行分析與探討，期能裨益於相關業者並對於車輛途程問題之未來研究提供參考之依據。

In many practical conditions, the vehicle is often required to simultaneously drop off goods and pick up goods at the same customers. Customers usually have the requirements of both deliveries and pickups. The study supposes that customers have the requirements of both deliveries and pickups at the same time. This will be under the limitation of the capacity of the vehicle and the time of serving customers should be in the defined time window to make the vehicle finish the serving in the lowest cost.
In addition, the study also discusses the situation that vehicle can carry on the mission not only for one time but also several times in a time window.
Therefore, the study establishes a series of modes of mathematical scheme and use the set of ILOG OPL Studio 3.6.1 software to test and find the solutions. Although the studies of the two kinds of the vehicles are quite few discussed in academic, it is the very field for the enterprise groups eager to go into to reduce the operating cost in delivery and increase the efficiency of delivery. The study will offer the revising mode of mathematical scheme, the analysis of the solutions and the suggestion. We expect to resolve the vehicle routing problems and help to apply in practical.

第一章 緒論 1
第一節 研究背景與動機 1
第二節 研究目的 2
第三節 研究範圍 3
第四節 研究架構與流程 3
第二章 文獻回顧 6
第一節 車輛途程問題相關文獻回顧 6
第二節 具同時收送貨之車輛途程問題相關文獻回顧 13
第三節 OPL數學規劃軟體 16
第四節 具時窗和同時收送貨多趟次車輛途程問題之相關探討 16
第三章 車輛配送數學模式之建構 20
第一節 基本假設 20
第二節 參數與變數之定義 20
第三節 問題描述 21
第四節 數學模式 22
第五節 加入時間窗限制條件之數學規劃模式 23
第四章 實驗設計 26
第一節 實驗設計之目的 26
第二節 實驗工具 26
第三節 實驗方法 26
第四節 相關參數之設定 27
第五節 實驗設計 28
第五章 具時窗和同時收送貨之多趟次車輛途程問題之相關分析 34
第一節 問題描述 34
第二節 建立具時窗同時收送貨車輛途程問題模式 35
第三節 模式修正與分析求解 37
第四節 敏感度分析 38
第五節 敏感度分析結果探討 41
第六章 結論與建議 51
第一節 結論 51
第二節 建議 52
參考文獻 53

1.林惠民（民91），具時窗之多趟次車輛途程問題，元智大學資訊管理研究所碩士論文，未出版，桃園。
2.李依龍（民92），航空進口貨物配送之研究，長榮大學經營管理研究所碩士論文，未出版，台南。
3.吳泰熙（民92），含取貨之車輛途程問題解法之研究，Journal of the Chinese of Industrial Engineers, Vol.20, No.6, pp.651-665.
4.莊英群（民92），應用禁忌搜尋法於混合送收貨之車輛途程問題，逢甲大學工業工程研究所碩士論文，未出版，台中。
5.陳俊穎（民93），快遞貨物專區配送方式之研究，長榮大學經營管理研究所碩士論文，未出版，台南。
6.彭冠儒（民91），考量同時送貨及收貨之車輛途程問題，逢甲大學工業工程研究所碩士論文，未出版，台中。
7.Bodin, L., and B. Golden（1981）, Classification in vehicle routing and scheduling, Networks, 11, pp.97-108.
8.Bodin, L.B., A. Assad and M. Ball（1983）, Routing and Scheduling of Vehicle and Crews: The State of the Art, Computers & Operations Research, 10, pp.62-212.
9.Casco, D.O., B. L. Golden and E. A. Wasil（1988）, Vehicle routing with backhauls: models, algorithms, and case studies, In: Golden, L. and A. Assad （Eds）, Vehicle Routing: Methods and Studies, North-Holland, Amsterdam, pp.127-147.
10.Brandao, J. and Mercer, A.（1997）, A tabu search algorithm for the multi-trip vehicle routing and scheduling problem, European Journal of Operations Research, 100, pp.180-191.
11.Brandao, J. and Mercer, A.（1998）, The multi-trip vehicle routing problem, Journal of the Operational Research Society, 49, pp.799-805.
12.Clarke, G., and Wright, J.（1964）, Scheduling of vehicles from a central depot to a number of delivery points, Operations Research, 12, pp.568-581.
13.Dantzig, G. and J. H. Ramser（1959）, The truck dispatching problem, Management science, 6, 80-91.
14.Deif, I. and L. Bodin（1984）, Extension of the Clarke and Wright algorithm for solving the vehicle routing problem with backhauling, Proceedings of the Babson Conference on Software in Transportation and Logistic Management, A. E. Kidder, Babson Prak, MA, pp.75-96.
15.Duhamel, C., J. Y. Potvinn and J. M. Rousseau（1997）, A Tabu search heuristic for the vehicle routing problem with backhauls and time windows, Transportation Science, 31, pp.49-59.
16.Fisher, M. L. and R. Jaikumar（1981）, A generalized assignment heuristic for vehicle routing problems, Networks, 11, pp.109-124.
17.Fisher, M., M., Magnanti, T., Monma, M., Nemhauser (Eds.), G. (1995), Handbooks in Operations Research and Management Science, vol. 8: Network Routing, North-Holland, Amsterdam, pp.1-33.
18.Gillett, B. E., and Miller, L. R.（1974）, A heuristic algorithm for the vehicle dispatch problem, Operations Research, 22, pp.340-349.
19.Goetschalckx, M. and C. Jacobs-Blecha（1989）, The vehicle routing problem with backhauls, European Journal of Operational Research, 42, pp.39-51.
20.Golden, E. B., J. Alfaro and J. Schagger（1985）, The vehicle routing problem with backhauling：two approaches, Proceedings of the XII Annual Meeting of TIMS, Myrtle Beach, SC, pp.90-92.
21.Kontoravdis, G. and J. Bard（1992）, Improved heuristics for the vehicle routing problem with time windows, Working Paper, Operations Research Group, Department of Mechanical Engineering, University of Texas, Austin.
22.Kontoravdis, G. and Bard, J.F.（1995）, A GRASP for the Vehicle Routing Problem with Time Windows, Journal on Computing, 7, pp.10-23.
23.Laporte, G., Y. Nobert, and M. Desrochers（1985）, Optimal Routing under Capacity and Distance Restrictions, Operations research, 33(5), pp.1050-1073.
24.Lin, S., and Kernighan, B.（1973）, An effective heuristic algorithm for the traveling salesman problem, Operations Research, 21, pp.498-516.
25.Liu, F. and Shen, S.（1999）, A route-neighborhood-based met heuristic for vehicle routing problem with time windows, European Journal of Operations Research. 118, pp.485-504.
26.Liu, F. and Shen, S.（1999）, The fleet size and mix vehicle routing problem with time windows, Journal of the Operational Research Society, 50, pp.721-732.
27.M. Richter（1987）, Vehicle routing at quality stores, Interfaces, 17(2), 52-63.
28.Potivin, J.Y. and Rousseau, J.M.（1993）, A Parallel route building algorithm forth vehicle routing and scheduling problem with time windows, European Journal of Operations Research, pp.66331-340.
29.Potvin, J. Y., C. Duhamel and F. Guertin（1996）, A genetic algorithm for vehicle routing with backhauling, Applied Intelligence, 6, pp.345-355.
30.Potvin J. Y. and G. Laporte（1996）, Genetic algorithm for the traveling salesman problem, Annals of Operations Research, 63, pp.339-370.
31.Russell, R.A.（1995）, Hybrid heuristics for the vehicle routing problem with time windows, Transportation Science, 29, pp.156-166.
32.Salhi, S. and G. Nagy（1999）, A cluster insertion heuristic for single and multiple depot vehicle routing problems with backhauling, Journal of the Operational Research Society, 50, pp.1034-1042.
33.Solomon, M.（1987）, Algorithm for the vehicle routing and scheduling problems with time window constraint, Operations Research, 35, pp.254-265.
34.Taillard, E., Laporte, G. and Gendreau, M.（1996）, Vehicle Routing with Multiple Use of Vehicles, Journal of the Operational Research Society, 47, pp.1065-1070.
35.Thangiah, S. R., J. Y. Potvin and T. Sun（1996）, Heuristic approaches to vehicle routing with backhauls and time windows, Computers and Operations Research, 23, pp. 1043-1057.
36.Toth, P. and D. Vigo（1997）. An exact algorithm for the vehicle routing problem with backhauls, Transportation Science, 31, pp.372-385.
37.Yano, T., L. Chan and K. M. Richter（1987）, Vehicle routing at quality stores, Interfaces, 17(2), pp.52-63.