卡車與拖車途程問題(Truck and Trailer Routing Problem, TTRP)是傳統車輛途程問題(Vehicle Routing Problem, VRP)的一種衍生性問題，此類問題的特性在於車輛可以卡車或整車(卡車附掛拖車)兩種不同的車輛型態服務不同可及性的顧客，而兼顧高車容量以及機動性的特點。
而在配送問題中，準時一向是業者與顧客皆重視的課題，輔以近年來宅配業、貨運業者服務的範圍更擴大至食品以及其他的易腐性商品，準時與效率更顯重要，因此本研究增加考量了顧客的時間限制，構建出包含時窗限制的卡車與拖車路線問題(Truck and Trailer Routing Problem with Time Window, TTRPTW)，並提出啟發式的求解架構。最後以Solomon的標準測試題庫為基礎設計17題TTRPTW的測試例題作測試分析。

The Truck and Trailer Routing Problem (TTRP) is a variant of the Vehicle Routing Problem (VRP). The problem extends the basic VRP to take a real-life application into account. In the TTRP, customers can be serviced by a truck alone or a vehicle (a truck pulling a trailer), therefore there are three types of routes in a solution to the TTRP: a pure truck route, a pure vehicle route, and a complete vehicle route which includes the vehicle route and the sub-tours serviced by a truck alone.
This research extends TTRP to consider time window constraint, and defines the Truck and Trailer Routing Problem with Time Window (TTRPTW). This research also applies a heuristic to solve the TTRPTW and test on 17 problems which were designed based on Solomon’s standard VRPTW problems.

