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)


    Zugriff

    Zugriff über TIB

    Verfügbarkeit in meiner Bibliothek prüfen


    Exportieren, teilen und zitieren



    Titel :

    An Extension of the (Szwarc) Truck Assignment Problem


    Beteiligte:
    M. Bellmore (Autor:in) / J. C. Liebman (Autor:in) / D. H. Marks (Autor:in)

    Erscheinungsdatum :

    1972


    Format / Umfang :

    10 pages


    Medientyp :

    Report


    Format :

    Keine Angabe


    Sprache :

    Englisch




    DIRECT TRUCK ASSIGNMENT SYSTEM

    CHASE ARNOLD | Europäisches Patentamt | 2023

    Freier Zugriff

    DIRECT TRUCK ASSIGNMENT SYSTEM

    CHASE ARNOLD | Europäisches Patentamt | 2022

    Freier Zugriff

    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 | Europäisches Patentamt | 2018

    Freier Zugriff

    Truck bed extension

    RUDE TERRY JAMES | Europäisches Patentamt | 2016

    Freier Zugriff