ABSTRACT
Contents 10.1 Introduction ............................................................................... 180 10.2 Literature .................................................................................... 180 10.3 Triplet Formulation ..................................................................... 181 10.4 A Penalty Method for the TRP ...................................................... 183 10.5 Restatement as a Markov Process ................................................... 184 10.6 Dynamic Programming Formulation ............................................. 186 10.7 Dynamic Programming Model Results ........................................... 188
10.7.1 Sample 1 ....................................................................... 189 10.7.2 Sample 2 ....................................................................... 194 10.7.3 Sample 3 ....................................................................... 196 10.7.4 Sample 4 ....................................................................... 196 10.7.5 Sample 5 ....................................................................... 198
10.8 Efficiency of Solution Method ....................................................... 200 10.9 Conclusions ................................................................................ 201 10.10 Future Research ........................................................................... 202 References .............................................................................................. 202
10.1 Introduction The evolution of the truckload routing problem combines a typical assignment problem with a restricted probabilistic traveling salesman problem. Although a significant problem in the trucking industry, it has attracted much less attention in the literature than its less-than-truckload counterpart, the vehicle routing problem.
