A dynamic multi-plant lot-sizing and distribution problem

被引:50
作者
Darvish, Maryam [1 ,2 ]
Larrain, Homero [3 ]
Coelho, Leandro C. [1 ,2 ]
机构
[1] Univ Laval, CIRRELT, Quebec City, PQ G1K 7P4, Canada
[2] Univ Laval, Fac Sci Adm, Quebec City, PQ G1K 7P4, Canada
[3] Pontificia Univ Catolica Chile, Dept Transport Engn & Logist, Santiago, Chile
基金
加拿大自然科学与工程研究理事会;
关键词
physical internet; dynamic lot-sizing; integrated supply chain planning; production; inventory; distribution; optimization; FIX-AND-OPTIMIZE; INTEGRATED PRODUCTION; NEIGHBORHOOD SEARCH; META-HEURISTICS; ALGORITHM; INVENTORY; TIME; FORMULATIONS; MULTIITEM; MODEL;
D O I
10.1080/00207543.2016.1154623
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
In this paper, we investigate a multi-plant, production planning and distribution problem for the simultaneous optimisation of production, inventory control, demand allocation and distribution decisions. The objective of this rich problem is to satisfy the dynamic demand of customers while minimising the total cost of production, inventory and distribution. By solving the problem, we determine when the production needs to occur, how much has to be produced in each of the plants, how much has to be stored in each of the warehouses and how much needs to be delivered to each customer in each period. On a large real data-set inspired by a case obtained from an industrial partner, we show that the proposed integration is highly effective. Moreover, we study several trade-offs in a detailed sensitivity analysis. Our analyses indicate that the proposed scenarios give the company competitive advantage in terms of reduced total logistics cost, and also highlight more possibilities that become available taking advantage of an integrated approach towards logistics planning. These abundant opportunities are to be synergised and exploited in an interconnected open global logistics system.
引用
收藏
页码:6707 / 6717
页数:11
相关论文
共 38 条
[1]   A Two-Phase Iterative Heuristic Approach for the Production Routing Problem [J].
Absi, N. ;
Archetti, C. ;
Dauzere-Peres, S. ;
Feillet, D. .
TRANSPORTATION SCIENCE, 2015, 49 (04) :784-795
[2]   Uncapacitated lot-sizing problem with production time windows, early productions, backlogs and lost sales [J].
Absi, Nabil ;
Kedad-Sidhoum, Safia ;
Dauzere-Peres, Stephane .
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2011, 49 (09) :2551-2566
[3]   The production routing problem: A review of formulations and solution algorithms [J].
Adulyasak, Yossiri ;
Cordeau, Jean-Francois ;
Jans, Raf .
COMPUTERS & OPERATIONS RESEARCH, 2015, 55 :141-152
[4]   Optimization-Based Adaptive Large Neighborhood Search for the Production Routing Problem [J].
Adulyasak, Yossiri ;
Cordeau, Jean-Francois ;
Jans, Raf .
TRANSPORTATION SCIENCE, 2014, 48 (01) :20-45
[5]   Formulations and Branch-and-Cut Algorithms for Multivehicle Production and Inventory Routing Problems [J].
Adulyasak, Yossiri ;
Cordeau, Jean-Francois ;
Jans, Raf .
INFORMS JOURNAL ON COMPUTING, 2014, 26 (01) :103-120
[6]   Comparison of just-in-time and time window delivery policies for a single-item capacitated lot sizing problem [J].
Akbalik, Ayse ;
Penz, Bernard .
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2011, 49 (09) :2567-2585
[7]   Neighbourhood search meta-heuristics for capacitated lot-sizing with sequence-dependent setups [J].
Almada-Lobo, Bernardo ;
James, Ross J. W. .
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2010, 48 (03) :861-878
[8]   A hybrid optimization approach for multi-level capacitated lot-sizing problems [J].
Almeder, Christian .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2010, 200 (02) :599-606
[9]  
[Anonymous], SERVICE ORIENTATION
[10]   Analysis of the maximum level policy in a production-distribution system [J].
Archetti, Claudia ;
Bertazzi, Luca ;
Paletta, Giuseppe ;
Speranza, M. Grazia .
COMPUTERS & OPERATIONS RESEARCH, 2011, 38 (12) :1731-1746