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.


    Access

    Access via TIB

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

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




    Publication date :

    2016




    Type of media :

    Article (Journal)


    Type of material :

    Print


    Language :

    English



    Classification :

    BKL:    85.00 / 55.82 Güterverkehr