Tactical Production and Distribution Planning in Urban Logistics under Vehicle Operational Restrictions

被引:3
作者
Du, Mu [1 ]
Kong, Nan [2 ]
Hu, Xiangpei [3 ]
Zhao, Lindu [1 ]
机构
[1] Southeast Univ, Inst Syst Engn, 2 Sipailou, Nanjing 210096, Jiangsu, Peoples R China
[2] Purdue Univ, Weldon Sch Biomed Engn, W Lafayette, IN 47906 USA
[3] Dalian Univ Technol, Inst Syst Engn, 2 Linggong Rd, Dalian 116023, Peoples R China
来源
KNOWLEDGE-BASED AND INTELLIGENT INFORMATION & ENGINEERING SYSTEMS (KES-2018) | 2018年 / 126卷
基金
中国国家自然科学基金;
关键词
Tactical productiondistribution planning; two-stage stochastic integer programming; stochastic branch-and-bound algorithm; urban logistics; SUPPLY CHAIN RISK; MANAGEMENT; ALGORITHM;
D O I
10.1016/j.procs.2018.08.105
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Significant uncertainty associated with Chinese urban logistics, caused by random vehicle operational restrictions due to severe weather (e.g., smog) in addiction to normal traffic variation makes the tactical production and distribution planning decisions quite challenging. In this paper, we propose a two-stage stochastic integer programming model for an optimal production distribution capacity planning problem under the aforementioned uncertainties. We aim to minimize both procurement spending and the expected operational cost under logistic uncertainty. Given the computational burden of solving the resultant stochastic integer program for real-world instances, we develop an improved stochastic branch-and-bound (SBB) algorithm embedding with Tabu search method. We conduct the numerical study to verify the superiority of the proposed algorithm. We also offer managerial insights to practitioners and policy recommendations to municipal governments based on the numerical study results. (C) 2018 The Authors. Published by Elsevier Ltd.
引用
收藏
页码:1720 / 1729
页数:10
相关论文
共 12 条
[1]   Benders Decomposition for Production Routing Under Demand Uncertainty [J].
Adulyasak, Yossiri ;
Cordeau, Jean-Francois ;
Jans, Raf .
OPERATIONS RESEARCH, 2015, 63 (04) :851-867
[2]   A finite branch-and-bound algorithm for two-stage stochastic integer programs [J].
Ahmed, S ;
Tawarmalani, M ;
Sahinidis, NV .
MATHEMATICAL PROGRAMMING, 2004, 100 (02) :355-377
[3]  
Baniamerian Ali, 2018, Journal of Industrial Engineering International, V14, P15, DOI 10.1007/s40092-017-0203-0
[4]   A stochastic model for risk management in global supply chain networks [J].
Goh, Mark ;
Lim, Joseph Y. S. ;
Meng, Fanwen .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2007, 182 (01) :164-173
[5]   A critical review on supply chain risk - Definition, measure and modeling [J].
Heckmann, Iris ;
Comes, Tina ;
Nickel, Stefan .
OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE, 2015, 52 :119-132
[6]   Supply chain risk management: a literature review [J].
Ho, William ;
Zheng, Tian ;
Yildiz, Hakan ;
Talluri, Srinivas .
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2015, 53 (16) :5031-5069
[7]   A branch-and-price algorithm for multistage stochastic integer programming with application to stochastic batch-sizing problems [J].
Lulli, G ;
Sen, S .
MANAGEMENT SCIENCE, 2004, 50 (06) :786-796
[8]   Computational solution of capacity planning models under uncertainty [J].
MirHassani, SA ;
Lucas, C ;
Mitra, G ;
Messina, E ;
Poojari, CA .
PARALLEL COMPUTING, 2000, 26 (05) :511-538
[9]   A branch and bound method for stochastic global optimization [J].
Norkin, VI ;
Pflug, GC ;
Ruszczynski, A .
MATHEMATICAL PROGRAMMING, 1998, 83 (03) :425-450
[10]   A continuous approximation model for the fleet composition problem on the rectangular grid [J].
Nourinejad, Mehdi ;
Roorda, Matthew J. .
OR SPECTRUM, 2017, 39 (02) :373-401