An analysis on Trailer and Tractor Problem (TTP)

트레일러-트렉터문제에 대한 연구

We consider the transportation problem of optimizing the use of trailers and tractors. Several variants with fixed loading and unloading time are discussed. We show that the variant requiring on-time delivery can be solved in polynomial time, whereas the other variant requiring time-window delivery is NP-hard. We also discuss that if the number of loading and unloading operations assigned to each trailer or tractor is limited, even the variant requiring on-time delivery becomes NP-hard.