由於資訊的發達、生活水準的提高，消費者對於貨品送達時間的要求也越來越嚴格，企業必須思考如何安排載運車輛的配送路線，才能以最低運輸成本但最快的速度來迎合客戶的需求。卡車與拖車路線問題主要是藉由卡車附掛拖車來進行配送，不同地區的可及性不同，因此，卡車與拖車路線問題考量了不同地區的交通狀況，例如在偏遠山區或是在市中心，沒辦法整車運送，於是我們便可以利用行動力較高的卡車來進行配送，不僅解決大型車行駛市區不方便的問題，也同時解決了小型車運載容量不足的問題。
具時間窗限制之卡車與拖車路線問題為VRPTW問題的衍生，因此其複雜度為NP-hard，在過去研究方面，對於卡車與拖車路線問題並沒有將時間窗納入考量，且其拖車停放點是隨意選擇成本最低的顧客點，而本研究不僅將時間窗納入考量，並且還限制拖車只能停放在特殊顧客點，除此之外，本研究還建立具時間窗限制的卡車與拖車路線問題的數學模式，並且發展相關啟發式演算法。
本研究使用「最鄰近法」以迅速產生初始可行解，並利用「禁忌搜尋法」進行路線的改善測試。透過了與LINGO比較測試之後，本研究的演算法可以在短時間內求得不錯品質的解。另外，本研究還建立了一組18題的TTRPTW測試題庫，並以Java語言撰寫程式在個人PC上執行測試。測試結果顯示本研究所提出的演算法雖然提高了路線成本，但卻可以有效率的減少車輛的使用數量，並節省了車輛固定成本的支出，因此可以藉此降低總成本的支出。

The Truck and Trailer Routing Problem (TTRP) uses trucks as well as the combination of truck-and-trailers to serve customers with different traffic situation. For example in the mountain area or in the downtown area where the truck-and-trailers can’t deliver the goods, we use the trucks to deliver them.
In the literatures, the Truck and Trailer Routing Problem had not been certainly brought into consideration with regarding Time Windows and it is assumed that the trailers can park in the place of every customer. This study not only brings into consideration with the time windows, but also limits the trailers only to be able to park in the locations of some certain customers. In addition, this study also establishes a mathematical model of the Truck and Trailer Routing Problem with Time Windows and develops a heuristic algorithm to solve it.
This study uses the rule of "Nearest Neighborhood" to produce the initial feasible solution, and carries it into the route improvement by "Tabu Search" algorithm. Comparing with the result obtained by LINGO, the algorithm developed by this study can obtain a good quality solution in a short time. Moreover, this research has also establishes a test bank of 18 TTRPTW questions, and composes the program by the Java language to carry out the test on personal PC. The test result shows the solution produced by the algorithm can reduces the total cost effectively.

一、 中文部份
陳正元，「節省法與路線間交換改善法在車輛路線問題(VRP)上之應用」，交通大學土木工程研究所碩士論文，1992。

易德華，「軟時窗車輛巡迴問題之研究」，國立中央大學士木工程學系碩士論文，1998。

林書銘，「禁制搜尋法於含時窗與裝載限制車輛途程問題解算之研究」，元智大學工業工程研究所碩士論文，1998。

林書銘、徐旭昇，「塔布搜尋法於含時窗與裝載限制車輛途程問題解算之研究」，中華民國運輸學會第十三屆年會暨學術論文研討會，1998。

顏憶茹與張淳智，物流管理，第2版，台北：前程，1999。

陳契伸，「硬性/軟性時窗限制之車輛途程問題研究」，中原大學工業工程學系碩士論文，2001。

吳志仁，「一般化卡車拖車路線問題」，國立交通大學運輸科技與管理學系碩士論文，2003。

二、 英文部份
Baker, E. and J. Schaffer, “Solution Improvement Heuristics for the Vehicle Routing and Scheduling Problem with Time Window Constraints,” American Journal of Mathematical and Management Sciences, 6, pp.261-300, 1986.

Bodin, L. D., B. L. Golden, A. A. Assad and M. O. Ball, “Routing and Scheduling of Vehicles and Crews,” The State of the art, Computers and Operations Research, 10, pp.69-193, 1983.

Chao, I. M., “A Tabu Search method for the Truck and Trailer Routing Problem,” Computers and Operations Research, 29, pp.33-51, 2002.