參考文獻
[1] 邱穀交通工程事務所(2000)，公路車輛行車成本調查，交通部運輸研究所委託辦理，中華民國八十九年一月。
[2] 郭國基，林文彬(1996)，我國流通業通路變革之實證研究，1996年國際商業物流管理研討會，pp. 564-581，台北。
[3] 吳志仁(2003)，(指導教授：韓復華)，一般化卡車拖車路線問題，國立交通大學運輸科技與管理學系碩士論文，新竹。
[4] 卓裕仁(2001)，(指導教授：韓復華)，以巨集啟發式解法求解多車種與週期性車輛路線問題之研究，國立交通大學運輸科技與管理學系博士論文，新竹。
[5] 易德華(1998)，(指導教授：陳惠國)，軟時窗車輛巡迴問題之研究，國立中央大學土木工程研究所碩士論文，中壢。
[6] 梅明德(1999)，(指導教授：謝浩明)，線上型時窗限制車輛路線問題之模式與求解演算法，國立中央大學土木工程研究所博士論文，中壢。
[7] 劉金維(2002)，(指導教授，謝浩明)，依時性路段暨時窗限制下單ㄧ車輛路線問題之研究，國立中央大學土木工程研究所博士論文，中壢。
[8] 洪仲林(2001)，(指導教授，張美香)，含時窗限制之動態需求車輛途程規劃問題，私立中華大學經營管理研究所碩士論文，新竹。
[9] Battiti, Roberto, Tecchiolli, Giampietro (1994), “The Reactive Tabu Search,” ORSA Journal on Computing, Vol. 6, pp. 126-140.
[10] Bodin, L., Golden, B., Assad, A., and Ball, M. (1983), “Routing and Scheduling of Vehicle and Crews: the State of the Art,” Special Issue of Computer & Operations Research, Vol. 10, No.2, pp. 63-211.
[11] Brailsford, S.C., Potts, C.N., and Smith, B.M. (1999), “Constraint Satisfaction Problem: Algorithms and Applications,” European Journal of Operational Research, Vol. 119, pp. 557-581.
[12] Carlton, W.B., Barnes, J.W. (1996), “Solving the Traveling Salesman Problem for the Vehicle Routing Problem with Time Windows,” Operations Research, Vol. 40, pp. 342-354.
[13] Chao, I. M. (2002) “A Tabu Search Method for the Truck and Trailer Routing Problem,” Computers and Operations Research, Vol. 29, pp. 31-51.
[14] Christofides, N., Mingozzi, A. and Toth, P. (1979), “The Vehicle Routing Problem,” Combinatorial Optimization, pp. 315-338.
[15] Clarke, G. and Wright, J.W. (1964), “Scheduling of Vehicles from a Central Depot to a Number of Delivery Points,” Operations Research, Vol. 12, No. 4, pp. 568-581.
[16] Dantzig, G.B. and Ramser R.H. (1959), “The Truck Dispatching Problem,” Management Science, Vol. 6, pp. 80–91.
[17] Dueck, G. and Scheuer, T. (1990), “Threshold Accepting – A General Purpose Optimization Algorithm Appearing Superior to Simulated Annealing,” Journal of Computational Physics, Vol. 90, pp. 161-175.
[18] Fisher, M. and Jaikumar, R. (1981), “A Generalized Assignment Heuristic for Vehicle Routing,” Networks, Vol. 11, pp. 109-124.
[19] Garey, M.R., and Johnson, D.S. (1979), Computers and Intractability: A Guide to the Theory of NP-Completeness, Freeman, San Francisco, USA.
[20] Gerdessen, J. C. (1996), “Vehicle Routing Problem with Trailers,” European Journal of Operational Research, Vol. 93, pp. 135-147.
[21] Gillett, B. and Miller, L. (1974), “A Heuristic Algorithm for the Vehicle Dispatch Problem,” Operations Research, Vol. 22, pp. 340-349.
[22] Glover, F. (1977), “Heuristics for Integer Programming Using Surrogate Constraints,” Decision Science, Vol. 8, pp. 156-166.
[23] Golden, B.L., Magnanti, T.L. and Nguyen, H.Q. (1977), “Implement Vehicle Routing Algorithms,” Networks, Vol. 7, pp. 113-148.
[24] Golden, B., Wasil, E., Kelly, J., and Chao, I.M. (1998), “The Impact of Metaheuristics on Solving the Vehicle Routing Problem: Algorithms, Problem Sets, and Computational Results,” Fleet Management and Logistics, Crainic T., and Laporte G., eds., Liuwer Academic Publishers, Netherlands, pp.33-56.
[25] Held, M. and Karp, R. (1971), “The Traveling Salesman Problem and Minimum Spanning Trees Part II,” Mathematical Programming, Vol. 1, pp. 6-25.
[26] Holland, J. H. (1973), “Genetic Algorithms and the Optimal Allocations of Trials,” SIAM Journal of Computing, Vol. 2, pp. 88-105.
[27] Murty, K. G. Karel, C. and Little J. D. C. (1963), “An Algorithm for the Traveling Salesman Problem,” Operations Research, Vol. 11, pp. 972-989.
[28] Laporte, G., Nobert, Y., (1987), “Exact algorithms for the vehicle routing problem,” Surveys in Combinatorial Optimization, Vol. 31, pp. 147-184.
[29] Laporte, G. (1992), “The Vehicle Routing Problem: An Overview of Exact and Approximate Algorithms,” European Journal of Operational Research, Vol. 59, pp. 345-358.
[30] Lin, S. and Kernighan, B. (1973), “An Effective Heuristic Algorithm for the Traveling Salesman Problem,” Operations Research, Vol. 21, pp. 498-516.
[31] Miller, C.E. (1960), “Integer Programming Formulation of Traveling Salesman Problem,” Journal of Association for Computing Machinery, Vol.7, pp.326-329.
[32] Mole, R.H. and Jameson, S.R. (1976), “A Sequential Route-Building Algorithm Employing Generalized Saving Criterion,” Operation Research Quarterly, Vol. 27, pp. 503-527.
[33] Nemhauser, G.L. and Rinnooy Kan, A.H.G. (1995), Handbooks in Operations Research and Management Science (Volume 8), North-Holland, Inc. Netherlands.
[34] Or, I. (1976), 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
[35] Osman, I.H. (1993), “Metastrategy Simulated Annealing and Tabu Search Algorithms for the Vehicle Routing Problem,” Annals of Operations Research, Vol. 41, pp. 421-451.
[36] Potvin, J.Y., Kervahut, T., Garcia, B.L., and Rousseau, J.M. (1996), “The Vehicle Routing Problem with Time Windows Part I: Tabu Search,” INFORMS Journal on Computing, Vol. 8, No. 2, pp.158-164.
[37] Psaraftis, H.N. (1998), “Dynamic Vehicle Routing Problem,” In Vehicle Routing: Methods and Studies, Golden B.L., and Assad A.A. eds., North-Holland, Amsterdam, pp. 223-248.
[38] Solomon, M.M. (1987), “Algorithms for the Vehicle Routing and Scheduling Problem with Time Window Constraints,” Operations Research, Vol. 35, No.2, pp. 254-265.
[39] Solomon, M.M. Baker, E.K. and Schaffer, J.R. (1988), “Vehicle Routing and Scheduling Problems with Time Window Constraints: Efficient Implementations of Solution Improvement Procedures,” In Golden, B.L. and Assad, A.A. (Eds), Vehicle Routing: Methods and Studies, Elsevier Science Publishers, Amsterdam, pp. 170-186.