Abstract Truck backhauling reduces empty truck-miles by having drivers haul loads on trips back to their home terminal. This paper develops a model to help coordinate backhauling between many (more than two) terminals. Two mathematical programming formulations of this backhauling problem are given. One formulates it as a “matching” problem that leads to a heuristic for solving the very large backhauling problems that arise in practice. Using Lagrangian relaxation, the other formulation allows a very tight bound on the optimal solution to be calculated. The quality of the heuristic solution can be determined by comparison with this bound. A large scale example based on actual truck shipments demonstrates how the model might be used in planning truck backhauling. For this example, the heuristic yields a solution within 1% of optimal.
Truck backhauling on networks with many terminals
Transportation Research Part B: Methodological ; 21 , 3 ; 183-193
1986-04-03
11 pages
Article (Journal)
Electronic Resource
English
Truck backhauling on two terminal networks
Elsevier | 1984
|Engineering Index Backfile | 1953
Engineering Index Backfile | 1930
|Cost-Optimal Placement and Backhauling of Small-Cell Networks
British Library Online Contents | 2015
|