We study the problem in which one supplier delivers a product to a set of retailers over time by using an outsourced fleet of vehicles. Since the probability distribution of the demand is not known, we provide a Min-Max approach to find robust policies. We show that the optimal Min-Expected Value policy can be very poor in the worst case. We provide a Min-Max Dynamic Programming formulation that allows us to exactly solve the problem in small instances. Finally, we implement a Min-Max Matheuristic to solve benchmark instances and show that it is very effective.


    Zugriff

    Zugriff über TIB

    Verfügbarkeit in meiner Bibliothek prüfen

    Bestellung bei Subito €


    Exportieren, teilen und zitieren



    Titel :

    Min–Max exact and heuristic policies for a two-echelon supply chain with inventory and transportation procurement decisions



    Erschienen in:

    Erscheinungsdatum :

    2016




    Medientyp :

    Aufsatz (Zeitschrift)


    Format :

    Print


    Sprache :

    Englisch



    Klassifikation :

    BKL:    85.00 / 55.82 Güterverkehr