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

The authors 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, they provide a Min–Max approach to find robust policies. They show that the optimal Min-Expected Value policy can be very poor in the worst case. The authors provide a Min–Max Dynamic Programming formulation that allows us to exactly solve the problem in small instances. Finally, they implement a Min–Max Matheuristic to solve benchmark instances and show that it is very effective.

Language

  • English

Media Info

Subject/Index Terms

Filing Info

  • Accession Number: 01611280
  • Record Type: Publication
  • Files: TRIS
  • Created Date: Aug 1 2016 2:34PM