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.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Truck backhauling on networks with many terminals


    Contributors:

    Published in:

    Publication date :

    1986-04-03


    Size :

    11 pages




    Type of media :

    Article (Journal)


    Type of material :

    Electronic Resource


    Language :

    English



    Truck backhauling on two terminal networks

    Jordan, William C. / Burns, Lawrence D. | Elsevier | 1984


    Truck terminals

    Zee, T.T. | Engineering Index Backfile | 1930


    Truck terminals

    Engineering Index Backfile | 1953


    Cost-Optimal Placement and Backhauling of Small-Cell Networks

    Ranaweera, Chathurika / Lim, Christina / Nirmalathas, Ampalavanapillai et al. | British Library Online Contents | 2015


    Efficient GSM/UMTS Backhauling over Satellite

    Jahn, Axel / Werner, Markus | AIAA | 2006