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





    Reoptimization Heuristic for the Capacitated Vehicle Routing Problem

    Rodrigo Linfati / John Willmer Escobar | DOAJ | 2018

    Freier Zugriff

    A meta-heuristic for capacitated green vehicle routing problem

    Zhang, Shuai / Gajpal, Yuvraj / Appadoo, S. S. | Springer Verlag | 2017


    Hybrid Heuristic Algorithm for solving Capacitated Vehicle Routing problem

    AbdElAziz, Moh. M. / A. El-Ghareeb, Haitham / Ksasy, M. S. M. | BASE | 2014

    Freier Zugriff

    [229] HEURISTIC APPROACH FOR THE ENVIRONMENTAL VEHICLE ROUTING PROBLEM

    Chaouachi, Jouhaina / Fatnassi, Ezzeddine | TIBKAT | 2016