期刊
COMPUTERS & INDUSTRIAL ENGINEERING
卷 172, 期 -, 页码 -出版社
PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.cie.2022.108615
关键词
Service network design; Almost robust optimization; Decomposition approach; Stochastic demand
资金
- Natural Science Foundation of China [72271222, 71871203, L1924063]
This study proposed an optimization method for a robust service network design problem, balancing objective value and penalty violation with penalty limit constraint and robustness index. A decomposition method was introduced to solve the problem, with numerical results demonstrating the efficiency of the algorithm. The robust optimization approach was validated using real data, resulting in a robust parcel delivery network design with satisfactory out-of-sample performances.
This study examines a robust service network design problem, which aims to select transportation services and distribute commodity flow for consolidation carriers. A robust optimization approach with a penalty limit constraint is proposed to formulate the problem. Furthermore, to make a balance between objective value and penalty violation, we introduce the concept of robustness index. A decomposition method with valid cuts is proposed to solve the problem. Numerical results show that the efficiency of the proposed algorithm. A real data set released by a logistics company in east China is imported to validate the robust optimization approach, which yields a robust parcel delivery network design with satisfying out-of-sample performances.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据