In this work, we present a variable neighborhood search for solving a capacitated location routing problem with capacitated depots and a capacitated homogenous vehicle fleet in order to minimize the location and routing cost. We present the basic elements for this purpose and implement the variable neighborhood search algorithm using the variable neighborhood descent as the local search. We tested our heuristic approach on a large number of instances and the results were compared with the literature.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    A variable neighborhood search for the capacitated location-routing problem


    Contributors:
    Derbel, H. (author) / Jarboui, B. (author) / Chabchoub, H. (author) / Hanafi, S. (author) / Mladenovic, N. (author)


    Publication date :

    2011-05-01


    Size :

    704940 byte




    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English