Clarke, G. and J. W. Wright, “Scheduling of Vehicles from a Central Depot to a Number of Deliver Points,” Operations Research, 12, pp.568-581, 1964.

Duhamel, C., J. Y. Potvin and J. M. Rousseau, “A Tabu Search Heuristic for the Vehicle Routing Problem with Backhauls and Time Windows,” Transportation Science, 31, pp.49-59, 1997.

Garcia, B., J. Potvin and J. Rousseau, “A parallel Implementation of the Tabu Search Heuristic for Vehicle Routing Problems with TimeWindow Constraints”, Computers & Operations Research, 21(9), pp.1025-1033, 1994.

Gerdessen, J.C., “Vehicle Routing Problem with Trailers,” European Journal of Operational Research, 93, pp.135-147, 1996.

Glover F., “Heuristic for Integer Programming Using Surrogate Constraints,” Decision Science, 8, pp.156-166, 1977.

Golden, B. L. and L. Bodin, “Microcomputer-Based Vehicle Routing and Scheduling Software,” Computers & Operations Research, 13(2), pp.277-285, 1986.
Kirkpatrick, S., C. D. Gelatt, Jr., and M. P. Vecchi, “Optimization Simulated Annealing,” Science, 220(4598), pp.671-680, 1983.

Kolen, A. W. J., A. H. G. Rinnoy Kan and H. W. J. M. Trienekens, “Vehicle Routing with Time Windows,” Operations Research, 35(2), pp.266-273, 1987.

Koskodis, Y. A., B. P. Warren and M. M. Solomon, “An Optimization-Based Heuristic for Vehicle Routing and Scheduling with Soft Time Window Constraints,” Transportation Science, 26(2), pp.69-85, 1992.
Laporte, G. and Y. Nobert, “Exact Algorithms for the Vehicle Routing Problem,” Surveys in Combinatorial Optimization, pp.147-184, 1987.

Lin, S. and Kernighan, B., “An Effective Heuristic Algorithm for The Traveling Salesmen Problem,” Operations Research, 21, pp.498-516, 1973.

Malmborg, C. J., “A Genetic Algorithm for Service Level Based Vehicle Routing Scheduling,” European Journal of Operational Research, 93, pp.121-134, 1996.

Potvin, J. and J. Rousseau, “A Parallel Route Building Algorithm for the Vehicle Routing and Scheduling Problem with Time Windows,” European Journal of Operational Research, 66, pp.331-340, 1993.

Potvin, J., T. Kervahut, B. Garcia and J. Rousseau, “The Vehicle Routing Problem with Time Windows: Part I: Tabu Search,” INFORMS Journal on Computing, 8(2), pp.158-164, 1996.
Potvin, J. and S. Bengio, “The Vehicle Routing Problem with Time Windows: Part Ⅱ: Genetic Search,” INFORMS Journal on Computing, 8(2), pp.165-172, 1996.

Russell, R. A., “Hybrid Heuristics for the Vehicle Routing Problem with Time Windows,” Transportation Science, 29(2), pp.156-166, 1995.

Sexton, T. R. and Y. M. Choi, “Pickup and Delivery of Partial Loads with Soft Time Windows,” American Journal of Mathematical and Management Sciences, 6(3-4), pp.369-398, 1986.

Solomon, M.M., “Algorithms for The Vehicle Routing and Scheduling Problems with Time Window Constraints,” Operations Research, 35(2), pp.254-265, 1987.

Solomon, M. M. and J. Desrosiers, “Time Windows Constrained Routing and Scheduling Problems,” Transportation Science, 22(1), pp.1-13, 1988.

Sutcliffe, C. and J. Board, “Optimal Solution of a Vehicle-routing Problem：Transporting Mentally Handicapped Adults to an Adult Training Centre,” Journal of Operational Research Society, 14(1), pp.61-67, 1990.

Taillard, E., Badeau, P., Genderau, M., Guertin, F. and Potvin, J.Y., “A tabu search heuristic for the vehicle routing problem with soft time windows,” Transportation Science, 31, pp.170-186, 1997.

Thangiah, S. R., I. H. Osman and T. Sun, “Hybrid Genetic Algorithm, Simulated Annealing and Tabu Search Methods for Vehicle Routing Problems with Time Windows,” Technical Report UKC/OR94/4, Institute of Mathematics & Statistics, University of Kent, CanterBury, UK, 1994.