Dynamic programming approach for minimizing the transportation costs in a supply chain

Zerouk Mouloua 1 Ammar Oulamara 1
1 ORCHIDS - Operations research for Complex HybrId Decision Sytems
LORIA - NSS - Department of Networks, Systems and Services
Abstract : 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.
Type de document :
Communication dans un congrès
Octavian Bologa, Ioan Dumitrache, Florin Gheorghe Filip. 4th IFAC Conference on Management and Control of Production and Logistics - MCPL'2007, Sep 2007, Sibiu, Romania. 4, pp.753-758, 2007, 〈10.3182/20070927-4-RO-3905.00124〉
Liste complète des métadonnées

https://hal.inria.fr/inria-00596014
Contributeur : Publications Loria <>
Soumis le : jeudi 26 mai 2011 - 11:34:04
Dernière modification le : mardi 24 avril 2018 - 13:34:49

Identifiants

Collections

Citation

Zerouk Mouloua, Ammar Oulamara. Dynamic programming approach for minimizing the transportation costs in a supply chain. Octavian Bologa, Ioan Dumitrache, Florin Gheorghe Filip. 4th IFAC Conference on Management and Control of Production and Logistics - MCPL'2007, Sep 2007, Sibiu, Romania. 4, pp.753-758, 2007, 〈10.3182/20070927-4-RO-3905.00124〉. 〈inria-00596014〉

Partager

Métriques

Consultations de la notice

100