卡車與拖車途程問題(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.
