Considers a common variant of the vehicle routing problem in which a vehicle fleet delivers products stored at a central depot to satisfy customer orders. Each vehicle has a fixed capacity, and each order uses a fixed portion of vehicle capacity. The routing decision involves determining which of the demands will be satisfied by each vehicle and what route each vehicle will follow in servicing its assigned demand in order to minimize total delivery cost. The authors present a heuristic for this problem in which an assignment of customers to vehicles is obtained by solving a generalized assignment problem with an objective function that approximates delivery cost.


    Zugriff

    Zugriff prüfen

    Verfügbarkeit in meiner Bibliothek prüfen

    Bestellung bei Subito €


    Exportieren, teilen und zitieren



    Titel :

    A generalized assignment heuristic for vehicle routing


    Weitere Titelangaben:

    Eine verallgemeinerte Zuordnungsheuristik fuer die Ermittlung des Kraftfahrzeugleitweges


    Beteiligte:
    Fisher, M.L. (Autor:in) / Jaikumar, R. (Autor:in)

    Erschienen in:

    Networks ; 11 , 2 ; 109-124


    Erscheinungsdatum :

    1981


    Format / Umfang :

    16 Seiten, 22 Quellen



    Medientyp :

    Aufsatz (Zeitschrift)


    Format :

    Print


    Sprache :

    Englisch




    Heuristic Scheme for Heterogeneous Vehicle Routing Problem on Trees Based on Generalized Assignment and Bin-Packing Upper Bounds

    Kumar, Roshan / Unnikrishnan, Avinash / Waller, S. Travis | Transportation Research Record | 2012



    A column generation based heuristic for the generalized vehicle routing problem with time windows

    Yuan, Yuan / Cattaruzza, Diego / Ogier, Maxime et al. | Elsevier | 2021


    Reoptimization Heuristic for the Capacitated Vehicle Routing Problem

    Rodrigo Linfati / John Willmer Escobar | DOAJ | 2018

    Freier Zugriff

    The Time Window Assignment Vehicle Routing Problem

    Spliet, Remy | Online Contents | 2014