Dynamic programming approach for minimizing the transportation costs in a supply chain
Résumé
In this paper we study the transportation issues in supply chain given a fixed production schedule. We consider a supply chain with one manufacturer and one or several products. We distinguish the case where we produce one type of products and the case where there are several types of products. The objective is to minimize the transportation costs, i.e. making the optimal delivery schedule that minimize the number of travels from the manufacturer and the customers. We give dynamic programming based approaches to handle the two cases.