This article studies the vehicle routing problem with trailers and transshipments (VRPTT), a practically relevant, but challenging, generalization of the classical vehicle routing problem. The article makes three contributions: (i) Building on a nontrivial network representation, two mixed-integer programming formulations for the VRPTT are proposed. (ii) Based on these formulations, five different branch-and-cut algorithms are developed and implemented. (iii) The computational behavior of the algorithms is analyzed in an extensive computational study, using a large number of test instances designed to resemble real-world VRPTTs.


    Zugriff

    Zugriff über TIB

    Verfügbarkeit in meiner Bibliothek prüfen

    Bestellung bei Subito €


    Exportieren, teilen und zitieren



    Titel :

    Branch-and-cut algorithms for the vehicle routing problem with trailers and transshipments


    Beteiligte:
    Drexl, Michael (Autor:in)

    Erschienen in:

    Networks ; 63 , 1 ; 119-133


    Erscheinungsdatum :

    2014


    Format / Umfang :

    15 Seiten




    Medientyp :

    Aufsatz (Zeitschrift)


    Format :

    Print


    Sprache :

    Englisch





    Formulations and Branch-and-Cut Algorithms for the Generalized Vehicle Routing Problem

    Bektas, T. / Erdogan, G. / Ropke, S. | British Library Online Contents | 2011


    Trailers & Semi-trailers

    Online Contents | 2014


    Trailers & Semi-trailers

    Online Contents | 2014


    Trailers & Semi-trailers

    Online Contents | 2014