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.


    Access

    Access via TIB

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    An improved heuristic for the period vehicle routing problem


    Additional title:

    Eine verbesserte Heuristik für das Problem periodischer Fahrzeugrouten


    Contributors:
    Chao, I-Ming (author) / Golden, B.L. (author) / Wasil, E. (author)

    Published in:

    Networks ; 26 , 1 ; 25-44


    Publication date :

    1995


    Size :

    20 Seiten, 17 Quellen




    Type of media :

    Article (Journal)


    Type of material :

    Print


    Language :

    English





    Reoptimization Heuristic for the Capacitated Vehicle Routing Problem

    Rodrigo Linfati / John Willmer Escobar | DOAJ | 2018

    Free access

    Hybrid Heuristic Algorithm for solving Capacitated Vehicle Routing problem

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

    Free access

    A tabu search heuristic for the vehicle routing problem

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


    [229] HEURISTIC APPROACH FOR THE ENVIRONMENTAL VEHICLE ROUTING PROBLEM

    Chaouachi, Jouhaina / Fatnassi, Ezzeddine | TIBKAT | 2016