In the period vehicle routing problem, each customer requires a certain number of deliveries per week. Given these frequency requirements, customers must be allocated to days. A vehicle routing problem is solved over each day. We have improved upon best-known solutions to problems from the literature using a new heuristic procedure. The heuristic also works well on 19 newly generated test problems.


    Zugriff

    Zugriff über TIB

    Verfügbarkeit in meiner Bibliothek prüfen

    Bestellung bei Subito €


    Exportieren, teilen und zitieren



    Titel :

    An improved heuristic for the period vehicle routing problem


    Weitere Titelangaben:

    Eine verbesserte Heuristik für das Problem periodischer Fahrzeugrouten


    Beteiligte:
    Chao, I-Ming (Autor:in) / Golden, B.L. (Autor:in) / Wasil, E. (Autor:in)

    Erschienen in:

    Networks ; 26 , 1 ; 25-44


    Erscheinungsdatum :

    1995


    Format / Umfang :

    20 Seiten, 17 Quellen




    Medientyp :

    Aufsatz (Zeitschrift)


    Format :

    Print


    Sprache :

    Englisch




    An adaptive large-neighborhood search heuristic for a multi-period vehicle routing problem

    Dayarian, Iman / Crainic, Teodor Gabriel / Gendreau, Michel et al. | Elsevier | 2016



    Reoptimization Heuristic for the Capacitated Vehicle Routing Problem

    Rodrigo Linfati / John Willmer Escobar | DOAJ | 2018

    Freier Zugriff

    A tabu search heuristic for the vehicle routing problem

    Gendreau, Michel / Hertz, Alain / Laporte, Gilbert | TIBKAT | 1992


    A novel heuristic algorithm for capacitated vehicle routing problem

    Kır, Sena / Yazgan / Harun Reşit et al. | BASE | 2017

    Freier Zugriff