The truck and trailer routing problem (TTRP) is a variant of the well known vehicle routing problem (VRP). Different from the VRP, in the TTRP, customers are serviced by a fleet of trucks and trailers. Due to practical constraints, some customers (truck customer; TC) can only be serviced by a single truck. The other customers (vehicle customer; VC) can be serviced by a single truck or a truck pulling a trailer.

• 21 TTRP instances (Chao, 2002)
  The numbers in the first line are Truck Capacity, Trailer Capacity, Number of Customers
  The numbers in each of the subsequent lines are Customer Number, X-coordinate, Y-coordinate, Demand, Indicator of Truck Customer (1 = TC, 0 = VC)
  The 2nd line is for the depot (node 0) so the last two numbers in the line can be ignored.
• 36 new (R)TTRP instances (Lin et al., 2010)
• TTRPTW instances (Lin et al., 2011)

1. Lin SW, Yu VF*, Lu CC. A simulated annealing heuristic for the truck and trailer routing problem with time windows. Expert Systems with Applications 2011; 38(12):15244-15252.
2. Lin SW, Yu VF*, Chou SY. A note on the truck and trailer routing problem. Expert Systems with Applications 2010; 37(1):899-903.
3. Lin SW, Yu VF*, Chou SY. Solving the truck and trailer routing problem based on a simulated annealing heuristic. Computers & Operations Research 2009; 36(5):1683-1692.
4. Drexl M. A branch-and-price algorithm for the truck-and-trailer routing problem. Technical report. RWTH Aachen University, Germany; 2007.
5. Scheuerer S. A tabu search heuristic for the truck and trailer routing problem. Computers & Operations Research 2006;33:894-909
6. Chao IM. A tabu search method for the truck and trailer routing problem. Computers & Operations Research 2002;29(1):33-51