Hedging against demand ambiguity in new product development: a two-stage distributionally robust approach

被引:1
作者
Li, Yuanbo [1 ,2 ]
Lin, Meiyan [3 ]
Shen, Houcai [2 ]
Zhang, Lianmin [2 ,4 ]
机构
[1] Nanjing Univ Posts & Telecommun, Sch Management, Nanjing, Peoples R China
[2] Nanjing Univ, Sch Management & Engn, Nanjing, Peoples R China
[3] Shenzhen Univ, Coll Management, Rm 414,Mingli Bldg,Xueyuan Ave, Shenzhen, Guangdong, Peoples R China
[4] Shenzhen Res Inst Big Data, Shenzhen, Peoples R China
基金
中国国家自然科学基金;
关键词
New product development; Distributionally robust optimization; Commonality; Substitution; Column and constraints generation; Project management; COMPONENT COMMONALITY; OPTIMIZATION; MANAGEMENT; SUBSTITUTION; IMPACT; TARGET;
D O I
10.1007/s10479-023-05644-4
中图分类号
C93 [管理学]; O22 [运筹学];
学科分类号
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要
In the globalization era, many manufacturing companies face great uncertainties, as most components in new product development (NPD) are outsourced to external and internal suppliers worldwide. More seriously, component supply chain disruptions have been seen in the recent global outbreak of COVID-19. Hence, some key components must be reserved in advance to control risks considering the suppliers' production plans and uncertain lead time. We propose a key components reservation model for NPD concerning component commonality and substitution. Demand is characterized by a scenario-wise ambiguity set consisting of mean, support, and mean absolute deviation information. Based on a demand unsatisfied index (DUI), we establish a two-stage distributionally robust optimization (DRO) model, which is reformulated to a linear programming (LP) model by duality analysis and solved by a proposed column and constraints generation (CCG) algorithm. We examine the performance of the DRO model over other benchmark models. The proposed DRO model with DUI has a lower probability and magnitude for demand shortage. The scenario-wise ambiguity set also outperforms the single-scenario and deterministic models, especially when product demand varies inconsistently in different scenarios. The proposed CCG algorithm can significantly improve the solution procedure for large-scale problems.
引用
收藏
页码:1001 / 1035
页数:35
相关论文
共 56 条
[1]   The distributionally robust optimization model for a remanufacturing system under cap-and-trade policy: a newsvendor approach [J].
Bai, Qingguo ;
Xu, Jianteng ;
Zhang, Yuzhong .
ANNALS OF OPERATIONS RESEARCH, 2022, 309 (02) :731-760
[2]  
Balakrishnan A., 2000, Manufacturing & Service Operations Management, V2, P166, DOI 10.1287/msom.2.2.166.12349
[3]   Robust convex optimization [J].
Ben-Tal, A ;
Nemirovski, A .
MATHEMATICS OF OPERATIONS RESEARCH, 1998, 23 (04) :769-805
[4]   Robust solutions of Linear Programming problems contaminated with uncertain data [J].
Ben-Tal, A ;
Nemirovski, A .
MATHEMATICAL PROGRAMMING, 2000, 88 (03) :411-424
[5]   Robust solutions of uncertain quadratic and conic-quadratic problems [J].
Ben-Tal, A ;
Nemirovski, A ;
Roos, C .
SIAM JOURNAL ON OPTIMIZATION, 2002, 13 (02) :535-560
[6]   Robust solutions of uncertain linear programs [J].
Ben-Tal, A ;
Nemirovski, A .
OPERATIONS RESEARCH LETTERS, 1999, 25 (01) :1-13
[7]   The Role of Component Commonality in Product Assortment Decisions [J].
Bernstein, Fernando ;
Koek, A. Guerhan ;
Xie, Lei .
M&SOM-MANUFACTURING & SERVICE OPERATIONS MANAGEMENT, 2011, 13 (02) :261-270
[8]   Robust linear optimization under general norms [J].
Bertsimas, D ;
Pachamanova, D ;
Sim, M .
OPERATIONS RESEARCH LETTERS, 2004, 32 (06) :510-516
[9]   The price of robustness [J].
Bertsimas, D ;
Sim, M .
OPERATIONS RESEARCH, 2004, 52 (01) :35-53
[10]   The Price of Fairness [J].
Bertsimas, Dimitris ;
Farias, Vivek F. ;
Trichakis, Nikolaos .
OPERATIONS RESEARCH, 2011, 59 (01) :17-31