In the journal in 1967, Szwarc presented an algorithm for the optimal routing of a common vehicle fleet between m sources and n sinks with p different types of commodities. The main premise of the formulation is that a truck may carry only one commodity at a time and must deliver the entire load to one demand area. This elminates the problem of routing vehicles between sources or between sinks and limits the problem to the routing of loaded trucks between sources and sinks and empty trucks making the return trip. Szwarc considered only the transportation aspect of the problem (i.e., no intermediate points) and presented a very efficient algorithm for solution of the case described. (Author)


    Access

    Access via TIB

    Check availability in my library


    Export, share and cite



    Title :

    An Extension of the (Szwarc) Truck Assignment Problem


    Contributors:
    M. Bellmore (author) / J. C. Liebman (author) / D. H. Marks (author)

    Publication date :

    1972


    Size :

    10 pages


    Type of media :

    Report


    Type of material :

    No indication


    Language :

    English




    DIRECT TRUCK ASSIGNMENT SYSTEM

    CHASE ARNOLD | European Patent Office | 2023

    Free access

    DIRECT TRUCK ASSIGNMENT SYSTEM

    CHASE ARNOLD | European Patent Office | 2022

    Free access

    The Truck Routing and Aircraft Assignment Problem with Time Windows

    Li, Hongqi / Bai, Ming / Wang, Haotian et al. | ASCE | 2019


    TRUCK BED EXTENSION

    LEPAGE DEAN | European Patent Office | 2018

    Free access

    Truck bed extension

    RUDE TERRY JAMES | European Patent Office | 2016

    Free access