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.


    Zugriff

    Zugriff prüfen

    Verfügbarkeit in meiner Bibliothek prüfen

    Bestellung bei Subito €


    Exportieren, teilen und zitieren



    Titel :

    Truck backhauling on networks with many terminals


    Beteiligte:

    Erschienen in:

    Erscheinungsdatum :

    03.04.1986


    Format / Umfang :

    11 pages




    Medientyp :

    Aufsatz (Zeitschrift)


    Format :

    Elektronische Ressource


    Sprache :

    Englisch



    Truck backhauling on two terminal networks

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


    Truck terminals

    Engineering Index Backfile | 1953


    Truck terminals

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


    Wireless Backhauling for Energy Harvesting Ultra-Dense Networks

    Rostami, Soheil / Heiska, Kari / Puchko, Oleksandr et al. | IEEE | 2018


    Cost-Optimal Placement and Backhauling of Small-Cell Networks

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