We propose a new multi-start solution approach for the split-delivery vehicle routing problem with minimum delivery amounts (SDVRP-MDA). Initial solutions are generated by both node-insertion and route-addition procedures with a single parameter to control the restart. These solutions are then improved by a variable neighborhood descent metaheuristic with a novel search operator inspired by node-ejection chains. We test the proposed approach with 32 benchmark instances for four different minimum delivery fractions. Using the proposed algorithm, out of 128 cases tested, we find 81 best known solutions and 34 new best solutions; overall, we find 43 new best solutions.


    Access

    Access via TIB

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    A multi-start heuristic approach for the split-delivery vehicle routing problem with minimum delivery amounts


    Contributors:


    Publication date :

    2016




    Type of media :

    Article (Journal)


    Type of material :

    Print


    Language :

    English



    Classification :

    BKL:    85.00 / 55.82 Güterverkehr



    The split delivery vehicle routing problem with minimum delivery amounts

    Gulczynski, Damon / Golden, Bruce / Wasil, Edward | Elsevier | 2009



    An Optimization-Based Heuristic for the Split Delivery Vehicle Routing Problem

    Archetti, C. / Speranza, M.G. / Savelsbergh, M.W.P. | British Library Online Contents | 2008



    A Modified Meta-Heuristic Approach for Vehicle Routing Problem with Simultaneous Pickup and Delivery

    Faiz, Alfian / Subiyanto, Subiyanto / Arief, Ulfah Mediaty | BASE | 2018

    Free access