To　solve　the　truck　and　trailer　routing　problem　(TTRP),　an　iterated　variable　neighborhood　descent　(IVND)　algorithm　was　proposed.　First,　the　T-cluster　heuristic　was　implemented　for　generating　an　initial　solution.　Next,　a　VND　based　on　multi-operator　optimization　was　developed.　In　VND,　the　restricted　neighborhood　was　introduced　based　on　the　idea　of　granular　neighborhoods,　and　a　perturbation　strategy　had　been　designed　by　switch-vehicle-type　operator　to　help　optimization　escape　from　local　minima.　Computational　results　are　reported　for　21　test　problems　with　50~199　customers　from　Chao＇s　benchmark　and　the　results　indicate　that　the　proposed　IVND　algorithm　could　converge　to　the　satisfactory　solutions　within　the　shortest　computational　time.　In　addition,　the　IVND　is　flexible,　efficient　and　easy　to　implement,　and　could　be　extended　to　handle　other　variants　of　vehicle　routing　problem　and　other　combinatorial　optimization　problem.　©　2018,　Editorial　Board　of　Journal　of　Systems　Engineering　Society　of　China.　All　right　reserved.